{"chains":[{"edge":{"id":"e-1f2ac171cb8f6597","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-63a72abdf1dbaedc","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":"02e21b7dfffae9a8c10a5d8898f17bb79cd9e51dda4489ece75a5749f69a6952","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}}],"premises":[{"position":0,"node_id":"n-7d6d6baad7692ddc","role":"sequence","name":"Triangle read by rows, S_4(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-7d6d6baad7692ddc","role":"sequence","name":"Triangle read by rows, S_4(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-7d6d6baad7692ddc","role":"sequence","name":"Triangle read by rows, S_4(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-8ea25153a52b5bd5","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-7d6d6baad7692ddc","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":"a5a90548f5b614df0702df145fb361510074e612b56c8c8fe97835aba0f2e2db","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-7d6d6baad7692ddc","role":"sequence","name":"Triangle read by rows, S_4(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}