{"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"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","6","9"],["-1","-6","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","3"],["6","6"]]},"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 Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-27","54","0","-54","27"],["-21","36","18","-60","27"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["4","6","-24","-4","36","-18"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["9","-27","27","-9"],["3","-9","9","-3"]]},"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":[["6","12","6"],["3","6","3"]]},"terms":[{"coeff":{"coeffs":[["2","-16","-78","-100","-40"],["25","124","213","154","40"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-4","-38","-130","-202","-146","-40"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["3","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"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","6","9"],["-1","-6","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","3"],["6","6"]]},"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","-27"],["-21","-27"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["4","18","18"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["9"],["3"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["9","-27","27","-9"],["3","-9","9","-3"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["162","729","729"],["108","486","486"],["18","81","81"]]},"step_quotients":[[{"coeff":{"coeffs":[["-216","-1620","-3888","-2916"],["-342","-2565","-6156","-4617"],["-144","-1080","-2592","-1944"],["-18","-135","-324","-243"]]},"deriv_order":0},{"coeff":{"coeffs":[["288","2592","8424","11664","5832"],["168","1512","4914","6804","3402"],["24","216","702","972","486"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-576","-5184","-16848","-23328","-11664"],["-336","-3024","-9828","-13608","-6804"],["-48","-432","-1404","-1944","-972"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["9"],["9"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","0"],["-12","-18"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2","9","9"]]},"deriv_order":2,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["2916","26244","85293","118098","59049"],["2916","26244","85293","118098","59049"],["972","8748","28431","39366","19683"],["108","972","3159","4374","2187"]]},"step_quotients":[[{"coeff":{"coeffs":[["23328","209952","682344","944784","472392"],["56376","507384","1648998","2283228","1141614"],["50220","451980","1468935","2033910","1016955"],["21060","189540","616005","852930","426465"],["4212","37908","123201","170586","85293"],["324","2916","9477","13122","6561"]]},"deriv_order":0},{"coeff":{"coeffs":[["-23328","-233280","-892296","-1627128","-1417176","-472392"],["-36936","-377136","-1482786","-2803734","-2558790","-905418"],["-20736","-214488","-857304","-1654830","-1548396","-564246"],["-4968","-51840","-209466","-409698","-389286","-144342"],["-432","-4536","-18468","-36450","-34992","-13122"]]},"deriv_order":1},{"coeff":{"coeffs":[["2592","34992","192456","551124","866052","708588","236196"],["2376","32076","176418","505197","793881","649539","216513"],["720","9720","53460","153090","240570","196830","65610"],["72","972","5346","15309","24057","19683","6561"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["42768","419904","1565892","2755620","2283228","708588"],["66420","664848","2546397","4651749","4061259","1358127"],["36828","373248","1453383","2714067","2438505","846369"],["8748","89424","352107","667035","610173","216513"],["756","7776","30861","59049","54675","19683"]]},"deriv_order":0},{"coeff":{"coeffs":[["-5184","-69984","-384912","-1102248","-1732104","-1417176","-472392"],["-4752","-64152","-352836","-1010394","-1587762","-1299078","-433026"],["-1440","-19440","-106920","-306180","-481140","-393660","-131220"],["-144","-1944","-10692","-30618","-48114","-39366","-13122"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["3"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","6","9"],["1","6","9"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-15","-15"],["-6","-6"]]},"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 = ((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 >= 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":"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"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","6","9"],["-1","-6","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","3"],["6","6"]]},"deriv_order":0,"offset":1,"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 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/3)) P_(n-1) - c_n (x + 1/3)^2 P_(n-2) for n >= 2, with a_n = (4 n + 2)/(n + 2), b_n = (6 n + 3)/(n + 2), c_n = (9 n - 9)/(n + 2); Q_n(y) = y^(d_n) P_n(1/y - 1/3), 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/3 of the coordinate change y = 1/(x + 1/3)","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)) + ((6 n + 3)/(n + 2)) x, V_n(x) = 0, W_n(x) = ((-n + 1)/(n + 2)) + ((-6 n + 6)/(n + 2)) x + ((-9 n + 9)/(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/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":"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)) + ((6 n + 3)/(n + 2)) x, B_n(x) = ((-n + 1)/(n + 2)) + ((-6 n + 6)/(n + 2)) x + ((-9 n + 9)/(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)) + ((6 n + 3)/(n + 2)) x, B_n(x) = ((-n + 1)/(n + 2)) + ((-6 n + 6)/(n + 2)) x + ((-9 n + 9)/(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 = ((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"}