{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","2","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by Fibonacci(n)."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-6","-17","-17","-7","-1"],["-5","-12","-9","-2","0"],["-1","-2","-1","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","-17","-17","-7","-1"],["-5","-12","-9","-2","0"],["-1","-2","-1","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-3","-7","-5","-1"],["-4","-6","-2","0"],["-1","-1","0","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["-3","-7","-5","-1"],["-4","-6","-2","0"],["-1","-1","0","0"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["2","3","1"],["3","2","0"],["1","0","0"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["2","3","1"],["3","2","0"],["1","0","0"]]},"deriv_order":1,"shift":2}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"denominator":{"coeffs":[["0","-1","1"],["-1","2","0"],["1","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","1","3","3","1"],["1","4","5","2","0"],["1","2","1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1","-1","1","1"],["0","2","2","0"],["1","1","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","2","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["2","7","9","5","1"],["3","8","7","2","0"],["1","2","1","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["2","7","9","5","1"],["3","8","7","2","0"],["1","2","1","0","0"]]},"deriv_order":1}],"shift":0}],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["-1"],["-1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":1,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["-1","-3","-3","-1"],["-1","-2","-1","0"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["1","2","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["1","3","3","1"]]},"deriv_order":0}],[{"coeff":{"coeffs":[["1","4","6","4","1"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":1,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["-4","-14","-18","-10","-2"],["-2","-6","-6","-2","0"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["1","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["1","1"]]},"deriv_order":0}],[]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1","2","1"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-1","-2","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","-1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["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 0) and E the input rule gauged by lambda(n)/delta(n) and composed with (or conjugated through) T = phi(n, D) = 1 + (1) D; so the candidate rows satisfy the input rule at every base n >= 0 (the exceptional bases checked exactly), and agreement on the 2 identifying rows gives Q_n = lambda(n) T_n(P_(n+0)) for every n >= 0"},"method":"operator_division"},"status":"certified"},"input_first_index":0,"interlacing":{"reason":"no parent theorem report with an interlacing conclusion","status":"none"},"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"lift_summary":{"hypotheses":[{"evidence":"the polynomial with ascending coefficients [1, 1] is fixed; exact check: real-rooted = true, coefficients of one sign = true","name":"derivative_polynomial_real_rooted","statement":"the polynomial in D is real-rooted 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 [0, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 0 + 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":"0","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":0,"input_interlacing":{"reason":"no parent theorem report with an interlacing conclusion","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"phi(n, D) = 1 + (1) D","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","2","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = phi(n, D) = 1 + (1) D, for every n >= 0"},"parent_proof":{"route":"hypergeometric_row","statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 0, 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 differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n"},"verdict":"proved"},"notes":["the division remainder is removed by row annihilators of the shifted parent"],"parent_proof":{"attempts":[{"detail":"the rule is not P_(n+k) = c(x) P_n with c free of n","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: support must satisfy offset = 1 + ell * t_degree; fixed_delay_predecessor_window: only P_(n-1) and one term w(n) t P_(n-L) are supported)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"HypothesisFailed: P_n = (a_n + b_n (x + 1)) P_(n-1) - c_n (x + 1)^2 P_(n-2) for n >= 2, with a_n = 0, b_n = 1, c_n = -1; Q_n(y) = y^(d_n) P_n(1/y - 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2); open hypotheses: leading_coefficient_nonzero: fails at n = 2: f(n) a_n = 0 = 0 there (exact); seeds_interlace: deg Q_1 != deg Q_0 + 1 = 1; first_coefficient_positive: not checked: the seeds do not satisfy the seed hypothesis; recurrence_coefficient_positive: fails at n = 3: the denominator of beta_n = -1 vanishes there; 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 >= 2, with A_n(x) = (1) + (1) x, V_n(x) = 0, W_n(x) = (1) + (2) x + (1) x^2; open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = 1 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 = 0 (not a disproof): fails at n = 2: [x^0] 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 = 0 (not a disproof): fails at n = 2: [x^0] 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":"Unresolved: P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 2, with A_n(x) = (1) + (1) x, B_n(x) = (1) + (2) x + (1) x^2; open hypotheses: lag_coefficient_nonpositive: neither everywhere (the quadratic test p_2 <= 0, p_0 <= 0, p_1^2 <= 4 p_2 p_0 does not hold for every n (not a disproof): fails at n = 2: p_2 = [x^2] B_n = 1 there (exact); fails at n = 2: p_0 = [x^0] B_n = 1 there (exact); p_1^2 - 4 p_2 p_0 <= 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of p_1^2 - 4 p_2 p_0 at n = 2 + u have one sign)) nor on x <= 0 (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 = 0 (not a disproof): fails at n = 2: [x^0] B_n = 1 there (exact))","route":"liu_wang_three_term","success":false,"variant":"liu_wang_three_term"},{"detail":"row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, n >= 0, with p = (-1) (k), q = (-1) (k - n - 1); valuation v(n) = 0, degree d(n) = n: every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0): for n >= 0 the coefficients U_j (U_j = [x^(j + v(n))] P_n, v(n) = 0) satisfy U_j = U_0(n) prod_(t <= j) R(n, t), R(n, j) = (-1) (j - n - 1) / ((j)), so sum_j U_j y^j is U_0(n) times the image of (1 + y)^(n) under a nonnegative multiplier sequence, and U_0(n) != 0 for n >= 0 by its scalar recurrence","route":"hypergeometric_row","success":true,"variant":"hypergeometric_row"}],"conditional_on":[],"route":"hypergeometric_row","rows_checked":10,"statement":"every parent row P_n, n >= 0, 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 = phi(n, D) = 1 + (1) D for every n >= 0, the side conditions hold for every n, and every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 0, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}