{"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"],["0","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","1"],["3","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-4"],["6"],["-2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Exponential Riordan array [1, log((1-x)/(1-2x))]."},"identifying_rows":4,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0"],["8"],["20"],["16"],["4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0"],["0","24"],["0","60"],["0","48"],["0","12"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","0"],["0","0","8"],["0","0","20"],["0","0","16"],["0","0","4"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["-36","-16"],["-78","-24"],["-54","-8"],["-12","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","-108","16"],["0","-234","24"],["0","-162","8"],["0","-36","0"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","-36","64"],["0","0","-78","96"],["0","0","-54","32"],["0","0","-12","0"]]},"deriv_order":2,"shift":1},{"coeff":{"coeffs":[["0","0","0","0","16"],["0","0","0","0","24"],["0","0","0","0","8"]]},"deriv_order":3,"shift":1},{"coeff":{"coeffs":[["52","24","-9"],["52","12","0"],["13","0","0"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["0","156","-24","-43"],["0","156","-12","0"],["0","39","0","0"]]},"deriv_order":1,"shift":2},{"coeff":{"coeffs":[["0","0","52","-96","-29"],["0","0","52","-48","0"],["0","0","13","0","0"]]},"deriv_order":2,"shift":2},{"coeff":{"coeffs":[["0","0","0","0","-24","-4"],["0","0","0","0","-12","0"]]},"deriv_order":3,"shift":2},{"coeff":{"coeffs":[["-15","-4"],["-6","0"]]},"deriv_order":0,"shift":3},{"coeff":{"coeffs":[["0","-45","4"],["0","-18","0"]]},"deriv_order":1,"shift":3},{"coeff":{"coeffs":[["0","0","-15","16"],["0","0","-6","0"]]},"deriv_order":2,"shift":3},{"coeff":{"coeffs":[["0","0","0","0","4"]]},"deriv_order":3,"shift":3},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":4},{"coeff":{"coeffs":[["0","3"]]},"deriv_order":1,"shift":4},{"coeff":{"coeffs":[["0","0","1"]]},"deriv_order":2,"shift":4}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1,2,3],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"],["0","4"],["0","12","9"],["0","56","81","16"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-288"],["408"],["-212"],["48"],["-4"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["-180","48"],["222","-40"],["-90","8"],["12","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","0","-48"],["0","0","40"],["0","0","-8"]]},"deriv_order":1,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-52","24","9"],["52","-12","0"],["-13","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-24","4"],["0","0","12","0"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-9","4"],["6","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-4"]]},"deriv_order":1,"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":[["1"],["0","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","1"],["3","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-4"],["6"],["-2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["4"],["6"],["2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","12"],["0","18"],["0","6"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","4"],["0","0","6"],["0","0","2"]]},"deriv_order":2}],"shift":0},{"differentiations":[{"coeff":{"coeffs":[["-6"],["-3"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","-18","9"],["0","-9","0"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","-6","17"],["0","0","-3","0"]]},"deriv_order":2},{"coeff":{"coeffs":[["0","0","0","0","4"]]},"deriv_order":3}],"shift":1},{"differentiations":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","3"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","1"]]},"deriv_order":2}],"shift":2}],"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0"],["2"],["2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-3","-1"],["-3","0"]]},"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 4 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, 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":{"reason":"no parent theorem report with an interlacing conclusion","status":"not_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"],["0","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","1"],["3","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-4"],["6"],["-2"]]},"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":"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":[],"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: coefficients must be index-independent; 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":"HypothesisFailed: P_n = (a_n x + b_n) P_(n-1) - c_n P_(n-2) for n >= 2, with a_n = 1, b_n = 3 n - 3, c_n = 2 n^2 - 6 n + 4; open hypotheses: first_coefficient_positive: beta_2 = 0 (exact); root_upper_bound: not attempted: the real-rootedness hypotheses do not all hold","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) = (3 n - 3) + (1) x, V_n(x) = 0, W_n(x) = (-2 n^2 + 6 n - 4); open hypotheses: seed_roots_negative: P_1 is zero, not real-rooted, or has a root >= 0 (exact); multipliers_vanish_at_zero: [x^0] c_2(n, x) = -2 n^2 + 6 n - 4 is not the zero polynomial; derivative_or_lag_coefficient_negative: W_n(x) = gamma(n) w(x) / f(n) with w(x) = -4, which is negative on (-inf, 0) (no root there, exact): fails at n = 2: gamma(n)/f(n) = 1/2 n^2 - 3/2 n + 1 = 0 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":"induction start moved 1 row(s) past the seeds: P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 3, with A_n(x) = (3 n - 3) + (1) x, B_n(x) = (-2 n^2 + 6 n - 4); P_n = x^1 R_n for n >= 1 (x^1 divides P_1 and P_2; R_n satisfies the same rule): every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0] (so its coefficients have one sign); for n >= 2, 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 >= 3; P_n = x^1 R_n for n >= 1 with R_n(0) != 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); P_(m-1) interlaces P_m checked exactly for m = 1, ..., 1","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 >= 3, with A_n(x) = (3 n - 3) + (1) x, B_n(x) = (-2 n^2 + 6 n - 4); P_n = x^1 R_n for n >= 1 (x^1 divides P_1 and P_2; R_n satisfies the same rule)","every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0] (so its coefficients have one sign); for n >= 2, 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 >= 3; P_n = x^1 R_n for n >= 1 with R_n(0) != 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); P_(m-1) interlaces P_m checked exactly for m = 1, ..., 1"],"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 + (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"}