{"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":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["4","2"],["-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"theta_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-8","-36","36","-2"],["-16","-88","78","-4"],["-2","-100","51","-2"],["14","-54","11","0"],["10","-10","0","0"],["2","0","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-88","36","132","-10"],["0","-240","40","290","-20"],["0","-214","-112","197","-10"],["0","-54","-138","45","0"],["0","14","-34","0","0"],["0","6","0","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-88","144","66","-7"],["0","0","-256","292","148","-14"],["0","0","-262","135","106","-7"],["0","0","-106","-24","26","0"],["0","0","-10","-15","0","0"],["0","0","2","0","0","0"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","-16","36","6","-1"],["0","0","0","-48","76","14","-2"],["0","0","0","-52","47","11","-1"],["0","0","0","-24","6","3","0"],["0","0","0","-4","-1","0","0"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["0","0","0"],["4","2","0"],["12","-9","0"],["13","-12","1"],["6","-3","0"],["1","0","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","0","0","0"],["0","12","6","0"],["0","36","-27","0"],["0","39","-36","3"],["0","18","-9","0"],["0","3","0","0"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","4","2","0"],["0","0","12","-9","0"],["0","0","13","-12","1"],["0","0","6","-3","0"],["0","0","1","0","0"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","-2","-1"],["0","-4","3"],["-1","9","-3"],["-1","0","1"],["1","-3","0"],["1","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","4","2","0"],["0","10","-9","0"],["4","-2","-18","2"],["6","14","-11","0"],["0","10","0","0"],["-2","0","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","-4","-1","0"],["0","4","-23","-2","1"],["0","8","-10","-3","0"],["0","4","1","0","0"]]},"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":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["4","2"],["-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","1"]]},"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"],["0","0","0","0","64","64","20","2","0"],["0","0","0","0","192","-48","-60","-9","0"],["0","0","0","0","208","-88","-67","-4","1"],["0","0","0","0","96","0","-18","-3","0"],["0","0","0","0","16","8","1","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","192","192","60","6","0"],["0","0","0","0","0","576","-144","-180","-27","0"],["0","0","0","0","0","624","-264","-201","-12","3"],["0","0","0","0","0","288","0","-54","-9","0"],["0","0","0","0","0","48","24","3","0","0"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","64","64","20","2","0"],["0","0","0","0","0","0","192","-48","-60","-9","0"],["0","0","0","0","0","0","208","-88","-67","-4","1"],["0","0","0","0","0","0","96","0","-18","-3","0"],["0","0","0","0","0","0","16","8","1","0","0"]]},"deriv_order":2}],"shift":0}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["0","2"],["-1","-2"],["1","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","6","4"],["0","-4","-1"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","4","1"]]},"deriv_order":2}],"kind":"single","quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","224","112","14","0"],["0","0","0","0","0","256","112","8","-1"],["0","0","0","0","0","64","32","4","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","192","80","4","-1"],["0","0","0","0","0","0","208","72","-3","-2"],["0","0","0","0","0","0","48","24","3","0"]]},"deriv_order":1}],"row_multiplier":["0","0","0","0","16","8","1"],"start_base":1,"step_multiplier":{"coeffs":[["0","0","0","0","16","8","1"]]},"step_quotient":[{"coeff":{"coeffs":[["0","0","0","0","-32","16","14","2"],["0","0","0","0","-32","-16","-2","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","64","48","12","1"]]},"deriv_order":1}]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-2","-2"],["2","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-4","-1"]]},"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 + (2) theta + (1) theta^2; 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, 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 [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 + (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":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["4","2"],["-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","1"]]},"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 + (2) theta + (1) theta^2, for every n >= 1"},"parent_proof":{"route":"ma_wang_interval","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":"HypothesisFailed: P_n = a_n(x) P_(n-1) + b_n(x) P'_(n-1) for n >= 2, with a_n(x) = ((-2 n + 4)/(n - 1)) + ((2)/(n - 1)) x and b_n(x) = ((0)/(n - 1)) + ((4)/(n - 1)) x + ((1)/(n - 1)) x^2; open hypotheses: 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 = 2 (not a disproof): fails at n = 2: [x^2] b_n = 1 there (exact); constant_term_positive: fails at n = 2: a_n(0) = (-2 n + 4)/(n - 1) = 0 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":"P_n = (alpha_n x + beta_n) P_(n-1) + kappa_n (x - L)(x - U) P'_(n-1) for n >= 2, with L = -4, U = 0, alpha_n = (2)/(n - 1), beta_n = (-2 n + 4)/(n - 1), kappa_n = (1)/(n - 1): every P_n, n >= 1, is nonzero and real-rooted with every root in (-4, 0]; deg P_n = deg P_(n-1) + 1 and P_(n-1) interlaces P_n (Ma--Wang) for n >= 2","route":"ma_wang_interval","success":true,"variant":"ma_wang_interval"}],"conditional_on":[],"interlacing":{"from_index":2,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = (alpha_n x + beta_n) P_(n-1) + kappa_n (x - L)(x - U) P'_(n-1) for n >= 2, with L = -4, U = 0, alpha_n = (2)/(n - 1), beta_n = (-2 n + 4)/(n - 1), kappa_n = (1)/(n - 1)","every P_n, n >= 1, is nonzero and real-rooted with every root in (-4, 0]; deg P_n = deg P_(n-1) + 1 and P_(n-1) interlaces P_n (Ma--Wang) for n >= 2"],"theorem":"ma_wang_interval: S.-M. Ma and Y. Wang, q-Eulerian polynomials and polynomials with only real zeros, Electron. J. Combin. 15 (2008) R17, Theorem 2 and Corollary 3 (arXiv:math/0611826), in the closed two-endpoint form of the RealRooted library (https://github.com/PerAlexandersson/RealRooted, RealRooted.affineEndpointStep_closed), after the change of variable x = U + (U - L) y, with the endpoint multiplicities tracked exactly through the induction"},"kind":"weak","orientation":"previous_interlaces_next"},"route":"ma_wang_interval","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 + (2) theta + (1) theta^2 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"}