{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"reversal"},"parent":{"first_index":1,"initial_polynomials":[["1"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-12","18"],["-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 double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= k <= n)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-12","0"],["-15","-27"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","0","18"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["6"],["3"]]},"deriv_order":0,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["3"],["3"]]},"terms":[{"coeff":{"coeffs":[["9","-3","-4"],["9","15","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","18","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["2","1"],"operator":{"schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"reversal"},"parent":{"first_index":1,"initial_polynomials":[["1"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-12","18"],["-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":1,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["-12","0"],["-15","-27"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","0","18"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["6"],["3"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["6"],["3"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["-36","0","324"],["-36","0","324"],["-9","0","81"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0"],["-54","162","486","-1458"],["-45","135","405","-1215"],["-9","27","81","-243"]]},"deriv_order":0},{"coeff":{"coeffs":[["36","0","-648","0","2916"],["30","0","-540","0","2430"],["6","0","-108","0","486"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-72","0","1296","0","-5832"],["-60","0","1080","0","-4860"],["-12","0","216","0","-972"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["-9"],["9"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","18"],["-6","-18"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-1","0","9"]]},"deriv_order":2,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["216","0","-3888","0","17496"],["324","0","-5832","0","26244"],["162","0","-2916","0","13122"],["27","0","-486","0","2187"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["972","0","-17496","0","78732"],["2268","0","-40824","0","183708"],["1863","0","-33534","0","150903"],["648","0","-11664","0","52488"],["81","0","-1458","0","6561"]]},"deriv_order":0},{"coeff":{"coeffs":[["-1296","0","23328","0","-104976","0"],["-2376","-1944","42768","34992","-192456","-157464"],["-1620","-2592","29160","46656","-131220","-209952"],["-486","-1134","8748","20412","-39366","-91854"],["-54","-162","972","2916","-4374","-13122"]]},"deriv_order":1},{"coeff":{"coeffs":[["-108","0","2916","0","-26244","0","78732"],["-144","0","3888","0","-34992","0","104976"],["-63","0","1701","0","-15309","0","45927"],["-9","0","243","0","-2187","0","6561"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["2592","0","-46656","0","209952","0"],["5076","2916","-91368","-52488","411156","236196"],["3672","3888","-66096","-69984","297432","314928"],["1161","1701","-20898","-30618","94041","137781"],["135","243","-2430","-4374","10935","19683"]]},"deriv_order":0},{"coeff":{"coeffs":[["216","0","-5832","0","52488","0","-157464"],["288","0","-7776","0","69984","0","-209952"],["126","0","-3402","0","30618","0","-91854"],["18","0","-486","0","4374","0","-13122"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["3"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","0"],["1","-6","9"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-9","-9"],["-6","-6"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["3"],["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 1) and E the input rule gauged by lambda(n)/delta(n) and composed with (or conjugated through) T = x^(d_n) P(1/x), d_n = 0 + 1 (n - 1); so the candidate rows satisfy the input rule at every base n >= 1 (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 >= 1"},"method":"operator_division"},"status":"certified"},"input_first_index":1,"interlacing":{"reason":"the schedule d_n depends on n","status":"none"},"lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"lean_route":"reversed","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":1,"input_interlacing":{"reason":"the schedule d_n depends on n","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"x^(d_n) P(1/x), d_n = 0 + 1 (n - 1)","kind":"preserver_image","operator":{"schedule":{"first_degree":0,"first_index":1,"step":1},"shape":"reversal"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-12","18"],["-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 = x^(d_n) P(1/x), d_n = 0 + 1 (n - 1), for every n >= 1"},"parent_proof":{"route":"three_term_recurrence","statement":"every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 1, 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":"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_interlacing_report":{"conclusion":{"first_index":1,"interlacing":"strict","interlacing_from":2,"root_region":{"upper":{"closed":false,"value":"0"}},"simple_roots":true,"statement":"every P_n, n >= 1, is nonzero and real-rooted, with simple roots from n = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0)"},"hypotheses":[{"evidence":"f(n) = n + 1 != 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of f(n) = n + 1 at n = 3 + u have one sign)","name":"left_factor_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["4","1"]},"numerator":["1","1"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"the left-hand factor f(n) is nonzero for every n >= 3","status":{"kind":"verified"}},{"evidence":"f(n) a_n = 8 n - 4 != 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 8 n - 4 at n = 3 + u have one sign)","name":"leading_coefficient_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["20","8"]},"numerator":["-4","8"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"a_n != 0 for every n >= 3","status":{"kind":"verified"}},{"evidence":"Q_1 has degree 0, Q_2 degree 1; simple real roots and strict interlacing checked exactly","name":"seeds_interlace","statement":"Q_1 and Q_2 have simple real roots, degrees e and e + 1, and Q_1 strictly interlaces Q_2","status":{"kind":"verified"}},{"evidence":"beta_3 = 9/80 (exact)","name":"first_coefficient_positive","statement":"beta_3 = c_3 L_1 / (a_3 L_2) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = (9/64 n^2 - 9/32 n)/(n^2 - 2 n + 3/4) > 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of beta_n = (9/64 n^2 - 9/32 n)/(n^2 - 2 n + 3/4) at n = 4 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["3/4","-2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["35/4","6","1"],"shifted_numerator":["9/8","27/32","9/64"]},"numerator":["0","-9/32","9/64"],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"beta_n = c_n / (a_n a_(n-1)) > 0 for every n >= 4","status":{"kind":"verified"}},{"evidence":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = (3/8 n + 3/8)/(n - 1/2) (the exact ratio r_n): g(n) > 0 for n >= 3, r_3 >= g(3) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 4 + u have one sign)","name":"root_upper_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["0","3/16","-5/4","3","-3","1"],"method":{"kind":"taylor_shift","shifted_denominator":["1715/4","10339/16","1547/4","115","17","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"every root of Q_n is < 0 for every n >= 1 (region (-inf, 0) for P)","status":{"kind":"verified"}},{"evidence":"on the reflected rows (-1)^(deg) p_n(-y): seeds checked exactly; positive-ratio induction at t = 3 with g(n) = (9/8 n - 9/16)/(n - 1/2) ((t - alpha_n)/2): g(n) > 0 for n >= 3, r_3 >= g(3) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 4 + u have one sign)","name":"root_lower_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["-9/32","33/16","-23/4","15/2","-9/2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["8575/32","7105/16","1169/4","191/2","31/2","1"],"shifted_numerator":["69335/256","57197/128","18761/64","3059/32","31/2","1"]},"numerator":["-81/256","285/128","-383/64","243/32","-9/2","1"],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"every root of Q_n is > -3 for every n >= 1 (region (-inf, 0) for P)","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x - 1/3)) P_(n-1) - c_n (x - 1/3)^2 P_(n-2) for n >= 3, with a_n = (8 n - 4)/(n + 1), b_n = (6 n - 3)/(n + 1), c_n = (9 n - 18)/(n + 1); Q_n(y) = y^(d_n) P_n(1/y + 1/3), d_n = deg P_1 + n - 1, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","3"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-12","18"],["-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"},"reference":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","requested_root_region":{"upper":{"closed":false,"value":"0"}},"schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"three_term_recurrence"},"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":"P_n = (a_n + b_n (x - 1/3)) P_(n-1) - c_n (x - 1/3)^2 P_(n-2) for n >= 3, with a_n = (8 n - 4)/(n + 1), b_n = (6 n - 3)/(n + 1), c_n = (9 n - 18)/(n + 1); Q_n(y) = y^(d_n) P_n(1/y + 1/3), d_n = deg P_1 + n - 1, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2): every P_n, n >= 1, is nonzero and real-rooted, with simple roots from n = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0)","route":"three_term_recurrence","success":true,"variant":"three_term_recurrence"}],"conditional_on":[],"interlacing":{"from_index":2,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = (a_n + b_n (x - 1/3)) P_(n-1) - c_n (x - 1/3)^2 P_(n-2) for n >= 3, with a_n = (8 n - 4)/(n + 1), b_n = (6 n - 3)/(n + 1), c_n = (9 n - 18)/(n + 1); Q_n(y) = y^(d_n) P_n(1/y + 1/3), d_n = deg P_1 + n - 1, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","every P_n, n >= 1, is nonzero and real-rooted, with simple roots from n = 1 on; P_(n-1) strictly interlaces P_n for n >= 2; every root lies in (-inf, 0)"],"theorem":"three_term_recurrence: three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction"},"kind":"strict","orientation":"previous_interlaces_next"},"route":"three_term_recurrence","rows_checked":10,"statement":"every parent row P_n, n >= 1, 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 = x^(d_n) P(1/x), d_n = 0 + 1 (n - 1) for every n >= 1, the side conditions hold for every n, and every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 1, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}