{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"},"parent":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of descents."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0","0","0","0"],["1","-15","39","-37","12"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-2","14","-30","26","-8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","0","0"],["2","-6","6","-2"]]},"deriv_order":0,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["-2","-4","-2"],["2","4","2"]]},"terms":[{"coeff":{"coeffs":[["1","-7","-23","-21","-6"],["-1","7","23","21","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","0","-12","-16","-6"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","1"],"operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"},"parent":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-4"]]},"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":[["0","0"],["1","-12"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-2","8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0"],["2","-6","6","-2"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["0","0","0","0"],["0","0","0","0"],["0","0","-16","64"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","-8","64","-128"],["0","0","-8","64","-128"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0"],["0","0","0","16","-128","256"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","-8","64","-128"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","0"],["-1","-8"],["-1","16"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-2","24"],["0","4","-32"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-4","16"]]},"deriv_order":2,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["0","0","0","0","128","-1024","2048"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["0","0","0","0","-128","1536","-6144","8192"],["0","0","0","0","-192","3072","-15360","24576"],["0","0","0","0","-64","1536","-9216","16384"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","128","-1536","6144","-8192"],["0","0","0","0","0","256","-4096","20480","-32768"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","-256","3072","-12288","16384"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["0","0","0","0","-128","1536","-6144","8192"],["0","0","0","0","-64","1280","-7168","12288"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","128","-1536","6144","-8192"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["2"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","-1","4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-4"]]},"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 = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), 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.splits_fPolynomial"],"lean_route":"fTransform","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":"((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0)","kind":"preserver_image","operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0), for every n >= 0"},"parent_proof":{"route":"liu_wang_three_term","statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 0, is zero or real-rooted with roots in [-1, 0]","input_root_region":{"lower":{"closed":true,"value":"-1"},"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":"proved"},"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":"not applicable: expected one nonzero lag term","route":"product_recurrence","success":false,"variant":"product_recurrence"},{"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":"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) = (4) x, V_n(x) = 0, W_n(x) = (1) x + (-4) x^2; open hypotheses: seed_roots_negative: P_1 is zero, not real-rooted, or has a root >= 0 (exact); constant_term_positive: fails at n = 2: A_n(0) = 0 = 0 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":"Q_n = A_n(x) Q_(n-1) + B_n(x) Q_(n-2) for n >= 2, with A_n(x) = (4), B_n(x) = (-4) + (1) x; Q_n = x^(n - 0) P_n(1/x) for n >= 0 (the reversal at the nominal degree deg P_0 + n - 0, an upper bound for deg P_n), which satisfies the rule below: every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0] (so its coefficients have one sign); for n >= 1, Q_(n-1) interlaces Q_n (weakly, in the sense of Liu and Wang; no interlacing of the P_n is claimed)","route":"liu_wang_three_term","success":true,"variant":"liu_wang_three_term"}],"conditional_on":[],"route":"liu_wang_three_term","rows_checked":10,"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"proved: Q_n = lambda(n) T_n(P_(n+0)) with T = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0) for every n >= 0, the side conditions hold for every n, and every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 0, is zero or real-rooted with roots in [-1, 0]"},"kind":"preserver_image"}