{"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":[["0"],["-2"],["-2"],["4"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["-2","4"],["-2","-11"],["4","7"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-12","6"],["0","18","-14"],["0","12","2"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-8","2"],["0","0","20","-5"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"reversal of Triangle read by rows: T(n,k) = binomial(n+1,k+1)*binomial(2*n-k+1,k)/(n+1), 0<=k<=n."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0","0"],["-12","-12","0"],["-20","-40","-3"],["-8","-34","-14"],["0","-16","-30"],["0","-14","-26"],["0","-4","-7"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-72","36","0"],["0","-180","36","12"],["0","-68","-116","41"],["0","-8","-182","46"],["0","0","-124","-18"],["0","0","-38","-30"],["0","0","-4","-7"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-108","36","0"],["0","0","-204","18","15"],["0","0","-24","-170","55"],["0","0","0","-254","75"],["0","0","0","-114","21"],["0","0","0","-12","-2"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","-24","6","0"],["0","0","0","-40","-2","3"],["0","0","0","0","-44","11"],["0","0","0","0","-60","15"],["0","0","0","0","-20","5"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["0","0"],["12","0"],["20","0"],["8","6"],["0","16"],["0","14"],["0","4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","0","0"],["0","12","0"],["0","20","0"],["0","8","6"],["0","0","16"],["0","0","14"],["0","0","4"]]},"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"],["-4","0"],["-4","-2"],["8","2"],["0","6"],["0","-10"],["0","4"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["-4","16","4"],["-4","-46","-14"],["8","30","14"],["0","6","5"],["0","-10","-16"],["0","4","7"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-24","12","6"],["0","36","-34","-18"],["0","24","20","12"],["0","0","-22","14"],["0","0","-6","-16"],["0","0","12","2"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-16","-4","2"],["0","0","40","14","-6"],["0","0","0","-16","4"],["0","0","0","-20","5"],["0","0","0","20","-5"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","6","10","4"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-2"],["-2"],["4"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["-2","4"],["-2","-11"],["4","7"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-12","6"],["0","18","-14"],["0","12","2"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-8","2"],["0","0","20","-5"]]},"deriv_order":2,"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","-48","12","0"],["0","0","-80","20","0"],["0","0","-32","-16","6"],["0","0","0","-64","16"],["0","0","0","-56","14"],["0","0","0","-16","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","-48","12","0"],["0","0","0","-80","20","0"],["0","0","0","-32","-16","6"],["0","0","0","0","-64","16"],["0","0","0","0","-56","14"],["0","0","0","0","-16","4"]]},"deriv_order":1}],"shift":0}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["0"],["-1"],["0"],["1"]]},"deriv_order":0},{"coeff":{"coeffs":[["-6","4"],["0","-3"],["0","-1"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","-14","5"],["0","0","-1"]]},"deriv_order":2},{"coeff":{"coeffs":[["0","0","-4","1"]]},"deriv_order":3}],"kind":"single","quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","0","0","0"],["0","0","0","0","-72","18"],["0","0","0","0","-312","78"],["0","0","0","0","-536","134"],["0","0","0","0","-408","102"],["0","0","0","0","-112","28"]]},"deriv_order":0}],"row_multiplier":["0","0","-4","1"],"start_base":1,"step_multiplier":{"coeffs":[["0","0","0","0","0","0","-64","48","-12","1"]]},"step_quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","-1152","864","-216","18","0"],["0","0","0","0","0","0","-3072","1728","-144","-60","9"],["0","0","0","0","0","0","-1408","-480","888","-266","24"],["0","0","0","0","0","0","-256","-256","288","-80","7"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","-2688","2784","-1080","186","-12"],["0","0","0","0","0","0","0","-5248","5216","-1944","322","-20"],["0","0","0","0","0","0","0","-768","448","-48","-12","2"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","-768","768","-288","48","-3"],["0","0","0","0","0","0","0","0","-1280","1280","-480","80","-5"]]},"deriv_order":2}]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0"],["-6","-3"],["-10","-10"],["-4","-7"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-18","6"],["0","-42","10"],["0","-12","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-12","3"],["0","0","-20","5"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0"],["6"],["10"],["4"]]},"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":[["0"],["-2"],["-2"],["4"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["-2","4"],["-2","-11"],["4","7"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-12","6"],["0","18","-14"],["0","12","2"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-8","2"],["0","0","20","-5"]]},"deriv_order":2,"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":{"route":"hypergeometric_row","statement":"every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign","status":"proved"},"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":"proved"},"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: 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 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)","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) = n - 2 (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 = -2 n - 2 n^2 + 4 n^3 - 24 x + 110 n x - 116 n^2 x + 36 n^3 x, B = 6 x - 20 n x + 8 n^2 x - 36 x^2 + 118 n x^2 - 52 n^2 x^2, C = 2 x^2 - 5 n x^2 - 8 x^3 + 20 n x^3) / (4 n^3 - 2 n^2 - 2 n); open hypotheses: weyl_step_discriminant_nonnegative: at n = 2: B^2 - 4 A C = -1536989218775/67108864 < 0 at x = -515/256: T is not a real-rootedness preserver on the whole line (Borcea--Branden 2010, Theorem 1.3, necessary condition); weyl_step_leading_coefficients_same_sign: fails at n = 2: A_1 B_lead = -1872 n^5 + 10280 n^4 - 20704 n^3 + 18404 n^2 - 6792 n + 864 = -160 there (exact); weyl_step_interlacing: fails at n = 2: B_2 (B_2 A_0^2 - B_1 A_0 A_1 + B_0 A_1^2) = 103168 n^10 - 748288 n^9 + 2185856 n^8 - 3267264 n^7 + 2524912 n^6 - 686528 n^5 - 367648 n^4 + 345936 n^3 - 100512 n^2 + 10368 n = 19200 there (exact); weyl_step_leading_coefficients_one_signed: fails at n = 2: A_a B_(a+1) = -1872 n^5 + 10280 n^4 - 20704 n^3 + 18404 n^2 - 6792 n + 864 = -160 there (exact)","route":"iterated_preserver","success":false,"variant":"iterated_preserver"},{"detail":"row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, n >= 1, with p = (-4) (k) (k) (k + 1/2), q = (1) (k - n - 1) (k - n) (k + n); valuation v(n) = 0, degree d(n) = n - 1: every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, 0): for n >= 1 the coefficients U_j (U_j = [x^(j + v(n))] P_n, v(n) = 0) satisfy U_j = U_0(n) prod_(t <= j) R(n, t), R(n, j) = (1/4) (j - n - 1) (j - n) (j + n) / ((j) (j) (j + 1/2)), so sum_j U_j y^j is U_0(n) times the image of (1 + y)^(n - 1) under a nonnegative multiplier sequence, and U_0(n) != 0 for n >= 1 by its scalar recurrence","route":"hypergeometric_row","success":true,"variant":"hypergeometric_row"}],"conditional_on":[],"route":"hypergeometric_row","rows_checked":10,"statement":"every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign","status":"proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"proved: Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (1) theta for every n >= 1, the side conditions hold for every n, and every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 1, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}