{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-3"],["2"]]},"terms":[{"coeff":{"coeffs":[["0","0","-18"],["0","0","45"],["0","0","-18"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6","12"],["-16","-24"],["8","12"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013610 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1)."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0","0","0"],["-2","-6","-27","-27"],["-12","-72","-126","-162"],["-24","-228","-486","-405"],["-16","-252","-765","-648"],["0","-72","-360","-405"],["0","0","-36","-81"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","4","36","108","108"],["0","18","198","567","567"],["0","12","312","1314","1134"],["0","-40","-156","558","945"],["0","-48","-612","-1467","-756"],["0","0","-216","-1008","-999"],["0","0","0","-108","-243"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","5","45","135","135"],["0","0","28","264","783","783"],["0","0","48","588","1989","1863"],["0","0","16","432","2034","2295"],["0","0","-16","-72","270","837"],["0","0","0","-72","-270","-135"],["0","0","0","0","-36","-81"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","1","9","27","27"],["0","0","0","6","54","162","162"],["0","0","0","12","132","423","405"],["0","0","0","8","132","504","540"],["0","0","0","0","36","207","297"],["0","0","0","0","0","18","54"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["0","0","0"],["1","-3","0"],["5","-3","0"],["8","18","9"],["4","36","27"],["0","18","27"],["0","0","9"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","0","0","0"],["0","3","-9","0"],["0","15","-9","0"],["0","24","54","27"],["0","12","108","81"],["0","0","54","81"],["0","0","0","27"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","1","-3","0"],["0","0","5","-3","0"],["0","0","8","18","9"],["0","0","4","36","27"],["0","0","0","18","27"],["0","0","0","0","9"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["-1","3","0"],["5","-21","0"],["-8","54","-9"],["4","-54","27"],["0","18","-27"],["0","0","9"]]},"terms":[{"coeff":{"coeffs":[["2","18","54","54"],["-14","-102","-243","-135"],["36","180","198","0"],["-40","-60","306","243"],["16","-108","-495","-162"],["0","72","144","-81"],["0","0","36","81"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","9","27","27"],["0","-6","-42","-90","-54"],["0","12","48","27","-27"],["0","-8","12","144","108"],["0","0","-36","-117","-27"],["0","0","0","-18","-54"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","0","0","1","3","3","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-3"],["2"]]},"terms":[{"coeff":{"coeffs":[["0","0","-18"],["0","0","45"],["0","0","-18"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6","12"],["-16","-24"],["8","12"]]},"deriv_order":0,"offset":1,"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":[["0","0"],["-2","-3"],["-4","-9"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","1","3"],["0","2","6"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["0","0","1","3","-9","-27","0"],["0","0","7","33","9","-81","0"],["0","0","19","123","234","135","81"],["0","0","25","219","684","891","405"],["0","0","16","204","882","1512","810"],["0","0","4","96","558","1188","810"],["0","0","0","18","153","432","405"],["0","0","0","0","9","54","81"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["0","0","0","3","9","-27","-81","0"],["0","0","0","21","99","27","-243","0"],["0","0","0","57","369","702","405","243"],["0","0","0","75","657","2052","2673","1215"],["0","0","0","48","612","2646","4536","2430"],["0","0","0","12","288","1674","3564","2430"],["0","0","0","0","54","459","1296","1215"],["0","0","0","0","0","27","162","243"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["0","0","0","0","1","3","-9","-27","0"],["0","0","0","0","7","33","9","-81","0"],["0","0","0","0","19","123","234","135","81"],["0","0","0","0","25","219","684","891","405"],["0","0","0","0","16","204","882","1512","810"],["0","0","0","0","4","96","558","1188","810"],["0","0","0","0","0","18","153","432","405"],["0","0","0","0","0","0","9","54","81"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","0","0"],["0","0","0"],["0","1","3"],["0","2","6"],["0","1","3"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0"],["0","0","0","0"],["0","0","-18","-54"],["0","0","-57","-171"],["0","0","-66","-198"],["0","0","-33","-99"],["0","0","-6","-18"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","6","36","54"],["0","0","25","150","225"],["0","0","35","210","315"],["0","0","20","120","180"],["0","0","4","24","36"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","-6","-36","-54"],["0","0","-37","-222","-333"],["0","0","-85","-510","-765"],["0","0","-90","-540","-810"],["0","0","-44","-264","-396"],["0","0","-8","-48","-72"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-3"],["3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1","6"],["-2","-6"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","1","3"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["0","0","0","0","21","135","243","81"],["0","0","0","0","162","1062","1998","810"],["0","0","0","0","543","3636","7155","3402"],["0","0","0","0","993","6840","14229","7938"],["0","0","0","0","1026","7380","16578","11016"],["0","0","0","0","561","4365","11043","8991"],["0","0","0","0","126","1197","3780","3969"],["0","0","0","0","0","81","486","729"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","9","63","135","81"],["0","0","0","0","0","69","495","1107","729"],["0","0","0","0","0","231","1701","3969","2835"],["0","0","0","0","0","423","3231","7965","6237"],["0","0","0","0","0","438","3546","9450","8262"],["0","0","0","0","0","240","2160","6480","6480"],["0","0","0","0","0","54","630","2322","2754"],["0","0","0","0","0","0","54","324","486"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","0"],["0","0","0","0","0"],["0","0","1","6","9"],["0","0","3","18","27"],["0","0","3","18","27"],["0","0","1","6","9"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","0"],["0","0","0","0","0"],["0","0","6","36","54"],["0","0","33","198","297"],["0","0","69","414","621"],["0","0","69","414","621"],["0","0","33","198","297"],["0","0","6","36","54"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","0","0","0"],["0","0","-2","-12","-18","0"],["0","0","-13","-90","-189","-108"],["0","0","-32","-246","-612","-486"],["0","0","-37","-306","-837","-756"],["0","0","-20","-174","-504","-486"],["0","0","-4","-36","-108","-108"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["0","0","0","2","18","54","54"],["0","0","0","9","81","243","243"],["0","0","0","14","126","378","378"],["0","0","0","9","81","243","243"],["0","0","0","2","18","54","54"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","0","0","0"],["0","0","2","12","18","0"],["0","0","17","108","189","54"],["0","0","58","393","792","405"],["0","0","101","729","1647","1107"],["0","0","94","717","1764","1377"],["0","0","44","351","918","783"],["0","0","8","66","180","162"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["0","0","0","-2","-18","-54","-54"],["0","0","0","-13","-117","-351","-351"],["0","0","0","-32","-288","-864","-864"],["0","0","0","-37","-333","-999","-999"],["0","0","0","-20","-180","-540","-540"],["0","0","0","-4","-36","-108","-108"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","1","6","9"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","0"],["0","0","27"],["0","0","18"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","-12"],["-16","-24"],["-8","-12"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["2"],["5"],["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 + (2) theta + (1) theta^2; so the candidate rows satisfy the input rule at every base n >= 1 (the exceptional bases checked exactly), and agreement on the 2 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":2,"justification":"the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 2; T = f(n, theta) = 1 + (2) theta + (1) theta^2 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 >= 2","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, 2, 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":2,"justification":{"premises":["the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 2; T = f(n, theta) = 1 + (2) theta + (1) theta^2 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 >= 2"],"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 + (2) theta + (1) theta^2","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-3"],["2"]]},"terms":[{"coeff":{"coeffs":[["0","0","-18"],["0","0","45"],["0","0","-18"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6","12"],["-16","-24"],["8","12"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (2) theta + (1) theta^2, 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":2,"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 = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0); the rule is applied from n = 3 on in the induction (start moved 1 row(s) past the supplied seeds; P_0, ..., P_2 enter as seed rows, checked exactly)"},"hypotheses":[{"evidence":"f(n) = 2 n^2 - 3 n != 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of f(n) = 2 n^2 - 3 n at n = 3 + u have one sign)","name":"left_factor_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["9","9","2"]},"numerator":["0","-3","2"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"the left-hand factor f(n) is nonzero for every n >= 3","status":{"kind":"verified"}},{"evidence":"f(n) a_n = 8 n^2 - 16 n + 6 != 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 8 n^2 - 16 n + 6 at n = 3 + u have one sign)","name":"leading_coefficient_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["30","32","8"]},"numerator":["6","-16","8"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"a_n != 0 for every n >= 3","status":{"kind":"verified"}},{"evidence":"Q_1 has degree 0, Q_2 degree 1; simple real roots and strict interlacing checked exactly","name":"seeds_interlace","statement":"Q_1 and Q_2 have simple real roots, degrees e and e + 1, and Q_1 strictly interlaces Q_2","status":{"kind":"verified"}},{"evidence":"beta_3 = 1/2 (exact)","name":"first_coefficient_positive","statement":"beta_3 = c_3 L_1 / (a_3 L_2) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = (9/16 n^4 - 27/8 n^3 + 441/64 n^2 - 351/64 n + 45/32)/(n^4 - 6 n^3 + 25/2 n^2 - 21/2 n + 45/16) > 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of beta_n = (9/16 n^4 - 27/8 n^3 + 441/64 n^2 - 351/64 n + 45/32)/(n^4 - 6 n^3 + 25/2 n^2 - 21/2 n + 45/16) at n = 4 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["45/16","-21/2","25/2","-6","1"],"method":{"kind":"taylor_shift","shifted_denominator":["525/16","115/2","73/2","10","1"],"shifted_numerator":["567/32","2025/64","1305/64","45/8","9/16"]},"numerator":["45/32","-351/64","441/64","-27/8","9/16"],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"beta_n = c_n / (a_n a_(n-1)) > 0 for every n >= 4","status":{"kind":"verified"}},{"evidence":"checked exactly for P_0, ..., P_0","name":"earlier_seeds","statement":"the seed rows P_0, ..., P_0 are nonzero and real-rooted with every root in (-inf, 0)","status":{"kind":"verified"}},{"evidence":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = (3/4 n^2)/(n^2 - 3/2 n + 1/2) (the exact ratio r_n): g(n) > 0 for n >= 3, r_3 >= g(3) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 4 + u have one sign)","name":"root_upper_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["135/128","-1539/128","7659/128","-21901/128","19925/64","-12057/32","4917/16","-1335/8","231/4","-23/2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["3472875/128","12932325/128","21469455/128","20946579/128","6655661/64","1440279/32","215085/16","21897/8","1455/4","57/2","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"every root of Q_n is < 0 for every n >= 1 (region (-inf, 0) for P)","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 3, with a_n = (4 n^2 - 8 n + 3)/(n^2 - 3/2 n), b_n = (6 n^2 - 12 n + 6)/(n^2 - 3/2 n), c_n = (9 n^2 - 45/2 n + 9)/(n^2 - 3/2 n); Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_1 + n - 1, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-3"],["2"]]},"terms":[{"coeff":{"coeffs":[["0","0","-18"],["0","0","45"],["0","0","-18"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6","12"],["-16","-24"],["8","12"]]},"deriv_order":0,"offset":1,"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","start_delay":1,"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":"not applicable: expected one nonzero lag term","route":"product_recurrence","success":false,"variant":"product_recurrence"},{"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":"induction start moved 1 row(s) past the seeds: P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 3, with a_n = (4 n^2 - 8 n + 3)/(n^2 - 3/2 n), b_n = (6 n^2 - 12 n + 6)/(n^2 - 3/2 n), c_n = (9 n^2 - 45/2 n + 9)/(n^2 - 3/2 n); Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_1 + n - 1, 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 = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0); the rule is applied from n = 3 on in the induction (start moved 1 row(s) past the supplied seeds; P_0, ..., P_2 enter as seed rows, checked exactly)","route":"three_term_recurrence","success":true,"variant":"three_term_recurrence"}],"conditional_on":[],"interlacing":{"from_index":2,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 3, with a_n = (4 n^2 - 8 n + 3)/(n^2 - 3/2 n), b_n = (6 n^2 - 12 n + 6)/(n^2 - 3/2 n), c_n = (9 n^2 - 45/2 n + 9)/(n^2 - 3/2 n); Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_1 + n - 1, 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 = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0); the rule is applied from n = 3 on in the induction (start moved 1 row(s) past the supplied seeds; P_0, ..., P_2 enter as seed rows, checked exactly)"],"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 + (2) theta + (1) theta^2 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"}