{"id":"e-cb47efc3e6c3b2c6","operation":{"operation":"obreschkoff_combination"},"operation_detail":null,"conclusion_id":"n-24c1a22c5b1801ba","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":"5760bfa837affd15f974a8053fe9c46339bb7603bde2d64c454e092e22ee3d3b","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"obreschkoff_combination","certificate_raw_size":6428,"certificate_compressed_size":1581,"conclusion_name":"obreschkoff_combination of Triangle read by rows: T(n,k) = Sum_{i=0..n-1} binomial(n-1, i)*T(n-1-i,k-1) - Sum_{i=1..n-1} binomial(n-1,i)*T(n-1-i,k) for 1 <= k <= n+1 with T(0,1) = 1 (and T(n,k) = 0 otherwise).","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[{"position":0,"node_id":"n-13114c927e22057d","role":"sequence","name":"Triangle read by rows: T(n,k) = Sum_{i=0..n-1} binomial(n-1, i)*T(n-1-i,k-1) - Sum_{i=1..n-1} binomial(n-1,i)*T(n-1-i,k) for 1 <= k <= n+1 with T(0,1) = 1 (and T(n,k) = 0 otherwise).","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-13114c927e22057d","role":"sequence","name":"Triangle read by rows: T(n,k) = Sum_{i=0..n-1} binomial(n-1, i)*T(n-1-i,k-1) - Sum_{i=1..n-1} binomial(n-1,i)*T(n-1-i,k) for 1 <= k <= n+1 with T(0,1) = 1 (and T(n,k) = 0 otherwise).","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"}],"cited_by":[{"node_id":"n-24c1a22c5b1801ba","claim":"real_rooted"}]}
