{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["2"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["3"],["7"],["2"]]},"terms":[{"coeff":{"coeffs":[["6","0"],["8","8"],["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["3","-6","3"],["-1","2","-1"],["-2","4","-2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle of Dyck paths counted by number of long interior inclines."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-12","-40","-32"],["-7","-72","-79"],["-1","-41","-68"],["0","-10","-24"],["0","-1","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-22","-76","14"],["0","-11","-132","-15"],["0","-1","-69","-40"],["0","0","-14","-20"],["0","0","-1","-3"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-5","-18","23"],["0","0","-2","-30","32"],["0","0","0","-14","14"],["0","0","0","-2","2"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["8","16"],["6","36"],["1","28"],["0","9"],["0","1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","8","16"],["0","6","36"],["0","1","28"],["0","0","9"],["0","0","1"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["2"]],"recurrence":{"denominator":{"coeffs":[["3","0"],["4","3"],["1","7"],["0","5"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["6","0","0"],["5","16","3"],["1","17","14"],["0","6","12"],["0","1","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","3","0","-3"],["0","2","8","-10"],["0","0","8","-8"],["0","0","2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["64","96","52","12","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["2"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["3"],["7"],["2"]]},"terms":[{"coeff":{"coeffs":[["6","0"],["8","8"],["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["3","-6","3"],["-1","2","-1"],["-2","4","-2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":0,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["-12","-8"],["-7","-11"],["-1","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-5","5"],["0","-2","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["8"],["6"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","-64","-64","128"],["0","-96","-288","384"],["0","-52","-404","456"],["0","-12","-264","276"],["0","-1","-89","90"],["0","0","-15","15"],["0","0","-1","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-64","-64","128"],["0","0","-96","-288","384"],["0","0","-52","-404","456"],["0","0","-12","-264","276"],["0","0","-1","-89","90"],["0","0","0","-15","15"],["0","0","0","-1","1"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","-64","64"],["0","-96","96"],["0","-52","52"],["0","-12","12"],["0","-1","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","-560","1120","-560"],["0","-1532","3064","-1532"],["0","-1624","3248","-1624"],["0","-863","1726","-863"],["0","-244","488","-244"],["0","-35","70","-35"],["0","-2","4","-2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","1400","-2800","1400"],["0","0","2290","-4580","2290"],["0","0","1457","-2914","1457"],["0","0","451","-902","451"],["0","0","68","-136","68"],["0","0","4","-8","4"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-7000","14000","-7000"],["0","0","-14250","28500","-14250"],["0","0","-11865","23730","-11865"],["0","0","-5169","10338","-5169"],["0","0","-1242","2484","-1242"],["0","0","-156","312","-156"],["0","0","-8","16","-8"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-3","0"],["0","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-1","1"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","-832","832"],["0","0","0","-2080","2080"],["0","0","0","-2116","2116"],["0","0","0","-1120","1120"],["0","0","0","-325","325"],["0","0","0","-49","49"],["0","0","0","-3","3"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["0","0","512","-1024","512"],["0","0","1152","-2304","1152"],["0","0","1056","-2112","1056"],["0","0","504","-1008","504"],["0","0","132","-264","132"],["0","0","18","-36","18"],["0","0","1","-2","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","3200","-6400","3200"],["0","0","11520","-23040","11520"],["0","0","17416","-34832","17416"],["0","0","14508","-29016","14508"],["0","0","7302","-14604","7302"],["0","0","2277","-4554","2277"],["0","0","430","-860","430"],["0","0","45","-90","45"],["0","0","2","-4","2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-4800","6400","1600","-3200"],["0","0","-10080","10240","9760","-9920"],["0","0","-8604","4752","16308","-12456"],["0","0","-3816","-648","12744","-8280"],["0","0","-927","-1308","5397","-3162"],["0","0","-117","-462","1275","-696"],["0","0","-6","-70","158","-82"],["0","0","0","-4","8","-4"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","-1600","4800","-4800","1600"],["0","0","0","-3360","10080","-10080","3360"],["0","0","0","-2868","8604","-8604","2868"],["0","0","0","-1272","3816","-3816","1272"],["0","0","0","-309","927","-927","309"],["0","0","0","-39","117","-117","39"],["0","0","0","-2","6","-6","2"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","27200","-41600","1600","12800"],["0","0","71520","-98560","-17440","44480"],["0","0","80596","-96488","-48812","64704"],["0","0","50796","-49788","-52812","51804"],["0","0","19569","-14070","-30567","25068"],["0","0","4716","-1905","-10338","7527"],["0","0","694","-16","-2050","1372"],["0","0","57","25","-221","139"],["0","0","2","2","-10","6"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","8000","-24000","24000","-8000"],["0","0","0","20000","-60000","60000","-20000"],["0","0","0","21060","-63180","63180","-21060"],["0","0","0","12096","-36288","36288","-12096"],["0","0","0","4089","-12267","12267","-4089"],["0","0","0","813","-2439","2439","-813"],["0","0","0","88","-264","264","-88"],["0","0","0","4","-12","12","-4"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","-1","1"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["7","-14","7"],["9","-18","9"],["2","-4","2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-38","-32"],["-24","-24"],["-4","-4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["25"],["15"],["2"]]},"deriv_order":0,"shift":2}]},"statement":"w(n) E = sum_nu H_nu S^nu L' (with any remainder removed by row annihilators of the parent), where L' is the parent rule at P'_n = P_(n+0) (valid from base 0) and E the input rule gauged by lambda(n)/delta(n) and composed with (or conjugated through) T = f(n, theta) = 1 + (1) theta; so the candidate rows satisfy the input rule at every base n >= 0 (the exceptional bases checked exactly), and agreement on the 1 identifying rows gives Q_n = lambda(n) T_n(P_(n+0)) for every n >= 0"},"method":"operator_division"},"status":"certified"},"input_first_index":0,"interlacing":{"from_index":1,"justification":"the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 1; T = f(n, theta) = 1 + (1) theta is independent of n and maps every real-rooted polynomial to a real-rooted polynomial or zero, so by the Hermite--Kakeya--Obreschkoff theorem (both directions) T(P_(m-1)) and T(P_m) have weakly interlacing zeros; the nonzero gauge does not move zeros, so Q_(n-1) and Q_n interlace weakly (orientation not determined) for every n >= 1","kind":"weak","orientation":"unordered","status":"claimed"},"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"lift_summary":{"hypotheses":[{"evidence":"the polynomial with ascending coefficients [1, 1] is fixed; exact check: real-rooted = true, coefficients of one sign = true","name":"euler_polynomial_roots_nonpositive","statement":"the polynomial in theta is real-rooted with every root <= 0 for every n >= n0","status":{"kind":"verified"}},{"evidence":"lambda(n) = 1","name":"gauge_finite_nonzero","statement":"lambda(n) is finite and nonzero for every n >= n0","status":{"kind":"verified"}},{"evidence":"delta(n) != 0 for every integer n in [0, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 0 + u have one sign)","name":"operator_coefficients_defined","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["1"]},"numerator":["1"],"range":{"first":"0","last":null}},"decision":"holds"},"statement":"the operator coefficients are finite at every n >= n0 (their denominators do not vanish)","status":{"kind":"verified"}}],"identity":{"method":"forward_division","status":"certified"},"input_first_index":0,"input_interlacing":{"interlacing":{"from_index":1,"justification":{"premises":["the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 1; T = f(n, theta) = 1 + (1) theta is independent of n and maps every real-rooted polynomial to a real-rooted polynomial or zero, so by the Hermite--Kakeya--Obreschkoff theorem (both directions) T(P_(m-1)) and T(P_m) have weakly interlacing zeros; the nonzero gauge does not move zeros, so Q_(n-1) and Q_n interlace weakly (orientation not determined) for every n >= 1"],"theorem":"Hermite--Kakeya--Obreschkoff theorem (N. Obreschkoff, Verteilung und Berechnung der Nullstellen reeller Polynome, 1963; see S. Fisk, Polynomials, Roots, and Interlacing, arXiv:math/0612833): real polynomials f, g have weakly interlacing zeros iff alpha f + beta g is real-rooted or zero for all real alpha, beta; a linear T independent of n that maps every real-rooted polynomial to a real-rooted polynomial or zero therefore maps interlacing pairs to pairs with weakly interlacing zeros (orientation not determined)"},"kind":"weak","orientation":"unordered"},"status":"proved"},"lean_replay":"not_attempted","operation":{"description":"f(n, theta) = 1 + (1) theta","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["2"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["3"],["7"],["2"]]},"terms":[{"coeff":{"coeffs":[["6","0"],["8","8"],["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["3","-6","3"],["-1","2","-1"],["-2","4","-2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (1) theta, for every n >= 0"},"parent_proof":{"route":"three_term_recurrence","statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 0, is zero or real-rooted with roots in (-inf, 0]","input_root_region":{"upper":{"closed":true,"value":"0"}},"parent_hypothesis":"every parent row used is zero or real-rooted with all roots in (-inf, 0] (coefficients of one sign)","parent_root_region":{"upper":{"closed":true,"value":"0"}},"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n"},"verdict":"proved"},"notes":["the division remainder is removed by row annihilators of the shifted parent"],"parent_interlacing_report":{"conclusion":{"first_index":0,"interlacing":"strict","interlacing_from":1,"root_region":{"upper":{"closed":false,"value":"0"}},"simple_roots":true,"statement":"every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)"},"hypotheses":[{"evidence":"f(n) = 2 n^2 + 7 n + 3 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) = 2 n^2 + 7 n + 3 at n = 2 + u have one sign)","name":"left_factor_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["25","15","2"]},"numerator":["3","7","2"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"the left-hand factor f(n) is nonzero for every n >= 2","status":{"kind":"verified"}},{"evidence":"f(n) a_n = 8 n^2 + 16 n + 6 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 8 n^2 + 16 n + 6 at n = 2 + u have one sign)","name":"leading_coefficient_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["70","48","8"]},"numerator":["6","16","8"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"a_n != 0 for every n >= 2","status":{"kind":"verified"}},{"evidence":"Q_0 has degree 0, Q_1 degree 1; simple real roots and strict interlacing checked exactly","name":"seeds_interlace","statement":"Q_0 and Q_1 have simple real roots, degrees e and e + 1, and Q_0 strictly interlaces Q_1","status":{"kind":"verified"}},{"evidence":"beta_2 = 1/25 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = (1/16 n^4 + 1/8 n^3 - 7/64 n^2 - 11/64 n + 3/32)/(n^4 + 2 n^3 + 1/2 n^2 - 1/2 n - 3/16) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = (1/16 n^4 + 1/8 n^3 - 7/64 n^2 - 11/64 n + 3/32)/(n^4 + 2 n^3 + 1/2 n^2 - 1/2 n - 3/16) at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["-3/16","-1/2","1/2","2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["2205/16","329/2","145/2","14","1"],"shifted_numerator":["225/32","595/64","281/64","7/8","1/16"]},"numerator":["3/32","-11/64","-7/64","1/8","1/16"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"beta_n = c_n / (a_n a_(n-1)) > 0 for every n >= 3","status":{"kind":"verified"}},{"evidence":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = (1/4 n + 3/4)/(n + 3/2) (the exact ratio r_n): g(n) > 0 for n >= 2, r_2 >= g(2) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 3 + u have one sign)","name":"root_upper_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["-27/64","-351/128","-333/64","77/32","351/16","259/8","89/4","15/2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["6251175/128","13276305/128","6122277/64","1602077/32","260301/16","26899/8","1727/4","63/2","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"every root of Q_n is < 0 for every n >= 0 (region (-inf, 0) for P)","status":{"kind":"verified"}},{"evidence":"on the reflected rows (-1)^(deg) p_n(-y): seeds checked exactly; positive-ratio induction at t = 1 with g(n) = (1/4 n^2 + 5/4 n + 3/2)/(n^2 + 5/2 n + 3/2) (the exact ratio r_n): g(n) > 0 for n >= 2, r_2 >= g(2) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 3 + u have one sign)","name":"root_lower_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["-27/64","-459/128","-711/64","-1375/128","1379/64","2517/32","1743/16","675/8","153/4","19/2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["6251175/8","32803785/16","308374479/128","213765665/128","48414773/64","7488429/32","801213/16","58563/8","2799/4","79/2","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"every root of Q_n is > -1 for every n >= 0 (region (-inf, 0) for P)","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x - 1)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 2, with a_n = (4 n^2 + 8 n + 3)/(n^2 + 7/2 n + 3/2), b_n = (2 n^2 + 4 n)/(n^2 + 7/2 n + 3/2), c_n = (n^2 + 1/2 n - 3/2)/(n^2 + 7/2 n + 3/2); Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","recurrence":{"first_index":0,"initial_polynomials":[["2"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["3"],["7"],["2"]]},"terms":[{"coeff":{"coeffs":[["6","0"],["8","8"],["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["3","-6","3"],["-1","2","-1"],["-2","4","-2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"reference":"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","requested_root_region":{"upper":{"closed":false,"value":"0"}},"schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"three_term_recurrence"},"parent_proof":{"attempts":[{"detail":"the leader is not a nonzero constant","route":"periodic_product","success":false,"variant":"P_(n+k) = c(x) P_n"},{"detail":"no theorem matched (weighted_renewal_window: LHS must be a nonzero constant; fixed_delay_predecessor_window: LHS must be a nonzero constant)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"P_n = (a_n + b_n (x - 1)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 2, with a_n = (4 n^2 + 8 n + 3)/(n^2 + 7/2 n + 3/2), b_n = (2 n^2 + 4 n)/(n^2 + 7/2 n + 3/2), c_n = (n^2 + 1/2 n - 3/2)/(n^2 + 7/2 n + 3/2); Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2): every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)","route":"three_term_recurrence","success":true,"variant":"three_term_recurrence"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = (a_n + b_n (x - 1)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 2, with a_n = (4 n^2 + 8 n + 3)/(n^2 + 7/2 n + 3/2), b_n = (2 n^2 + 4 n)/(n^2 + 7/2 n + 3/2), c_n = (n^2 + 1/2 n - 3/2)/(n^2 + 7/2 n + 3/2); Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)"],"theorem":"three_term_recurrence: 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"},"kind":"strict","orientation":"previous_interlaces_next"},"route":"three_term_recurrence","rows_checked":10,"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"proved: Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (1) theta for every n >= 0, the side conditions hold for every n, and every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 0, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}