{"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":[["0"],["1"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["2"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["6","2"],["-11","-11"],["6","9"],["-1","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","1"],["0","-3","-4"],["0","1","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"derivative of Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones."},"identifying_rows":3,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","-2"],["0","1"],["-2","4"],["5","-2"],["-4","-3"],["1","2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","-4"],["0","0","1"],["0","-4","8"],["0","9","-2"],["0","-6","-7"],["0","1","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","0","-1"],["0","0","0","0"],["0","0","-1","2"],["0","0","2","0"],["0","0","-1","-2"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0"],["0"],["1"],["-2"],["1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","0"],["0","0"],["0","1"],["0","-2"],["0","1"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1,2],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["0"],["1"],["0","4"]],"recurrence":{"denominator":{"coeffs":[["4"],["-12"],["13"],["-6"],["1"]]},"terms":[{"coeff":{"coeffs":[["12","2"],["-40","-9"],["51","28"],["-31","-30"],["9","13"],["-1","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","1"],["0","-12","-4"],["0","13","10"],["0","-6","-8"],["0","1","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":2,"multiplier":["0","-1","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["0"],["1"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["2"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["6","2"],["-11","-11"],["6","9"],["-1","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","1"],["0","-3","-4"],["0","1","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_valid_from_base":2,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["0","0","0"],["0","0","0"],["0","0","1"],["0","0","-2"],["0","0","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0"],["0","0","0","0"],["0","0","0","1"],["0","0","0","-2"],["0","0","0","1"]]},"deriv_order":1}],"shift":0}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["2"],["-3"],["1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","4"],["0","-2"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","1"]]},"deriv_order":2}],"kind":"single","quotient":[{"coeff":{"coeffs":[["0","0","0","0"],["0","0","0","1"],["0","0","0","-2"],["0","0","0","0"],["0","0","0","3"],["0","0","0","-2"]]},"deriv_order":0}],"row_multiplier":["0","0","1"],"start_base":2,"step_multiplier":{"coeffs":[["0","0","0","0","1"]]},"step_quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","-2"],["0","0","0","0","0","1"],["0","0","0","0","1","3"],["0","0","0","0","-1","-2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","-1"],["0","0","0","0","0","-1","0"],["0","0","0","0","0","1","2"]]},"deriv_order":1}]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","2"],["2","-1"],["-3","-3"],["1","2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","1"],["0","1","0"],["0","-1","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["-1"],["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 2) 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 >= 2 (the exceptional bases checked exactly), and agreement on the 3 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":[["0"],["1"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["2"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["6","2"],["-11","-11"],["6","9"],["-1","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","1"],["0","-3","-4"],["0","1","2"]]},"deriv_order":1,"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":{"statement":"open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only)","status":"open"},"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":"open"},"notes":["the division remainder is removed by row annihilators of the shifted parent"],"parent_proof":{"attempts":[{"detail":"the leader is not a nonzero constant","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: LHS must be a nonzero constant; fixed_delay_predecessor_window: LHS must be a nonzero constant)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"not applicable: the rule is not f(n) P_n = c_1(n, x) P_(n-1) + c_2(n, x) P_(n-2) with both terms nonzero","route":"three_term_recurrence","success":false,"variant":"three_term_recurrence"},{"detail":"HypothesisFailed: P_n = a_n(x) P_(n-1) + b_n(x) P'_(n-1) for n >= 3, with a_n(x) = ((-n^3 + 6 n^2 - 11 n + 6)/(n^2 - 3 n + 2)) + ((-2 n^3 + 9 n^2 - 11 n + 2)/(n^2 - 3 n + 2)) x and b_n(x) = ((0)/(n^2 - 3 n + 2)) + ((n^2 - 3 n + 2)/(n^2 - 3 n + 2)) x + ((2 n^2 - 4 n + 1)/(n^2 - 3 n + 2)) x^2; open hypotheses: seed_roots_negative: P_2 is zero, not real-rooted, or has a root >= 0 (exact); earlier_seeds: P_0 is zero or not real-rooted with every root in (-inf, 0) (exact); derivative_coefficient_nonpositive: b_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] b_n <= 0 fails for k = 2 (not a disproof): fails at n = 3: [x^2] b_n = 7/2 there (exact); constant_term_positive: fails at n = 3: a_n(0) = (-n^3 + 6 n^2 - 11 n + 6)/(n^2 - 3 n + 2) = 0 there (exact)","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 >= 3, with A_n(x) = ((-n^3 + 6 n^2 - 11 n + 6)/(n^2 - 3 n + 2)) + ((-2 n^3 + 9 n^2 - 11 n + 2)/(n^2 - 3 n + 2)) x, V_n(x) = ((n^2 - 3 n + 2)/(n^2 - 3 n + 2)) x + ((2 n^2 - 4 n + 1)/(n^2 - 3 n + 2)) x^2, W_n(x) = 0; open hypotheses: seed_roots_negative: P_2 is zero, not real-rooted, or has a root >= 0 (exact); constant_term_positive: fails at n = 3: A_n(0) = (-n^3 + 6 n^2 - 11 n + 6)/(n^2 - 3 n + 2) = 0 there (exact); derivative_coefficient_nonpositive: V_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] V_n <= 0 fails for k = 2 (not a disproof): fails at n = 3: [x^2] V_n = 7/2 there (exact); derivative_or_lag_coefficient_negative: V_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] V_n <= 0 fails for k = 2 (not a disproof): fails at n = 3: [x^2] V_n = 7/2 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): c_1 is not gamma(n) w(x)","route":"ma_wang_interval","success":false,"variant":"ma_wang_interval"},{"detail":"not applicable: the rule is not f(n) P_n = c_1(n, x) P_(n-1) + c_d(n, x) P'_(n-1) + c_2(n, x) P_(n-2) with a nonzero lag term and a nonzero P_(n-1) or P'_(n-1) term","route":"liu_wang_three_term","success":false,"variant":"liu_wang_three_term"},{"detail":"HypothesisFailed: P_n = a_n(x) S_n(P_(n-1)) for n >= 3, with a_n(x) = (1) ((1)) and S_n = (A + B D + C D^2 with A = 6 - 11 n + 6 n^2 - n^3 + 2 x - 11 n x + 9 n^2 x - 2 n^3 x, B = 2 x - 3 n x + n^2 x + x^2 - 4 n x^2 + 2 n^2 x^2, C = 0) / (n^2 - 3 n + 2); open hypotheses: weyl_step_leading_coefficients_same_sign: fails at n = 3: A_1 B_lead = -4 n^5 + 26 n^4 - 60 n^3 + 57 n^2 - 19 n + 2 = -28 there (exact); weyl_step_interlacing: fails at n = 3: B_2 (B_2 A_0^2 - B_1 A_0 A_1 + B_0 A_1^2) = -2 n^9 + 26 n^8 - 145 n^7 + 455 n^6 - 884 n^5 + 1100 n^4 - 873 n^3 + 423 n^2 - 112 n + 12 = 0 there (exact); weyl_step_leading_coefficients_one_signed: fails at n = 3: A_a B_(a+1) = -4 n^5 + 26 n^4 - 60 n^3 + 57 n^2 - 19 n + 2 = -28 there (exact)","route":"iterated_preserver","success":false,"variant":"iterated_preserver"}],"conditional_on":[],"rows_checked":10,"statement":"open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only)","status":"not_proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (1) theta for every n >= 0 is certified; the lift is Open (open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only))"},"kind":"preserver_image"}