{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"reversal"},"parent":{"first_index":1,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","-4","-2"],["1","2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","3"],["-6","-2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A007318 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":[["4","2"],["-7","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["4","6","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["1"]]},"deriv_order":0,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1","1","8"],["1","1","-4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","6","4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","1"],"operator":{"schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"reversal"},"parent":{"first_index":1,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","-4","-2"],["1","2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","3"],["-6","-2"]]},"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","2"],["-7","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["4","6","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0"],["1"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["0","0","0"],["0","0","0"],["2","3","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0"],["0","0","0","0"],["2","5","4","1"],["2","5","4","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0"],["-8","-24","-26","-12","-2"],["-8","-24","-26","-12","-2"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0","0","0"],["16","48","52","24","4"],["16","48","52","24","4"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["1"],["-2"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["5","3"],["-4","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2","3","1"]]},"deriv_order":2,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","0"],["0","0","0","0","0"],["4","12","13","6","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","0"],["0","0","0","0","0"],["0","0","0","0","0"],["-4","-12","-13","-6","-1"],["-4","-12","-13","-6","-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","0","0","0"],["-4","-16","-25","-19","-7","-1"],["12","40","51","31","9","1"],["16","56","76","50","16","2"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["-8","-36","-66","-63","-33","-9","-1"],["-8","-36","-66","-63","-33","-9","-1"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","0","0","0"],["8","32","50","38","14","2"],["-20","-64","-77","-43","-11","-1"],["-28","-96","-127","-81","-25","-3"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["16","72","132","126","66","18","2"],["16","72","132","126","66","18","2"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","0"],["-1","-2","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["3","1"],["6","2"]]},"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 = x^(d_n) P(1/x), d_n = 0 + 1 (n - 1); 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":"the schedule d_n depends on n","status":"none"},"lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"lean_route":"reversed","lift_summary":{"hypotheses":[{"evidence":"lambda(n) = 1","name":"gauge_finite_nonzero","statement":"lambda(n) is finite and nonzero for every n >= n0","status":{"kind":"verified"}}],"identity":{"method":"forward_division","status":"certified"},"input_first_index":1,"input_interlacing":{"reason":"the schedule d_n depends on n","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"x^(d_n) P(1/x), d_n = 0 + 1 (n - 1)","kind":"preserver_image","operator":{"schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"reversal"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","-4","-2"],["1","2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","3"],["-6","-2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = x^(d_n) P(1/x), d_n = 0 + 1 (n - 1), 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":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically"},"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)) P_(n-1) - c_n (x + 1)^2 P_(n-2) for n >= 3, with a_n = (4 n - 6)/(n - 1), b_n = (2 n - 3)/(n - 1), c_n = (n - 2)/(n - 1); Q_n(y) = y^(d_n) P_n(1/y - 1), 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 of the coordinate change y = 1/(x + 1)","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)) + ((2 n - 3)/(n - 1)) x, V_n(x) = 0, W_n(x) = ((-n + 2)/(n - 1)) + ((-2 n + 4)/(n - 1)) x + ((-n + 2)/(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 = -1 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 = -1 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)) + ((2 n - 3)/(n - 1)) x, B_n(x) = ((-n + 2)/(n - 1)) + ((-2 n + 4)/(n - 1)) x + ((-n + 2)/(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)) + ((2 n - 3)/(n - 1)) x, B_n(x) = ((-n + 2)/(n - 1)) + ((-2 n + 4)/(n - 1)) x + ((-n + 2)/(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 = x^(d_n) P(1/x), d_n = 0 + 1 (n - 1) 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"}