{"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"],["2","4"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","16"],["0","0","-16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-2","-4"],["4","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013611 of Square the entries of Pascal's triangle."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-2","-22","-56","-64"],["-6","-94","-328","-384"],["-4","-96","-440","-560"],["0","-24","-176","-288"],["0","0","-16","-48"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","2","58","392","576"],["0","-10","-106","-56","256"],["0","-12","-240","-936","-912"],["0","0","-72","-496","-736"],["0","0","0","-48","-144"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","8","133","644","896"],["0","0","4","126","832","1376"],["0","0","-4","-36","40","400"],["0","0","0","-24","-136","-128"],["0","0","0","0","-16","-48"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","2","31","140","192"],["0","0","0","2","44","232","352"],["0","0","0","0","12","96","192"],["0","0","0","0","0","8","32"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["1","3","4"],["2","12","16"],["1","15","24"],["0","6","16"],["0","0","4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","3","9","12"],["0","6","36","48"],["0","3","45","72"],["0","0","18","48"],["0","0","0","12"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","1","3","4"],["0","0","2","12","16"],["0","0","1","15","24"],["0","0","0","6","16"],["0","0","0","0","4"]]},"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"],["0","0","0"],["1","-3","0"],["0","6","0"],["0","0","4"]]},"terms":[{"coeff":{"coeffs":[["0","0","8","0"],["-2","-26","-88","-64"],["4","24","8","-16"],["0","24","112","96"],["0","0","16","48"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","1","4","0"],["0","-2","-20","-64","-64"],["0","0","-12","-72","-96"],["0","0","0","-8","-32"]]},"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"],["2","4"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","16"],["0","0","-16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-2","-4"],["4","8"]]},"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":[["-2","-4"],["-4","-12"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","2","8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","1","11","44","80","64"],["0","0","4","50","232","480","384"],["0","0","6","90","492","1152","960"],["0","0","4","80","528","1408","1280"],["0","0","1","35","292","912","960"],["0","0","0","6","72","288","384"],["0","0","0","0","4","32","64"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","3","33","132","240","192"],["0","0","0","12","150","696","1440","1152"],["0","0","0","18","270","1476","3456","2880"],["0","0","0","12","240","1584","4224","3840"],["0","0","0","3","105","876","2736","2880"],["0","0","0","0","18","216","864","1152"],["0","0","0","0","0","12","96","192"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","1","11","44","80","64"],["0","0","0","0","4","50","232","480","384"],["0","0","0","0","6","90","492","1152","960"],["0","0","0","0","4","80","528","1408","1280"],["0","0","0","0","1","35","292","912","960"],["0","0","0","0","0","6","72","288","384"],["0","0","0","0","0","0","4","32","64"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","1","4"],["0","2","8"],["0","1","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","-8","-32"],["0","0","-20","-80"],["0","0","-16","-64"],["0","0","-4","-16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","4","32","64"],["0","0","6","48","96"],["0","0","2","16","32"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-8","-64","-128"],["0","0","-12","-96","-192"],["0","0","-4","-32","-64"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["0"],["4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","4"],["-2","-8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","1","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","40","372","1056","832"],["0","0","0","0","162","1540","4544","3904"],["0","0","0","0","246","2424","7584","7296"],["0","0","0","0","166","1752","6048","6784"],["0","0","0","0","42","532","2240","3136"],["0","0","0","0","0","36","288","576"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","17","176","592","640"],["0","0","0","0","0","69","736","2576","2944"],["0","0","0","0","0","105","1176","4368","5376"],["0","0","0","0","0","71","872","3568","4864"],["0","0","0","0","0","18","280","1376","2176"],["0","0","0","0","0","0","24","192","384"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","1","8","16"],["0","0","3","24","48"],["0","0","3","24","48"],["0","0","1","8","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","8","64","128"],["0","0","36","288","576"],["0","0","64","512","1024"],["0","0","56","448","896"],["0","0","24","192","384"],["0","0","4","32","64"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-4","-40","-128","-128"],["0","0","-14","-148","-512","-576"],["0","0","-18","-200","-736","-896"],["0","0","-10","-116","-448","-576"],["0","0","-2","-24","-96","-128"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","2","24","96","128"],["0","0","0","5","60","240","320"],["0","0","0","4","48","192","256"],["0","0","0","1","12","48","64"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","8","72","192","128"],["0","0","28","268","800","704"],["0","0","36","364","1184","1216"],["0","0","20","212","736","832"],["0","0","4","44","160","192"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-4","-48","-192","-256"],["0","0","0","-10","-120","-480","-640"],["0","0","0","-8","-96","-384","-512"],["0","0","0","-2","-24","-96","-128"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","1","8","16"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","16"],["0","0","16"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","-12"],["-4","-8"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["2"],["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"],["2","4"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","16"],["0","0","-16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-2","-4"],["4","8"]]},"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 >= 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 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) = 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":["2","1"]},"numerator":["0","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 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 4 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":["6","4"]},"numerator":["-2","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 = 4/3 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = (n^2 - 2 n + 1)/(n^2 - 2 n + 3/4) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = (n^2 - 2 n + 1)/(n^2 - 2 n + 3/4) at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["3/4","-2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["15/4","4","1"],"shifted_numerator":["4","4","1"]},"numerator":["1","-2","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)/(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":["-3/16","23/16","-17/4","6","-4","1"],"method":{"kind":"taylor_shift","shifted_denominator":["375/8","1775/16","415/4","48","11","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)/(n), b_n = (8 n - 4)/(n), c_n = (16 n - 16)/(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"],["2","4"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","16"],["0","0","-16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-2","-4"],["4","8"]]},"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)/(n), b_n = (8 n - 4)/(n), c_n = (16 n - 16)/(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)/(n), b_n = (8 n - 4)/(n), c_n = (16 n - 16)/(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 + (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"}