{"chains":[{"edge":{"id":"e-d80b429919e51d6c","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-9db049b57ec83477","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"7e2836800bcfb2b657eea4c5277192ccfb46026bb6a44649566df9cdfe27130d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-8ac1223942f7b8c5","role":"sequence","name":"reversal of Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]},"premises":[{"premise":{"position":0,"node_id":"n-8ac1223942f7b8c5","role":"sequence","name":"reversal of Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"},"chains":[{"edge":{"id":"e-73dd335e950d1f81","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-8ac1223942f7b8c5","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"f1cf545ca8d704eebec03aaf59102be1f188fe9b0e4041f67fd6d7c1c20e60ac","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-1/2"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-30cb3cad216ed189","role":"sequence","name":"Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-6, -2)"}]},"premises":[{"premise":{"position":0,"node_id":"n-30cb3cad216ed189","role":"sequence","name":"Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-6, -2)"},"chains":[{"edge":{"id":"e-56c0c02612a8191c","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-30cb3cad216ed189","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"8dc4494a1e2ed5342d45b61af8e2727cad6124c0afc55155169f37cd84abda33","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"}]},"premises":[{"premise":{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"},"chains":[{"edge":{"id":"e-c7df247a48c8552e","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-f287bed89e07609f","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":"10f6373de245482d0dca6ec5342374efbffa58c936fa09f9e9ee3c227a8cfcd8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"premises":[]}]}]},{"edge":{"id":"e-6582417c7c9b5874","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-30cb3cad216ed189","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"b86a1997aee92c5feb7cdf2e900c5aea8731468b6c9ce53081e396fca185d817","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"}]},"premises":[{"premise":{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"},"chains":[{"edge":{"id":"e-c7df247a48c8552e","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-f287bed89e07609f","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":"10f6373de245482d0dca6ec5342374efbffa58c936fa09f9e9ee3c227a8cfcd8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"repeat":true,"premises":[]}]}]},{"edge":{"id":"e-ec629e395a3def0c","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-30cb3cad216ed189","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":"5840e8f04930313d95df0836e60f47ba034ba0f1ab5d46f077f5a1a85b1b7308","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"premises":[]}]}]},{"edge":{"id":"e-b768fdcb322c6ad3","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-8ac1223942f7b8c5","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"d310a4c9b4ced570f17c4e3c3c16bb00b69dc63b3f70163349ef892c4187e3e0","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-1/2"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-30cb3cad216ed189","role":"sequence","name":"Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-6, -2)"}]},"premises":[{"premise":{"position":0,"node_id":"n-30cb3cad216ed189","role":"sequence","name":"Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-6, -2)"},"chains":[{"edge":{"id":"e-56c0c02612a8191c","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-30cb3cad216ed189","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"8dc4494a1e2ed5342d45b61af8e2727cad6124c0afc55155169f37cd84abda33","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"}]},"repeat":true,"premises":[]},{"edge":{"id":"e-6582417c7c9b5874","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-30cb3cad216ed189","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"b86a1997aee92c5feb7cdf2e900c5aea8731468b6c9ce53081e396fca185d817","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"}]},"repeat":true,"premises":[]},{"edge":{"id":"e-ec629e395a3def0c","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-30cb3cad216ed189","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":"5840e8f04930313d95df0836e60f47ba034ba0f1ab5d46f077f5a1a85b1b7308","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-6"},"upper":{"closed":false,"value":"-2"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"repeat":true,"premises":[]}]}]},{"edge":{"id":"e-fd03420edaf2e6be","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"mobius, shift 0","conclusion_id":"n-8ac1223942f7b8c5","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"fTransform","lean_declarations":["RealRooted.splits_fPolynomial"],"certificate_hash":"45efb111130685fe651d6a178054e11bc07c22767a44d98593a8c5f1c0e73552","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-c4e1c7f7d91f2e30","role":"sequence","name":"reversal of A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]},"premises":[{"premise":{"position":0,"node_id":"n-c4e1c7f7d91f2e30","role":"sequence","name":"reversal of A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"},"chains":[{"edge":{"id":"e-a162795980dd8c54","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-c4e1c7f7d91f2e30","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"87380c2474cfcd7395358977f63a62dd1ed98bbbb3a1dfcc185cf64b722fcad4","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"}]},"premises":[{"premise":{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"},"chains":[{"edge":{"id":"e-c7df247a48c8552e","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-f287bed89e07609f","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":"10f6373de245482d0dca6ec5342374efbffa58c936fa09f9e9ee3c227a8cfcd8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"repeat":true,"premises":[]}]}]},{"edge":{"id":"e-fc7d20c85c447d4e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-c4e1c7f7d91f2e30","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"3c9089cfe1cb5c045adb0f9131adacd44b09230b7b0d5c3cf2918b29eea4cbd6","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"}]},"premises":[{"premise":{"position":0,"node_id":"n-f287bed89e07609f","role":"sequence","name":"A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-5, -1)"},"chains":[{"edge":{"id":"e-c7df247a48c8552e","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-f287bed89e07609f","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":"10f6373de245482d0dca6ec5342374efbffa58c936fa09f9e9ee3c227a8cfcd8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"repeat":true,"premises":[]}]}]}]}]}]}]}],"truncated":false,"expanded":10}