{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":-1,"operator":{"factor":{"terms":[{"kind":"inverse_factorial"}]},"shape":"hadamard_multiplier"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2"],["0","2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"n-c914b69838ac70ec"},"identifying_rows":2,"identity":{"certificate":{"certificate":{"factor":{"terms":[{"kind":"inverse_factorial"}]},"hadamard":{"conjugated_input_relation":{"terms":[{"coeff":{"coeffs":[["0","0"],["-1","4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","0"],["0","0","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["-1"],["-1"]]},"deriv_order":0,"shift":2}]},"conjugation_x_shift":0,"exceptional_bases":[],"factor":{"terms":[{"kind":"inverse_factorial"}]},"gauge":{"kind":"none"},"identifying_indices":[1,2],"input_leader_shift":2,"input_relation":{"terms":[{"coeff":{"coeffs":[["0","0"],["-1","4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1"],["2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["-1"],["-1"]]},"deriv_order":0,"shift":2}]},"input_valid_from_base":1,"multiplier":["1"],"parent":{"first_index":1,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-4"],["0","2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0"],["0","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":2}]},"parent_valid_from_base":1,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["-1"],["-1"]]},"deriv_order":0}],"shift":0}],"row_annihilator_system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["-1","2"],["0","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0"],["1"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["0","0","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0"],["0","0","0","-8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","16"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0","0","-16"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["2"],["-3"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","10"],["0","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","4"]]},"deriv_order":2,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["0","0","0","0","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","-16"],["0","0","0","0","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","-16","96"],["0","0","0","0","0","-64"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","64"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","0","0","16","-96"],["0","0","0","0","0","32"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","-64"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1"]]},"start_base":1},"row_multiplier":["1"],"statement":"mu(x) w(n) M'' = sum_nu H_nu S^nu L + sum_l Z_l A_l (an invariant row-annihilator system of the parent) with M'' the input relation conjugated by lambda(n) 1/k!; so the candidate rows satisfy the input rule at every base n >= 1 (the exceptional bases checked exactly), and agreement on the 2 identifying rows gives Q_n = lambda(n) sum_k u(n,k) [x^k]P_n x^k for every n >= 1"},"index_shift":-1,"input":{"first_index":1,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["3"],["-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","8"],["1","-4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2"],["0","2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},"method":"hadamard_conjugation"},"status":"certified"},"input_first_index":1,"interlacing":{"reason":"no parent theorem report with an interlacing conclusion","status":"none"},"lean_declarations":["RealRooted.isMultiplierSequence_inv_factorial"],"lift_summary":{"hypotheses":[{"evidence":"1/k! is defined for every n >= 1","name":"factor_defined","statement":"the factor u(n, k) is defined on the index domain","status":{"kind":"verified"}},{"evidence":"1/k!: sum_k binom(m,k) x^k / k! = L_m(-x) is real-rooted with negative zeros for every m (Branden, Example 41); second condition of Theorem 40","name":"factor_multiplier_sequence","statement":"k -> u(n, k) is a nonnegative multiplier sequence 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"}}],"identity":{"method":"hadamard_conjugation","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":"x^k -> 1/k! x^k","kind":"preserver_image","operator":{"factor":{"terms":[{"kind":"inverse_factorial"}]},"shape":"hadamard_multiplier"}},"parent":{"gauge":{"kind":"none"},"index_shift":-1,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2"],["0","2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n-1)) with T = x^k -> 1/k! x^k, for every n >= 1"},"parent_proof":{"route":"paper_theorem","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 >= 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":"Polya--Schur characterization of multiplier sequences (G. Polya and I. Schur, J. Reine Angew. Math. 144 (1914) 89--113; stated as Theorem 40 of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601): a real sequence (lambda_k) is a multiplier sequence (x^k -> lambda_k x^k maps real-rooted polynomials to real-rooted polynomials or zero) iff sum_k binom(m,k) lambda_k x^k is real-rooted with zeros of one sign for every m, iff sum_k lambda_k x^k / k! (or its reflection) is C x^m e^(a x) prod (1 + alpha_j x) with a, alpha_j >= 0; a product of multiplier sequences is one (composition), and a nonzero factor lambda(n) of the row changes nothing"},"verdict":"proved"},"notes":[],"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":"Q_0 = 1, Q_n = Q_(n-1) + w(n) t Q_(max(0, n-2)), w(n) = -2 + 2n (paper_proof_not_lean_checked): For every n >= 1: Q_n has nonnegative coefficients and constant term 1, is real-rooted, and Q_i << Q_n (oriented weak interlacing) for p(n) <= i <= n. Hence Q_A << Q_B whenever 0 <= A <= B and B - A <= 2.; the identifying seeds equal the canonical rows (Canonical), so every parent row is a canonical row","route":"paper_theorem","success":true,"variant":"fixed_delay_predecessor_window"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["p(n) = max(0, n-2) with 2 >= 1 is nondecreasing and 0 <= p(n) < n for n >= 1 (exact_structural)","w(n) >= 0 for every integer n >= 1: w(1+m) has nonnegative coefficients [0, 2] in m (exact_symbolic_certificate)","window: Q_A << Q_B for 0 <= A <= B with B - A <= 2 (B - A <= 2)","the identifying parent seeds equal the canonical rows (Canonical), so every parent row is a canonical row and consecutive parent rows are consecutive canonical rows"],"theorem":"fixed_delay_predecessor_window (paper_proof_not_lean_checked; https://github.com/PerAlexandersson/RealRooted/issues/2037): For every n >= 1: Q_n has nonnegative coefficients and constant term 1, is real-rooted, and Q_i << Q_n (oriented weak interlacing) for p(n) <= i <= n. Hence Q_A << Q_B whenever 0 <= A <= B and B - A <= 2."},"kind":"weak","orientation":"previous_interlaces_next"},"route":"paper_theorem","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-1)) with T = x^k -> 1/k! x^k for every n >= 1, 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 >= 1, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}