{"chains":[{"edge":{"id":"e-77a19b2535dc4780","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-0b1520d85356534b","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":"bdbe1f189952b7fd89749fd6b65500ba5f01a7e25e0f62101ba6641c34140fc4","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[{"position":0,"node_id":"n-dbf182f3ecfeda2a","role":"sequence","name":"Triangle of coefficients of cos(x)^n in polynomial for cos(nx).","uses":{"claim":"real_rooted","from_index":0,"region":{}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)"}]},"premises":[{"premise":{"position":0,"node_id":"n-dbf182f3ecfeda2a","role":"sequence","name":"Triangle of coefficients of cos(x)^n in polynomial for cos(nx).","uses":{"claim":"real_rooted","from_index":0,"region":{}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)"},"chains":[{"edge":{"id":"e-9aecc6cc430e81f1","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-dbf182f3ecfeda2a","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":"b581439c2359e4fd54c55436ebbe863d7f48a3f8bf3ec10f9784714bf7bc7c9c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[]},"premises":[]}]}]}],"truncated":false,"expanded":2}
