{"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"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","2","-1"],["2","-2","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1","2"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"one_plus_derivative of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles."},"identifying_rows":4,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["1","4","6","4","1"],["4","12","12","4","0"],["6","12","6","0","0"],["4","4","0","0","0"],["1","0","0","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","3","12","18","12","3"],["0","12","36","36","12","0"],["0","18","36","18","0","0"],["0","12","12","0","0","0"],["0","3","0","0","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","1","4","6","4","1"],["0","0","4","12","12","4","0"],["0","0","6","12","6","0","0"],["0","0","4","4","0","0","0"],["0","0","1","0","0","0","0"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["-15","-28","-18","-4"],["-28","-36","-12","0"],["-18","-12","0","0"],["-4","0","0","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","-45","-84","-54","-12"],["0","-84","-108","-36","0"],["0","-54","-36","0","0"],["0","-12","0","0","0"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","-15","-28","-18","-4"],["0","0","-28","-36","-12","0"],["0","0","-18","-12","0","0"],["0","0","-4","0","0","0"]]},"deriv_order":2,"shift":1},{"coeff":{"coeffs":[["25","24","6"],["24","12","0"],["6","0","0"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["0","75","72","18"],["0","72","36","0"],["0","18","0","0"]]},"deriv_order":1,"shift":2},{"coeff":{"coeffs":[["0","0","25","24","6"],["0","0","24","12","0"],["0","0","6","0","0"]]},"deriv_order":2,"shift":2},{"coeff":{"coeffs":[["-10","-4"],["-4","0"]]},"deriv_order":0,"shift":3},{"coeff":{"coeffs":[["0","-30","-12"],["0","-12","0"]]},"deriv_order":1,"shift":3},{"coeff":{"coeffs":[["0","0","-10","-4"],["0","0","-4","0"]]},"deriv_order":2,"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"],["2","4"],["5","20","9"],["17","92","81","16"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-81","108","-54","12","-1"],["108","-108","36","-4","0"],["-54","36","-6","0","0"],["12","-4","0","0","0"],["-1","0","0","0","0"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["-65","76","-30","4"],["76","-60","12","0"],["-30","12","0","0"],["4","0","0","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-25","24","-6"],["24","-12","0"],["-6","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-6","4"],["4","0"]]},"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":[["1"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","2","-1"],["2","-2","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1","2"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["1","-4","1"],["2","-4","0"],["1","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","3","2","-1"],["0","6","2","0"],["0","3","0","0"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","1","2","1"],["0","0","2","2","0"],["0","0","1","0","0"]]},"deriv_order":2}],"shift":0},{"differentiations":[{"coeff":{"coeffs":[["-3","4"],["-2","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","-9","-2"],["0","-6","0"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","-3","-2"],["0","0","-2","0"]]},"deriv_order":2}],"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":[["1","2","1"],["2","2","0"],["1","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-3","-2"],["-2","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"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","2","-1"],["2","-2","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1","2"],["2","0"]]},"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":{"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":[],"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":"not applicable: c_2(n, x) is not of the form gamma(n) w(x)","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) = (2 n - 1) + (2) x, V_n(x) = 0, W_n(x) = (-n^2 + 2 n - 1) + (-2 n + 2) x + (-1) x^2; open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = -n^2 + 2 n - 1 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 = 1 (not a disproof): fails at n = 2: [x^1] W_n = -2 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 = 1 (not a disproof): fails at n = 2: [x^1] W_n = -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)","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) = (2 n - 1) + (2) x, B_n(x) = (-n^2 + 2 n - 1) + (-2 n + 2) x + (-1) x^2: every P_n, n >= 0, is nonzero and real-rooted; 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; the theorem certifies no root region, so the roots are not contained in (-inf, 0], so the rows are real-rooted but this route does not give coefficients of one sign","route":"liu_wang_three_term","success":false,"variant":"liu_wang_three_term"},{"detail":"no lean_proved catalog entry equals the parent; 25 with the same first index and seeds differ in the rule or in later initial rows (oeis_catalog:A029653:lean_proved, oeis_catalog:A060920:lean_proved, oeis_catalog:A084950:lean_proved, oeis_catalog:A093375:lean_proved, oeis_catalog:A104029:lean_proved, oeis_catalog:A106246:lean_proved, oeis_catalog:A113214:lean_proved, oeis_catalog:A113413:lean_proved, oeis_catalog:A117317:lean_proved, oeis_catalog:A119308:lean_proved, oeis_catalog:A119808:lean_proved, oeis_catalog:A121574:lean_proved, oeis_catalog:A126216:lean_proved, oeis_catalog:A133087:lean_proved, oeis_catalog:A134082:lean_proved, oeis_catalog:A154929:lean_proved, oeis_catalog:A156319:lean_proved, oeis_catalog:A167194:lean_proved, oeis_catalog:A193727:lean_proved, oeis_catalog:A193728:lean_proved, oeis_catalog:A193730:lean_proved, oeis_catalog:A193735:lean_proved, oeis_catalog:A202241:lean_proved, oeis_catalog:A318397:lean_proved, oeis_catalog:A394813:lean_proved)","route":"attestation","success":false,"variant":"oeis_catalog"}],"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 + (2) theta + (1) theta^2 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"}