{"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":1,"initial_polynomials":[["1"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-8","8"],["-1","4","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","-2"],["6","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013609 of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= k <= n)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-16","80","-128","64","0","0"],["-20","112","176","-400","64","-64"],["0","72","456","-568","-736","-288"],["0","0","168","-520","-1424","-640"],["0","0","0","-208","-704","-448"],["0","0","0","0","-80","-96"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","0","224","-640","256","256","256"],["0","-12","392","-80","-1712","1856","960"],["0","0","264","824","-2408","-32","1184"],["0","0","0","312","-1880","-3504","-640"],["0","0","0","0","-688","-2112","-1088"],["0","0","0","0","0","-240","-288"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-5","44","60","-448","144","320","320"],["0","0","40","182","-584","-1040","2144","1376"],["0","0","0","132","-224","-1448","1984","2272"],["0","0","0","0","-72","-920","-464","960"],["0","0","0","0","0","-288","-704","-128"],["0","0","0","0","0","0","-80","-96"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","-1","12","-4","-64","16","64","64"],["0","0","0","12","14","-152","-128","416","288"],["0","0","0","0","12","-136","-176","544","512"],["0","0","0","0","0","-48","-80","192","320"],["0","0","0","0","0","0","-16","0","64"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["8","-40","64","-32","0"],["4","-60","80","-16","0"],["0","-20","-24","128","32"],["0","0","-24","160","80"],["0","0","0","48","64"],["0","0","0","0","16"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","24","-120","192","-96","0"],["0","12","-180","240","-48","0"],["0","0","-60","-72","384","96"],["0","0","0","-72","480","240"],["0","0","0","0","144","192"],["0","0","0","0","0","48"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","8","-40","64","-32","0"],["0","0","4","-60","80","-16","0"],["0","0","0","-20","-24","128","32"],["0","0","0","0","-24","160","80"],["0","0","0","0","0","48","64"],["0","0","0","0","0","0","16"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["4","0","-16","0","0"],["4","-20","56","16","0"],["0","-20","48","-64","16"],["0","0","-24","-32","-16"],["0","0","0","48","-16"],["0","0","0","0","16"]]},"terms":[{"coeff":{"coeffs":[["-4","-40","16","-208","0","-64"],["20","32","232","-8","320","96"],["0","-72","48","256","-112","96"],["0","0","-168","-312","-592","-192"],["0","0","0","208","304","-32"],["0","0","0","0","80","96"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","0","6","0","-32","0","-32"],["0","-12","10","24","-48","96","32"],["0","0","-12","-8","32","32","64"],["0","0","0","48","16","-192","-64"],["0","0","0","0","16","0","-64"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["8","12","6","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-8","8"],["-1","4","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","-2"],["6","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":1,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["-4","0"],["-5","-6"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","0","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["32","-160","0","1152","-1536","-1536","4096","-2048","0"],["48","-400","192","3008","-3840","-4864","9216","-3072","0"],["24","-360","96","3296","-1792","-9088","3584","6656","2048"],["4","-140","-144","2256","1408","-11328","-5376","18176","7168"],["0","-20","-120","1120","1568","-8000","-6784","15360","9728"],["0","0","-24","352","592","-2816","-3584","5632","6400"],["0","0","0","48","128","-384","-1024","768","2048"],["0","0","0","0","16","0","-128","0","256"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","96","-480","0","3456","-4608","-4608","12288","-6144","0"],["0","144","-1200","576","9024","-11520","-14592","27648","-9216","0"],["0","72","-1080","288","9888","-5376","-27264","10752","19968","6144"],["0","12","-420","-432","6768","4224","-33984","-16128","54528","21504"],["0","0","-60","-360","3360","4704","-24000","-20352","46080","29184"],["0","0","0","-72","1056","1776","-8448","-10752","16896","19200"],["0","0","0","0","144","384","-1152","-3072","2304","6144"],["0","0","0","0","0","48","0","-384","0","768"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","32","-160","0","1152","-1536","-1536","4096","-2048","0"],["0","0","48","-400","192","3008","-3840","-4864","9216","-3072","0"],["0","0","24","-360","96","3296","-1792","-9088","3584","6656","2048"],["0","0","4","-140","-144","2256","1408","-11328","-5376","18176","7168"],["0","0","0","-20","-120","1120","1568","-8000","-6784","15360","9728"],["0","0","0","0","-24","352","592","-2816","-3584","5632","6400"],["0","0","0","0","0","48","128","-384","-1024","768","2048"],["0","0","0","0","0","0","16","0","-128","0","256"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["-4","0","16"],["-4","0","16"],["-1","0","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0"],["-6","12","24","-48"],["-5","10","20","-40"],["-1","2","4","-8"]]},"deriv_order":0},{"coeff":{"coeffs":[["6","0","-48","0","96"],["5","0","-40","0","80"],["1","0","-8","0","16"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-6","0","48","0","-96"],["-5","0","40","0","-80"],["-1","0","8","0","-16"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-4"],["4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","8"],["-4","-8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-1","0","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","-56","96","-128","-128","3840","-3584","-10240","10240","2048"],["0","-84","240","-1296","1024","15296","-19712","-38656","47104","14336"],["0","-42","216","-1688","3072","17888","-34944","-51328","76800","37888"],["0","-7","84","-748","2912","9264","-27328","-36416","57344","47104"],["0","0","12","-90","1160","2584","-9856","-16352","20096","29824"],["0","0","0","8","168","520","-1344","-4544","2688","9344"],["0","0","0","0","0","72","0","-576","0","1152"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-24","64","0","-256","1280","-1024","-4096","4096","2048"],["0","0","-36","160","-304","-64","4928","-7168","-15616","19456","12288"],["0","0","-18","144","-360","864","5600","-13824","-22912","32256","29696"],["0","0","-3","56","-84","1072","2992","-11264","-19136","24320","34816"],["0","0","0","8","34","472","1048","-4160","-10016","8576","21120"],["0","0","0","0","12","72","304","-576","-3008","1152","6400"],["0","0","0","0","0","0","48","0","-384","0","768"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["8","0","-64","0","128"],["12","0","-96","0","192"],["6","0","-48","0","96"],["1","0","-8","0","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["48","0","-384","0","768"],["112","0","-896","0","1792"],["92","0","-736","0","1472"],["32","0","-256","0","512"],["4","0","-32","0","64"]]},"deriv_order":0},{"coeff":{"coeffs":[["-96","0","768","0","-1536","0"],["-176","-96","1408","768","-2816","-1536"],["-120","-128","960","1024","-1920","-2048"],["-36","-56","288","448","-576","-896"],["-4","-8","32","64","-64","-128"]]},"deriv_order":1},{"coeff":{"coeffs":[["-12","0","144","0","-576","0","768"],["-16","0","192","0","-768","0","1024"],["-7","0","84","0","-336","0","448"],["-1","0","12","0","-48","0","64"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["96","0","-768","0","1536","0"],["188","72","-1504","-576","3008","1152"],["136","96","-1088","-768","2176","1536"],["43","42","-344","-336","688","672"],["5","6","-40","-48","80","96"]]},"deriv_order":0},{"coeff":{"coeffs":[["12","0","-144","0","576","0","-768"],["16","0","-192","0","768","0","-1024"],["7","0","-84","0","336","0","-448"],["1","0","-12","0","48","0","-64"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1","0","-8","0","16"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","0"],["1","-4","4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-9","-6"],["-6","-4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["3"],["1"]]},"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 1) 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 1 identifying rows gives Q_n = lambda(n) T_n(P_(n+0)) for every n >= 1"},"method":"operator_division"},"status":"certified"},"input_first_index":1,"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 [1, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 1 + 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":"1","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":1,"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":1,"initial_polynomials":[["1"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-8","8"],["-1","4","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","-2"],["6","4"]]},"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 >= 1"},"parent_proof":{"route":"three_term_recurrence","statement":"every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 1, 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":1,"interlacing":"strict","interlacing_from":2,"root_region":{"upper":{"closed":false,"value":"0"}},"simple_roots":true,"statement":"every P_n, n >= 1, 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)"},"hypotheses":[{"evidence":"f(n) = n + 1 != 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of f(n) = n + 1 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":["4","1"]},"numerator":["1","1"],"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 - 4 != 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 8 n - 4 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":["20","8"]},"numerator":["-4","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/20 (exact)","name":"first_coefficient_positive","statement":"beta_3 = c_3 L_1 / (a_3 L_2) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = (1/16 n^2 - 1/8 n)/(n^2 - 2 n + 3/4) > 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of beta_n = (1/16 n^2 - 1/8 n)/(n^2 - 2 n + 3/4) at n = 4 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["3/4","-2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["35/4","6","1"],"shifted_numerator":["1/2","3/8","1/16"]},"numerator":["0","-1/8","1/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":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = (1/4 n + 1/4)/(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":["0","3/16","-5/4","3","-3","1"],"method":{"kind":"taylor_shift","shifted_denominator":["1715/4","10339/16","1547/4","115","17","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"}},{"evidence":"on the reflected rows (-1)^(deg) p_n(-y): seeds checked exactly; positive-ratio induction at t = 2 with g(n) = (3/4 n - 3/8)/(n - 1/2) ((t - alpha_n)/2): 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_lower_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["-9/32","33/16","-23/4","15/2","-9/2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["8575/32","7105/16","1169/4","191/2","31/2","1"],"shifted_numerator":["69335/384","57197/192","18761/96","3059/48","31/3","2/3"]},"numerator":["-27/128","95/64","-383/96","81/16","-3","2/3"],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"every root of Q_n is > -2 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 - 1/2)) P_(n-1) - c_n (x - 1/2)^2 P_(n-2) for n >= 3, with a_n = (8 n - 4)/(n + 1), b_n = (4 n - 2)/(n + 1), c_n = (4 n - 8)/(n + 1); Q_n(y) = y^(d_n) P_n(1/y + 1/2), 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":1,"initial_polynomials":[["1"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-8","8"],["-1","4","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","-2"],["6","4"]]},"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","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":"P_n = (a_n + b_n (x - 1/2)) P_(n-1) - c_n (x - 1/2)^2 P_(n-2) for n >= 3, with a_n = (8 n - 4)/(n + 1), b_n = (4 n - 2)/(n + 1), c_n = (4 n - 8)/(n + 1); Q_n(y) = y^(d_n) P_n(1/y + 1/2), 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 >= 1, 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)","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 - 1/2)) P_(n-1) - c_n (x - 1/2)^2 P_(n-2) for n >= 3, with a_n = (8 n - 4)/(n + 1), b_n = (4 n - 2)/(n + 1), c_n = (4 n - 8)/(n + 1); Q_n(y) = y^(d_n) P_n(1/y + 1/2), 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 >= 1, 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)"],"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 >= 1, 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 >= 1, the side conditions hold for every n, and every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 1, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}