{"id":"e-37a36b1b0e8be851","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":0},"operation_detail":"r=2, j=0, shift 0","conclusion_id":"n-60ec3928030a20ba","premise_count":1,"theorem":"Veronese sections of Polya frequency sequences (Aissen--Schoenberg--Whitney--Edrei): if P is real-rooted with coefficients of one sign, equivalently nonzero with all roots in (-inf, 0], every section V_(r,j)(P) is zero or real-rooted with roots in (-inf, 0]","lean_route":null,"lean_declarations":[],"certificate_hash":"016fd6db6381aa7362d4c7f3d8c43c777265ca43330eea88cb66ff7ee007f4b1","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"veronese_section","certificate_raw_size":7414,"certificate_compressed_size":2062,"conclusion_name":"veronese_section_2_0 of Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-2821c21537bbbcdd","role":"sequence","name":"Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).","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-60ec3928030a20ba","claim":"real_rooted"},{"node_id":"n-60ec3928030a20ba","claim":"one_signed_coefficients"},{"node_id":"n-60ec3928030a20ba","claim":"hadamard_kernel"}]}