{"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"],["4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle of coefficients of Chebyshev's S(n,x+4) polynomials (exponents of x in increasing order)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-4608","-4992","448","992","152","-8"],["-2304","-4512","2240","2088","260","-28"],["0","-1008","1968","1460","116","-38"],["0","0","480","380","-20","-25"],["0","0","0","24","-24","-8"],["0","0","0","0","-4","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6912","-20736","-8640","8896","4896","504","-40"],["0","-6912","-1440","17664","8616","636","-132"],["0","0","1008","9552","4732","12","-166"],["0","0","0","1440","852","-252","-99"],["0","0","0","0","24","-104","-28"],["0","0","0","0","0","-12","-3"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-8640","-13248","2928","9888","3392","212","-28"],["0","0","-2304","10608","15920","5028","80","-88"],["0","0","0","4032","6528","1900","-304","-103"],["0","0","0","0","480","20","-260","-55"],["0","0","0","0","0","-36","-64","-13"],["0","0","0","0","0","0","-4","-1"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","-1728","-1728","1584","1888","480","12","-4"],["0","0","0","0","3024","2736","588","-36","-12"],["0","0","0","0","1008","912","88","-84","-13"],["0","0","0","0","0","0","-72","-48","-6"],["0","0","0","0","0","0","-12","-8","-1"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["1152","96","-208","-40","2"],["1152","96","-688","-120","10"],["0","0","-720","-120","20"],["0","0","-240","-40","20"],["0","0","0","0","10"],["0","0","0","0","2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","3456","288","-624","-120","6"],["0","3456","288","-2064","-360","30"],["0","0","0","-2160","-360","60"],["0","0","0","-720","-120","60"],["0","0","0","0","0","30"],["0","0","0","0","0","6"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","1152","96","-208","-40","2"],["0","0","1152","96","-688","-120","10"],["0","0","0","0","-720","-120","20"],["0","0","0","0","-240","-40","20"],["0","0","0","0","0","0","10"],["0","0","0","0","0","0","2"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0","0","0"],["1152","96","32","0","0"],["0","0","0","0","0"],["0","0","-240","-40","0"],["0","0","0","0","0"],["0","0","0","0","2"]]},"terms":[{"coeff":{"coeffs":[["2304","1488","304","-8","-8","0"],["2304","2496","256","-212","-44","0"],["0","1008","-528","-464","-72","1"],["0","0","-480","-284","-36","3"],["0","0","0","-24","4","3"],["0","0","0","0","4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1728","1728","432","-64","-40","-4","0"],["0","0","-1008","-912","-244","-20","0"],["0","0","-1008","-912","-232","-12","1"],["0","0","0","0","24","16","2"],["0","0","0","0","12","8","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["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"],["4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"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":[["-8","-2"],["-4","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-12","-8","-1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["663552","940032","359424","-75264","-92032","-25472","-2688","-32","8"],["1990656","2820096","801792","-640512","-501888","-129152","-12288","96","56"],["1990656","2820096","110592","-1677312","-1061760","-254848","-20032","1088","168"],["663552","940032","-884736","-1941504","-1089664","-238208","-10432","2880","280"],["0","0","-691200","-1036800","-535680","-93440","7040","3680","280"],["0","0","-138240","-207360","-91008","2816","11264","2528","168"],["0","0","0","0","8064","10752","4928","896","56"],["0","0","0","0","1152","1536","704","128","8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","1990656","2820096","1078272","-225792","-276096","-76416","-8064","-96","24"],["0","5971968","8460288","2405376","-1921536","-1505664","-387456","-36864","288","168"],["0","5971968","8460288","331776","-5031936","-3185280","-764544","-60096","3264","504"],["0","1990656","2820096","-2654208","-5824512","-3268992","-714624","-31296","8640","840"],["0","0","0","-2073600","-3110400","-1607040","-280320","21120","11040","840"],["0","0","0","-414720","-622080","-273024","8448","33792","7584","504"],["0","0","0","0","0","24192","32256","14784","2688","168"],["0","0","0","0","0","3456","4608","2112","384","24"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","663552","940032","359424","-75264","-92032","-25472","-2688","-32","8"],["0","0","1990656","2820096","801792","-640512","-501888","-129152","-12288","96","56"],["0","0","1990656","2820096","110592","-1677312","-1061760","-254848","-20032","1088","168"],["0","0","663552","940032","-884736","-1941504","-1089664","-238208","-10432","2880","280"],["0","0","0","0","-691200","-1036800","-535680","-93440","7040","3680","280"],["0","0","0","0","-138240","-207360","-91008","2816","11264","2528","168"],["0","0","0","0","0","0","8064","10752","4928","896","56"],["0","0","0","0","0","0","1152","1536","704","128","8"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["48","32","4"],["96","64","8"],["48","32","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["96","88","24","2"],["192","176","48","4"],["96","88","24","2"]]},"deriv_order":0},{"coeff":{"coeffs":[["-288","-384","-176","-32","-2"],["-288","-384","-176","-32","-2"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-288","-384","-176","-32","-2"],["-288","-384","-176","-32","-2"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-2"],["-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["12","3"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["12","8","1"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","1161216","1492992","1009152","652800","305280","71552","6432","-96","-32"],["0","3483648","4478976","3290112","2359296","1131264","257920","19008","-1344","-184"],["0","3483648","4478976","3787776","3124224","1533696","326016","11200","-4736","-440"],["0","1161216","1492992","1714176","1744896","862848","141440","-18240","-7488","-560"],["0","0","0","179712","290304","119808","-25856","-28320","-6048","-400"],["0","0","0","-27648","-36864","-38784","-32256","-13568","-2432","-152"],["0","0","0","0","0","-3456","-4608","-2112","-384","-24"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","497664","663552","387072","193536","87552","21504","1536","-192","-24"],["0","0","1492992","1990656","1175040","622080","292608","67840","1632","-1440","-136"],["0","0","1492992","1990656","1161216","649728","319104","59136","-9536","-4064","-320"],["0","0","497664","663552","304128","152064","74880","-17664","-24448","-5728","-400"],["0","0","0","0","-110592","-124416","-77184","-51968","-22848","-4320","-280"],["0","0","0","0","-41472","-55296","-40320","-24576","-9440","-1664","-104"],["0","0","0","0","0","0","-2304","-3072","-1408","-256","-16"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["1152","1536","704","128","8"],["3456","4608","2112","384","24"],["3456","4608","2112","384","24"],["1152","1536","704","128","8"]]},"step_quotients":[[{"coeff":{"coeffs":[["-1728","-2304","-1056","-192","-12"],["-5760","-7680","-3520","-640","-40"],["-6912","-9216","-4224","-768","-48"],["-3456","-4608","-2112","-384","-24"],["-576","-768","-352","-64","-4"]]},"deriv_order":0},{"coeff":{"coeffs":[["6912","10944","6528","1824","240","12"],["13824","21888","13056","3648","480","24"],["6912","10944","6528","1824","240","12"]]},"deriv_order":1},{"coeff":{"coeffs":[["6912","13824","10944","4352","912","96","4"],["13824","27648","21888","8704","1824","192","8"],["6912","13824","10944","4352","912","96","4"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["9216","14592","8704","2432","320","16"],["20736","32832","19584","5472","720","36"],["13824","21888","13056","3648","480","24"],["2304","3648","2176","608","80","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["6912","13824","10944","4352","912","96","4"],["13824","27648","21888","8704","1824","192","8"],["6912","13824","10944","4352","912","96","4"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1152","1536","704","128","8"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["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 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 >= 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 + (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 >= 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, 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":1,"justification":{"premises":["the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 1; 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 >= 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 + (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"],["4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"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 + (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":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) a_n = 1 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 1 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":["1"]},"numerator":["1"],"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 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = 1 > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = 1 at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["1"]},"numerator":["1"],"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) = 2 ((t - alpha_n)/2): 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":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["3/2"]},"numerator":["3/2"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"every root of P_n is < 0 for every n >= 0 (region (-inf, 0) for P)","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n x + b_n) P_(n-1) - c_n P_(n-2) for n >= 2, with a_n = 1, b_n = 4, c_n = 1","recurrence":{"first_index":0,"initial_polynomials":[["1"],["4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"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 rule is not P_(n+k) = c(x) P_n with c free of n","route":"periodic_product","success":false,"variant":"P_(n+k) = c(x) P_n"},{"detail":"no theorem matched (weighted_renewal_window: coefficient of P_(n-1) must be 1 after normalization; fixed_delay_predecessor_window: coefficient of P_(n-1) must be 1 (+ w(n) t) after normalization)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"P_n = (a_n x + b_n) P_(n-1) - c_n P_(n-2) for n >= 2, with a_n = 1, b_n = 4, c_n = 1: 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 x + b_n) P_(n-1) - c_n P_(n-2) for n >= 2, with a_n = 1, b_n = 4, c_n = 1","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 + (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"}