{"id":"e-90513bb2a56c6046","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-66e2c3448245b0b7","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":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_eval_nonpos","RealRooted.threeTerm_interlaces","RealRooted.eval_nonpos_of_natDegree_le_two"],"certificate_hash":"2438b0f110b4c7fbb4c2afb9099cd1dff1e895a68479d21de6cd3c24935888dc","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":4848,"certificate_compressed_size":1508,"conclusion_name":"Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","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":[],"cited_by":[{"node_id":"n-66e2c3448245b0b7","claim":"real_rooted"},{"node_id":"n-66e2c3448245b0b7","claim":"one_signed_coefficients"},{"node_id":"n-66e2c3448245b0b7","claim":"hadamard_kernel"},{"node_id":"n-66e2c3448245b0b7","claim":"interlacing"}]}