{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Even row Pascal-square read by antidiagonals."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-18","-204","-552","-576"],["-42","-652","-2184","-2384"],["-32","-704","-2980","-3584"],["-8","-312","-1752","-2488"],["0","-48","-432","-800"],["0","0","-32","-96"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-18","-76","664","1280"],["0","-78","-996","-1736","-176"],["0","-80","-1568","-5564","-4928"],["0","-24","-840","-4360","-5416"],["0","0","-144","-1232","-2144"],["0","0","0","-96","-288"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","27","466","2348","3184"],["0","0","18","548","3836","6336"],["0","0","-12","-24","1240","3696"],["0","0","-8","-192","-632","72"],["0","0","0","-48","-352","-480"],["0","0","0","0","-32","-96"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","9","134","580","752"],["0","0","0","12","240","1204","1744"],["0","0","0","4","136","844","1456"],["0","0","0","0","24","224","512"],["0","0","0","0","0","16","64"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["18","60","72"],["42","244","312"],["32","352","536"],["8","216","456"],["0","48","192"],["0","0","32"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","54","180","216"],["0","126","732","936"],["0","96","1056","1608"],["0","24","648","1368"],["0","0","144","576"],["0","0","0","96"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","18","60","72"],["0","0","42","244","312"],["0","0","32","352","536"],["0","0","8","216","456"],["0","0","0","48","192"],["0","0","0","0","32"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["2","-4","0"],["8","-8","0"],["8","24","8"],["0","48","32"],["0","0","32"]]},"terms":[{"coeff":{"coeffs":[["0","-8","-4","-8"],["2","-12","-88","-40"],["8","56","-4","-40"],["8","120","344","248"],["0","48","272","320"],["0","0","32","96"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-6","-12","-16"],["0","-4","-40","-124","-112"],["0","-4","-64","-268","-304"],["0","0","-24","-160","-256"],["0","0","0","-16","-64"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1","3","3","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":0,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["-2","-4"],["-2","-6"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","1","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","72","816","3360","6144","4608"],["0","0","312","3952","18464","37888","29184"],["0","0","536","7888","42304","97024","78848"],["0","0","456","8304","51904","133376","117760"],["0","0","192","4864","36256","105728","104960"],["0","0","32","1504","13984","47872","55808"],["0","0","0","192","2560","11264","16384"],["0","0","0","0","128","1024","2048"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","216","2448","10080","18432","13824"],["0","0","0","936","11856","55392","113664","87552"],["0","0","0","1608","23664","126912","291072","236544"],["0","0","0","1368","24912","155712","400128","353280"],["0","0","0","576","14592","108768","317184","314880"],["0","0","0","96","4512","41952","143616","167424"],["0","0","0","0","576","7680","33792","49152"],["0","0","0","0","0","384","3072","6144"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","72","816","3360","6144","4608"],["0","0","0","0","312","3952","18464","37888","29184"],["0","0","0","0","536","7888","42304","97024","78848"],["0","0","0","0","456","8304","51904","133376","117760"],["0","0","0","0","192","4864","36256","105728","104960"],["0","0","0","0","32","1504","13984","47872","55808"],["0","0","0","0","0","192","2560","11264","16384"],["0","0","0","0","0","0","128","1024","2048"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","4","16"],["0","8","32"],["0","4","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","-4","-16"],["0","0","-8","-32"],["0","0","-4","-16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","2","16","32"],["0","0","2","16","32"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-2","-16","-32"],["0","0","-2","-16","-32"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["2"],["4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","2"],["-2","-8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","1","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","1280","11840","33280","25600"],["0","0","0","0","5712","53952","157440","132096"],["0","0","0","0","10128","98656","303104","282112"],["0","0","0","0","8912","91232","302080","318976"],["0","0","0","0","3888","43680","162816","201216"],["0","0","0","0","672","9568","44288","67072"],["0","0","0","0","0","576","4608","9216"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","544","5568","18432","19456"],["0","0","0","0","0","2432","25632","88320","98816"],["0","0","0","0","0","4320","47520","172800","207360"],["0","0","0","0","0","3808","44832","175872","229888"],["0","0","0","0","0","1664","22176","97536","141824"],["0","0","0","0","0","288","5184","27648","46080"],["0","0","0","0","0","0","384","3072","6144"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","8","64","128"],["0","0","24","192","384"],["0","0","24","192","384"],["0","0","8","64","128"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","24","192","384"],["0","0","88","704","1408"],["0","0","120","960","1920"],["0","0","72","576","1152"],["0","0","16","128","256"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-12","-120","-384","-384"],["0","0","-32","-336","-1152","-1280"],["0","0","-28","-312","-1152","-1408"],["0","0","-8","-96","-384","-512"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","4","48","192","256"],["0","0","0","8","96","384","512"],["0","0","0","4","48","192","256"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","12","112","320","256"],["0","0","32","312","960","896"],["0","0","28","288","960","1024"],["0","0","8","88","320","384"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-4","-48","-192","-256"],["0","0","0","-8","-96","-384","-512"],["0","0","0","-4","-48","-192","-256"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","8","64","128"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","-2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":2}]},"statement":"w(n) E = sum_nu H_nu S^nu L' (with any remainder removed by row annihilators of the parent), where L' is the parent rule at P'_n = P_(n+0) (valid from base 0) and E the input rule gauged by lambda(n)/delta(n) and composed with (or conjugated through) T = f(n, theta) = 1 + (2) theta + (1) theta^2; so the candidate rows satisfy the input rule at every base n >= 0 (the exceptional bases checked exactly), and agreement on the 1 identifying rows gives Q_n = lambda(n) T_n(P_(n+0)) for every n >= 0"},"method":"operator_division"},"status":"certified"},"input_first_index":0,"interlacing":{"from_index":1,"justification":"the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 1; T = f(n, theta) = 1 + (2) theta + (1) theta^2 is independent of n and maps every real-rooted polynomial to a real-rooted polynomial or zero, so by the Hermite--Kakeya--Obreschkoff theorem (both directions) T(P_(m-1)) and T(P_m) have weakly interlacing zeros; the nonzero gauge does not move zeros, so Q_(n-1) and Q_n interlace weakly (orientation not determined) for every n >= 1","kind":"weak","orientation":"unordered","status":"claimed"},"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"lift_summary":{"hypotheses":[{"evidence":"the polynomial with ascending coefficients [1, 2, 1] is fixed; exact check: real-rooted = true, coefficients of one sign = true","name":"euler_polynomial_roots_nonpositive","statement":"the polynomial in theta is real-rooted with every root <= 0 for every n >= n0","status":{"kind":"verified"}},{"evidence":"lambda(n) = 1","name":"gauge_finite_nonzero","statement":"lambda(n) is finite and nonzero for every n >= n0","status":{"kind":"verified"}},{"evidence":"delta(n) != 0 for every integer n in [0, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 0 + u have one sign)","name":"operator_coefficients_defined","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["1"]},"numerator":["1"],"range":{"first":"0","last":null}},"decision":"holds"},"statement":"the operator coefficients are finite at every n >= n0 (their denominators do not vanish)","status":{"kind":"verified"}}],"identity":{"method":"forward_division","status":"certified"},"input_first_index":0,"input_interlacing":{"interlacing":{"from_index":1,"justification":{"premises":["the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 1; T = f(n, theta) = 1 + (2) theta + (1) theta^2 is independent of n and maps every real-rooted polynomial to a real-rooted polynomial or zero, so by the Hermite--Kakeya--Obreschkoff theorem (both directions) T(P_(m-1)) and T(P_m) have weakly interlacing zeros; the nonzero gauge does not move zeros, so Q_(n-1) and Q_n interlace weakly (orientation not determined) for every n >= 1"],"theorem":"Hermite--Kakeya--Obreschkoff theorem (N. Obreschkoff, Verteilung und Berechnung der Nullstellen reeller Polynome, 1963; see S. Fisk, Polynomials, Roots, and Interlacing, arXiv:math/0612833): real polynomials f, g have weakly interlacing zeros iff alpha f + beta g is real-rooted or zero for all real alpha, beta; a linear T independent of n that maps every real-rooted polynomial to a real-rooted polynomial or zero therefore maps interlacing pairs to pairs with weakly interlacing zeros (orientation not determined)"},"kind":"weak","orientation":"unordered"},"status":"proved"},"lean_replay":"not_attempted","operation":{"description":"f(n, theta) = 1 + (2) theta + (1) theta^2","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (2) theta + (1) theta^2, for every n >= 0"},"parent_proof":{"route":"three_term_recurrence","statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 0, is zero or real-rooted with roots in (-inf, 0]","input_root_region":{"upper":{"closed":true,"value":"0"}},"parent_hypothesis":"every parent row used is zero or real-rooted with all roots in (-inf, 0] (coefficients of one sign)","parent_root_region":{"upper":{"closed":true,"value":"0"}},"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"},"verdict":"proved"},"notes":["the division remainder is removed by row annihilators of the shifted parent"],"parent_interlacing_report":{"conclusion":{"first_index":0,"interlacing":"strict","interlacing_from":1,"root_region":{"upper":{"closed":false,"value":"0"}},"simple_roots":true,"statement":"every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)"},"hypotheses":[{"evidence":"f(n) a_n = 1 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 1 at n = 2 + u have one sign)","name":"leading_coefficient_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["1"]},"numerator":["1"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"a_n != 0 for every n >= 2","status":{"kind":"verified"}},{"evidence":"Q_0 has degree 0, Q_1 degree 1; simple real roots and strict interlacing checked exactly","name":"seeds_interlace","statement":"Q_0 and Q_1 have simple real roots, degrees e and e + 1, and Q_0 strictly interlaces Q_1","status":{"kind":"verified"}},{"evidence":"beta_2 = 1 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = 1 > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = 1 at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["1"]},"numerator":["1"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"beta_n = c_n / (a_n a_(n-1)) > 0 for every n >= 3","status":{"kind":"verified"}},{"evidence":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = (n + 1)/(n) (the exact ratio r_n): g(n) > 0 for n >= 2, r_2 >= g(2) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 3 + u have one sign)","name":"root_upper_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["0","1"],"method":{"kind":"taylor_shift","shifted_denominator":["3","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"every root of Q_n is < 0 for every n >= 0 (region (-inf, 0) for P)","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 2, with a_n = 1, b_n = 2, c_n = 1; Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"reference":"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","requested_root_region":{"upper":{"closed":false,"value":"0"}},"schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"three_term_recurrence"},"parent_proof":{"attempts":[{"detail":"the rule is not P_(n+k) = c(x) P_n with c free of n","route":"periodic_product","success":false,"variant":"P_(n+k) = c(x) P_n"},{"detail":"no theorem matched (weighted_renewal_window: support must satisfy offset = 1 + ell * t_degree; fixed_delay_predecessor_window: only P_(n-1) and one term w(n) t P_(n-L) are supported)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 2, with a_n = 1, b_n = 2, c_n = 1; Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2): every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)","route":"three_term_recurrence","success":true,"variant":"three_term_recurrence"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 2, with a_n = 1, b_n = 2, c_n = 1; Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)"],"theorem":"three_term_recurrence: 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"},"kind":"strict","orientation":"previous_interlaces_next"},"route":"three_term_recurrence","rows_checked":10,"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"proved: Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (2) theta + (1) theta^2 for every n >= 0, the side conditions hold for every n, and every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 0, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}