{"chains":[{"edge":{"id":"e-45f39b72ccd15e60","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-288ee4e6a60f9c49","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":"8f5a26bc17f09b82bb19037d3b9ba7689096abce219958a3896d8621cd0611cf","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}}],"premises":[{"position":0,"node_id":"n-cab14672969f6507","role":"sequence","name":"Galton triangle T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k) read by rows.","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-cab14672969f6507","role":"sequence","name":"Galton triangle T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k) read by rows.","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-cab14672969f6507","role":"sequence","name":"Galton triangle T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k) read by rows.","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-94f85f79154d7ed6","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-cab14672969f6507","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":"3b8c85c0351dfbb71a7fb05872b28901c989056a9ba51b5a81a782ec553b2524","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-cab14672969f6507","role":"sequence","name":"Galton triangle T(n, k) = T(n-1, k-1) + (3k-2)*T(n-1, k) read by rows.","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}