{"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":[["144","120","25"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["12","5"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*5^j."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-1728","-8640","-8100","-2000"],["0","-2160","-3300","-1000"],["0","0","-300","-125"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-5184","-25920","-24300","-6000"],["0","0","-6480","-9900","-3000"],["0","0","0","-900","-375"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-1728","-8640","-8100","-2000"],["0","0","0","-2160","-3300","-1000"],["0","0","0","0","-300","-125"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["144","480","225"],["0","180","150"],["0","0","25"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","432","1440","675"],["0","0","540","450"],["0","0","0","75"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","144","480","225"],["0","0","0","180","150"],["0","0","0","0","25"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["144","480","225"]],"recurrence":{"denominator":{"coeffs":[["144","300","100"],["0","180","100"],["0","0","25"]]},"terms":[{"coeff":{"coeffs":[["1728","6480","5100","1125"],["0","2160","2700","750"],["0","0","300","125"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["144","120","25"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["12","5"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["429981696","2508226560","5374771200","6034176000","4017600000","1652400000","414000000","58125000","3515625"],["0","537477120","1791590400","2519424000","1944000000","891000000","243000000","36562500","2343750"],["0","0","74649600","186624000","194400000","108000000","33750000","5625000","390625"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","1289945088","7524679680","16124313600","18102528000","12052800000","4957200000","1242000000","174375000","10546875"],["0","0","1612431360","5374771200","7558272000","5832000000","2673000000","729000000","109687500","7031250"],["0","0","0","223948800","559872000","583200000","324000000","101250000","16875000","1171875"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","429981696","2508226560","5374771200","6034176000","4017600000","1652400000","414000000","58125000","3515625"],["0","0","0","537477120","1791590400","2519424000","1944000000","891000000","243000000","36562500","2343750"],["0","0","0","0","74649600","186624000","194400000","108000000","33750000","5625000","390625"]]},"deriv_order":2}],"shift":0}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["1440","1200","250"],["720","600","125"]]},"deriv_order":0},{"coeff":{"coeffs":[["-1728","-2160","-900","-125"]]},"deriv_order":1}],"kind":"single","quotient":[{"coeff":{"coeffs":[["0","0","8709120","16588800","10800000","2520000","-37500","-62500"],["0","0","0","1555200","1728000","540000","0","-15625"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","3732480","9849600","9936000","4860000","1162500","109375"],["0","0","0","0","1036800","1728000","1080000","300000","31250"]]},"deriv_order":1}],"row_multiplier":["2985984","7464960","7776000","4320000","1350000","225000","15625"]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-12","-5"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":1}]},"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 (LiuWang) proves P_(m-1) weakly 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 (LiuWang) proves P_(m-1) weakly 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":[["144","120","25"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["12","5"]]},"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":"periodic_product","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":"weak","interlacing_from":1,"root_region":{"upper":{"closed":false,"value":"0"}},"simple_roots":false,"statement":"every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0) (so its coefficients have one sign); deg P_n = deg P_(n-1) + 1 and P_(n-1) interlaces P_n (Liu--Wang) for n >= 1"},"hypotheses":[{"evidence":"P_0 has degree 2; checked exactly","name":"seed_roots_negative","statement":"P_0 is nonzero and real-rooted with every root < 0","status":{"kind":"verified"}},{"evidence":"lambda_n = 5 > 0 for every integer n in [1, +inf) (exact; Taylor shift: the coefficients of lambda_n = 5 at n = 1 + u have one sign)","name":"degree_step_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["5"]},"numerator":["5"],"range":{"first":"1","last":null}},"decision":"holds"},"statement":"lambda_n = [x^1] a_n + (deg P_(n-1)) [x^2] b_n > 0 for every n >= 1 (deg P_n = deg P_(n-1) + 1 with leading coefficients of one sign)","status":{"kind":"verified"}},{"evidence":"[x^0] c_1(n, x) is the zero polynomial","name":"derivative_coefficient_vanishes_at_zero","statement":"b_n(0) = 0 for every n >= 1","status":{"kind":"verified"}},{"evidence":"b_n = 0","name":"derivative_coefficient_nonpositive","statement":"b_n(x) <= 0 for every x < 0 and every n >= 1","status":{"kind":"verified"}},{"evidence":"a_n(0) = 12 > 0 for every integer n in [1, +inf) (exact; Taylor shift: the coefficients of a_n(0) = 12 at n = 1 + u have one sign)","name":"constant_term_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["12"]},"numerator":["12"],"range":{"first":"1","last":null}},"decision":"holds"},"statement":"a_n(0) > 0 for every n >= 1","status":{"kind":"verified"}},{"evidence":"exact","name":"requested_root_region","statement":"the requested region (-inf, 0) contains (-inf, 0), the region this theorem certifies","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = a_n(x) P_(n-1) + b_n(x) P'_(n-1) for n >= 1, with a_n(x) = (12) + (5) x and b_n(x) = (0) + (0) x + (0) x^2","recurrence":{"first_index":0,"initial_polynomials":[["144","120","25"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["12","5"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"reference":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","requested_root_region":{"upper":{"closed":false,"value":"0"}},"schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"liu_wang"},"parent_proof":{"attempts":[{"detail":"c and the seeds are nonzero, real-rooted and of one sign, so P_(n0 + k m + i) = c^m P_(n0 + i) is too","route":"periodic_product","success":true,"variant":"P_(n+k) = c(x) P_n"}],"conditional_on":[],"route":"periodic_product","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"}