{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","12","36"],["-1","-12","-36"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","6"],["6","12"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k double rises (0 <= k <= n-1)."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-18","0"],["-45","-90"],["-21","-54"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["3","27","54"],["2","18","36"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0"],["9"],["3"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["0"],["6"]],"recurrence":{"denominator":{"coeffs":[["-6"],["3"],["3"]]},"terms":[{"coeff":{"coeffs":[["-6","-36"],["3","-18"],["21","54"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-9","-18"],["-2","-18","-36"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["3","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","12","36"],["-1","-12","-36"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","6"],["6","12"]]},"deriv_order":0,"offset":1,"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":[["-27","-54"],["-21","-54"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["2","18","36"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["9"],["3"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0"],["9","81","162"],["3","27","54"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["81","729","1458"],["54","486","972"],["9","81","162"]]},"step_quotients":[[{"coeff":{"coeffs":[["-108","-1620","-7776","-11664"],["-171","-2565","-12312","-18468"],["-72","-1080","-5184","-7776"],["-9","-135","-648","-972"]]},"deriv_order":0},{"coeff":{"coeffs":[["72","1296","8424","23328","23328"],["42","756","4914","13608","13608"],["6","108","702","1944","1944"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-144","-2592","-16848","-46656","-46656"],["-84","-1512","-9828","-27216","-27216"],["-12","-216","-1404","-3888","-3888"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["18"],["18"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","0"],["-12","-36"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1","9","18"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["27","243","486"],["9","81","162"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["729","13122","85293","236196","236196"],["729","13122","85293","236196","236196"],["243","4374","28431","78732","78732"],["27","486","3159","8748","8748"]]},"step_quotients":[[{"coeff":{"coeffs":[["11664","209952","1364688","3779136","3779136"],["28188","507384","3297996","9132912","9132912"],["25110","451980","2937870","8135640","8135640"],["10530","189540","1232010","3411720","3411720"],["2106","37908","246402","682344","682344"],["162","2916","18954","52488","52488"]]},"deriv_order":0},{"coeff":{"coeffs":[["-5832","-116640","-892296","-3254256","-5668704","-3779136"],["-9234","-188568","-1482786","-5607468","-10235160","-7243344"],["-5184","-107244","-857304","-3309660","-6193584","-4513968"],["-1242","-25920","-209466","-819396","-1557144","-1154736"],["-108","-2268","-18468","-72900","-139968","-104976"]]},"deriv_order":1},{"coeff":{"coeffs":[["324","8748","96228","551124","1732104","2834352","1889568"],["297","8019","88209","505197","1587762","2598156","1732104"],["90","2430","26730","153090","481140","787320","524880"],["9","243","2673","15309","48114","78732","52488"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["10692","209952","1565892","5511240","9132912","5668704"],["16605","332424","2546397","9303498","16245036","10865016"],["9207","186624","1453383","5428134","9754020","6770952"],["2187","44712","352107","1334070","2440692","1732104"],["189","3888","30861","118098","218700","157464"]]},"deriv_order":0},{"coeff":{"coeffs":[["-648","-17496","-192456","-1102248","-3464208","-5668704","-3779136"],["-594","-16038","-176418","-1010394","-3175524","-5196312","-3464208"],["-180","-4860","-53460","-306180","-962280","-1574640","-1049760"],["-18","-486","-5346","-30618","-96228","-157464","-104976"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["3","27","54"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","12","36"],["1","12","36"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-15","-30"],["-6","-12"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["4"],["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 = phi(n, D) = (1) D; 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":"no parent theorem report with an interlacing conclusion","status":"none"},"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"lift_summary":{"hypotheses":[{"evidence":"the polynomial with ascending coefficients [0, 1] is fixed; exact check: real-rooted = true, coefficients of one sign = true","name":"derivative_polynomial_real_rooted","statement":"the polynomial in D is real-rooted for every n >= n0","status":{"kind":"verified"}},{"evidence":"lambda(n) = 1","name":"gauge_finite_nonzero","statement":"lambda(n) is finite and nonzero for every n >= n0","status":{"kind":"verified"}},{"evidence":"delta(n) != 0 for every integer n in [0, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 0 + u have one sign)","name":"operator_coefficients_defined","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["1"]},"numerator":["1"],"range":{"first":"0","last":null}},"decision":"holds"},"statement":"the operator coefficients are finite at every n >= n0 (their denominators do not vanish)","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":"phi(n, D) = (1) D","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","12","36"],["-1","-12","-36"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","6"],["6","12"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = phi(n, D) = (1) D, 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 (-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":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n"},"verdict":"proved"},"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":"Unresolved: P_n = (a_n + b_n (x + 1/6)) P_(n-1) - c_n (x + 1/6)^2 P_(n-2) for n >= 2, with a_n = (4 n + 2)/(n + 2), b_n = (12 n + 6)/(n + 2), c_n = (36 n - 36)/(n + 2); Q_n(y) = y^(d_n) P_n(1/y - 1/6), 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: root_region: the region contains the pole x = -1/6 of the coordinate change y = 1/(x + 1/6)","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) = ((6 n + 3)/(n + 2)) + ((12 n + 6)/(n + 2)) x, V_n(x) = 0, W_n(x) = ((-n + 1)/(n + 2)) + ((-12 n + 12)/(n + 2)) x + ((-36 n + 36)/(n + 2)) x^2; 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 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 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":"P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 2, with A_n(x) = ((6 n + 3)/(n + 2)) + ((12 n + 6)/(n + 2)) x, B_n(x) = ((-n + 1)/(n + 2)) + ((-12 n + 12)/(n + 2)) x + ((-36 n + 36)/(n + 2)) x^2: 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, P_(n-1) interlaces P_n (weakly, in the sense of Liu and Wang), and deg P_n - deg P_(n-1) is 0 or 1 for n >= 2","route":"liu_wang_three_term","success":true,"variant":"liu_wang_three_term"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 2, with A_n(x) = ((6 n + 3)/(n + 2)) + ((12 n + 6)/(n + 2)) x, B_n(x) = ((-n + 1)/(n + 2)) + ((-12 n + 12)/(n + 2)) x + ((-36 n + 36)/(n + 2)) x^2","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, P_(n-1) interlaces P_n (weakly, in the sense of Liu and Wang), and deg P_n - deg P_(n-1) is 0 or 1 for n >= 2"],"theorem":"liu_wang_three_term: L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction; Proposition 3.3 (the case B_n(x) = -(c_n x + d_n)^2)"},"kind":"weak","orientation":"previous_interlaces_next"},"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 = phi(n, D) = (1) D 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 (-inf, 0]"},"kind":"preserver_image"}