{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["0"],["0"],["2"]],"recurrence":{"denominator":{"coeffs":[["2"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0"],["0","-4"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"derivative of Infinitesimal Pascal matrix: generator (lower triangular matrix representation) of the Pascal matrix, the classical operator xDx, iterated Laguerre transforms, associated matrices of the list partition transform and general Euler transformation for sequences."},"identifying_rows":4,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0","2"],["0","0","3"],["0","0","1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","4"],["0","-2"],["0","-2"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0"],["-1"],["1"]]},"deriv_order":1,"shift":2}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1,2,3],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["0"],["0"],["0"],["6"]],"recurrence":{"denominator":{"coeffs":[["6"],["-5"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0"],["0","-6"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":2,"multiplier":["0","1","-1","-1","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["0"],["0"],["2"]],"recurrence":{"denominator":{"coeffs":[["2"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0"],["0","-4"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":1,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["0"],["-1"],["3"],["-3"],["1"]]},"deriv_order":1}],"shift":0}],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","-1"],["0","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0"],["0"],["4"],["-6"],["0"],["2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0"],["0","-4"],["0","6"],["0","0"],["0","-2"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["-1"],["1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0"],["0","-2"],["0","1"],["0","1"]]},"deriv_order":0}],[]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["2"],["-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["0","1"],["0","-2"],["0","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0"],["0","-1"],["0","1"],["0","1"],["0","-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0"],["0","0","-1"],["0","0","0"],["0","0","1"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0"],["0","0","-1"],["0","0","-1"],["0","0","1"],["0","0","1"]]},"deriv_order":0}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1"]]},"start_base":2}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","2"],["0","0","3"],["0","0","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0"],["0","-4"],["0","-2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0"],["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 = phi(n, D) = (1) D; so the candidate rows satisfy the input rule at every base n >= 2 (the exceptional bases checked exactly), and agreement on the 4 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 [0, 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) D","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["0"],["2"]],"recurrence":{"denominator":{"coeffs":[["2"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","1"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0"],["0","-4"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = phi(n, D) = (1) D, for every n >= 0"},"parent_proof":{"route":"liu_wang_three_term","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 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 + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 3, with a_n = (0)/(n^2 - 3 n + 2), b_n = (2 n^2 - 4 n)/(n^2 - 3 n + 2), c_n = (n^2 - n)/(n^2 - 3 n + 2); Q_n(y) = y^(d_n) P_n(1/y + 0), 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: leading_coefficient_nonzero: fails at n = 3: f(n) a_n = 0 = 0 there (exact); seeds_interlace: P_1 is zero; first_coefficient_positive: not checked: the seeds do not satisfy the seed hypothesis; recurrence_coefficient_positive: fails at n = 4: the denominator of beta_n = n^4 - 6 n^3 + 11 n^2 - 6 n vanishes there; earlier_seeds: P_0 is zero or not real-rooted with every root in (-inf, 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) = ((2 n^2 - 4 n)/(n^2 - 3 n + 2)) x, V_n(x) = 0, W_n(x) = ((-n^2 + n)/(n^2 - 3 n + 2)) x^2; open hypotheses: seed_roots_negative: P_1 is zero, not real-rooted, or has a root >= 0 (exact); seed_degree_step: a seed row of the induction is zero; seed_strict_interlacing: the Bezout test fails or the degrees do not differ by one (exact); lag_degree_step_nonnegative: fails at n = 3: mu_n = (-n^2 + n)/(n^2 - 3 n + 2) = -3 there (exact); degree_step_positive: fails at n = 3: lambda_n + mu_n = (n^2 - 3 n)/(n^2 - 3 n + 2) = 0 there (exact); constant_term_positive: fails at n = 3: A_n(0) = (0)/(n^2 - 3 n + 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":"induction start moved 1 row(s) past the seeds: Q_n = A_n(x) Q_(n-1) + B_n(x) Q_(n-2) for n >= 4, with A_n(x) = ((2 n^2 - 4 n)/(n^2 - 3 n + 2)), B_n(x) = ((-n^2 + n)/(n^2 - 3 n + 2)); Q_n = P_n / x^(n - 2) for n >= 2, which satisfies the rule below: P_0, P_1 are zero; every other P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0] (so its coefficients have one sign); for n >= 3, Q_(n-1) interlaces Q_n (weakly, in the sense of Liu and Wang; no interlacing of the P_n is claimed); the rule is applied from n = 4 on in the induction (start moved 1 row(s) past the supplied seeds; P_0, ..., P_3 enter as seed rows, checked exactly)","route":"liu_wang_three_term","success":true,"variant":"liu_wang_three_term"}],"conditional_on":[],"route":"liu_wang_three_term","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) 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"}