{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"intercept":"0","shape":"affine","slope":"1"},"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-7","-8"],["5","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","-14","-8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"existing definition"},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0"],["-3","-4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-3"],["-2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["3"],["1"]]},"deriv_order":0,"shift":2}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1,2],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-6","-8"],["3","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["6","5","1"],"operator":{"intercept":"0","shape":"affine","slope":"1"},"parent":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-7","-8"],["5","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","-14","-8"]]},"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","0","0","0"],["27/4","99/4","30","12"],["9/4","33/4","10","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["-27/2","-63","-219/2","-84","-24"],["-9/2","-21","-73/2","-28","-8"]]},"deriv_order":1}],"shift":0},{"differentiations":[{"coeff":{"coeffs":[["9/2","21/2","6"],["15/4","35/4","5"],["3/4","7/4","1"]]},"deriv_order":0}],"shift":1}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["1/2"],["-3/4"],["1/4"]]},"deriv_order":0},{"coeff":{"coeffs":[["2","5/2"],["-1","-1"]]},"deriv_order":1},{"coeff":{"coeffs":[["3/4","7/4","1"]]},"deriv_order":2}],"kind":"single","quotient":[{"coeff":{"coeffs":[["108","504","876","672","192"],["36","168","292","224","64"]]},"deriv_order":0}],"row_multiplier":["3/4","7/4","1"],"start_base":1,"step_multiplier":{"coeffs":[["9/16","21/8","73/16","7/2","1"]]},"step_quotient":[{"coeff":{"coeffs":[["-9/2","-111/4","-68","-331/4","-50","-12"],["45/16","123/8","533/16","143/4","19","4"]]},"deriv_order":0},{"coeff":{"coeffs":[["-27/8","-189/8","-549/8","-847/8","-183/2","-42","-8"]]},"deriv_order":1}]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["2","4"],["-5","-4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["6","14","8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["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 = P((1) x + (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 >= 1"},"method":"operator_division"},"status":"certified"},"input_first_index":1,"interlacing":{"reason":"no parent theorem report with an interlacing conclusion","status":"none"},"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"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":1,"input_interlacing":{"reason":"no parent theorem report with an interlacing conclusion","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"P((1) x + (0))","kind":"preserver_image","operator":{"intercept":"0","shape":"affine","slope":"1"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-7","-8"],["5","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","-14","-8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = P((1) x + (0)), for every n >= 1"},"parent_proof":{"statement":"open: no route proved that every parent row P_n, n >= 1, 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 >= 1, 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 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 theorem needs at least two seed rows","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) = ((5 n - 7)/(n + 1)) + ((4 n - 8)/(n + 1)) x and b_n(x) = ((-6)/(n + 1)) + ((-14)/(n + 1)) x + ((-8)/(n + 1)) x^2; open hypotheses: degree_step_positive: fails at n = 2: lambda_n = (-4 n + 8)/(n + 1) = 0 there (exact); derivative_coefficient_vanishes_at_zero: [x^0] c_1(n, x) = -6 is not the zero polynomial; 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 = 1 (not a disproof): fails at n = 2: [x^1] b_n = -14/3 there (exact)","route":"liu_wang","success":false,"variant":"liu_wang"},{"detail":"not applicable: the theorem needs two seed rows","route":"liu_wang_derivative_lag","success":false,"variant":"liu_wang_derivative_lag"},{"detail":"HypothesisFailed: P_n = (alpha_n x + beta_n) P_(n-1) + kappa_n (x - L)(x - U) P'_(n-1) for n >= 2, with L = -1, U = -3/4, alpha_n = (4 n - 8)/(n + 1), beta_n = (5 n - 7)/(n + 1), kappa_n = (-8)/(n + 1); open hypotheses: slope_positive: fails at n = 2: a_n = -1/2 n + 1 = 0 there (exact); upper_endpoint_threshold: no hit before n = 2; E(2) = e(2) + 0 = -3/2 < 0 with no hit in between (exact); when a_n > 0 for every n <= 2, the criterion puts a root of P_2 outside the interval","route":"ma_wang_interval","success":false,"variant":"ma_wang_interval"},{"detail":"not applicable: the theorem needs two seed rows","route":"liu_wang_three_term","success":false,"variant":"liu_wang_three_term"},{"detail":"HypothesisFailed: Q_n = x^(d_n) P_n(1/x) at the nominal degree d_n, with d_(n-L) = n - 2 (an upper bound of deg P_(n-L)): Q_n = a_n(x) S_n(Q_(n-1)) for n >= 2, with a_n(x) = (1) ((1)) and S_n = (A + B D + C D^2 with A = 8 - 4 n + 21 x - 9 n x + 12 x^2 - 6 n x^2, B = 8 x + 14 x^2 + 6 x^3, C = 0) / (n + 1); open hypotheses: degree_step: delta = 2, deg P_(n-1) = 2 n - 4: fails at n = 2: Lambda(n, deg P_(n-1)) = 6 n - 12 = 0 there (exact); weyl_step_interlacing: at n = 2: deg A = 1, deg B = 3: neither deg B = deg A nor deg B = deg A + 1; weyl_step_leading_coefficients_one_signed: fails at n = 3: A_a B_(a+1) = -36 n + 72 = -36 there (exact)","route":"iterated_preserver","success":false,"variant":"iterated_preserver"},{"detail":"no lean_proved catalog entry equals the parent; 68 with the same first index and seeds differ in the rule or in later initial rows (oeis_catalog:A003506:lean_proved, oeis_catalog:A008277:lean_proved, oeis_catalog:A008278:lean_proved, oeis_catalog:A008288:lean_proved, oeis_catalog:A008292:lean_proved, oeis_catalog:A019538:lean_proved, oeis_catalog:A026729:lean_proved, oeis_catalog:A035607:lean_proved, oeis_catalog:A039755:lean_proved, oeis_catalog:A046716:lean_proved, oeis_catalog:A048854:lean_proved, oeis_catalog:A052553:lean_proved, oeis_catalog:A056242:lean_proved, oeis_catalog:A059110:lean_proved, oeis_catalog:A060187:lean_proved, oeis_catalog:A062145:lean_proved, oeis_catalog:A063007:lean_proved, oeis_catalog:A063967:lean_proved, oeis_catalog:A071951:lean_proved, oeis_catalog:A078812:lean_proved, oeis_catalog:A085478:lean_proved, oeis_catalog:A086645:lean_proved, oeis_catalog:A089627:lean_proved, oeis_catalog:A091042:lean_proved, oeis_catalog:A098158:lean_proved, oeis_catalog:A098172:lean_proved, oeis_catalog:A099097:lean_proved, oeis_catalog:A104684:lean_proved, oeis_catalog:A105278:lean_proved, oeis_catalog:A106800:lean_proved, oeis_catalog:A111125:lean_proved, oeis_catalog:A114656:lean_proved, oeis_catalog:A122542:lean_proved, oeis_catalog:A123160:lean_proved, oeis_catalog:A127648:lean_proved, oeis_catalog:A131689:lean_proved, oeis_catalog:A134991:lean_proved, oeis_catalog:A142075:lean_proved, oeis_catalog:A142459:lean_proved, oeis_catalog:A143395:lean_proved, oeis_catalog:A154602:lean_proved, oeis_catalog:A156289:lean_proved, oeis_catalog:A158909:lean_proved, oeis_catalog:A166973:lean_proved, oeis_catalog:A173018:lean_proved, oeis_catalog:A201637:lean_proved, oeis_catalog:A201730:lean_proved, oeis_catalog:A219836:lean_proved, oeis_catalog:A225117:lean_proved, oeis_catalog:A225466:lean_proved, oeis_catalog:A225467:lean_proved, oeis_catalog:A225468:lean_proved, oeis_catalog:A225469:lean_proved, oeis_catalog:A225472:lean_proved, oeis_catalog:A225473:lean_proved, oeis_catalog:A235706:lean_proved, oeis_catalog:A253283:lean_proved, oeis_catalog:A259454:lean_proved, oeis_catalog:A269939:lean_proved, oeis_catalog:A269945:lean_proved, oeis_catalog:A271697:lean_proved, oeis_catalog:A271703:lean_proved, oeis_catalog:A271705:lean_proved, oeis_catalog:A286724:lean_proved, oeis_catalog:A292219:lean_proved, oeis_catalog:A321331:lean_proved, oeis_catalog:A334218:lean_proved, oeis_catalog:A390433: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 >= 1, 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 = P((1) x + (0)) for every n >= 1 is certified; the lift is Open (open: no route proved that every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only))"},"kind":"definition_equality"}