{"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["6","12","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013609 of Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-54","-648","-2340","-3744","-2904","-1056","-144"],["0","-324","-1800","-3600","-3216","-1296","-192"],["0","0","-216","-720","-816","-384","-64"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-162","-1944","-7020","-11232","-8712","-3168","-432"],["0","0","-972","-5400","-10800","-9648","-3888","-576"],["0","0","0","-648","-2160","-2448","-1152","-192"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-54","-648","-2340","-3744","-2904","-1056","-144"],["0","0","0","-324","-1800","-3600","-3216","-1296","-192"],["0","0","0","0","-216","-720","-816","-384","-64"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["9","36","48","24","4"],["0","54","120","84","16"],["0","0","36","48","16"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","27","108","144","72","12"],["0","0","162","360","252","48"],["0","0","0","108","144","48"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","9","36","48","24","4"],["0","0","0","54","120","84","16"],["0","0","0","0","36","48","16"]]},"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":[["9","-18","-36","-12","4"],["0","54","48","-12","-16"],["0","0","36","48","16"]]},"terms":[{"coeff":{"coeffs":[["54","324","756","864","504","144","16"],["0","324","1368","2160","1584","528","64"],["0","0","216","720","816","384","64"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["6","12","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["324","2592","8640","15552","16416","10368","3840","768","64"],["0","1944","12096","30672","40896","30816","13056","2880","256"],["0","0","1296","6912","14400","14976","8256","2304","256"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","972","7776","25920","46656","49248","31104","11520","2304","192"],["0","0","5832","36288","92016","122688","92448","39168","8640","768"],["0","0","0","3888","20736","43200","44928","24768","6912","768"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","324","2592","8640","15552","16416","10368","3840","768","64"],["0","0","0","1944","12096","30672","40896","30816","13056","2880","256"],["0","0","0","0","1296","6912","14400","14976","8256","2304","256"]]},"deriv_order":2}],"shift":0}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["0","0"],["12","8"]]},"deriv_order":0},{"coeff":{"coeffs":[["-6","-12","-4"]]},"deriv_order":1}],"kind":"single","quotient":[{"coeff":{"coeffs":[["0","0","4536","27648","67824","85824","59616","22272","4032","256"],["0","0","0","3888","19872","39168","38016","19392","4992","512"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","1944","13392","37584","55296","45792","21312","5184","512"],["0","0","0","0","2592","13824","28800","29952","16512","4608","512"]]},"deriv_order":1}],"row_multiplier":["36","144","192","96","16"]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-6","-12","-4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":1}]},"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":{"reason":"no parent theorem report with an interlacing conclusion","status":"none"},"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":{"reason":"no parent theorem report with an interlacing conclusion","status":"not_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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["6","12","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":"periodic_product","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_proof":{"attempts":[{"detail":"c and the seeds are nonzero, real-rooted and of one sign, so P_(n0 + k m + i) = c^m P_(n0 + i) is too","route":"periodic_product","success":true,"variant":"P_(n+k) = c(x) P_n"}],"conditional_on":[],"route":"periodic_product","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"}