{"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"],["4","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013609 of One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-36","-204","-276","-144"],["-84","-652","-1092","-596"],["-64","-704","-1490","-896"],["-16","-312","-876","-622"],["0","-48","-216","-200"],["0","0","-16","-24"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-36","-76","332","320"],["0","-156","-996","-868","-44"],["0","-160","-1568","-2782","-1232"],["0","-48","-840","-2180","-1354"],["0","0","-144","-616","-536"],["0","0","0","-48","-72"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","54","466","1174","796"],["0","0","36","548","1918","1584"],["0","0","-24","-24","620","924"],["0","0","-16","-192","-316","18"],["0","0","0","-48","-176","-120"],["0","0","0","0","-16","-24"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","18","134","290","188"],["0","0","0","24","240","602","436"],["0","0","0","8","136","422","364"],["0","0","0","0","24","112","128"],["0","0","0","0","0","8","16"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["9","15","9"],["21","61","39"],["16","88","67"],["4","54","57"],["0","12","24"],["0","0","4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","27","45","27"],["0","63","183","117"],["0","48","264","201"],["0","12","162","171"],["0","0","36","72"],["0","0","0","12"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","9","15","9"],["0","0","21","61","39"],["0","0","16","88","67"],["0","0","4","54","57"],["0","0","0","12","24"],["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"],["1","-1","0"],["4","-2","0"],["4","6","1"],["0","12","4"],["0","0","4"]]},"terms":[{"coeff":{"coeffs":[["0","-8","-2","-2"],["4","-12","-44","-10"],["16","56","-2","-10"],["16","120","172","62"],["0","48","136","80"],["0","0","16","24"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","-6","-6","-4"],["0","-8","-40","-62","-28"],["0","-8","-64","-134","-76"],["0","0","-24","-80","-64"],["0","0","0","-8","-16"]]},"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"],["4","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"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":[["-4","-4"],["-4","-6"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","2","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","9","51","105","96","36"],["0","0","39","247","577","592","228"],["0","0","67","493","1322","1516","616"],["0","0","57","519","1622","2084","920"],["0","0","24","304","1133","1652","820"],["0","0","4","94","437","748","436"],["0","0","0","12","80","176","128"],["0","0","0","0","4","16","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","27","153","315","288","108"],["0","0","0","117","741","1731","1776","684"],["0","0","0","201","1479","3966","4548","1848"],["0","0","0","171","1557","4866","6252","2760"],["0","0","0","72","912","3399","4956","2460"],["0","0","0","12","282","1311","2244","1308"],["0","0","0","0","36","240","528","384"],["0","0","0","0","0","12","48","48"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","9","51","105","96","36"],["0","0","0","0","39","247","577","592","228"],["0","0","0","0","67","493","1322","1516","616"],["0","0","0","0","57","519","1622","2084","920"],["0","0","0","0","24","304","1133","1652","820"],["0","0","0","0","4","94","437","748","436"],["0","0","0","0","0","12","80","176","128"],["0","0","0","0","0","0","4","16","16"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","1","2"],["0","2","4"],["0","1","2"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","-2","-4"],["0","0","-4","-8"],["0","0","-2","-4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","2","8","8"],["0","0","2","8","8"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-4","-16","-16"],["0","0","-4","-16","-16"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["1"],["2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","1"],["-2","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","1","2"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","160","740","1040","400"],["0","0","0","0","714","3372","4920","2064"],["0","0","0","0","1266","6166","9472","4408"],["0","0","0","0","1114","5702","9440","4984"],["0","0","0","0","486","2730","5088","3144"],["0","0","0","0","84","598","1384","1048"],["0","0","0","0","0","36","144","144"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","68","348","576","304"],["0","0","0","0","0","304","1602","2760","1544"],["0","0","0","0","0","540","2970","5400","3240"],["0","0","0","0","0","476","2802","5496","3592"],["0","0","0","0","0","208","1386","3048","2216"],["0","0","0","0","0","36","324","864","720"],["0","0","0","0","0","0","24","96","96"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","1","4","4"],["0","0","3","12","12"],["0","0","3","12","12"],["0","0","1","4","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","3","12","12"],["0","0","11","44","44"],["0","0","15","60","60"],["0","0","9","36","36"],["0","0","2","8","8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-3","-15","-24","-12"],["0","0","-8","-42","-72","-40"],["0","0","-7","-39","-72","-44"],["0","0","-2","-12","-24","-16"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","1","6","12","8"],["0","0","0","2","12","24","16"],["0","0","0","1","6","12","8"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","6","28","40","16"],["0","0","16","78","120","56"],["0","0","14","72","120","64"],["0","0","4","22","40","24"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-2","-12","-24","-16"],["0","0","0","-4","-24","-48","-32"],["0","0","0","-2","-12","-24","-16"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","1","4","4"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-4"]]},"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"],["4","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"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) a_n = 4 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 4 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":["4"]},"numerator":["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/4 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = 1/4 > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = 1/4 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/4"]},"numerator":["1/4"],"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/2 n + 1/2)/(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 = 4, b_n = 4, c_n = 4; 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","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"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 >= 2, with a_n = 4, b_n = 4, c_n = 4; 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, b_n = 4, c_n = 4; 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"}