{"id":"e-883bba4ec6cabdf4","operation":{"factor":"binom(n+1, k)","operation":"hadamard_factor"},"operation_detail":"binom(n+1, k)","conclusion_id":"n-b002679da3d71a0f","premise_count":1,"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","lean_route":null,"lean_declarations":[],"certificate_hash":"edc612ac8ff3f82730f01281e9119efe43c6c8a5e46d54e9d7d8f75830775a2d","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"hadamard_factor","certificate_raw_size":20652,"certificate_compressed_size":5160,"conclusion_name":"Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-dbc23e13bb290987","role":"sequence","name":"hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}],"cited_by":[{"node_id":"n-b002679da3d71a0f","claim":"one_signed_coefficients"},{"node_id":"n-b002679da3d71a0f","claim":"hadamard_kernel"},{"node_id":"n-b002679da3d71a0f","claim":"real_rooted"}]}