{"id":"e-cd414fbaeca8ed3c","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-ff76d530e3f3a037","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction","lean_route":"window","lean_declarations":["RealRooted.threeTerm_interlaces_of_roots_le"],"certificate_hash":"1addd81d75255edc5f9ac76d4beed90f35e95bc2015034301bb1713cfc36e255","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":4599,"certificate_compressed_size":1494,"conclusion_name":"Triangle T(n,k), 0<=k<=n, read by rows given by [0,2,-1/2,-1/2,0,0,0,0,0,0,0,0,...] DELTA [1,0,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[],"cited_by":[{"node_id":"n-ff76d530e3f3a037","claim":"real_rooted"},{"node_id":"n-ff76d530e3f3a037","claim":"one_signed_coefficients"},{"node_id":"n-ff76d530e3f3a037","claim":"hadamard_kernel"},{"node_id":"n-ff76d530e3f3a037","claim":"interlacing"}]}
