{"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"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle T(n,k), read by rows given by [1,0,1,0,0,0,0,0,0,...] DELTA [0,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["36","-6","0","0"],["-72","-110","-14","-1"],["0","-66","1","0"],["0","44","34","2"],["0","0","5","0"],["0","0","-2","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-468","-322","-56","-4"],["0","-216","-330","-42","-3"],["0","0","154","123","8"],["0","0","132","102","6"],["0","0","0","-1","-4"],["0","0","0","-6","-3"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-684","-386","-70","-5"],["0","0","-72","-110","-14","-1"],["0","0","0","374","151","10"],["0","0","0","44","34","2"],["0","0","0","0","-15","-5"],["0","0","0","0","-2","-1"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","-144","-76","-14","-1"],["0","0","0","0","0","0","0"],["0","0","0","0","88","30","2"],["0","0","0","0","0","0","0"],["0","0","0","0","0","-4","-1"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["-36","6","0"],["72","-34","0"],["0","66","-1"],["0","-44","4"],["0","0","-5"],["0","0","2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","-108","18","0"],["0","216","-102","0"],["0","0","198","-3"],["0","0","-132","12"],["0","0","0","-15"],["0","0","0","6"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","-36","6","0"],["0","0","72","-34","0"],["0","0","0","66","-1"],["0","0","0","-44","4"],["0","0","0","0","-5"],["0","0","0","0","2"]]},"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":[["-108","150","-12"],["72","-298","44"],["0","198","-63"],["0","-44","44"],["0","0","-15"],["0","0","2"]]},"terms":[{"coeff":{"coeffs":[["-108","6","12","0"],["72","-154","-56","0"],["0","198","51","-4"],["0","-44","6","8"],["0","0","-15","-5"],["0","0","2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","144","-12","-12","0"],["0","0","176","44","0"],["0","0","-88","-6","4"],["0","0","0","-16","-4"],["0","0","0","4","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"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":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"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":[["1","0"],["-2","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-4","-1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-1"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","-576","-192","12","6","0"],["0","0","3456","800","-248","-58","0"],["0","0","-6912","160","1360","218","-1"],["0","0","4608","-4800","-3136","-380","8"],["0","0","0","7040","3120","240","-25"],["0","0","0","-2816","-800","128","38"],["0","0","0","0","-448","-224","-28"],["0","0","0","0","128","64","8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-1728","-576","36","18","0"],["0","0","0","10368","2400","-744","-174","0"],["0","0","0","-20736","480","4080","654","-3"],["0","0","0","13824","-14400","-9408","-1140","24"],["0","0","0","0","21120","9360","720","-75"],["0","0","0","0","-8448","-2400","384","114"],["0","0","0","0","0","-1344","-672","-84"],["0","0","0","0","0","384","192","24"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","-576","-192","12","6","0"],["0","0","0","0","3456","800","-248","-58","0"],["0","0","0","0","-6912","160","1360","218","-1"],["0","0","0","0","4608","-4800","-3136","-380","8"],["0","0","0","0","0","7040","3120","240","-25"],["0","0","0","0","0","-2816","-800","128","38"],["0","0","0","0","0","0","-448","-224","-28"],["0","0","0","0","0","0","128","64","8"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","4","1"],["0","-16","-4"],["0","16","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","-4","-1","0"],["0","0","-4","-1"],["0","16","12","2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","16","8","1"],["0","0","-32","-16","-2"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","16","8","1"],["0","0","-32","-16","-2"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["1"],["-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["2","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","4","1"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","608","320","46","1"],["0","0","0","0","-4448","-2304","-318","-5"],["0","0","0","0","12096","6064","764","1"],["0","0","0","0","-14464","-6640","-608","37"],["0","0","0","0","6400","1824","-288","-86"],["0","0","0","0","0","1216","608","76"],["0","0","0","0","0","-384","-192","-24"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","256","144","24","1"],["0","0","0","0","0","-1888","-1040","-166","-6"],["0","0","0","0","0","5184","2736","396","9"],["0","0","0","0","0","-6272","-2944","-296","12"],["0","0","0","0","0","2816","640","-208","-48"],["0","0","0","0","0","0","768","384","48"],["0","0","0","0","0","0","-256","-128","-16"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","-16","-8","-1"],["0","0","96","48","6"],["0","0","-192","-96","-12"],["0","0","128","64","8"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","-16","-8","-1"],["0","0","48","24","3"],["0","0","0","0","0"],["0","0","-64","-32","-4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","32","48","18","2"],["0","0","-128","-192","-72","-8"],["0","0","128","192","72","8"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","64","48","12","1"],["0","0","0","-256","-192","-48","-4"],["0","0","0","256","192","48","4"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","48","56","19","2"],["0","0","-160","-192","-66","-7"],["0","0","64","96","36","4"],["0","0","128","128","40","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","64","48","12","1"],["0","0","0","-256","-192","-48","-4"],["0","0","0","256","192","48","4"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","128","64","8"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","-1"]]},"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":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 [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":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":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-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 >= 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":2,"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 = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0); the rule is applied from n = 3 on in the induction (start moved 1 row(s) past the supplied seeds; P_0, ..., P_2 enter as seed rows, checked exactly)"},"hypotheses":[{"evidence":"f(n) a_n = 1 != 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 1 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":["1"]},"numerator":["1"],"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 (exact)","name":"first_coefficient_positive","statement":"beta_3 = c_3 L_1 / (a_3 L_2) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = 1 > 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of beta_n = 1 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"]},"numerator":["1"],"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":"checked exactly for P_0, ..., P_0","name":"earlier_seeds","statement":"the seed rows P_0, ..., P_0 are nonzero and real-rooted with every root in (-inf, 0)","status":{"kind":"verified"}},{"evidence":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = 1 (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 P_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 x + b_n) P_(n-1) - c_n P_(n-2) for n >= 3, with a_n = 1, b_n = 2, c_n = 1","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-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","start_delay":1,"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":"induction start moved 1 row(s) past the seeds: P_n = (a_n x + b_n) P_(n-1) - c_n P_(n-2) for n >= 3, with a_n = 1, b_n = 2, c_n = 1: every P_n, n >= 0, 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); the rule is applied from n = 3 on in the induction (start moved 1 row(s) past the supplied seeds; P_0, ..., P_2 enter as seed rows, checked exactly)","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 x + b_n) P_(n-1) - c_n P_(n-2) for n >= 3, with a_n = 1, b_n = 2, c_n = 1","every P_n, n >= 0, 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); the rule is applied from n = 3 on in the induction (start moved 1 row(s) past the supplied seeds; P_0, ..., P_2 enter as seed rows, checked exactly)"],"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"}