{"chains":[{"edge":{"id":"e-107bbdcb60a21a66","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-f455ca73098afb3a","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":"d3d54f289c230d9242d2809df5899069ac69e6bb07e5636a0d03a3241281c5f8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[{"position":0,"node_id":"n-75a6475b3e851dc5","role":"sequence","name":"Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.","uses":{"claim":"real_rooted","from_index":0,"region":{}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)"},{"position":1,"node_id":"n-75a6475b3e851dc5","role":"sequence","name":"Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.","uses":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"uses_text":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1"}]},"premises":[{"premise":{"position":0,"node_id":"n-75a6475b3e851dc5","role":"sequence","name":"Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.","uses":{"claim":"real_rooted","from_index":0,"region":{}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)"},"chains":[{"edge":{"id":"e-d07da0cb5a6ac36b","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-75a6475b3e851dc5","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":"1ee9a85fa832b27b252e53ab2d756de256c666dbfee65c2e4da51ff79b853bcd","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},"premises":[]},{"edge":{"id":"e-e811f0fabc9e8e88","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-75a6475b3e851dc5","premise_count":0,"theorem":"polytool parent provers, route root_domain: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"298531a92301dc9efedfcd495b9fdfa922405c991720f623ad83012cf40a78c1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},"premises":[]}]},{"premise":{"position":1,"node_id":"n-75a6475b3e851dc5","role":"sequence","name":"Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.","uses":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"uses_text":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1"},"chains":[]}]}],"truncated":false,"expanded":3}