{"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":{"denominator":{"coeffs":[["0"],["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-2"],["-2","1"],["3","3"],["-1","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"],["0","-1","0"],["0","1","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"theta_plus_one of Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0"],["-1","-1"],["0","3"],["1","2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","-1"],["0","-1","-4"],["0","-1","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1","0"],["0","-1"],["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","0"],["0","0","1"],["0","-2","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","1","1"],"operator":{"schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"reversal"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-2"],["-2","1"],["3","3"],["-1","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"],["0","-1","0"],["0","1","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_valid_from_base":1,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0}],"shift":0}],"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0"],["-1","-1"],["0","3"],["1","2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","0","-1"],["0","-1","-4"],["0","-1","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["1"],["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 1) 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 >= 1 (the exceptional bases checked exactly), and agreement on the 2 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":{"denominator":{"coeffs":[["0"],["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-2"],["-2","1"],["3","3"],["-1","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"],["0","-1","0"],["0","1","2"]]},"deriv_order":1,"offset":1,"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":[],"parent_proof":{"attempts":[{"detail":"the leader is not a nonzero constant","route":"periodic_product","success":false,"variant":"P_(n+k) = c(x) P_n"},{"detail":"not applicable: expected one nonzero lag term","route":"product_recurrence","success":false,"variant":"product_recurrence"},{"detail":"no theorem matched (weighted_renewal_window: LHS must be a nonzero constant; fixed_delay_predecessor_window: LHS must be a nonzero constant)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"not applicable: the rule is not f(n) P_n = c_1(n, x) P_(n-1) + c_2(n, x) P_(n-2) with both terms nonzero","route":"three_term_recurrence","success":false,"variant":"three_term_recurrence"},{"detail":"HypothesisFailed: P_n = a_n(x) P_(n-1) + b_n(x) P'_(n-1) for n >= 2, with a_n(x) = ((-n^3 + 3 n^2 - 2 n)/(n^2 - n)) + ((-2 n^3 + 3 n^2 + n - 2)/(n^2 - n)) x and b_n(x) = ((0)/(n^2 - n)) + ((n^2 - n)/(n^2 - n)) x + ((2 n^2 - 1)/(n^2 - n)) x^2; open hypotheses: derivative_coefficient_nonpositive: b_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] b_n <= 0 fails for k = 2 (not a disproof): fails at n = 2: [x^2] b_n = 7/2 there (exact); constant_term_positive: fails at n = 2: a_n(0) = (-n^3 + 3 n^2 - 2 n)/(n^2 - n) = 0 there (exact)","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) = ((-n^3 + 3 n^2 - 2 n)/(n^2 - n)) + ((-2 n^3 + 3 n^2 + n - 2)/(n^2 - n)) x, V_n(x) = ((n^2 - n)/(n^2 - n)) x + ((2 n^2 - 1)/(n^2 - n)) x^2, W_n(x) = 0; open hypotheses: constant_term_positive: fails at n = 2: A_n(0) = (-n^3 + 3 n^2 - 2 n)/(n^2 - n) = 0 there (exact); derivative_coefficient_nonpositive: V_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] V_n <= 0 fails for k = 2 (not a disproof): fails at n = 2: [x^2] V_n = 7/2 there (exact); derivative_or_lag_coefficient_negative: V_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] V_n <= 0 fails for k = 2 (not a disproof): fails at n = 2: [x^2] V_n = 7/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): c_1 is not gamma(n) w(x)","route":"ma_wang_interval","success":false,"variant":"ma_wang_interval"},{"detail":"not applicable: the rule is not f(n) P_n = c_1(n, x) P_(n-1) + c_d(n, x) P'_(n-1) + c_2(n, x) P_(n-2) with a nonzero lag term and a nonzero P_(n-1) or P'_(n-1) term","route":"liu_wang_three_term","success":false,"variant":"liu_wang_three_term"},{"detail":"HypothesisFailed: P_n = a_n(x) S_n(P_(n-1)) for n >= 2, with a_n(x) = (1) ((1)) and S_n = (A + B D + C D^2 with A = -2 n + 3 n^2 - n^3 - 2 x + n x + 3 n^2 x - 2 n^3 x, B = -n x + n^2 x - x^2 + 2 n^2 x^2, C = 0) / (n^2 - n); open hypotheses: weyl_step_leading_coefficients_same_sign: fails at n = 2: A_1 B_lead = -4 n^5 + 6 n^4 + 4 n^3 - 7 n^2 - n + 2 = -28 there (exact); weyl_step_interlacing: fails at n = 2: B_2 (B_2 A_0^2 - B_1 A_0 A_1 + B_0 A_1^2) = -2 n^9 + 8 n^8 - 9 n^7 + 5 n^5 - 2 n^4 = 0 there (exact); weyl_step_leading_coefficients_one_signed: fails at n = 2: A_a B_(a+1) = -4 n^5 + 6 n^4 + 4 n^3 - 7 n^2 - n + 2 = -28 there (exact)","route":"iterated_preserver","success":false,"variant":"iterated_preserver"},{"detail":"no lean_proved catalog entry equals the parent; 21 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:A103406: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"}