{"id":"e-365c9804d88a701d","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-01fe968f3e05a927","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":"e24029a8e3c32831442d0b04fa77751ddd1f2a9922c8c1688da77e95903b3570","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":4649,"certificate_compressed_size":1376,"conclusion_name":"Triangle T(n,k), read by rows given by [1,0,1,0,0,0,0,0,0,...] DELTA [0,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[],"cited_by":[{"node_id":"n-01fe968f3e05a927","claim":"interlacing"},{"node_id":"n-01fe968f3e05a927","claim":"one_signed_coefficients"},{"node_id":"n-01fe968f3e05a927","claim":"hadamard_kernel"},{"node_id":"n-01fe968f3e05a927","claim":"real_rooted"}]}