{"chains":[{"edge":{"id":"e-1a132a11ecb2f34a","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-c9945ec6eb94c8a9","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":"733f97e485daa7e7dc0062b2db6bdfdbe32ab7dd33d4873f601b55b5d247db2d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}}],"premises":[{"position":0,"node_id":"n-bdd5560e7eb65b04","role":"sequence","name":"Triangle read by rows, 3^k*S_3(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.","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-bdd5560e7eb65b04","role":"sequence","name":"Triangle read by rows, 3^k*S_3(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.","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-bdd5560e7eb65b04","role":"sequence","name":"Triangle read by rows, 3^k*S_3(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.","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-0881060763ba73b2","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-bdd5560e7eb65b04","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":"378c473bec22c47f8f862d0dd4aac9ed22dea956401d51485f7d4941ea1eafc5","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-bdd5560e7eb65b04","role":"sequence","name":"Triangle read by rows, 3^k*S_3(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0.","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}