{"chains":[{"edge":{"id":"e-613dc59dd9b60970","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-9436d64c250aa083","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":"121d27ce3fa69578933d25e06f404cb7b4a942dc95b38d710ea2729818df654d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-67d789c805b2e2cd","role":"sequence","name":"basis_map_A007318 of Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.","uses":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1)"}]},"premises":[{"premise":{"position":0,"node_id":"n-67d789c805b2e2cd","role":"sequence","name":"basis_map_A007318 of Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.","uses":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1)"},"chains":[{"edge":{"id":"e-39cee2f16f82e52f","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-67d789c805b2e2cd","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":"8ed2fff33c7c049ac09e5694171588a3b66716cf8c4b882e65c13bb7de195bcb","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-318700a428d7b97b","role":"sequence","name":"Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.","uses":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":false,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4, 0)"}]},"premises":[{"premise":{"position":0,"node_id":"n-318700a428d7b97b","role":"sequence","name":"Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.","uses":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":false,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4, 0)"},"chains":[{"edge":{"id":"e-19ca7a5e6e7a3cfc","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-318700a428d7b97b","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":"c03fe8c5492a79fb2ab1bf06b0e98fadbee2a114d5476c6b06c9b321f73a1fcc","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"premises":[]}]}]},{"edge":{"id":"e-4d7e15a01b4f3b87","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-67d789c805b2e2cd","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":"3d37b2ffae35b089b3b25f855ded8e59b8ad7ba6de6896e71f4eb82d1102cdcf","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":false,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-318700a428d7b97b","role":"sequence","name":"Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.","uses":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":false,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4, 0)"}]},"premises":[{"premise":{"position":0,"node_id":"n-318700a428d7b97b","role":"sequence","name":"Triangle read by rows: T(k,s) = ((2*k+1)/(2*s+1))*binomial(k+s,2*s), 0 <= s <= k.","uses":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":false,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4, 0)"},"chains":[{"edge":{"id":"e-19ca7a5e6e7a3cfc","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-318700a428d7b97b","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":"c03fe8c5492a79fb2ab1bf06b0e98fadbee2a114d5476c6b06c9b321f73a1fcc","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},"repeat":true,"premises":[]}]}]}]}]}],"truncated":false,"expanded":4}