{"id":"e-18de01688f1c88b0","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-4689fb1386d440ad","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"8c2138197fbd81bcaffe5fc72cdeb04869c55c0ee3164120b7e4956645777634","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":4327,"certificate_compressed_size":1392,"conclusion_name":"T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[],"cited_by":[{"node_id":"n-4689fb1386d440ad","claim":"real_rooted"},{"node_id":"n-4689fb1386d440ad","claim":"one_signed_coefficients"},{"node_id":"n-4689fb1386d440ad","claim":"hadamard_kernel"},{"node_id":"n-4689fb1386d440ad","claim":"interlacing"}]}