{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"intercept":"0","shape":"affine","slope":"1"},"parent":{"first_index":1,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"denominator":{"coeffs":[["5"],["-7"],["2"]]},"terms":[{"coeff":{"coeffs":[["-9"],["9"],["-2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["46","30"],["-48","-32"],["12","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"existing definition"},"identifying_rows":3,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["2","2"],["-7","-4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["9","6"],["7","4"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["-2"],["-1"]]},"deriv_order":0,"shift":3}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1,2,3],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"],["1","1"],["5","8","3"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["4"],["-1"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-23","-14"],["7","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["12","6"],["-7","-4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["-2","-3","7","12","4"],"operator":{"intercept":"0","shape":"affine","slope":"1"},"parent":{"first_index":1,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"denominator":{"coeffs":[["5"],["-7"],["2"]]},"terms":[{"coeff":{"coeffs":[["-9"],["9"],["-2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["46","30"],["-48","-32"],["12","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":1,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["-2"],["1"],["5"],["2"]]},"deriv_order":0}],"shift":0},{"differentiations":[{"coeff":{"coeffs":[["2"],["-1"],["-5"],["-2"]]},"deriv_order":0}],"shift":1}],"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-1"],["-1"],["2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["2","2"],["0","0"],["-12","-8"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["-1"],["1"],["2"]]},"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 = P((1) x + (0)); so the candidate rows satisfy the input rule at every base n >= 1 (the exceptional bases checked exactly), and agreement on the 3 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":["Polynomial.Splits.comp_of_degree_le_one"],"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":"no parent theorem report with an interlacing conclusion","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"P((1) x + (0))","kind":"preserver_image","operator":{"intercept":"0","shape":"affine","slope":"1"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"denominator":{"coeffs":[["5"],["-7"],["2"]]},"terms":[{"coeff":{"coeffs":[["-9"],["9"],["-2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["46","30"],["-48","-32"],["12","8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = P((1) x + (0)), 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":[],"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":"HypothesisFailed: P_n = (a_n x + b_n) P_(n-1) - c_n P_(n-2) for n >= 3, with a_n = (4 n^2 - 16 n + 15)/(n^2 - 7/2 n + 5/2), b_n = (6 n^2 - 24 n + 23)/(n^2 - 7/2 n + 5/2), c_n = (n^2 - 9/2 n + 9/2)/(n^2 - 7/2 n + 5/2); open hypotheses: first_coefficient_positive: beta_3 = 0 (exact); root_upper_bound: not attempted: the real-rootedness hypotheses do not all hold","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^2 - 24 n + 23)/(n^2 - 7/2 n + 5/2)) + ((4 n^2 - 16 n + 15)/(n^2 - 7/2 n + 5/2)) x, V_n(x) = 0, W_n(x) = ((-n^2 + 9/2 n - 9/2)/(n^2 - 7/2 n + 5/2)); open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = -2 n^2 + 9 n - 9 is not the zero polynomial; derivative_or_lag_coefficient_negative: W_n(x) = gamma(n) w(x) / f(n) with w(x) = -9, which is negative on (-inf, 0) (no root there, exact): fails at n = 3: gamma(n)/f(n) = (1/9 n^2 - 1/2 n + 1/2)/(n^2 - 7/2 n + 5/2) = 0 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^2 - 24 n + 23)/(n^2 - 7/2 n + 5/2)) + ((4 n^2 - 16 n + 15)/(n^2 - 7/2 n + 5/2)) x, B_n(x) = ((-n^2 + 9/2 n - 9/2)/(n^2 - 7/2 n + 5/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^2 - 24 n + 23)/(n^2 - 7/2 n + 5/2)) + ((4 n^2 - 16 n + 15)/(n^2 - 7/2 n + 5/2)) x, B_n(x) = ((-n^2 + 9/2 n - 9/2)/(n^2 - 7/2 n + 5/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"},"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 = P((1) x + (0)) 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":"definition_equality"}