{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A007318 of Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-624","-672","-228","-24"],["-546","-770","-314","-38"],["0","-130","-95","-16"],["0","0","-7","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["3042","4836","2826","732","72"],["0","468","426","140","18"],["0","0","-52","-45","-8"],["0","0","0","-7","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","1521","2730","1749","480","48"],["0","0","507","598","227","28"],["0","0","0","39","25","4"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["156","90","12"],["78","71","16"],["0","13","7"],["0","0","1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","156","90","12"],["0","78","71","16"],["0","0","13","7"],["0","0","0","1"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["78","32","2"],["78","45","5"],["0","13","4"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["78","32","2","0"],["546","510","145","12"],["0","130","74","10"],["0","0","7","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1521","-2223","-1190","-278","-24"],["0","-507","-520","-177","-20"],["0","0","-39","-25","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["4","4","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"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":[["-8","-2"],["-7","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["39","25","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["12168","14820","6684","1320","96"],["12168","16848","8764","2028","176"],["3042","5733","3907","1138","120"],["0","507","676","277","36"],["0","0","39","25","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","12168","14820","6684","1320","96"],["0","12168","16848","8764","2028","176"],["0","3042","5733","3907","1138","120"],["0","0","507","676","277","36"],["0","0","0","39","25","4"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["156","100","16"],["156","100","16"],["39","25","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["-936","-912","-296","-32"],["-936","-912","-296","-32"],["-234","-228","-74","-8"]]},"deriv_order":0},{"coeff":{"coeffs":[["3042","3900","1874","400","32"],["1521","1950","937","200","16"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-3042","-3900","-1874","-400","-32"],["-1521","-1950","-937","-200","-16"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["5","2"],["-13","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["39","25","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","-6084","-3900","312","600","96"],["0","-6084","-3900","624","800","128"],["0","-1521","-975","390","350","56"],["0","0","0","78","50","8"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["12168","15600","7496","1600","128"],["18252","23400","11244","2400","192"],["9126","11700","5622","1200","96"],["1521","1950","937","200","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["12168","15600","7496","1600","128"],["30420","39000","18740","4000","320"],["27378","35100","16866","3600","288"],["10647","13650","6559","1400","112"],["1521","1950","937","200","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["-48672","-74568","-45584","-13896","-2112","-128"],["-127764","-200304","-125508","-39288","-6144","-384"],["-91260","-144378","-91320","-28866","-4560","-288"],["-19773","-31434","-19981","-6348","-1008","-64"]]},"deriv_order":1},{"coeff":{"coeffs":[["237276","456300","365508","156100","37488","4800","256"],["237276","456300","365508","156100","37488","4800","256"],["59319","114075","91377","39025","9372","1200","64"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["-24336","-43368","-30592","-10696","-1856","-128"],["18252","23400","11244","2400","192","0"],["36504","55926","34188","10422","1584","96"],["10647","16692","10459","3274","512","32"]]},"deriv_order":0},{"coeff":{"coeffs":[["-237276","-456300","-365508","-156100","-37488","-4800","-256"],["-237276","-456300","-365508","-156100","-37488","-4800","-256"],["-59319","-114075","-91377","-39025","-9372","-1200","-64"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["39","25","4"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-3","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-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 + (1) theta; 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":{"reason":"no parent theorem report with an interlacing conclusion","status":"none"},"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, 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":{"reason":"no parent theorem report with an interlacing conclusion","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"f(n, theta) = 1 + (1) theta","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"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 + (1) theta, for every n >= 0"},"parent_proof":{"route":"liu_wang_three_term","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_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: support must satisfy offset = 1 + ell * t_degree; fixed_delay_predecessor_window: only P_(n-1) and one term w(n) t P_(n-L) are supported)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"not applicable: c_2(n, x) = gamma(n) w(x) with w neither constant nor a constant times a square (x + v_0)^2","route":"three_term_recurrence","success":false,"variant":"three_term_recurrence"},{"detail":"not applicable: the rule is not f(n) P_n = c_0(n, x) P_(n-1) + c_1(n, x) P'_(n-1)","route":"liu_wang","success":false,"variant":"liu_wang"},{"detail":"HypothesisFailed: P_n = A_n(x) P_(n-1) + V_n(x) P'_(n-1) + W_n(x) P_(n-2) for n >= 2, with A_n(x) = (1), V_n(x) = 0, W_n(x) = (3) + (1) x; open hypotheses: degree_step_positive: fails at n = 2: lambda_n = 0 = 0 there (exact); multipliers_vanish_at_zero: [x^0] c_2(n, x) = 3 is not the zero polynomial; lag_coefficient_nonpositive: W_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] W_n <= 0 fails for k = 0 (not a disproof): fails at n = 2: [x^0] W_n = 3 there (exact); derivative_or_lag_coefficient_negative: W_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] W_n <= 0 fails for k = 0 (not a disproof): fails at n = 2: [x^0] W_n = 3 there (exact)","route":"liu_wang_derivative_lag","success":false,"variant":"liu_wang_derivative_lag"},{"detail":"not applicable: the rule is not f(n) P_n = c_0(n, x) P_(n-1) + gamma(n) (x - L)(x - U) P'_(n-1)","route":"ma_wang_interval","success":false,"variant":"ma_wang_interval"},{"detail":"P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 2, with A_n(x) = (1), B_n(x) = (3) + (1) x: every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, -3] (so its coefficients have one sign); for n >= 1, P_(n-1) interlaces P_n (weakly, in the sense of Liu and Wang), and deg P_n - deg P_(n-1) is 0 or 1 for n >= 2","route":"liu_wang_three_term","success":true,"variant":"liu_wang_three_term"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 2, with A_n(x) = (1), B_n(x) = (3) + (1) x","every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, -3] (so its coefficients have one sign); for n >= 1, P_(n-1) interlaces P_n (weakly, in the sense of Liu and Wang), and deg P_n - deg P_(n-1) is 0 or 1 for n >= 2"],"theorem":"liu_wang_three_term: L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction"},"kind":"weak","orientation":"previous_interlaces_next"},"route":"liu_wang_three_term","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 + (1) theta 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"}