{"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":[["2","3","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["-3","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["4","6","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"reversal of Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["128","712","1432","1354","608","104"],["96","672","1544","1599","770","140"],["0","108","411","541","300","60"],["0","0","27","54","36","8"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-128","-800","-1864","-2104","-1206","-328","-32"],["0","-96","-296","-228","83","154","44"],["0","0","36","207","329","204","44"],["0","0","0","27","54","36","8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-64","-464","-1288","-1768","-1280","-468","-68"],["0","0","-96","-484","-886","-758","-308","-48"],["0","0","0","-36","-102","-106","-48","-8"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["32","116","164","102","24"],["0","24","77","70","20"],["0","0","9","12","4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","32","116","164","102","24"],["0","0","24","77","70","20"],["0","0","0","9","12","4"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["2","6","3"]],"recurrence":{"denominator":{"coeffs":[["32","92","96","44","8"],["0","24","59","46","12"],["0","0","9","12","4"]]},"terms":[{"coeff":{"coeffs":[["-32","-148","-272","-242","-102","-16"],["-96","-456","-803","-679","-278","-44"],["0","-108","-330","-379","-192","-36"],["0","0","-27","-54","-36","-8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["64","368","840","984","628","208","28"],["0","96","412","682","546","212","32"],["0","0","36","102","106","48","8"]]},"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":[["2","3","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["-3","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["4","6","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["128","848","2464","4076","4180","2714","1088","246","24"],["0","96","596","1516","2065","1636","757","190","20"],["0","0","36","156","277","258","133","36","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","128","848","2464","4076","4180","2714","1088","246","24"],["0","0","96","596","1516","2065","1636","757","190","20"],["0","0","0","36","156","277","258","133","36","4"]]},"deriv_order":1}],"shift":0}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["7/2","5","2"],["25/4","17/2","3"],["9/4","3","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["-5","-23/2","-17/2","-2"],["-6","-13","-9","-2"]]},"deriv_order":1},{"coeff":{"coeffs":[["4","12","13","6","1"]]},"deriv_order":2}],"kind":"single","quotient":[{"coeff":{"coeffs":[["0","64","192","128","-144","-244","-120","-20"],["0","0","0","-32","-96","-104","-48","-8"]]},"deriv_order":0}],"row_multiplier":["4","12","13","6","1"],"start_base":0,"step_multiplier":{"coeffs":[["16","96","248","360","321","180","62","12","1"]]},"step_quotient":[{"coeff":{"coeffs":[["-160","-1072","-3152","-5336","-5730","-4047","-1880","-554","-94","-7"],["-48","-320","-936","-1576","-1683","-1182","-546","-160","-27","-2"]]},"deriv_order":0},{"coeff":{"coeffs":[["64","480","1600","3120","3940","3366","1970","780","200","30","2"]]},"deriv_order":1}]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["4","3"],["3","2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-6","-2"]]},"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 1 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":[["2","3","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["-3","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["4","6","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 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":"HypothesisFailed: P_n = a_n(x) P_(n-1) + b_n(x) P'_(n-1) for n >= 1, with a_n(x) = (-3 n - 1) + (-2 n - 1) x and b_n(x) = (4) + (6) x + (2) x^2; open hypotheses: derivative_coefficient_vanishes_at_zero: [x^0] c_1(n, x) = 4 is not the zero polynomial; 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 = 0 (not a disproof): fails at n = 1: [x^0] b_n = 4 there (exact); constant_term_positive: fails at n = 1: a_n(0) = -3 n - 1 = -4 there (exact)","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":"HypothesisFailed: P_n = (alpha_n x + beta_n) P_(n-1) + kappa_n (x - L)(x - U) P'_(n-1) for n >= 1, with L = -2, U = -1, alpha_n = -2 n - 1, beta_n = -3 n - 1, kappa_n = 2; open hypotheses: slope_positive: fails at n = 1: a_n = -n - 1/2 = -3/2 there (exact)","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 - 3 n - x - 2 n x, B = 4 + 6 x + 2 x^2, C = 0; open hypotheses: weyl_step_leading_coefficients_same_sign: fails at n = 1: A_1 B_lead = -4 n - 2 = -6 there (exact); weyl_step_leading_coefficients_one_signed: fails at n = 1: A_a B_(a+1) = -4 n - 2 = -6 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"}