{"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"],["1"],["1","1"],["1","15"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","2","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","12","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-1"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"veronese_section_2_0 of Triangle read by rows: T(n, k) = binomial(2n, 2k)."},"identifying_rows":6,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-191","381","-189","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["128","-575","765","-317","-1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","64","-192","192","-64"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["-3342","2252","66"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["256","-5870","4492","98"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","128","-1264","1120","16"]]},"deriv_order":2,"shift":1},{"coeff":{"coeffs":[["-9041","-146","3"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["-2304","-19409","-274","3"]]},"deriv_order":1,"shift":2},{"coeff":{"coeffs":[["0","-1152","-5184","-64"]]},"deriv_order":2,"shift":2},{"coeff":{"coeffs":[["-1860","-52"]]},"deriv_order":0,"shift":3},{"coeff":{"coeffs":[["4096","-2692","-116"]]},"deriv_order":1,"shift":3},{"coeff":{"coeffs":[["0","2048","-416","-32"]]},"deriv_order":2,"shift":3},{"coeff":{"coeffs":[["111","-3"]]},"deriv_order":0,"shift":4},{"coeff":{"coeffs":[["-2944","-145","-3"]]},"deriv_order":1,"shift":4},{"coeff":{"coeffs":[["0","-1472","-128"]]},"deriv_order":2,"shift":4},{"coeff":{"coeffs":[["-14"]]},"deriv_order":0,"shift":5},{"coeff":{"coeffs":[["768","18"]]},"deriv_order":1,"shift":5},{"coeff":{"coeffs":[["0","384","16"]]},"deriv_order":2,"shift":5},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":6},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"shift":6}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1,2,3,4,5,6],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"],["1"],["1","2"],["1","30"],["1","140","3"],["1","420","135"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["191","-381","189","1"]]},"deriv_order":0,"offset":6,"sign":"none"},{"coeff":{"coeffs":[["-64","192","-192","64"]]},"deriv_order":1,"offset":6,"sign":"none"},{"coeff":{"coeffs":[["3342","-2252","-66"]]},"deriv_order":0,"offset":5,"sign":"none"},{"coeff":{"coeffs":[["-128","1264","-1120","-16"]]},"deriv_order":1,"offset":5,"sign":"none"},{"coeff":{"coeffs":[["9041","146","-3"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["1152","5184","64"]]},"deriv_order":1,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["1860","52"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-2048","416","32"]]},"deriv_order":1,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-111","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1472","128"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["14"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-384","-16"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"],["1"],["1","1"],["1","15"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","2","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","12","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-1"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":4,"parent_valid_from_base":1,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["65","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["128","-63","-1"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","64","-64"]]},"deriv_order":2}],"shift":0},{"differentiations":[{"coeff":{"coeffs":[["-10"]]},"deriv_order":0},{"coeff":{"coeffs":[["768","22"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","384","16"]]},"deriv_order":2}],"shift":1},{"differentiations":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1}],"shift":2}],"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","-2","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-12"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["6","-2"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["-4"]]},"deriv_order":0,"shift":3},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":4}]},"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 6 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"],["1"],["1","1"],["1","15"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","2","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","12","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-1"]]},"deriv_order":0,"offset":4,"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":[],"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: coefficient of P_(n-1) must be 1 after normalization; 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: 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":"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":"not applicable: the rule is not f(n) P_n = c_0(n, x) P_(n-1) + c_1(n, x) P'_(n-1) + c_2(n, x) P_(n-2) with a derivative or a lag term","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":"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":"Unresolved: row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, n >= 1, with p = (-16) (k - 3/4) (k - 1/2) (k - 1/4) (k), q = (16) (k - 1/2 n - 1/2) (k - 1/2 n - 1/4) (k - 1/2 n) (k - 1/2 n + 1/4); valuation v(n) = 0; open hypotheses: row_relation: no invariant row-annihilator system of the rule containing H was found; multiplier_matching: no matching of the ratio factors (identity: R(n, j) = -q(n, j + v(n)) / p(n, j + v(n))) with a base binom(M, j), complements, pairs and reciprocal rising factorials holds for every n >= 1 + delay, delay <= 4","route":"hypergeometric_row","success":false,"variant":"hypergeometric_row"}],"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"}