{"id":"e-569bc6ae08ea897e","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-c8b3f39d03de798f","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":null,"lean_declarations":["RealRooted.MaWang.strictInterl_of_interlaces_evalCoeff_nonpos"],"certificate_hash":"e36985b6f89947ba99c48148d6d181180f037b3af593f87ec06f76ed3220311d","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":4967,"certificate_compressed_size":1403,"conclusion_name":"Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[],"cited_by":[{"node_id":"n-c8b3f39d03de798f","claim":"one_signed_coefficients"},{"node_id":"n-c8b3f39d03de798f","claim":"hadamard_kernel"},{"node_id":"n-c8b3f39d03de798f","claim":"interlacing"},{"node_id":"n-c8b3f39d03de798f","claim":"real_rooted"}]}