{"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2","-1"],["0","0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","0","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Irregular triangle T(n, k) = [x^k]( p(n, x) ), where p(n, x) = (1/x)*(1-x)^n*(1+x)^(n+2)*( Sum_{j >= 0} j^(n+1)*x^j ), read by rows."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0","2","12","18","8"],["0","0","-2","4","46","28"],["0","0","0","-4","20","28"],["0","0","0","0","0","8"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","4","22","24","-2","-8"],["0","0","0","10","28","34","4"],["0","0","0","0","4","20","20"],["0","0","0","0","0","0","8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","0","2","10","6","-10","-8"],["0","0","0","0","6","12","-6","-12"],["0","0","0","0","0","4","0","-4"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["-1","-6","-15","-10"],["0","-2","-12","-18"],["0","0","0","-8"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","-3","-10","-13","-6"],["0","0","-6","-12","-14"],["0","0","0","0","-8"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","-1","-2","1","2"],["0","0","0","-2","0","2"]]},"deriv_order":2,"shift":1},{"coeff":{"coeffs":[["1","2"],["0","2"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["0","1","2"],["0","0","2"]]},"deriv_order":1,"shift":2}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"],["1","4","3"]],"recurrence":{"denominator":{"coeffs":[["1","-2"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["0","0","-6","12","-6","0"],["0","0","2","-20","34","-12"],["0","0","0","4","-20","20"],["0","0","0","0","0","-8"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-2","2","2","-2","0"],["0","0","0","-6","4","6","-4"],["0","0","0","0","-4","0","4"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","2","-9","6"],["0","2","12","-14"],["0","0","0","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-2","-1","2"],["0","0","2","0","-2"]]},"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":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2","-1"],["0","0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","0","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["0","0","2","8"],["0","0","2","12"],["0","0","0","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-2","-10","-8"],["0","0","0","-6","-12"],["0","0","0","0","-4"]]},"deriv_order":1}],"shift":0},{"differentiations":[{"coeff":{"coeffs":[["1","2"],["0","2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","1","2"],["0","0","2"]]},"deriv_order":1}],"shift":1}],"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-1","-2","-1"],["0","0","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-1","0","1"]]},"deriv_order":1,"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 + (1) theta; so the candidate rows satisfy the input rule at every base n >= 0 (the exceptional bases checked exactly), and agreement on the 2 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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2","-1"],["0","0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","0","-1"]]},"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":{"labels":["oeis_catalog:A165891:lean_proved"],"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign (real-rootedness from the catalog flag, not proved here; one-signed coefficients proved here)","status":"attested"},"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":"conditional_on_attestation"},"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: derivatives and alternating signs are unsupported)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"not applicable: the theorem needs at least two seed rows","route":"three_term_recurrence","success":false,"variant":"three_term_recurrence"},{"detail":"not applicable: deg_x c_0 > 1 or deg_x c_1 > 2: the degree may grow by more than one","route":"liu_wang","success":false,"variant":"liu_wang"},{"detail":"not applicable: the theorem needs two seed rows","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): deg_x c_0 > 1 or deg_x c_1 != 2","route":"ma_wang_interval","success":false,"variant":"ma_wang_interval"},{"detail":"not applicable: the theorem needs two seed rows","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 >= 1, with a_n(x) = (1) ((1)) and S_n = A + B D + C D^2 with A = 1 + 2 x - x^2 + 2 n x^2, B = x - x^3, C = 0; open hypotheses: weyl_step_interlacing: at n = 1: A and B have leading coefficients of opposite signs; weyl_step_leading_coefficients_one_signed: fails at n = 1: A_a B_(a+1) = -2 n + 1 = -1 there (exact)","route":"iterated_preserver","success":false,"variant":"iterated_preserver"},{"detail":"every row of the bundled OEIS catalog entry A165891 is zero or real-rooted (flag lean_proved, as of 2026-10-03: a machine-checked Lean proof made outside polytool); every row has coefficients of one sign: the seeds do, the leader is positive and every combined weight is >= 0 for n >= 1, with deg P_m <= 0 + 2 m","route":"attestation","success":true,"variant":"oeis_catalog:A165891:lean_proved"}],"conditional_on":["oeis_catalog:A165891:lean_proved"],"route":"attestation","rows_checked":10,"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign (real-rootedness from the catalog flag, not proved here; one-signed coefficients proved here)","status":"conditional_on_attestation"},"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 ConditionalOnAttestation (every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign (real-rootedness from the catalog flag, not proved here; one-signed coefficients proved here))"},"kind":"preserver_image"}