{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"intercept":"1","shape":"affine","slope":"1"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","3"],["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-1"],["-1","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n,k) = (n+1)*(n+2)*(k+3)*binomial(n,k)/6, 0 <= k <= n."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-3","-4"],["-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":[["6","4"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","3","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1","1"],"operator":{"intercept":"1","shape":"affine","slope":"1"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","3"],["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-1"],["-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":[["-3","-4"],["-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":[["9","36","54","36","9"],["18","78","126","90","24"],["9","48","91","74","22"],["0","6","20","22","8"],["0","0","1","2","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["18","90","180","180","90","18"],["45","237","498","522","273","57"],["36","210","482","546","306","68"],["9","69","191","249","156","38"],["0","6","28","48","36","10"],["0","0","1","3","3","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","-18","-90","-180","-180","-90","-18"],["0","-27","-147","-318","-342","-183","-39"],["0","-9","-63","-164","-204","-123","-29"],["0","0","-6","-27","-45","-33","-9"],["0","0","0","-1","-3","-3","-1"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","-18","-72","-108","-72","-18"],["0","-27","-114","-180","-126","-33"],["0","-9","-45","-81","-63","-18"],["0","0","-3","-9","-9","-3"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-6","-24","-36","-24","-6"],["0","0","-9","-38","-60","-42","-11"],["0","0","-3","-15","-27","-21","-6"],["0","0","0","-1","-3","-3","-1"]]},"deriv_order":1}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","0"],["-4","-3"],["0","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["3","6","3"],["0","1","1"]]},"deriv_order":1,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["9","36","54","36","9"],["18","78","126","90","24"],["9","48","91","74","22"],["0","6","20","22","8"],["0","0","1","2","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["-72","-360","-720","-720","-360","-72"],["-180","-966","-2064","-2196","-1164","-246"],["-144","-885","-2120","-2490","-1440","-329"],["-36","-312","-938","-1304","-862","-220"],["0","-33","-172","-323","-262","-78"],["0","0","-10","-34","-38","-14"],["0","0","0","-1","-2","-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["54","342","900","1260","990","414","72"],["81","567","1632","2478","2097","939","174"],["27","252","891","1586","1527","762","155"],["0","27","168","407","483","282","65"],["0","0","9","40","66","48","13"],["0","0","0","1","3","3","1"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["72","360","720","720","360","72"],["126","660","1374","1422","732","150"],["63","372","845","931","500","105"],["9","78","215","262","146","30"],["0","6","25","35","19","3"],["0","0","1","2","1","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","18","96","204","216","114","24"],["0","27","156","356","402","225","50"],["0","9","66","179","231","144","35"],["0","0","6","28","48","36","10"],["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":[["3","3"],["1","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-5","-5"],["-2","-1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["2"],["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 = P((1) x + (1)); 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":["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":0,"input_interlacing":{"reason":"no parent theorem report with an interlacing conclusion","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"P((1) x + (1))","kind":"preserver_image","operator":{"intercept":"1","shape":"affine","slope":"1"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","4"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","3"],["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-1"],["-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 = P((1) x + (1)), 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, -1]","input_root_region":{"upper":{"closed":true,"value":"-1"}},"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":"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: 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) = ((2 n + 1)/(n)) + ((n + 3)/(n)) x, V_n(x) = 0, W_n(x) = ((-n - 1)/(n)) + ((-n - 1)/(n)) x; open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = -n - 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 = -3/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 = -3/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:A347056:lean_proved"},{"detail":"no lean_proved catalog entry equals the parent; 1 with the same first index and seeds differ in the rule or in later initial rows (oeis_catalog:A085841: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 = P((1) x + (1)) 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"}