{"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":[["1"],["0","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","8"],["0","-4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","1"],["0","0","4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0","36"],["0","0","60"],["0","0","37"],["0","0","10"],["0","0","1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-18"],["0","-48"],["0","-44"],["0","-16"],["0","-2"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["4"],["12"],["13"],["6"],["1"]]},"deriv_order":1,"shift":2}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["0"],["4"]],"recurrence":{"denominator":{"coeffs":[["0"],["0"],["1"],["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","0"],["0","0","-1"],["0","0","-2"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","2"],["0","0"],["0","-4"],["0","0"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1","4","6","4","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["0","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","8"],["0","-4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","1"],["0","0","4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["4"],["28"],["85"],["146"],["155"],["104"],["43"],["10"],["1"]]},"deriv_order":1}],"shift":0}],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","-4"],["0","-4"],["0","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1"],["2"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0"],["-16"],["-80"],["-164"],["-176"],["-104"],["-32"],["-4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","-18"],["0","-100"],["0","-238"],["0","-316"],["0","-254"],["0","-124"],["0","-34"],["0","-4"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["1"],["2"],["1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","-9"],["0","-22"],["0","-17"],["0","-4"]]},"deriv_order":0}],[]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["0","1"],["0","4"],["0","6"],["0","4"],["0","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","-1"],["0","-3"],["0","-3"],["0","-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","1"],["0","0","2"],["0","0","1"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","4"],["0","0","12"],["0","0","13"],["0","0","6"],["0","0","1"]]},"deriv_order":0}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","-9"],["0","0","-4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0"],["0","4"]]},"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) 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 [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":[["1"],["0","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","8"],["0","-4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","1"],["0","0","4"]]},"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) D, for every n >= 0"},"parent_proof":{"statement":"open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only)","status":"open"},"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":"open"},"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":"no theorem matched (weighted_renewal_window: coefficients must be index-independent; fixed_delay_predecessor_window: coefficient of P_(n-1) must be 1 (+ w(n) t) after normalization)","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 >= 2, with a_n = 0, b_n = -4 n + 8, c_n = -4 n - 1; Q_n(y) = y^(d_n) P_n(1/y + 0), 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 = -4 n - 1 vanishes there; 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 >= 2, with A_n(x) = (-4 n + 8) x, V_n(x) = 0, W_n(x) = (4 n + 1) x^2; open hypotheses: seed_roots_negative: P_1 is zero, not real-rooted, or has a root >= 0 (exact); derivative_degree_step_nonnegative: fails at n = 3: lambda_n = -4 n + 8 = -4 there (exact); constant_term_positive: fails at n = 2: A_n(0) = 0 = 0 there (exact); lag_coefficient_nonpositive: W_n(x) = gamma(n) w(x) / f(n) with w(x) = x^2, which is positive on (-inf, 0) (no root there, exact): fails at n = 2: gamma(n)/f(n) = 4 n + 1 = 9 there (exact); derivative_or_lag_coefficient_negative: W_n(x) = gamma(n) w(x) / f(n) with w(x) = x^2, which is positive on (-inf, 0) (no root there, exact): fails at n = 2: gamma(n)/f(n) = 4 n + 1 = 9 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":"the parent equals the flagged entry, but the flag gives real-rootedness only and one-signed coefficients are not shown: the weight of the coefficient of x^s of P_(n-1) in the coefficient of x^(s+1) is not shown to be >= 0 for n >= 2","route":"attestation","success":false,"variant":"oeis_catalog:A127733:lean_proved"},{"detail":"no lean_proved catalog entry equals the parent; 1 with the same first index and seeds differ in the rule or in later initial rows (oeis_catalog:A131431:lean_proved)","route":"attestation","success":false,"variant":"oeis_catalog"}],"conditional_on":[],"rows_checked":10,"statement":"open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only)","status":"not_proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"Q_n = lambda(n) T_n(P_(n+0)) with T = phi(n, D) = (1) D for every n >= 0 is certified; the lift is Open (open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only))"},"kind":"preserver_image"}