{"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","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013610 of A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-512","-1664","448","2976","1368","-216"],["-256","-1504","2240","6264","2340","-756"],["0","-336","1968","4380","1044","-1026"],["0","0","480","1140","-180","-675"],["0","0","0","72","-216","-216"],["0","0","0","0","-36","-27"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-256","-2304","-2880","8896","14688","4536","-1080"],["0","-768","-480","17664","25848","5724","-3564"],["0","0","336","9552","14196","108","-4482"],["0","0","0","1440","2556","-2268","-2673"],["0","0","0","0","72","-936","-756"],["0","0","0","0","0","-108","-81"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-320","-1472","976","9888","10176","1908","-756"],["0","0","-256","3536","15920","15084","720","-2376"],["0","0","0","1344","6528","5700","-2736","-2781"],["0","0","0","0","480","60","-2340","-1485"],["0","0","0","0","0","-108","-576","-351"],["0","0","0","0","0","0","-36","-27"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","-64","-192","528","1888","1440","108","-108"],["0","0","0","0","1008","2736","1764","-324","-324"],["0","0","0","0","336","912","264","-756","-351"],["0","0","0","0","0","0","-216","-432","-162"],["0","0","0","0","0","0","-36","-72","-27"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["128","32","-208","-120","18"],["128","32","-688","-360","90"],["0","0","-720","-360","180"],["0","0","-240","-120","180"],["0","0","0","0","90"],["0","0","0","0","18"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","384","96","-624","-360","54"],["0","384","96","-2064","-1080","270"],["0","0","0","-2160","-1080","540"],["0","0","0","-720","-360","540"],["0","0","0","0","0","270"],["0","0","0","0","0","54"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","128","32","-208","-120","18"],["0","0","128","32","-688","-360","90"],["0","0","0","0","-720","-360","180"],["0","0","0","0","-240","-120","180"],["0","0","0","0","0","0","90"],["0","0","0","0","0","0","18"]]},"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"],["128","32","32","0","0"],["0","0","0","0","0"],["0","0","-240","-120","0"],["0","0","0","0","0"],["0","0","0","0","18"]]},"terms":[{"coeff":{"coeffs":[["256","496","304","-24","-72","0"],["256","832","256","-636","-396","0"],["0","336","-528","-1392","-648","27"],["0","0","-480","-852","-324","81"],["0","0","0","-72","36","81"],["0","0","0","0","36","27"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["64","192","144","-64","-120","-36","0"],["0","0","-336","-912","-732","-180","0"],["0","0","-336","-912","-696","-108","27"],["0","0","0","0","72","144","54"],["0","0","0","0","36","72","27"]]},"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","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","3"]]},"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":[["-8","-6"],["-4","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-8","-3"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["8192","34816","39936","-25088","-92032","-76416","-24192","-864","648"],["24576","104448","89088","-213504","-501888","-387456","-110592","2592","4536"],["24576","104448","12288","-559104","-1061760","-764544","-180288","29376","13608"],["8192","34816","-98304","-647168","-1089664","-714624","-93888","77760","22680"],["0","0","-76800","-345600","-535680","-280320","63360","99360","22680"],["0","0","-15360","-69120","-91008","8448","101376","68256","13608"],["0","0","0","0","8064","32256","44352","24192","4536"],["0","0","0","0","1152","4608","6336","3456","648"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","24576","104448","119808","-75264","-276096","-229248","-72576","-2592","1944"],["0","73728","313344","267264","-640512","-1505664","-1162368","-331776","7776","13608"],["0","73728","313344","36864","-1677312","-3185280","-2293632","-540864","88128","40824"],["0","24576","104448","-294912","-1941504","-3268992","-2143872","-281664","233280","68040"],["0","0","0","-230400","-1036800","-1607040","-840960","190080","298080","68040"],["0","0","0","-46080","-207360","-273024","25344","304128","204768","40824"],["0","0","0","0","0","24192","96768","133056","72576","13608"],["0","0","0","0","0","3456","13824","19008","10368","1944"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","8192","34816","39936","-25088","-92032","-76416","-24192","-864","648"],["0","0","24576","104448","89088","-213504","-501888","-387456","-110592","2592","4536"],["0","0","24576","104448","12288","-559104","-1061760","-764544","-180288","29376","13608"],["0","0","8192","34816","-98304","-647168","-1089664","-714624","-93888","77760","22680"],["0","0","0","0","-76800","-345600","-535680","-280320","63360","99360","22680"],["0","0","0","0","-15360","-69120","-91008","8448","101376","68256","13608"],["0","0","0","0","0","0","8064","32256","44352","24192","4536"],["0","0","0","0","0","0","1152","4608","6336","3456","648"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["16","32","12"],["32","64","24"],["16","32","12"]]},"step_quotients":[[{"coeff":{"coeffs":[["32","88","72","18"],["64","176","144","36"],["32","88","72","18"]]},"deriv_order":0},{"coeff":{"coeffs":[["-32","-128","-176","-96","-18"],["-32","-128","-176","-96","-18"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-32","-128","-176","-96","-18"],["-32","-128","-176","-96","-18"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-6"],["-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["12","9"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["4","8","3"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","14336","55296","112128","217600","305280","214656","57888","-2592","-2592"],["0","43008","165888","365568","786432","1131264","773760","171072","-36288","-14904"],["0","43008","165888","420864","1041408","1533696","978048","100800","-127872","-35640"],["0","14336","55296","190464","581632","862848","424320","-164160","-202176","-45360"],["0","0","0","19968","96768","119808","-77568","-254880","-163296","-32400"],["0","0","0","-3072","-12288","-38784","-96768","-122112","-65664","-12312"],["0","0","0","0","0","-3456","-13824","-19008","-10368","-1944"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","6144","24576","43008","64512","87552","64512","13824","-5184","-1944"],["0","0","18432","73728","130560","207360","292608","203520","14688","-38880","-11016"],["0","0","18432","73728","129024","216576","319104","177408","-85824","-109728","-25920"],["0","0","6144","24576","33792","50688","74880","-52992","-220032","-154656","-32400"],["0","0","0","0","-12288","-41472","-77184","-155904","-205632","-116640","-22680"],["0","0","0","0","-4608","-18432","-40320","-73728","-84960","-44928","-8424"],["0","0","0","0","0","0","-2304","-9216","-12672","-6912","-1296"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["128","512","704","384","72"],["384","1536","2112","1152","216"],["384","1536","2112","1152","216"],["128","512","704","384","72"]]},"step_quotients":[[{"coeff":{"coeffs":[["-576","-2304","-3168","-1728","-324"],["-1920","-7680","-10560","-5760","-1080"],["-2304","-9216","-12672","-6912","-1296"],["-1152","-4608","-6336","-3456","-648"],["-192","-768","-1056","-576","-108"]]},"deriv_order":0},{"coeff":{"coeffs":[["768","3648","6528","5472","2160","324"],["1536","7296","13056","10944","4320","648"],["768","3648","6528","5472","2160","324"]]},"deriv_order":1},{"coeff":{"coeffs":[["256","1536","3648","4352","2736","864","108"],["512","3072","7296","8704","5472","1728","216"],["256","1536","3648","4352","2736","864","108"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["1024","4864","8704","7296","2880","432"],["2304","10944","19584","16416","6480","972"],["1536","7296","13056","10944","4320","648"],["256","1216","2176","1824","720","108"]]},"deriv_order":0},{"coeff":{"coeffs":[["256","1536","3648","4352","2736","864","108"],["512","3072","7296","8704","5472","1728","216"],["256","1536","3648","4352","2736","864","108"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["128","512","704","384","72"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-3"]]},"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","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","3"]]},"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 = 3 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 3 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":["3"]},"numerator":["3"],"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/9 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = 1/9 > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = 1/9 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/9"]},"numerator":["1/9"],"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/3 ((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":["1/2"]},"numerator":["1/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 = 3, b_n = 4, c_n = 1","recurrence":{"first_index":0,"initial_polynomials":[["1"],["4","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","3"]]},"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 = 3, 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 = 3, 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"}