{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2))."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-10","-12","-2","0"],["-30","-76","-57","-12"],["0","-20","-30","-10"],["0","0","-3","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["50","200","304","202","48"],["0","20","64","73","28"],["0","0","-10","-12","-2"],["0","0","0","-3","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","25","105","158","102","24"],["0","0","25","70","65","20"],["0","0","0","5","9","4"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["10","12","2"],["10","17","5"],["0","5","4"],["0","0","1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","10","12","2"],["0","10","17","5"],["0","0","5","4"],["0","0","0","1"]]},"deriv_order":1,"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"],["10","7","0"],["0","5","1"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["-20","-44","-28","-4"],["30","36","6","-2"],["0","20","21","4"],["0","0","3","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-25","-80","-93","-46","-8"],["0","-25","-60","-47","-12"],["0","0","-5","-9","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1","2","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","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":[["-1","0"],["-3","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["5","9","4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["50","150","158","66","8"],["100","325","376","179","28"],["50","200","283","169","36"],["0","25","70","65","20"],["0","0","5","9","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","50","150","158","66","8"],["0","100","325","376","179","28"],["0","50","200","283","169","36"],["0","0","25","70","65","20"],["0","0","0","5","9","4"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["5","9","4"],["10","18","8"],["5","9","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["-10","-28","-26","-8"],["-20","-56","-52","-16"],["-10","-28","-26","-8"]]},"deriv_order":0},{"coeff":{"coeffs":[["25","90","121","72","16"],["25","90","121","72","16"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-25","-90","-121","-72","-16"],["-25","-90","-121","-72","-16"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["6","6"],["-5","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["5","9","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","-25","-45","0","36","16"],["0","-50","-90","10","90","40"],["0","-25","-45","20","72","32"],["0","0","0","10","18","8"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["25","90","121","72","16"],["75","270","363","216","48"],["75","270","363","216","48"],["25","90","121","72","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["25","90","121","72","16"],["75","270","363","216","48"],["75","270","363","216","48"],["25","90","121","72","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["25","140","301","314","160","32"],["-75","-270","-363","-216","-48","0"],["-225","-960","-1629","-1374","-576","-96"],["-125","-550","-965","-844","-368","-64"]]},"deriv_order":1},{"coeff":{"coeffs":[["125","675","1515","1809","1212","432","64"],["250","1350","3030","3618","2424","864","128"],["125","675","1515","1809","1212","432","64"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["-75","-370","-723","-700","-336","-64"],["-75","-420","-903","-942","-480","-96"],["75","270","363","216","48","0"],["75","320","543","458","192","32"]]},"deriv_order":0},{"coeff":{"coeffs":[["-125","-675","-1515","-1809","-1212","-432","-64"],["-250","-1350","-3030","-3618","-2424","-864","-128"],["-125","-675","-1515","-1809","-1212","-432","-64"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["5","9","4"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-1","-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 + (1) theta; 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, 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 + (1) theta","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","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 + (1) theta, for every n >= 0"},"parent_proof":{"labels":["oeis_catalog:A128100:lean_proved"],"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign (real-rootedness from the catalog flag, not proved here; one-signed coefficients proved here)","status":"attested"},"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":"conditional_on_attestation"},"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":"no theorem matched (weighted_renewal_window: support must satisfy offset = 1 + ell * t_degree; fixed_delay_predecessor_window: only P_(n-1) and one term w(n) t P_(n-L) are supported)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"not applicable: c_2(n, x) = gamma(n) w(x) with w neither constant nor a constant times a square (x + v_0)^2","route":"three_term_recurrence","success":false,"variant":"three_term_recurrence"},{"detail":"not applicable: the rule is not f(n) P_n = c_0(n, x) P_(n-1) + c_1(n, x) P'_(n-1)","route":"liu_wang","success":false,"variant":"liu_wang"},{"detail":"HypothesisFailed: P_n = A_n(x) P_(n-1) + V_n(x) P'_(n-1) + W_n(x) P_(n-2) for n >= 2, with A_n(x) = (1), V_n(x) = 0, W_n(x) = (1) + (1) x; open hypotheses: seed_degree_step: degrees 0 and 0 (exact); seed_strict_interlacing: the Bezout test fails or the degrees do not differ by one (exact); degree_step_positive: fails at n = 2: lambda_n = 0 = 0 there (exact); multipliers_vanish_at_zero: [x^0] c_2(n, x) = 1 is not the zero polynomial; lag_coefficient_nonpositive: W_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] W_n <= 0 fails for k = 0 (not a disproof): fails at n = 2: [x^0] W_n = 1 there (exact); derivative_or_lag_coefficient_negative: W_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] W_n <= 0 fails for k = 0 (not a disproof): fails at n = 2: [x^0] W_n = 1 there (exact)","route":"liu_wang_derivative_lag","success":false,"variant":"liu_wang_derivative_lag"},{"detail":"not applicable: the rule is not f(n) P_n = c_0(n, x) P_(n-1) + gamma(n) (x - L)(x - U) P'_(n-1)","route":"ma_wang_interval","success":false,"variant":"ma_wang_interval"},{"detail":"every row of the bundled OEIS catalog entry A128100 is zero or real-rooted (flag lean_proved, as of 2026-10-03: a machine-checked Lean proof made outside polytool); every row has coefficients of one sign: the seeds do, the leader is positive and every combined weight is >= 0 for n >= 2, with deg P_m <= 0 + 1 m","route":"attestation","success":true,"variant":"oeis_catalog:A128100:lean_proved"}],"conditional_on":["oeis_catalog:A128100:lean_proved"],"route":"attestation","rows_checked":10,"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign (real-rootedness from the catalog flag, not proved here; one-signed coefficients proved here)","status":"conditional_on_attestation"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (1) theta for every n >= 0 is certified; the lift is ConditionalOnAttestation (every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign (real-rootedness from the catalog flag, not proved here; one-signed coefficients proved here))"},"kind":"preserver_image"}