{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"reversal"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's on the diagonal and 1's elsewhere."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-1","-2"],["-1","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-1","-1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["1"]]},"deriv_order":0,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","-1"],["1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1","1"],"operator":{"schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"reversal"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-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","-2"],["-1","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-1","-1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["1"],["1"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["1","4","6","4","1"],["2","10","18","14","4"],["1","8","19","18","6"],["0","2","8","10","4"],["0","0","1","2","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["2","10","20","20","10","2"],["3","20","50","60","35","8"],["1","12","42","64","45","12"],["0","2","13","28","25","8"],["0","0","1","4","5","2"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","-1","-5","-10","-10","-5","-1"],["0","-1","-7","-18","-22","-13","-3"],["0","0","-2","-9","-15","-11","-3"],["0","0","0","-1","-3","-3","-1"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","1","3","3","1"],["0","0","1","4","5","2"],["0","0","0","1","2","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-1","-4","-6","-4","-1"],["0","0","-1","-5","-9","-7","-2"],["0","0","0","-1","-3","-3","-1"]]},"deriv_order":1}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","0"],["-2","-1"],["0","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1","2","1"],["0","1","1"]]},"deriv_order":1,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["1","4","6","4","1"],["2","10","18","14","4"],["1","8","19","18","6"],["0","2","8","10","4"],["0","0","1","2","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["-2","-10","-20","-20","-10","-2"],["-4","-25","-60","-70","-40","-9"],["-2","-20","-64","-92","-62","-16"],["0","-5","-28","-55","-46","-14"],["0","0","-4","-14","-16","-6"],["0","0","0","-1","-2","-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["1","7","20","30","25","11","2"],["1","10","37","68","67","34","7"],["0","3","20","51","63","38","9"],["0","0","3","14","24","18","5"],["0","0","0","1","3","3","1"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["2","10","20","20","10","2"],["3","18","41","45","24","5"],["1","10","29","36","20","4"],["0","2","9","13","7","1"],["0","0","1","2","1","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","1","6","14","16","9","2"],["0","1","8","23","31","20","5"],["0","0","2","10","18","14","4"],["0","0","0","1","3","3","1"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","2","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","-2"]]},"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 = x^(d_n) P(1/x), d_n = 0 + 1 (n - 0); 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":"the schedule d_n depends on n","status":"none"},"lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"lean_route":"reversed","lift_summary":{"hypotheses":[{"evidence":"lambda(n) = 1","name":"gauge_finite_nonzero","statement":"lambda(n) is finite and nonzero for every n >= n0","status":{"kind":"verified"}}],"identity":{"method":"forward_division","status":"certified"},"input_first_index":0,"input_interlacing":{"reason":"the schedule d_n depends on n","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"x^(d_n) P(1/x), d_n = 0 + 1 (n - 0)","kind":"preserver_image","operator":{"schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"reversal"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = x^(d_n) P(1/x), d_n = 0 + 1 (n - 0), for every n >= 0"},"parent_proof":{"statement":"open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only)","status":"open"},"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":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically"},"verdict":"open"},"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: 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":"HypothesisFailed: P_n = (a_n + b_n (x + 1)) P_(n-1) - c_n (x + 1)^2 P_(n-2) for n >= 2, with a_n = 0, b_n = 2, c_n = 1; Q_n(y) = y^(d_n) P_n(1/y - 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2); open hypotheses: leading_coefficient_nonzero: fails at n = 2: f(n) a_n = 0 = 0 there (exact); first_coefficient_positive: a_2 or c_2 is undefined or a_2 = 0; recurrence_coefficient_positive: fails at n = 3: the denominator of beta_n = 1 vanishes there; root_region: the region contains the pole x = -1 of the coordinate change y = 1/(x + 1)","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) = (2) + (2) x, V_n(x) = 0, W_n(x) = (-1) + (-2) x + (-1) x^2; open hypotheses: lag_degree_step_nonnegative: fails at n = 2: mu_n = -1 = -1 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 = 1 (not a disproof): fails at n = 2: [x^1] W_n = -2 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 = 1 (not a disproof): fails at n = 2: [x^1] W_n = -2 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":"the parent equals the flagged entry, but the flag gives real-rootedness only and one-signed coefficients are not shown: the weight of the coefficient of x^s of P_(n-2) in the coefficient of x^(s+0) is not shown to be >= 0 for n >= 2","route":"attestation","success":false,"variant":"oeis_catalog:A103406:lean_proved"},{"detail":"no lean_proved catalog entry equals the parent; 20 with the same first index and seeds differ in the rule or in later initial rows (oeis_catalog:A028421:lean_proved, oeis_catalog:A033282:lean_proved, oeis_catalog:A061896:lean_proved, oeis_catalog:A084534:lean_proved, oeis_catalog:A110552:lean_proved, oeis_catalog:A114687:lean_proved, oeis_catalog:A120095:lean_proved, oeis_catalog:A163937:lean_proved, oeis_catalog:A172431:lean_proved, oeis_catalog:A193722:lean_proved, oeis_catalog:A193726:lean_proved, oeis_catalog:A193729:lean_proved, oeis_catalog:A193731:lean_proved, oeis_catalog:A193734:lean_proved, oeis_catalog:A207607:lean_proved, oeis_catalog:A223168:lean_proved, oeis_catalog:A232535:lean_proved, oeis_catalog:A330381:lean_proved, oeis_catalog:A339000:lean_proved, oeis_catalog:A367177:lean_proved)","route":"attestation","success":false,"variant":"oeis_catalog"}],"conditional_on":[],"rows_checked":10,"statement":"open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only)","status":"not_proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"Q_n = lambda(n) T_n(P_(n+0)) with T = x^(d_n) P(1/x), d_n = 0 + 1 (n - 0) for every n >= 0 is certified; the lift is Open (open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only))"},"kind":"preserver_image"}