{"chains":[{"edge":{"id":"e-9a566c54793e3e13","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-db81f1fdf59f6128","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":"7e622bd23c1ad9f167cf7fdd1064858e7dd303ddb118ac0ebb94cd2b38c87b14","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[{"position":0,"node_id":"n-dfedc6a36c97eba4","role":"sequence","name":"Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 3*n + 3.","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-dfedc6a36c97eba4","role":"sequence","name":"Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 3*n + 3.","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-dfedc6a36c97eba4","role":"sequence","name":"Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 3*n + 3.","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-563d8c95cca8fabd","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-dfedc6a36c97eba4","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":"1890adb25c27bc78f0782e461b73e0c0fe56002bbc99bcdb68940ad71908950f","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-f71cdfb9d254d483","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-dfedc6a36c97eba4","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":"d6b6216c7c63f8fa9c5604a22db99453ba7d581cc4aa17d85198d84a898f6a62","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-dfedc6a36c97eba4","role":"sequence","name":"Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 3*n + 3.","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}