{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["4","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","-1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"],["6","3"],["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-24","-36","-12"],["-28","-62","-25"],["-8","-30","-16"],["0","-4","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-8","-2","6"],["0","-20","-36","-7"],["0","-8","-26","-12"],["0","0","-4","-3"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","8","17","9"],["0","0","4","13","9"],["0","0","0","2","2"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["6","3"],["8","7"],["2","5"],["0","1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","6","3"],["0","8","7"],["0","2","5"],["0","0","1"]]},"deriv_order":1,"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"],["4","0"],["2","2"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["4","0","0"],["12","14","2"],["8","18","7"],["0","4","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-6","-2"],["0","-4","-9","-5"],["0","0","-2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["9","24","22","8","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["4","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","-1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"],["6","3"],["4","2"]]},"deriv_order":0,"offset":1,"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":[["-12","-6"],["-14","-9"],["-4","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","4","4"],["0","2","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["3"],["4"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","18","27","9"],["0","48","81","33"],["0","44","90","46"],["0","16","46","30"],["0","2","11","9"],["0","0","1","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","18","27","9"],["0","0","48","81","33"],["0","0","44","90","46"],["0","0","16","46","30"],["0","0","2","11","9"],["0","0","0","1","1"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","9","9"],["0","24","24"],["0","22","22"],["0","8","8"],["0","1","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","-72","-72"],["0","0","-246","-246"],["0","0","-329","-329"],["0","0","-220","-220"],["0","0","-78","-78"],["0","0","-14","-14"],["0","0","-1","-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","144","288","144"],["0","0","348","696","348"],["0","0","310","620","310"],["0","0","130","260","130"],["0","0","26","52","26"],["0","0","2","4","2"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-576","-1152","-576"],["0","0","-1680","-3360","-1680"],["0","0","-1936","-3872","-1936"],["0","0","-1140","-2280","-1140"],["0","0","-364","-728","-364"],["0","0","-60","-120","-60"],["0","0","-4","-8","-4"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","0"],["-2","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","1","1"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","45","45"],["0","0","0","147","147"],["0","0","0","182","182"],["0","0","0","106","106"],["0","0","0","29","29"],["0","0","0","3","3"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["0","0","27","54","27"],["0","0","108","216","108"],["0","0","171","342","171"],["0","0","136","272","136"],["0","0","57","114","57"],["0","0","12","24","12"],["0","0","1","2","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","144","288","144"],["0","0","708","1416","708"],["0","0","1468","2936","1468"],["0","0","1673","3346","1673"],["0","0","1145","2290","1145"],["0","0","482","964","482"],["0","0","122","244","122"],["0","0","17","34","17"],["0","0","1","2","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-288","-720","-576","-144"],["0","0","-1128","-2892","-2400","-636"],["0","0","-1808","-4766","-4108","-1150"],["0","0","-1538","-4174","-3734","-1098"],["0","0","-752","-2100","-1944","-596"],["0","0","-212","-608","-580","-184"],["0","0","-32","-94","-92","-30"],["0","0","-2","-6","-6","-2"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","72","216","216","72"],["0","0","0","246","738","738","246"],["0","0","0","329","987","987","329"],["0","0","0","220","660","660","220"],["0","0","0","78","234","234","78"],["0","0","0","14","42","42","14"],["0","0","0","1","3","3","1"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","1152","2736","2016","432"],["0","0","5088","12300","9336","2124"],["0","0","9488","23380","18296","4404"],["0","0","9768","24555","19806","5019"],["0","0","6084","15603","12954","3435"],["0","0","2352","6150","5244","1446"],["0","0","552","1470","1284","366"],["0","0","72","195","174","51"],["0","0","4","11","10","3"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-288","-864","-864","-288"],["0","0","0","-1128","-3384","-3384","-1128"],["0","0","0","-1808","-5424","-5424","-1808"],["0","0","0","-1538","-4614","-4614","-1538"],["0","0","0","-752","-2256","-2256","-752"],["0","0","0","-212","-636","-636","-212"],["0","0","0","-32","-96","-96","-32"],["0","0","0","-2","-6","-6","-2"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","1","1"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","6"],["0","0","5"],["0","0","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-30","-15"],["-22","-11"],["-4","-2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["8"],["6"],["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 + (1) theta; 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 + (1) theta 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, 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 + (1) theta 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 + (1) theta","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["4","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","-1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"],["6","3"],["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (1) theta, 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) = n^2 + 2 n != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) = n^2 + 2 n at n = 2 + u have one sign)","name":"left_factor_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["8","6","1"]},"numerator":["0","2","1"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"the left-hand factor f(n) is nonzero for every n >= 2","status":{"kind":"verified"}},{"evidence":"f(n) a_n = 4 n^2 + 6 n + 2 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 4 n^2 + 6 n + 2 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":["30","22","4"]},"numerator":["2","6","4"],"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/20 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = (1/16 n^4 + 1/16 n^3 - 1/16 n^2 - 1/16 n)/(n^4 + n^3 - 1/4 n^2 - 1/4 n) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = (1/16 n^4 + 1/16 n^3 - 1/16 n^2 - 1/16 n)/(n^4 + n^3 - 1/4 n^2 - 1/4 n) at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["0","-1/4","-1/4","1","1"],"method":{"kind":"taylor_shift","shifted_denominator":["105","533/4","251/4","13","1"],"shifted_numerator":["6","8","31/8","13/16","1/16"]},"numerator":["0","-1/16","-1/16","1/16","1/16"],"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) = (1/4 n + 1/2)/(n + 1/2) (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/16","-7/16","-15/16","3/16","15/4","6","4","1"],"method":{"kind":"taylor_shift","shifted_denominator":["20580","48167","196511/4","456429/16","165063/16","9519/4","342","28","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 = (4 n^2 + 6 n + 2)/(n^2 + 2 n), b_n = (2 n^2 + 3 n + 1)/(n^2 + 2 n), c_n = (n^2 + n)/(n^2 + 2 n); 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"],["4","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","-1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"],["6","3"],["4","2"]]},"deriv_order":0,"offset":1,"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 leader is not a nonzero constant","route":"periodic_product","success":false,"variant":"P_(n+k) = c(x) P_n"},{"detail":"not applicable: expected one nonzero lag term","route":"product_recurrence","success":false,"variant":"product_recurrence"},{"detail":"no theorem matched (weighted_renewal_window: LHS must be a nonzero constant; fixed_delay_predecessor_window: LHS must be a nonzero constant)","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 = (4 n^2 + 6 n + 2)/(n^2 + 2 n), b_n = (2 n^2 + 3 n + 1)/(n^2 + 2 n), c_n = (n^2 + n)/(n^2 + 2 n); 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 = (4 n^2 + 6 n + 2)/(n^2 + 2 n), b_n = (2 n^2 + 3 n + 1)/(n^2 + 2 n), c_n = (n^2 + n)/(n^2 + 2 n); 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 + (1) theta 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"}