{"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"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","-8","-8"],["1","4","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","6"],["-6","-4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013609 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["16","32","0","-32","-16","0"],["-28","47","233","220","60","0"],["0","-168","-172","132","168","32"],["0","0","-300","-416","-100","8"],["0","0","0","-184","-224","-48"],["0","0","0","0","-28","-24"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["8","72","88","-88","-192","-80","0"],["0","12","565","1347","1076","276","0"],["0","0","-264","460","1708","1208","224"],["0","0","0","-708","-576","372","216"],["0","0","0","0","-520","-576","-80"],["0","0","0","0","0","-84","-72"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","10","46","22","-110","-152","-56","0"],["0","0","92","577","1043","740","180","0"],["0","0","0","132","1048","1772","1048","192"],["0","0","0","0","-60","424","740","248"],["0","0","0","0","0","-144","-104","32"],["0","0","0","0","0","0","-28","-24"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","2","6","-2","-22","-24","-8","0"],["0","0","0","24","106","162","104","24","0"],["0","0","0","0","60","244","328","176","32"],["0","0","0","0","0","48","168","168","48"],["0","0","0","0","0","0","8","24","16"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["0","0","0","0","0"],["4","-1","1","0","0"],["0","20","-8","-4","0"],["0","0","36","-4","0"],["0","0","0","24","0"],["0","0","0","0","4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","12","-3","3","0","0"],["0","0","60","-24","-12","0"],["0","0","0","108","-12","0"],["0","0","0","0","72","0"],["0","0","0","0","0","12"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","4","-1","1","0","0"],["0","0","0","20","-8","-4","0"],["0","0","0","0","36","-4","0"],["0","0","0","0","0","24","0"],["0","0","0","0","0","0","4"]]},"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":[["-4","21","-45","24","-4"],["4","-41","125","-100","20"],["0","20","-116","152","-40"],["0","0","36","-100","40"],["0","0","0","24","-20"],["0","0","0","0","4"]]},"terms":[{"coeff":{"coeffs":[["-44","183","105","-112","4","0"],["28","-383","323","556","-180","-32"],["0","168","-728","-276","596","40"],["0","0","300","-320","-516","40"],["0","0","0","184","84","-72"],["0","0","0","0","28","24"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","18","48","-12","-40","0","0"],["0","-24","14","182","80","-80","-16"],["0","0","-60","-100","128","184","16"],["0","0","0","-48","-136","-72","16"],["0","0","0","0","-8","-24","-16"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","0","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"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","-8","-8"],["1","4","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","6"],["-6","-4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":1,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["4","4"],["-7","-6"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["2","6","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["4","23","47","41","17","8","4","0","0"],["0","20","112","208","112","-68","-80","-16","0"],["0","0","36","212","444","380","96","-16","0"],["0","0","0","24","144","312","288","96","0"],["0","0","0","0","4","24","52","48","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0"],["0","12","69","141","123","51","24","12","0","0"],["0","0","60","336","624","336","-204","-240","-48","0"],["0","0","0","108","636","1332","1140","288","-48","0"],["0","0","0","0","72","432","936","864","288","0"],["0","0","0","0","0","12","72","156","144","48"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0","0"],["0","0","4","23","47","41","17","8","4","0","0"],["0","0","0","20","112","208","112","-68","-80","-16","0"],["0","0","0","0","36","212","444","380","96","-16","0"],["0","0","0","0","0","24","144","312","288","96","0"],["0","0","0","0","0","0","4","24","52","48","16"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","0","0"],["0","0","0"],["1","3","2"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0"],["0","0","0","0"],["1","5","8","4"],["1","5","8","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0"],["-2","-12","-26","-24","-8"],["-2","-12","-26","-24","-8"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0","0","0"],["4","24","52","48","16"],["4","24","52","48","16"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["2"],["-4"],["2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["5","6"],["-4","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1","3","2"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0"],["0","-14","-78","-170","-242","-344","-368","-192","-32","0"],["0","0","-24","2","610","1886","2254","1136","184","0"],["0","0","0","-8","120","920","2184","2192","864","64"],["0","0","0","0","0","36","216","468","432","144"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0","0"],["0","0","-6","-34","-74","-98","-128","-140","-80","-16","0"],["0","0","0","-16","-46","112","578","796","440","80","0"],["0","0","0","0","-12","0","292","888","1024","480","64"],["0","0","0","0","0","0","24","144","312","288","96"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","0"],["0","0","0","0","0"],["1","6","13","12","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","0"],["0","0","0","0","0"],["0","0","0","0","0"],["-2","-12","-26","-24","-8"],["-2","-12","-26","-24","-8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","0","0","0"],["-1","-8","-25","-38","-28","-8"],["3","20","51","62","36","8"],["4","28","76","100","64","16"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["-1","-9","-33","-63","-66","-36","-8"],["-1","-9","-33","-63","-66","-36","-8"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","0","0","0"],["2","16","50","76","56","16"],["-5","-32","-77","-86","-44","-8"],["-7","-48","-127","-162","-100","-24"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["2","18","66","126","132","72","16"],["2","18","66","126","132","72","16"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1","6","13","12","4"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","0"],["-1","-4","-4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["3","2"],["6","4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["-1"],["-1"]]},"deriv_order":0,"shift":2}]},"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"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","-8","-8"],["1","4","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","6"],["-6","-4"]]},"deriv_order":0,"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":"liu_wang_three_term","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":"Unresolved: P_n = (a_n + b_n (x + 1/2)) P_(n-1) - c_n (x + 1/2)^2 P_(n-2) for n >= 3, with a_n = (4 n - 6)/(n - 1), b_n = (4 n - 6)/(n - 1), c_n = (4 n - 8)/(n - 1); Q_n(y) = y^(d_n) P_n(1/y - 1/2), d_n = deg P_1 + n - 1, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2); open hypotheses: root_region: the region contains the pole x = -1/2 of the coordinate change y = 1/(x + 1/2)","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":"HypothesisFailed: P_n = A_n(x) P_(n-1) + V_n(x) P'_(n-1) + W_n(x) P_(n-2) for n >= 3, with A_n(x) = ((6 n - 9)/(n - 1)) + ((4 n - 6)/(n - 1)) x, V_n(x) = 0, W_n(x) = ((-n + 2)/(n - 1)) + ((-4 n + 8)/(n - 1)) x + ((-4 n + 8)/(n - 1)) x^2; open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = n - 2 is not the zero polynomial; lag_coefficient_nonpositive: W_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] W_n <= 0 fails for k = 1 (not a disproof): fails at n = 3: [x^1] W_n = -2 there (exact); derivative_or_lag_coefficient_negative: W_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] W_n <= 0 fails for k = 1 (not a disproof): fails at n = 3: [x^1] W_n = -2 there (exact)","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":"P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 3, with A_n(x) = ((6 n - 9)/(n - 1)) + ((4 n - 6)/(n - 1)) x, B_n(x) = ((-n + 2)/(n - 1)) + ((-4 n + 8)/(n - 1)) x + ((-4 n + 8)/(n - 1)) x^2: every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, 0) (so its coefficients have one sign); for n >= 2, P_(n-1) interlaces P_n (weakly, in the sense of Liu and Wang), and deg P_n - deg P_(n-1) is 0 or 1 for n >= 3","route":"liu_wang_three_term","success":true,"variant":"liu_wang_three_term"}],"conditional_on":[],"interlacing":{"from_index":2,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 3, with A_n(x) = ((6 n - 9)/(n - 1)) + ((4 n - 6)/(n - 1)) x, B_n(x) = ((-n + 2)/(n - 1)) + ((-4 n + 8)/(n - 1)) x + ((-4 n + 8)/(n - 1)) x^2","every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, 0) (so its coefficients have one sign); for n >= 2, P_(n-1) interlaces P_n (weakly, in the sense of Liu and Wang), and deg P_n - deg P_(n-1) is 0 or 1 for n >= 3"],"theorem":"liu_wang_three_term: L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction; Proposition 3.3 (the case B_n(x) = -(c_n x + d_n)^2)"},"kind":"weak","orientation":"previous_interlaces_next"},"route":"liu_wang_three_term","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"}