{"input":{"first_index":1,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":1,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"kind":"hadamard_factor","lift":{"factor":{"terms":[{"kind":"inverse_factorial"}]},"factor_text":"1/k!","gauge":{"kind":"none"},"hidden_coefficients":"zero","identity":{"certificate":{"conjugated_input_relation":{"terms":[{"coeff":{"coeffs":[["0","0","2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","2","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","0","1","1"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["-1","-2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","-1","-2"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["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"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-1","-2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","-1"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":2}]},"input_valid_from_base":1,"multiplier":["1"],"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_relation":{"terms":[{"coeff":{"coeffs":[["-1","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-1","-1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":1}]},"parent_valid_from_base":1,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":1}],"shift":0},{"differentiations":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0}],"shift":1}],"row_multiplier":["1"],"statement":"mu(x) w(n) M'' = sum_nu H_nu S^nu L 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"},"status":"certified"},"lift_summary":{"hypotheses":[{"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 -> 1/k! is a nonnegative multiplier sequence for every n >= 1","status":{"kind":"verified"}}],"identity":{"method":"conjugation_division","status":"certified"},"input_first_index":1,"input_interlacing":{"reason":"the parent route root_domain proves no interlacing of consecutive parent rows","status":"not_proved"},"lean_replay":"not_attempted","operation":{"factor":"1/k!","kind":"hadamard_factor"},"parent":{"index_shift":0,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) sum_k 1/k! [x^k]P_n x^k for every n >= 1"},"parent_proof":{"route":"root_domain","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 (-inf, 0]: a nonnegative multiplier sequence keeps real-rootedness and one coefficient sign","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"},"multiplier_sequence":"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","parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"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: derivatives and alternating signs are unsupported; fixed_delay_predecessor_window: derivatives and alternating signs are unsupported)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"source claim: every P_n, n >= 1, is real-rooted in (-inf, 0] (CertifiedFamilyInvariant): the completed induction for Q_n and real_affine_equivalence (target to source; every map condition certified for all indices)","route":"root_domain","success":true,"variant":"identity (affine 1, 0)"}],"conditional_on":[],"route":"root_domain","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}}