{"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"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-6","-44","-104","-96"],["-5","-66","-182","-176"],["-1","-26","-98","-102"],["0","-3","-19","-24"],["0","0","-1","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-6","20","296","480"],["0","-11","-110","-98","112"],["0","-3","-66","-202","-130"],["0","0","-9","-53","-56"],["0","0","0","-3","-6"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","9","146","656","864"],["0","0","0","44","378","624"],["0","0","-1","-11","17","118"],["0","0","0","-3","-14","-4"],["0","0","0","0","-1","-2"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","3","38","152","192"],["0","0","0","1","22","112","160"],["0","0","0","0","3","23","44"],["0","0","0","0","0","1","4"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["6","20","24"],["5","34","44"],["1","18","30"],["0","3","9"],["0","0","1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","18","60","72"],["0","15","102","132"],["0","3","54","90"],["0","0","9","27"],["0","0","0","3"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","6","20","24"],["0","0","5","34","44"],["0","0","1","18","30"],["0","0","0","3","9"],["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":[["2","1","2"],["3","7","7"],["1","9","9"],["0","3","5"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["2","1","2","0"],["3","23","39","36"],["1","17","47","42"],["0","3","15","16"],["0","0","1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","-19","-62","-72"],["0","-1","-16","-69","-84"],["0","0","-3","-20","-32"],["0","0","0","-1","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["8","12","6","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"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","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":[["-2","-2"],["-1","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","1","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","24","272","1120","2048","1536"],["0","0","44","568","2704","5632","4352"],["0","0","30","468","2624","6208","5120"],["0","0","9","190","1288","3488","3200"],["0","0","1","38","326","1040","1120"],["0","0","0","3","37","152","208"],["0","0","0","0","1","8","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","72","816","3360","6144","4608"],["0","0","0","132","1704","8112","16896","13056"],["0","0","0","90","1404","7872","18624","15360"],["0","0","0","27","570","3864","10464","9600"],["0","0","0","3","114","978","3120","3360"],["0","0","0","0","9","111","456","624"],["0","0","0","0","0","3","24","48"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","24","272","1120","2048","1536"],["0","0","0","0","44","568","2704","5632","4352"],["0","0","0","0","30","468","2624","6208","5120"],["0","0","0","0","9","190","1288","3488","3200"],["0","0","0","0","1","38","326","1040","1120"],["0","0","0","0","0","3","37","152","208"],["0","0","0","0","0","0","1","8","16"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","4","16"],["0","4","16"],["0","1","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","-8","-32"],["0","0","-8","-32"],["0","0","-2","-8"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","2","16","32"],["0","0","1","8","16"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-2","-16","-32"],["0","0","-1","-8","-16"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","2"],["-1","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","1","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","304","2816","7936","6144"],["0","0","0","0","568","5392","15872","13568"],["0","0","0","0","396","3912","12288","11904"],["0","0","0","0","122","1300","4544","5184"],["0","0","0","0","14","182","784","1120"],["0","0","0","0","0","6","48","96"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","128","1312","4352","4608"],["0","0","0","0","0","240","2544","8832","9984"],["0","0","0","0","0","168","1880","6976","8576"],["0","0","0","0","0","52","644","2656","3648"],["0","0","0","0","0","6","96","480","768"],["0","0","0","0","0","0","4","32","64"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","8","64","128"],["0","0","12","96","192"],["0","0","6","48","96"],["0","0","1","8","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","8","64","128"],["0","0","20","160","320"],["0","0","18","144","288"],["0","0","7","56","112"],["0","0","1","8","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-8","-72","-192","-128"],["0","0","-12","-120","-384","-384"],["0","0","-6","-66","-240","-288"],["0","0","-1","-12","-48","-64"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","4","48","192","256"],["0","0","0","4","48","192","256"],["0","0","0","1","12","48","64"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","8","56","64","-128"],["0","0","12","96","192","0"],["0","0","6","54","144","96"],["0","0","1","10","32","32"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-4","-48","-192","-256"],["0","0","0","-4","-48","-192","-256"],["0","0","0","-1","-12","-48","-64"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","1","8","16"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1"]]},"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":{"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"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","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":"paper_theorem","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":"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":"the parent rows are not the canonical boundary rows (Mismatch)","route":"paper_theorem","success":false,"variant":"weighted_renewal_window"},{"detail":"Q_0 = 1, Q_n = Q_(n-1) + w(n) t Q_(max(0, n-2)), w(n) = 1 (paper_proof_not_lean_checked): For every n >= 1: Q_n has nonnegative coefficients and constant term 1, is real-rooted, and Q_i << Q_n (oriented weak interlacing) for p(n) <= i <= n. Hence Q_A << Q_B whenever 0 <= A <= B and B - A <= 2.; the identifying seeds equal the canonical rows (Canonical), so every parent row is a canonical row","route":"paper_theorem","success":true,"variant":"fixed_delay_predecessor_window"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["p(n) = max(0, n-2) with 2 >= 1 is nondecreasing and 0 <= p(n) < n for n >= 1 (exact_structural)","w(n) >= 0 for every integer n >= 1: w(1+m) has nonnegative coefficients [1] in m (exact_symbolic_certificate)","window: Q_A << Q_B for 0 <= A <= B with B - A <= 2 (B - A <= 2)","the identifying parent seeds equal the canonical rows (Canonical), so every parent row is a canonical row and consecutive parent rows are consecutive canonical rows"],"theorem":"fixed_delay_predecessor_window (paper_proof_not_lean_checked; https://github.com/PerAlexandersson/RealRooted/issues/2037): For every n >= 1: Q_n has nonnegative coefficients and constant term 1, is real-rooted, and Q_i << Q_n (oriented weak interlacing) for p(n) <= i <= n. Hence Q_A << Q_B whenever 0 <= A <= B and B - A <= 2."},"kind":"weak","orientation":"previous_interlaces_next"},"route":"paper_theorem","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"}