{"chains":[{"edge":{"id":"e-b38122b7d5253ee9","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"0\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-bfc9def181bdaf52","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"7d0890de7b959d0f3cd51df4cb8d85ef65088ce43563cb033a02d878152b7b55","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}},{"claim":"interlacing","from_index":3,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-afb1686ffa6592c0","role":"sequence","name":"Riordan array ((1-x)/(1+x), x/(1+x)^2).","uses":{"claim":"real_rooted","from_index":1,"region":{}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)"}]},"premises":[{"premise":{"position":0,"node_id":"n-afb1686ffa6592c0","role":"sequence","name":"Riordan array ((1-x)/(1+x), x/(1+x)^2).","uses":{"claim":"real_rooted","from_index":1,"region":{}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)"},"chains":[{"edge":{"id":"e-341476417f780961","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-afb1686ffa6592c0","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"16b51e87082d756cef403d96adf8c6f11d048caed7104a5d930f3821394f6530","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}},{"claim":"interlacing","from_index":3,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"premises":[]},{"edge":{"id":"e-3946aee10636c4f6","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-afb1686ffa6592c0","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction","lean_route":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_eval_nonpos","RealRooted.threeTerm_interlaces","RealRooted.eval_nonpos_of_natDegree_le_two"],"certificate_hash":"e7ef5218149705551a67f2999b6d11f2b19b750200fe9434f7986859b3cfdb4a","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}},{"claim":"interlacing","from_index":3,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},"premises":[]},{"edge":{"id":"e-6a535a5524b82f20","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-afb1686ffa6592c0","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"b179f0c23e745425c207555897f9881c7071d56dd33eff23ec403bea457e8819","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"0"},"upper":{"closed":false,"value":"4"}}},{"claim":"interlacing","from_index":3,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"premises":[]}]}]}],"truncated":false,"expanded":4}