{"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","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013611 of A convolution triangle of numbers based on A001906 (even-indexed Fibonacci numbers)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-288","-1248","448","3968","2432","-512"],["-144","-1128","2240","8352","4160","-1792"],["0","-252","1968","5840","1856","-2432"],["0","0","480","1520","-320","-1600"],["0","0","0","96","-384","-512"],["0","0","0","0","-64","-64"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-108","-1296","-2160","8896","19584","8064","-2560"],["0","-432","-360","17664","34464","10176","-8448"],["0","0","252","9552","18928","192","-10624"],["0","0","0","1440","3408","-4032","-6336"],["0","0","0","0","96","-1664","-1792"],["0","0","0","0","0","-192","-192"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-135","-828","732","9888","13568","3392","-1792"],["0","0","-144","2652","15920","20112","1280","-5632"],["0","0","0","1008","6528","7600","-4864","-6592"],["0","0","0","0","480","80","-4160","-3520"],["0","0","0","0","0","-144","-1024","-832"],["0","0","0","0","0","0","-64","-64"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","-27","-108","396","1888","1920","192","-256"],["0","0","0","0","756","2736","2352","-576","-768"],["0","0","0","0","252","912","352","-1344","-832"],["0","0","0","0","0","0","-288","-768","-384"],["0","0","0","0","0","0","-48","-128","-64"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["72","24","-208","-160","32"],["72","24","-688","-480","160"],["0","0","-720","-480","320"],["0","0","-240","-160","320"],["0","0","0","0","160"],["0","0","0","0","32"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","216","72","-624","-480","96"],["0","216","72","-2064","-1440","480"],["0","0","0","-2160","-1440","960"],["0","0","0","-720","-480","960"],["0","0","0","0","0","480"],["0","0","0","0","0","96"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","72","24","-208","-160","32"],["0","0","72","24","-688","-480","160"],["0","0","0","0","-720","-480","320"],["0","0","0","0","-240","-160","320"],["0","0","0","0","0","0","160"],["0","0","0","0","0","0","32"]]},"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"],["72","24","32","0","0"],["0","0","0","0","0"],["0","0","-240","-160","0"],["0","0","0","0","0"],["0","0","0","0","32"]]},"terms":[{"coeff":{"coeffs":[["144","372","304","-32","-128","0"],["144","624","256","-848","-704","0"],["0","252","-528","-1856","-1152","64"],["0","0","-480","-1136","-576","192"],["0","0","0","-96","64","192"],["0","0","0","0","64","64"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["27","108","108","-64","-160","-64","0"],["0","0","-252","-912","-976","-320","0"],["0","0","-252","-912","-928","-192","64"],["0","0","0","0","96","256","128"],["0","0","0","0","48","128","64"]]},"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","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","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":[["-8","-8"],["-4","-4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-3","-8","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["2592","14688","22464","-18816","-92032","-101888","-43008","-2048","2048"],["7776","44064","50112","-160128","-501888","-516608","-196608","6144","14336"],["7776","44064","6912","-419328","-1061760","-1019392","-320512","69632","43008"],["2592","14688","-55296","-485376","-1089664","-952832","-166912","184320","71680"],["0","0","-43200","-259200","-535680","-373760","112640","235520","71680"],["0","0","-8640","-51840","-91008","11264","180224","161792","43008"],["0","0","0","0","8064","43008","78848","57344","14336"],["0","0","0","0","1152","6144","11264","8192","2048"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","7776","44064","67392","-56448","-276096","-305664","-129024","-6144","6144"],["0","23328","132192","150336","-480384","-1505664","-1549824","-589824","18432","43008"],["0","23328","132192","20736","-1257984","-3185280","-3058176","-961536","208896","129024"],["0","7776","44064","-165888","-1456128","-3268992","-2858496","-500736","552960","215040"],["0","0","0","-129600","-777600","-1607040","-1121280","337920","706560","215040"],["0","0","0","-25920","-155520","-273024","33792","540672","485376","129024"],["0","0","0","0","0","24192","129024","236544","172032","43008"],["0","0","0","0","0","3456","18432","33792","24576","6144"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","2592","14688","22464","-18816","-92032","-101888","-43008","-2048","2048"],["0","0","7776","44064","50112","-160128","-501888","-516608","-196608","6144","14336"],["0","0","7776","44064","6912","-419328","-1061760","-1019392","-320512","69632","43008"],["0","0","2592","14688","-55296","-485376","-1089664","-952832","-166912","184320","71680"],["0","0","0","0","-43200","-259200","-535680","-373760","112640","235520","71680"],["0","0","0","0","-8640","-51840","-91008","11264","180224","161792","43008"],["0","0","0","0","0","0","8064","43008","78848","57344","14336"],["0","0","0","0","0","0","1152","6144","11264","8192","2048"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["12","32","16"],["24","64","32"],["12","32","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["24","88","96","32"],["48","176","192","64"],["24","88","96","32"]]},"deriv_order":0},{"coeff":{"coeffs":[["-18","-96","-176","-128","-32"],["-18","-96","-176","-128","-32"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-18","-96","-176","-128","-32"],["-18","-96","-176","-128","-32"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-8"],["-4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["12","12"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["3","8","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","4536","23328","63072","163200","305280","286208","102912","-6144","-8192"],["0","13608","69984","205632","589824","1131264","1031680","304128","-86016","-47104"],["0","13608","69984","236736","781056","1533696","1304064","179200","-303104","-112640"],["0","4536","23328","107136","436224","862848","565760","-291840","-479232","-143360"],["0","0","0","11232","72576","119808","-103424","-453120","-387072","-102400"],["0","0","0","-1728","-9216","-38784","-129024","-217088","-155648","-38912"],["0","0","0","0","0","-3456","-18432","-33792","-24576","-6144"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","1944","10368","24192","48384","87552","86016","24576","-12288","-6144"],["0","0","5832","31104","73440","155520","292608","271360","26112","-92160","-34816"],["0","0","5832","31104","72576","162432","319104","236544","-152576","-260096","-81920"],["0","0","1944","10368","19008","38016","74880","-70656","-391168","-366592","-102400"],["0","0","0","0","-6912","-31104","-77184","-207872","-365568","-276480","-71680"],["0","0","0","0","-2592","-13824","-40320","-98304","-151040","-106496","-26624"],["0","0","0","0","0","0","-2304","-12288","-22528","-16384","-4096"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["72","384","704","512","128"],["216","1152","2112","1536","384"],["216","1152","2112","1536","384"],["72","384","704","512","128"]]},"step_quotients":[[{"coeff":{"coeffs":[["-432","-2304","-4224","-3072","-768"],["-1440","-7680","-14080","-10240","-2560"],["-1728","-9216","-16896","-12288","-3072"],["-864","-4608","-8448","-6144","-1536"],["-144","-768","-1408","-1024","-256"]]},"deriv_order":0},{"coeff":{"coeffs":[["432","2736","6528","7296","3840","768"],["864","5472","13056","14592","7680","1536"],["432","2736","6528","7296","3840","768"]]},"deriv_order":1},{"coeff":{"coeffs":[["108","864","2736","4352","3648","1536","256"],["216","1728","5472","8704","7296","3072","512"],["108","864","2736","4352","3648","1536","256"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["576","3648","8704","9728","5120","1024"],["1296","8208","19584","21888","11520","2304"],["864","5472","13056","14592","7680","1536"],["144","912","2176","2432","1280","256"]]},"deriv_order":0},{"coeff":{"coeffs":[["108","864","2736","4352","3648","1536","256"],["216","1728","5472","8704","7296","3072","512"],["108","864","2736","4352","3648","1536","256"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["72","384","704","512","128"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-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"],["4","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","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) = 1/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/8"]},"numerator":["3/8"],"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 = 4, c_n = 1","recurrence":{"first_index":0,"initial_polynomials":[["1"],["4","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","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 = 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 = 4, 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"}