{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"mobius"},"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","2"],["2","1"],["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-1"],["0","-2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"shift_x_plus_one of Triangle read by rows: T(n, k) = [z^k] P(n, z) where P(n, z) = Sum_{k=0..n} binomial(n, k) * Pochhammer(n - k + c, k) * z^k / k! and c = 4."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-6","12","0","-12","6"],["-10","23","-9","-11","7"],["-4","9","-3","-5","3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","3","-6","0","6","-3"],["0","2","-4","0","4","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","0","0"],["3","-9","9","-3"],["1","-3","3","-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":[["-2","-4","-2"],["1","2","1"],["1","2","1"]]},"terms":[{"coeff":{"coeffs":[["0","0","-4","-8","-4"],["2","4","-4","-12","-6"],["4","17","26","17","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-5","-9","-7","-2"],["0","-2","-10","-18","-14","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","3","1"],"operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"mobius"},"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","2"],["2","1"],["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-1"],["0","-2","-2"]]},"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"],["3","-9","9","-3"],["1","-3","3","-1"]]},"deriv_order":0}],"shift":0}],"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-6","-6"],["-10","-7"],["-4","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","3","3"],["0","2","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["3"],["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 = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), 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.splits_fPolynomial"],"lean_route":"fTransform","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":"((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 1)","kind":"preserver_image","operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"mobius"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","2"],["2","1"],["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-1"],["0","-2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 1), for every n >= 1"},"parent_proof":{"route":"iterated_preserver","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 [-1, 0]","input_root_region":{"lower":{"closed":true,"value":"-1"},"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":"not applicable: the theorem needs at least two seed rows","route":"three_term_recurrence","success":false,"variant":"three_term_recurrence"},{"detail":"Unresolved: P_n = a_n(x) P_(n-1) + b_n(x) P'_(n-1) for n >= 2, with a_n(x) = ((4 n^2 + 2 n)/(n^2 + n - 2)) + ((3 n^2 + n + 2)/(n^2 + n - 2)) x and b_n(x) = ((0)/(n^2 + n - 2)) + ((-2 n - 1)/(n^2 + n - 2)) x + ((-2 n - 1)/(n^2 + n - 2)) 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 = 1 (not a disproof): fails at n = 2: [x^1] b_n = -5/4 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":"HypothesisFailed: P_n = (alpha_n x + beta_n) P_(n-1) + kappa_n (x - L)(x - U) P'_(n-1) for n >= 2, with L = -1, U = 0, alpha_n = (3 n^2 + n + 2)/(n^2 + n - 2), beta_n = (4 n^2 + 2 n)/(n^2 + n - 2), kappa_n = (-2 n - 1)/(n^2 + n - 2); open hypotheses: slope_positive: fails at n = 2: a_n = (-3/2 n^2 - 1/2 n - 1)/(n + 1/2) = -16/5 there (exact); upper_endpoint_threshold: no hit before n = 2; E(2) = e(2) + 0 = -4 < 0 with no hit in between (exact); when a_n > 0 for every n <= 2, the criterion puts a root of P_2 outside the interval","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":"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 = 4 + 4 n + n^2 + 2 x + 5 n x + 2 n^2 x, B = x + 2 n x + x^2 + 2 n x^2, C = 0) / (n^2 + n - 2): every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, 0]; deg Q_n = deg Q_(n-1) + 1 for n >= 2 (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)))","route":"iterated_preserver","success":true,"variant":"iterated_preserver"}],"conditional_on":[],"route":"iterated_preserver","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 = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), 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 [-1, 0]"},"kind":"preserver_image"}