{"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"],["1","12","20","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-45","129","804","-384"],["-18","341","640","-704"],["0","165","37","-504"],["0","22","-86","-176"],["0","0","-25","-30"],["0","0","-2","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-279","1819","2140","-1664"],["0","-54","2079","912","-2880"],["0","0","671","-633","-1928"],["0","0","66","-450","-624"],["0","0","0","-91","-98"],["0","0","0","-6","-6"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-225","1919","464","-1024"],["0","0","-18","1661","-620","-1664"],["0","0","0","385","-893","-1024"],["0","0","0","22","-326","-296"],["0","0","0","0","-45","-40"],["0","0","0","0","-2","-2"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","-36","358","-68","-128"],["0","0","0","0","264","-252","-192"],["0","0","0","0","44","-186","-104"],["0","0","0","0","0","-48","-24"],["0","0","0","0","0","-4","-2"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["45","-345","180"],["18","-413","372"],["0","-165","305"],["0","-22","124"],["0","0","25"],["0","0","2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","135","-1035","540"],["0","54","-1239","1116"],["0","0","-495","915"],["0","0","-66","372"],["0","0","0","75"],["0","0","0","6"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","45","-345","180"],["0","0","18","-413","372"],["0","0","0","-165","305"],["0","0","0","-22","124"],["0","0","0","0","25"],["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","24","36"]],"recurrence":{"denominator":{"coeffs":[["27","-75","12"],["18","-149","44"],["0","-99","63"],["0","-22","44"],["0","0","15"],["0","0","2"]]},"terms":[{"coeff":{"coeffs":[["27","69","-264","36"],["18","-77","-398","114"],["0","-99","-165","136"],["0","-22","6","76"],["0","0","15","20"],["0","0","2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","36","-138","-42","18"],["0","0","-176","8","48"],["0","0","-44","66","44"],["0","0","0","32","16"],["0","0","0","4","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["125/8","75/4","15/2","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"],["1","12","20","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"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":[["-5","-6"],["-2","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-4","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["5"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","4500","-30000","-15375","9375","4500"],["0","0","5400","-63500","-15950","34375","12900"],["0","0","2160","-52900","8620","49375","15785"],["0","0","288","-21720","20816","37250","10688"],["0","0","0","-4400","12900","16200","4325"],["0","0","0","-352","3832","4096","1046"],["0","0","0","0","560","560","140"],["0","0","0","0","32","32","8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","13500","-90000","-46125","28125","13500"],["0","0","0","16200","-190500","-47850","103125","38700"],["0","0","0","6480","-158700","25860","148125","47355"],["0","0","0","864","-65160","62448","111750","32064"],["0","0","0","0","-13200","38700","48600","12975"],["0","0","0","0","-1056","11496","12288","3138"],["0","0","0","0","0","1680","1680","420"],["0","0","0","0","0","96","96","24"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","4500","-30000","-15375","9375","4500"],["0","0","0","0","5400","-63500","-15950","34375","12900"],["0","0","0","0","2160","-52900","8620","49375","15785"],["0","0","0","0","288","-21720","20816","37250","10688"],["0","0","0","0","0","-4400","12900","16200","4325"],["0","0","0","0","0","-352","3832","4096","1046"],["0","0","0","0","0","0","560","560","140"],["0","0","0","0","0","0","32","32","8"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","50","25"],["0","40","20"],["0","8","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","70","95","30"],["0","48","68","22"],["0","8","12","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-40","-40","-10"],["0","0","-16","-16","-4"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-80","-80","-20"],["0","0","-32","-32","-8"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["-6"],["-5"],["-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","2","1"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","56000","16000","-26000","-10000"],["0","0","0","0","92200","-7800","-76950","-25000"],["0","0","0","0","56880","-46720","-89380","-25900"],["0","0","0","0","15584","-41336","-53024","-14230"],["0","0","0","0","1600","-15888","-17088","-4372"],["0","0","0","0","0","-2848","-2848","-712"],["0","0","0","0","0","-192","-192","-48"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","25000","-3000","-21750","-7000"],["0","0","0","0","0","41000","-28600","-59350","-17400"],["0","0","0","0","0","25200","-46440","-65340","-17910"],["0","0","0","0","0","6880","-32192","-37352","-9768"],["0","0","0","0","0","704","-11200","-11728","-2976"],["0","0","0","0","0","0","-1920","-1920","-480"],["0","0","0","0","0","0","-128","-128","-32"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","500","500","125"],["0","0","600","600","150"],["0","0","240","240","60"],["0","0","32","32","8"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","-1200","-1200","-300"],["0","0","-1660","-1660","-415"],["0","0","-852","-852","-213"],["0","0","-192","-192","-48"],["0","0","-16","-16","-4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","100","300","225","50"],["0","0","80","240","180","40"],["0","0","16","48","36","8"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","200","300","150","25"],["0","0","0","160","240","120","20"],["0","0","0","32","48","24","4"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","900","1900","1225","250"],["0","0","920","1920","1230","250"],["0","0","304","624","396","80"],["0","0","32","64","40","8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","400","600","300","50"],["0","0","0","320","480","240","40"],["0","0","0","64","96","48","8"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","32","32","8"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","-2"]]},"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"],["1","12","20","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"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 = 2 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 2 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":["2"]},"numerator":["2"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"a_n != 0 for every n >= 2","status":{"kind":"verified"}},{"evidence":"Q_0 has degree 2, Q_1 degree 3; 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/4 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = 1/4 > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = 1/4 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/4"]},"numerator":["1/4"],"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/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":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":[]},"numerator":[],"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 = 2, b_n = 2, c_n = 1","recurrence":{"first_index":0,"initial_polynomials":[["1","6","4"],["1","12","20","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"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 = 2, b_n = 2, 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 = 2, b_n = 2, 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"}