{"chains":[{"edge":{"id":"e-01a8bab2955d58ac","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-1fefd5af9c8edffe","premise_count":2,"theorem":"Hermite--Kakeya--Obreschkoff: real-rooted f, g with interlacing zeros give a zero or real-rooted a f + b g for all real a, b (Obreschkoff 1963; Fisk, Polynomials, roots, and interlacing, Thm 1.43)","lean_route":null,"lean_declarations":[],"certificate_hash":"cabf9921104fbdbeb6f707c3a4f085af70330e82f614c9a77fd47081926b4827","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}}],"premises":[{"position":0,"node_id":"n-92be85f47bd42a26","role":"sequence","name":"Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1.","uses":{"claim":"real_rooted","from_index":1,"region":{}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)"},{"position":1,"node_id":"n-92be85f47bd42a26","role":"sequence","name":"Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1.","uses":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"uses_text":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2"}]},"premises":[{"premise":{"position":0,"node_id":"n-92be85f47bd42a26","role":"sequence","name":"Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1.","uses":{"claim":"real_rooted","from_index":1,"region":{}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)"},"chains":[{"edge":{"id":"e-b3e0ac60e2e16f0a","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-92be85f47bd42a26","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"7686b08800e89bd18946ad88bcd5c294bee6603ab3b10846817bf9519bc07374","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},"premises":[]}]},{"premise":{"position":1,"node_id":"n-92be85f47bd42a26","role":"sequence","name":"Triangle read by rows: T(n, k) = k*(n - k)*binomial(2*n+2, 2*k+1)/(4*n + 2) for 1 <= k <= n-1.","uses":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"uses_text":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2"},"chains":[]}]}],"truncated":false,"expanded":2}