{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","8"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","16","64"],["-1","-16","-64"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","8"],["6","16"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013611 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":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-594","-1224","-2688","-1536"],["-1806","-5656","-5632","-1536"],["-1632","-5760","-3072","0"],["-448","-1536","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-525","-320","464","1280","1024"],["-1710","-4440","-1792","512","0"],["-1600","-5376","-2048","0","0"],["-448","-1536","0","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["69","904","3152","2816","1024"],["96","1216","3840","2048","0"],["32","384","1024","0","0"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["54","72","192"],["306","408","64"],["288","128","0"],["64","0","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["54","72","192"],["306","408","64"],["288","128","0"],["64","0","0"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-28","-208","128"],["-78","152","64"],["96","128","0"],["64","0","0"]]},"terms":[{"coeff":{"coeffs":[["-28","-208","128","0"],["-114","-1256","-512","1536"],["288","1152","3072","0"],["448","1536","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-5","-72","-336","-768","-1024"],["-32","-448","-1792","-2048","0"],["-32","-384","-1024","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["9","6","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","8"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","16","64"],["-1","-16","-64"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","8"],["6","16"]]},"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":[["-18","-48"],["-14","-48"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1","12","32"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["6"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["324","4320","16704","27648","36864"],["1944","25920","94080","92160","24576"],["2340","29664","94016","52224","4096"],["960","11776","33792","8192","0"],["128","1536","4096","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["324","4320","16704","27648","36864"],["1944","25920","94080","92160","24576"],["2340","29664","94016","52224","4096"],["960","11776","33792","8192","0"],["128","1536","4096","0","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["36","432","1152"],["24","288","768"],["4","48","128"]]},"step_quotients":[[{"coeff":{"coeffs":[["-48","-960","-6144","-12288"],["-76","-1520","-9728","-19456"],["-32","-640","-4096","-8192"],["-4","-80","-512","-1024"]]},"deriv_order":0},{"coeff":{"coeffs":[["24","576","4992","18432","24576"],["14","336","2912","10752","14336"],["2","48","416","1536","2048"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-24","-576","-4992","-18432","-24576"],["-14","-336","-2912","-10752","-14336"],["-2","-48","-416","-1536","-2048"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["32"],["32"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-8","0"],["-16","-64"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1","12","32"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["2160","28224","96768","73728"],["3168","39552","119808","49152"],["1392","16960","47616","8192"],["192","2304","6144","0"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["216","5184","44928","165888","221184"],["216","5184","44928","165888","221184"],["72","1728","14976","55296","73728"],["8","192","1664","6144","8192"]]},"step_quotients":[[{"coeff":{"coeffs":[["9216","221184","1916928","7077888","9437184"],["22272","534528","4632576","17104896","22806528"],["19840","476160","4126720","15237120","20316160"],["8320","199680","1730560","6389760","8519680"],["1664","39936","346112","1277952","1703936"],["128","3072","26624","98304","131072"]]},"deriv_order":0},{"coeff":{"coeffs":[["-3456","-92160","-940032","-4571136","-10616832","-9437184"],["-5472","-148992","-1562112","-7876608","-19169280","-18087936"],["-3072","-84736","-903168","-4648960","-11599872","-11272192"],["-736","-20480","-220672","-1150976","-2916352","-2883584"],["-64","-1792","-19456","-102400","-262144","-262144"]]},"deriv_order":1},{"coeff":{"coeffs":[["144","5184","76032","580608","2433024","5308416","4718592"],["132","4752","69696","532224","2230272","4866048","4325376"],["40","1440","21120","161280","675840","1474560","1310720"],["4","144","2112","16128","67584","147456","131072"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["3168","82944","824832","3870720","8552448","7077888"],["4920","131328","1341312","6534144","15212544","13565952"],["2728","73728","765568","3812352","9134080","8454144"],["648","17664","185472","936960","2285568","2162688"],["56","1536","16256","82944","204800","196608"]]},"deriv_order":0},{"coeff":{"coeffs":[["-144","-5184","-76032","-580608","-2433024","-5308416","-4718592"],["-132","-4752","-69696","-532224","-2230272","-4866048","-4325376"],["-40","-1440","-21120","-161280","-675840","-1474560","-1310720"],["-4","-144","-2112","-16128","-67584","-147456","-131072"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["4","48","128"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","16","64"],["1","16","64"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-15","-40"],["-6","-16"]]},"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 + (1) D; 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":["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 [1, 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 + (1) D","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","8"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","16","64"],["-1","-16","-64"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","8"],["6","16"]]},"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 + (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/8)) P_(n-1) - c_n (x + 1/8)^2 P_(n-2) for n >= 2, with a_n = (4 n + 2)/(n + 2), b_n = (16 n + 8)/(n + 2), c_n = (64 n - 64)/(n + 2); Q_n(y) = y^(d_n) P_n(1/y - 1/8), 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/8 of the coordinate change y = 1/(x + 1/8)","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)) + ((16 n + 8)/(n + 2)) x, V_n(x) = 0, W_n(x) = ((-n + 1)/(n + 2)) + ((-16 n + 16)/(n + 2)) x + ((-64 n + 64)/(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 = -4 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 = -4 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)) + ((16 n + 8)/(n + 2)) x, B_n(x) = ((-n + 1)/(n + 2)) + ((-16 n + 16)/(n + 2)) x + ((-64 n + 64)/(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)) + ((16 n + 8)/(n + 2)) x, B_n(x) = ((-n + 1)/(n + 2)) + ((-16 n + 16)/(n + 2)) x + ((-64 n + 64)/(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 + (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"}