{"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":1,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n, k) = binomial(2n, 2k)."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["9","105","75","3"],["-9","-82","-98","-11"],["0","-45","-90","3"],["0","22","109","25"],["0","0","8","-8"],["0","0","-4","-12"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-45","275","329","17"],["0","-27","-166","-350","-57"],["0","0","41","-438","1"],["0","0","66","263","139"],["0","0","0","-8","8"],["0","0","0","-12","-36"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-81","55","205","13"],["0","0","-9","18","-168","-41"],["0","0","0","175","-300","-7"],["0","0","0","22","29","105"],["0","0","0","0","-32","32"],["0","0","0","0","-4","-12"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","-18","-10","26","2"],["0","0","0","0","20","-14","-6"],["0","0","0","0","44","-42","-2"],["0","0","0","0","0","-16","16"],["0","0","0","0","0","-8","8"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["-9","3","0"],["9","-26","0"],["0","45","-1"],["0","-22","5"],["0","0","-8"],["0","0","4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","-27","9","0"],["0","27","-78","0"],["0","0","135","-3"],["0","0","-66","15"],["0","0","0","-24"],["0","0","0","12"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","-9","3","0"],["0","0","9","-26","0"],["0","0","0","45","-1"],["0","0","0","-22","5"],["0","0","0","0","-8"],["0","0","0","0","4"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1,2],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"],["1","4"]],"recurrence":{"denominator":{"coeffs":[["-18","96","-18"],["9","-182","69"],["0","111","-104"],["0","-22","77"],["0","0","-28"],["0","0","4"]]},"terms":[{"coeff":{"coeffs":[["-18","-120","14","4"],["9","-74","-357","-30"],["0","111","329","0"],["0","-22","-37","63"],["0","0","-28","-52"],["0","0","4","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","18","-14","-6","2"],["0","0","68","-54","-14"],["0","0","-44","42","2"],["0","0","0","-16","16"],["0","0","0","8","-8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":2,"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":1,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":1,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["1","3"],["-1","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-2","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","-36","84","-60","12","0"],["0","0","108","-344","364","-128","0"],["0","0","-108","616","-912","408","-4"],["0","0","36","-624","1168","-608","28"],["0","0","0","356","-788","508","-76"],["0","0","0","-88","276","-288","100"],["0","0","0","0","-64","128","-64"],["0","0","0","0","16","-32","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-108","252","-180","36","0"],["0","0","0","324","-1032","1092","-384","0"],["0","0","0","-324","1848","-2736","1224","-12"],["0","0","0","108","-1872","3504","-1824","84"],["0","0","0","0","1068","-2364","1524","-228"],["0","0","0","0","-264","828","-864","300"],["0","0","0","0","0","-192","384","-192"],["0","0","0","0","0","48","-96","48"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","-36","84","-60","12","0"],["0","0","0","0","108","-344","364","-128","0"],["0","0","0","0","-108","616","-912","408","-4"],["0","0","0","0","36","-624","1168","-608","28"],["0","0","0","0","0","356","-788","508","-76"],["0","0","0","0","0","-88","276","-288","100"],["0","0","0","0","0","0","-64","128","-64"],["0","0","0","0","0","0","16","-32","16"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","-2","2"],["0","4","-4"],["0","-2","2"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0"],["0","2","-4","2"],["0","-2","4","-2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-4","8","-4"],["0","0","4","-8","4"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","4","-8","4"],["0","0","-4","8","-4"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["3"],["-5"],["2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","7"],["0","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-2","2"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","-148","292","-140","-4"],["0","0","0","0","744","-1468","704","20"],["0","0","0","0","-1344","2680","-1328","-8"],["0","0","0","0","1048","-2224","1304","-128"],["0","0","0","0","-300","892","-884","292"],["0","0","0","0","0","-244","488","-244"],["0","0","0","0","0","72","-144","72"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","-68","132","-60","-4"],["0","0","0","0","0","336","-648","288","24"],["0","0","0","0","0","-600","1160","-520","-40"],["0","0","0","0","0","464","-960","528","-32"],["0","0","0","0","0","-132","420","-444","156"],["0","0","0","0","0","0","-152","304","-152"],["0","0","0","0","0","0","48","-96","48"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","-4","8","-4"],["0","0","12","-24","12"],["0","0","-12","24","-12"],["0","0","4","-8","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","-4","8","-4"],["0","0","16","-32","16"],["0","0","-20","40","-20"],["0","0","8","-16","8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-4","20","-28","12"],["0","0","8","-56","88","-40"],["0","0","-4","52","-92","44"],["0","0","0","-16","32","-16"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","-8","24","-24","8"],["0","0","0","16","-48","48","-16"],["0","0","0","-8","24","-24","8"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","4","-20","28","-12"],["0","0","-4","44","-76","36"],["0","0","-4","-28","68","-36"],["0","0","4","4","-20","12"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","8","-24","24","-8"],["0","0","0","-16","48","-48","16"],["0","0","0","8","-24","24","-8"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","4","-8","4"]]},"start_base":2}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","-2","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","-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 1) 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 >= 2 (the exceptional bases checked exactly), and agreement on the 2 identifying rows gives Q_n = lambda(n) T_n(P_(n+0)) for every n >= 1"},"method":"operator_division"},"status":"certified"},"input_first_index":1,"interlacing":{"from_index":2,"justification":"the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 2; 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 >= 2","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 [1, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 1 + 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":"1","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":1,"input_interlacing":{"interlacing":{"from_index":2,"justification":{"premises":["the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 2; 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 >= 2"],"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":1,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-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 >= 1"},"parent_proof":{"route":"three_term_recurrence","statement":"every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 1, 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":1,"interlacing":"strict","interlacing_from":2,"root_region":{"upper":{"closed":false,"value":"0"}},"simple_roots":true,"statement":"every P_n, n >= 1, is nonzero and real-rooted, with simple roots from n = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0)"},"hypotheses":[{"evidence":"f(n) a_n = 4 != 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 4 at n = 3 + u have one sign)","name":"leading_coefficient_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["4"]},"numerator":["4"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"a_n != 0 for every n >= 3","status":{"kind":"verified"}},{"evidence":"Q_1 has degree 0, Q_2 degree 1; simple real roots and strict interlacing checked exactly","name":"seeds_interlace","statement":"Q_1 and Q_2 have simple real roots, degrees e and e + 1, and Q_1 strictly interlaces Q_2","status":{"kind":"verified"}},{"evidence":"beta_3 = 1/8 (exact)","name":"first_coefficient_positive","statement":"beta_3 = c_3 L_1 / (a_3 L_2) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = 1/16 > 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of beta_n = 1/16 at n = 4 + 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/16"]},"numerator":["1/16"],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"beta_n = c_n / (a_n a_(n-1)) > 0 for every n >= 4","status":{"kind":"verified"}},{"evidence":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = 1/4 (the exact ratio r_n): g(n) > 0 for n >= 3, r_3 >= g(3) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 4 + u have one sign)","name":"root_upper_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"every root of Q_n is < 0 for every n >= 1 (region (-inf, 0) for P)","status":{"kind":"verified"}},{"evidence":"on the reflected rows (-1)^(deg) p_n(-y): seeds checked exactly; positive-ratio induction at t = 1 with g(n) = 1/4 (the exact ratio r_n): g(n) > 0 for n >= 3, r_3 >= g(3) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 4 + u have one sign)","name":"root_lower_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"every root of Q_n is > -1 for every n >= 1 (region (-inf, 0) for P)","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x - 1)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 3, with a_n = 4, b_n = 2, c_n = 1; Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_1 + n - 1, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","recurrence":{"first_index":1,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-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: coefficient of P_(n-1) must be 1 after normalization; fixed_delay_predecessor_window: coefficient of P_(n-1) must be 1 (+ w(n) t) after normalization)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"P_n = (a_n + b_n (x - 1)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 3, with a_n = 4, b_n = 2, c_n = 1; Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_1 + n - 1, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2): every P_n, n >= 1, is nonzero and real-rooted, with simple roots from n = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0)","route":"three_term_recurrence","success":true,"variant":"three_term_recurrence"}],"conditional_on":[],"interlacing":{"from_index":2,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = (a_n + b_n (x - 1)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 3, with a_n = 4, b_n = 2, c_n = 1; Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_1 + n - 1, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","every P_n, n >= 1, is nonzero and real-rooted, with simple roots from n = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; 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 >= 1, 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 >= 1, the side conditions hold for every n, and every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 1, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}