{"chains":[{"edge":{"id":"e-c021bdf930303dcb","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-bfef45d82201a3a1","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":"100d5cf26167c20550d198026af82ab78b2aee2436e5c0f64d465dd0f7c7c460","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[{"position":0,"node_id":"n-97228a88c81561dc","role":"sequence","name":"Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.","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-97228a88c81561dc","role":"sequence","name":"Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.","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-97228a88c81561dc","role":"sequence","name":"Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.","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-548a05679c99d179","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-97228a88c81561dc","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":"1acc27185aae0dd2887ec56822b134a9b547b717e8fa5604682aa5269f4f2390","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-0d5dad6bd99a01a4","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-97228a88c81561dc","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"0089038169eaa7fe7c220640e18c48cc0e4f3ef37abdf0c43b5848cbfa1626a9","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-97228a88c81561dc","role":"sequence","name":"Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]},"premises":[{"premise":{"position":0,"node_id":"n-97228a88c81561dc","role":"sequence","name":"Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"},"chains":[{"edge":{"id":"e-548a05679c99d179","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-97228a88c81561dc","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":"1acc27185aae0dd2887ec56822b134a9b547b717e8fa5604682aa5269f4f2390","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":[]},"repeat":true,"premises":[]}]}]}]},{"premise":{"position":1,"node_id":"n-97228a88c81561dc","role":"sequence","name":"Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.","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}