{"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"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k (n >= 0; 0 <= k <= n/2)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-128","-272","-168","-32","-8","0"],["64","-336","-760","-600","-216","-36"],["0","136","-292","-550","-304","-60"],["0","0","80","-98","-133","-37"],["0","0","0","16","-16","-10"],["0","0","0","0","1","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-128","-320","816","3016","3232","1512","288"],["0","-192","-976","104","1912","1576","372"],["0","0","56","-956","-634","128","116"],["0","0","0","144","-310","-239","-31"],["0","0","0","0","40","-48","-22"],["0","0","0","0","0","3","-3"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-160","-48","1768","4232","4128","1912","360"],["0","0","-416","-296","2220","4040","2564","564"],["0","0","0","-304","-392","720","996","310"],["0","0","0","0","-40","-118","67","63"],["0","0","0","0","0","6","-16","0"],["0","0","0","0","0","0","1","-1"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","-32","16","408","880","832","384","72"],["0","0","0","-96","8","596","928","556","120"],["0","0","0","0","-88","-20","254","260","74"],["0","0","0","0","0","-24","-4","40","20"],["0","0","0","0","0","0","-2","0","2"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["64","136","84","16","4"],["0","80","136","74","12"],["0","0","56","58","13"],["0","0","0","12","6"],["0","0","0","0","1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","192","408","252","48","12"],["0","0","240","408","222","36"],["0","0","0","168","174","39"],["0","0","0","0","36","18"],["0","0","0","0","0","3"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","64","136","84","16","4"],["0","0","0","80","136","74","12"],["0","0","0","0","56","58","13"],["0","0","0","0","0","12","6"],["0","0","0","0","0","0","1"]]},"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":[["64","56","4","-12","0"],["0","80","24","-6","0"],["0","0","56","22","1"],["0","0","0","12","2"],["0","0","0","0","1"]]},"terms":[{"coeff":{"coeffs":[["192","-200","-220","-132","-20","-4"],["-64","608","-64","-142","-62","-8"],["0","-136","532","160","11","-1"],["0","0","-80","162","59","7"],["0","0","0","-16","21","5"],["0","0","0","0","-1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["32","-112","-312","-288","-160","-48","-8"],["0","96","-184","-564","-416","-156","-24"],["0","0","88","-52","-254","-140","-26"],["0","0","0","24","-4","-40","-12"],["0","0","0","0","2","0","-2"]]},"deriv_order":1,"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"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"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":[["-2","0"],["1","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","0","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["1024","6272","16192","22784","18880","9344","2752","512","64"],["0","1280","7296","17568","23104","17856","8064","1952","192"],["0","0","896","4512","9296","9984","5856","1760","208"],["0","0","0","192","864","1536","1344","576","96"],["0","0","0","0","16","64","96","64","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","3072","18816","48576","68352","56640","28032","8256","1536","192"],["0","0","3840","21888","52704","69312","53568","24192","5856","576"],["0","0","0","2688","13536","27888","29952","17568","5280","624"],["0","0","0","0","576","2592","4608","4032","1728","288"],["0","0","0","0","0","48","192","288","192","48"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","1024","6272","16192","22784","18880","9344","2752","512","64"],["0","0","0","1280","7296","17568","23104","17856","8064","1952","192"],["0","0","0","0","896","4512","9296","9984","5856","1760","208"],["0","0","0","0","0","192","864","1536","1344","576","96"],["0","0","0","0","0","0","16","64","96","64","16"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["4","8","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["-4","-12","-12","-4"],["4","4","-4","-4"]]},"deriv_order":0},{"coeff":{"coeffs":[["-8","-16","0","16","8"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-4","0","8","0","-4"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["6","6"],["-4","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["4","8","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","896","4032","9280","16832","24128","22848","12480","3392","320"],["0","0","384","3072","10464","19328","20672","12672","4064","512"],["0","0","0","64","704","2448","4032","3488","1536","272"],["0","0","0","0","0","48","192","288","192","48"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","384","1920","4480","7296","9600","9344","5760","1920","256"],["0","0","0","256","1632","4832","8512","9408","6368","2400","384"],["0","0","0","0","96","576","1536","2304","2016","960","192"],["0","0","0","0","0","0","32","128","192","128","32"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["16","64","96","64","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["16","64","96","64","16"],["16","64","96","64","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["32","160","320","320","160","32"],["-64","-320","-640","-640","-320","-64"]]},"deriv_order":1},{"coeff":{"coeffs":[["64","384","960","1280","960","384","64"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["-64","-288","-512","-448","-192","-32"],["-16","-48","-32","32","48","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["32","128","160","0","-160","-128","-32"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["16","64","96","64","16"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-2","-2"]]},"deriv_order":0,"shift":0},{"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":{"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"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"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":"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"}