{"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"],["6","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013611 of Triangle of coefficients of Chebyshev's S(n,x+5) polynomials (exponents of x in increasing order)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-384","-1096","234","1316","456","-64"],["-192","-996","1125","2714","780","-224"],["0","-224","984","1880","348","-304"],["0","0","240","490","-60","-200"],["0","0","0","32","-72","-64"],["0","0","0","0","-12","-8"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-256","-1728","-1800","4518","6228","1512","-320"],["0","-576","-300","8847","10878","1908","-1056"],["0","0","224","4776","5976","36","-1328"],["0","0","0","720","1086","-756","-792"],["0","0","0","0","32","-312","-224"],["0","0","0","0","0","-36","-24"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-320","-1104","764","5004","4166","636","-224"],["0","0","-192","2364","7965","6134","240","-704"],["0","0","0","896","3264","2300","-912","-824"],["0","0","0","0","240","10","-780","-440"],["0","0","0","0","0","-48","-192","-104"],["0","0","0","0","0","0","-12","-8"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","-64","-144","372","954","570","36","-32"],["0","0","0","0","672","1368","684","-108","-96"],["0","0","0","0","224","456","84","-252","-104"],["0","0","0","0","0","0","-96","-144","-48"],["0","0","0","0","0","0","-16","-24","-8"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["64","12","-71","-30","4"],["64","12","-231","-90","20"],["0","0","-240","-90","40"],["0","0","-80","-30","40"],["0","0","0","0","20"],["0","0","0","0","4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","192","36","-213","-90","12"],["0","192","36","-693","-270","60"],["0","0","0","-720","-270","120"],["0","0","0","-240","-90","120"],["0","0","0","0","0","60"],["0","0","0","0","0","12"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","64","12","-71","-30","4"],["0","0","64","12","-231","-90","20"],["0","0","0","0","-240","-90","40"],["0","0","0","0","-80","-30","40"],["0","0","0","0","0","0","20"],["0","0","0","0","0","0","4"]]},"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"],["64","12","9","0","0"],["0","0","0","0","0"],["0","0","-80","-30","0"],["0","0","0","0","0"],["0","0","0","0","4"]]},"terms":[{"coeff":{"coeffs":[["192","324","147","-24","-24","0"],["192","548","123","-296","-132","0"],["0","224","-264","-602","-216","8"],["0","0","-240","-362","-108","24"],["0","0","0","-32","12","24"],["0","0","0","0","12","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["64","144","76","-42","-50","-12","0"],["0","0","-224","-456","-292","-60","0"],["0","0","-224","-456","-276","-36","8"],["0","0","0","0","32","48","16"],["0","0","0","0","16","24","8"]]},"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"],["6","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6","4"]]},"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":[["-6","-4"],["-3","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-6","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["1024","3264","2768","-1728","-4524","-3024","-796","-24","16"],["3072","9792","5744","-13824","-24516","-15264","-3636","72","112"],["3072","9792","-656","-35424","-51620","-29976","-5924","816","336"],["1024","3264","-8752","-40608","-52748","-27816","-3084","2160","560"],["0","0","-6400","-21600","-25760","-10680","2080","2760","560"],["0","0","-1280","-4320","-4256","552","3328","1896","336"],["0","0","0","0","448","1344","1456","672","112"],["0","0","0","0","64","192","208","96","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","3072","9792","8304","-5184","-13572","-9072","-2388","-72","48"],["0","9216","29376","17232","-41472","-73548","-45792","-10908","216","336"],["0","9216","29376","-1968","-106272","-154860","-89928","-17772","2448","1008"],["0","3072","9792","-26256","-121824","-158244","-83448","-9252","6480","1680"],["0","0","0","-19200","-64800","-77280","-32040","6240","8280","1680"],["0","0","0","-3840","-12960","-12768","1656","9984","5688","1008"],["0","0","0","0","0","1344","4032","4368","2016","336"],["0","0","0","0","0","192","576","624","288","48"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","1024","3264","2768","-1728","-4524","-3024","-796","-24","16"],["0","0","3072","9792","5744","-13824","-24516","-15264","-3636","72","112"],["0","0","3072","9792","-656","-35424","-51620","-29976","-5924","816","336"],["0","0","1024","3264","-8752","-40608","-52748","-27816","-3084","2160","560"],["0","0","0","0","-6400","-21600","-25760","-10680","2080","2760","560"],["0","0","0","0","-1280","-4320","-4256","552","3328","1896","336"],["0","0","0","0","0","0","448","1344","1456","672","112"],["0","0","0","0","0","0","64","192","208","96","16"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["4","6","2"],["8","12","4"],["4","6","2"]]},"step_quotients":[[{"coeff":{"coeffs":[["12","26","18","4"],["24","52","36","8"],["12","26","18","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["-16","-48","-52","-24","-4"],["-16","-48","-52","-24","-4"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-16","-48","-52","-24","-4"],["-16","-48","-52","-24","-4"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-4"],["-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["9","6"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["4","6","2"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","1792","5184","8704","13680","14880","8424","1904","-72","-64"],["0","5376","15552","28544","49392","55008","30240","5616","-1008","-368"],["0","5376","15552","33152","65328","74272","37872","3280","-3552","-880"],["0","1792","5184","15232","36432","41376","15840","-5440","-5616","-1120"],["0","0","0","1664","6048","5376","-3672","-8400","-4536","-800"],["0","0","0","-256","-768","-2048","-4032","-4016","-1824","-304"],["0","0","0","0","0","-192","-576","-624","-288","-48"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","768","2304","3264","4032","4224","2448","432","-144","-48"],["0","0","2304","6912","9920","12960","14016","7560","384","-1080","-272"],["0","0","2304","6912","9792","13536","15008","6072","-2992","-3048","-640"],["0","0","768","2304","2496","3168","3040","-3048","-7376","-4296","-800"],["0","0","0","0","-1024","-2592","-4128","-6696","-6816","-3240","-560"],["0","0","0","0","-384","-1152","-2080","-3072","-2800","-1248","-208"],["0","0","0","0","0","0","-128","-384","-416","-192","-32"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["16","48","52","24","4"],["48","144","156","72","12"],["48","144","156","72","12"],["16","48","52","24","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["-96","-288","-312","-144","-24"],["-320","-960","-1040","-480","-80"],["-384","-1152","-1248","-576","-96"],["-192","-576","-624","-288","-48"],["-32","-96","-104","-48","-8"]]},"deriv_order":0},{"coeff":{"coeffs":[["144","528","756","528","180","24"],["288","1056","1512","1056","360","48"],["144","528","756","528","180","24"]]},"deriv_order":1},{"coeff":{"coeffs":[["64","288","528","504","264","72","8"],["128","576","1056","1008","528","144","16"],["64","288","528","504","264","72","8"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["192","704","1008","704","240","32"],["432","1584","2268","1584","540","72"],["288","1056","1512","1056","360","48"],["48","176","252","176","60","8"]]},"deriv_order":0},{"coeff":{"coeffs":[["64","288","528","504","264","72","8"],["128","576","1056","1008","528","144","16"],["64","288","528","504","264","72","8"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["16","48","52","24","4"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","-4"]]},"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"],["6","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["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 >= 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 = 4 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 4 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":["4"]},"numerator":["4"],"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/16 (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 > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = 1/16 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/16"]},"numerator":["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) = 3/4 ((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":["2/3"]},"numerator":["2/3"],"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 = 4, b_n = 6, c_n = 1","recurrence":{"first_index":0,"initial_polynomials":[["1"],["6","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["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 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":"not applicable: expected one nonzero lag term","route":"product_recurrence","success":false,"variant":"product_recurrence"},{"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 = 4, b_n = 6, 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 = 4, b_n = 6, 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"}