{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1","-7","-10"],["1","4","5"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-6","-5"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"reversal of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","6","30","54","30","0"],["-1","-3","7","43","65","25"],["-1","-11","-39","-66","-45","0"],["0","-2","-14","-39","-50","-25"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","2","26","94","130","60","0"],["0","1","23","125","267","245","75"],["0","-1","-7","-3","36","75","50"],["0","0","-2","-14","-39","-50","-25"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","1","10","32","38","15","0"],["0","0","1","13","59","112","90","25"],["0","0","0","2","18","51","60","25"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","0"],["1","1","0","0"],["1","3","-2","-5"],["0","2","6","5"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","0","0","0","0"],["0","1","1","0","0"],["0","1","3","-2","-5"],["0","0","2","6","5"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","-8","-10"],["-1","1","22","25"],["1","-3","-20","-20"],["0","2","6","5"]]},"terms":[{"coeff":{"coeffs":[["0","0","2","16","30","0"],["-1","-13","-43","-58","-5","50"],["1","5","-3","-51","-105","-75"],["0","2","14","39","50","25"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","1","9","23","15","0"],["0","-1","-9","-23","-10","30","25"],["0","0","-2","-18","-51","-60","-25"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1","-7","-10"],["1","4","5"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-6","-5"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_valid_from_base":1,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","1/5","8/5","18/5","16/5","1","0","0"],["0","1/5","2","6","19/5","-42/5","-13","-5"],["0","0","2/5","4","69/5","111/5","17","5"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","1/5","8/5","18/5","16/5","1","0","0"],["0","0","1/5","2","6","19/5","-42/5","-13","-5"],["0","0","0","2/5","4","69/5","111/5","17","5"]]},"deriv_order":1}],"shift":0}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["3/5","13/5","2"],["-1","-19/5","-3"],["2/5","6/5","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["1/5","16/5","7","4"],["-1/5","-8/5","-17/5","-2"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","1/5","7/5","11/5","1"]]},"deriv_order":2}],"kind":"single","quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","0","0","3","21","33","15","0"],["0","0","0","4","38","114","130","50"]]},"deriv_order":0}],"row_multiplier":["0","1/5","7/5","11/5","1"],"start_base":1,"step_multiplier":{"coeffs":[["0","0","1/25","14/25","71/25","164/25","191/25","22/5","1"]]},"step_quotient":[{"coeff":{"coeffs":[["0","0","0","-7/25","-103/25","-567/25","-1503/25","-2157/25","-69","-29","-5"],["0","0","1/25","18/25","132/25","518/25","1202/25","1694/25","284/5","26","5"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-1/25","-4/5","-32/5","-132/5","-306/5","-2076/25","-328/5","-28","-5"]]},"deriv_order":1}]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","3","5"],["-1","-4","-5"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","1","6","5"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["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 1) 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 >= 1 (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 >= 1"},"method":"operator_division"},"status":"certified"},"input_first_index":1,"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 [1, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 1 + 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":"1","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":1,"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":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1","-7","-10"],["1","4","5"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-6","-5"]]},"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 >= 1"},"parent_proof":{"statement":"open: no route proved that every parent row P_n, n >= 1, 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 >= 1, 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 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: Q_n = x^(d_n) P_n(1/x) at the nominal degree d_n, with d_(n-L) = 2 n - 4 (an upper bound of deg P_(n-L)): Q_n = a_n(x) S_n(Q_(n-1)) for n >= 2, with a_n(x) = (1) ((1)) and S_n = (A + B D + C D^2 with A = 10 - 5 n + 17 x - 8 n x + 3 x^2 - n x^2, B = 5 x + 6 x^2 + x^3, C = 0) / (n - 1); open hypotheses: weyl_step_interlacing: at n = 2: A does not strictly interlace B (exact Bezout test); weyl_step_leading_coefficients_one_signed: fails at n = 4: A_a B_(a+1) = -n + 3 = -1 there (exact)","route":"iterated_preserver","success":false,"variant":"iterated_preserver"},{"detail":"no lean_proved catalog entry equals the parent; 68 with the same first index and seeds differ in the rule or in later initial rows (oeis_catalog:A003506:lean_proved, oeis_catalog:A008277:lean_proved, oeis_catalog:A008278:lean_proved, oeis_catalog:A008288:lean_proved, oeis_catalog:A008292:lean_proved, oeis_catalog:A019538:lean_proved, oeis_catalog:A026729:lean_proved, oeis_catalog:A035607:lean_proved, oeis_catalog:A039755:lean_proved, oeis_catalog:A046716:lean_proved, oeis_catalog:A048854:lean_proved, oeis_catalog:A052553:lean_proved, oeis_catalog:A056242:lean_proved, oeis_catalog:A059110:lean_proved, oeis_catalog:A060187:lean_proved, oeis_catalog:A062145:lean_proved, oeis_catalog:A063007:lean_proved, oeis_catalog:A063967:lean_proved, oeis_catalog:A071951:lean_proved, oeis_catalog:A078812:lean_proved, oeis_catalog:A085478:lean_proved, oeis_catalog:A086645:lean_proved, oeis_catalog:A089627:lean_proved, oeis_catalog:A091042:lean_proved, oeis_catalog:A098158:lean_proved, oeis_catalog:A098172:lean_proved, oeis_catalog:A099097:lean_proved, oeis_catalog:A104684:lean_proved, oeis_catalog:A105278:lean_proved, oeis_catalog:A106800:lean_proved, oeis_catalog:A111125:lean_proved, oeis_catalog:A114656:lean_proved, oeis_catalog:A122542:lean_proved, oeis_catalog:A123160:lean_proved, oeis_catalog:A127648:lean_proved, oeis_catalog:A131689:lean_proved, oeis_catalog:A134991:lean_proved, oeis_catalog:A142075:lean_proved, oeis_catalog:A142459:lean_proved, oeis_catalog:A143395:lean_proved, oeis_catalog:A154602:lean_proved, oeis_catalog:A156289:lean_proved, oeis_catalog:A158909:lean_proved, oeis_catalog:A166973:lean_proved, oeis_catalog:A173018:lean_proved, oeis_catalog:A201637:lean_proved, oeis_catalog:A201730:lean_proved, oeis_catalog:A219836:lean_proved, oeis_catalog:A225117:lean_proved, oeis_catalog:A225466:lean_proved, oeis_catalog:A225467:lean_proved, oeis_catalog:A225468:lean_proved, oeis_catalog:A225469:lean_proved, oeis_catalog:A225472:lean_proved, oeis_catalog:A225473:lean_proved, oeis_catalog:A235706:lean_proved, oeis_catalog:A253283:lean_proved, oeis_catalog:A259454:lean_proved, oeis_catalog:A269939:lean_proved, oeis_catalog:A269945:lean_proved, oeis_catalog:A271697:lean_proved, oeis_catalog:A271703:lean_proved, oeis_catalog:A271705:lean_proved, oeis_catalog:A286724:lean_proved, oeis_catalog:A292219:lean_proved, oeis_catalog:A321331:lean_proved, oeis_catalog:A334218:lean_proved, oeis_catalog:A390433: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 >= 1, 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 >= 1 is certified; the lift is Open (open: no route proved that every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only))"},"kind":"preserver_image"}