{"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"],["4","9"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013610 of Triangle of even numbered entries of odd numbered rows of Pascal's triangle A007318."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0","36","27"],["0","-24","-144","162"],["64","624","1512","729"],["-128","-864","-1512","-1134"],["0","-576","-2304","-2052"],["0","0","-288","-648"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","48","324","297"],["0","0","24","432","2214"],["0","448","4368","12168","9531"],["0","-384","-1440","1224","3510"],["0","0","-1728","-6336","-4428"],["0","0","0","-864","-1944"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","0","60","306","297"],["0","0","0","96","936","2322"],["0","0","384","3744","11052","9909"],["0","0","-128","576","5688","7506"],["0","0","0","-576","-1584","108"],["0","0","0","0","-288","-648"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","0","12","54","54"],["0","0","0","0","24","216","432"],["0","0","0","64","624","1908","1836"],["0","0","0","0","288","1440","1728"],["0","0","0","0","0","144","432"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["0","0","0"],["0","6","0"],["-16","-12","-9"],["32","-72","-18"],["0","144","36"],["0","0","72"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","0","0","0"],["0","0","18","0"],["0","-48","-36","-27"],["0","96","-216","-54"],["0","0","432","108"],["0","0","0","216"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","0","6","0"],["0","0","-16","-12","-9"],["0","0","32","-72","-18"],["0","0","0","144","36"],["0","0","0","0","72"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-48","198","-27"],["128","-762","180"],["-112","1068","-459"],["32","-648","558"],["0","144","-324"],["0","0","72"]]},"terms":[{"coeff":{"coeffs":[["-192","-936","-1188","-324"],["512","1560","-72","-270"],["-448","240","4896","1701"],["128","-1440","-4824","-594"],["0","576","864","-1188"],["0","0","288","648"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-64","-324","-450","-162"],["0","128","360","-144","-216"],["0","-64","240","1548","756"],["0","0","-288","-864","0"],["0","0","0","-144","-432"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["-1/8","3/4","-3/2","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"],["4","9"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"]]},"deriv_order":0,"offset":1,"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":[["4","9"],["-8","-18"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","4","12"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-1"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","24","144","216","0"],["0","0","-64","-528","-1476","-1512","-324"],["0","0","384","2304","3528","432","648"],["0","0","-768","-3072","2592","15552","2592"],["0","0","512","-384","-16704","-34560","-5184"],["0","0","0","2304","13248","17280","-5184"],["0","0","0","0","1152","6912","10368"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","0","0","0","72","432","648","0"],["0","0","0","-192","-1584","-4428","-4536","-972"],["0","0","0","1152","6912","10584","1296","1944"],["0","0","0","-2304","-9216","7776","46656","7776"],["0","0","0","1536","-1152","-50112","-103680","-15552"],["0","0","0","0","6912","39744","51840","-15552"],["0","0","0","0","0","3456","20736","31104"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","24","144","216","0"],["0","0","0","0","-64","-528","-1476","-1512","-324"],["0","0","0","0","384","2304","3528","432","648"],["0","0","0","0","-768","-3072","2592","15552","2592"],["0","0","0","0","512","-384","-16704","-34560","-5184"],["0","0","0","0","0","2304","13248","17280","-5184"],["0","0","0","0","0","0","1152","6912","10368"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","2","6"],["0","-8","-24"],["0","8","24"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","6","18"],["0","0","0","0"],["0","0","-24","-72"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-8","-48","-72"],["0","0","16","96","144"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","16","96","144"],["0","0","-32","-192","-288"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["3"],["-9"],["6"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["4","15"],["-4","-12"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","2","6"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","-48","-324","-648","-324"],["0","0","0","0","48","180","-216","-972"],["0","0","0","0","-1152","-6840","-9936","648"],["0","0","0","0","9600","61344","108864","33696"],["0","0","0","0","-22272","-140544","-241920","-62208"],["0","0","0","0","16128","92736","120960","-36288"],["0","0","0","0","0","10368","62208","93312"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","-24","-180","-432","-324"],["0","0","0","0","0","48","216","0","-648"],["0","0","0","0","0","-576","-3312","-4320","1296"],["0","0","0","0","0","4224","28224","55296","25920"],["0","0","0","0","0","-9600","-63936","-124416","-57024"],["0","0","0","0","0","6912","40320","55296","-10368"],["0","0","0","0","0","0","6912","41472","62208"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","-4","-24","-36"],["0","0","24","144","216"],["0","0","-48","-288","-432"],["0","0","32","192","288"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","12","72","108"],["0","0","-24","-144","-216"],["0","0","-48","-288","-432"],["0","0","96","576","864"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","12","72","108"],["0","0","-16","-192","-720","-864"],["0","0","64","624","2016","2160"],["0","0","-64","-576","-1728","-1728"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","8","72","216","216"],["0","0","0","-32","-288","-864","-864"],["0","0","0","32","288","864","864"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","0","-36","-216","-324"],["0","0","32","408","1584","1944"],["0","0","-128","-1200","-3744","-3888"],["0","0","128","1056","2880","2592"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-16","-144","-432","-432"],["0","0","0","64","576","1728","1728"],["0","0","0","-64","-576","-1728","-1728"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","32","192","288"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","9"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-6"]]},"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 >= 1 (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 >= 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"],["4","9"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"]]},"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 + (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 = 9/16 (exact)","name":"first_coefficient_positive","statement":"beta_3 = c_3 L_1 / (a_3 L_2) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = 9/16 > 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of beta_n = 9/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":["9/16"]},"numerator":["9/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) = (3/4 n - 3/8)/(n - 3/2) (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":["-3/2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["5/2","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"}}],"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 >= 3, with a_n = 4, b_n = 6, c_n = 9; Q_n(y) = y^(d_n) P_n(1/y + 0), 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"],["4","9"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"]]},"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 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":"not applicable: expected one nonzero lag term","route":"product_recurrence","success":false,"variant":"product_recurrence"},{"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 + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 3, with a_n = 4, b_n = 6, c_n = 9; Q_n(y) = y^(d_n) P_n(1/y + 0), 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 + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 3, with a_n = 4, b_n = 6, c_n = 9; Q_n(y) = y^(d_n) P_n(1/y + 0), 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"}