{"id":"e-7f1af9331800ddfa","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-6758fe7729845be8","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":"395521c0e23a4644f4cfc736783e88c8f6b9540040009e9a43545de8afcc7c9f","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":2681,"certificate_compressed_size":1033,"conclusion_name":"Triangular array binomial(2*n-k, k), k=0..n, n >= 0.","claims":[{"claim":"real_rooted","from_index":0,"region":{}}],"premises":[],"cited_by":[{"node_id":"n-6758fe7729845be8","claim":"real_rooted"}]}