{"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"],["2","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","2"],["-8","-8"],["8","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-12","24","-12"],["32","-64","32"],["-16","32","-16"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-2","2","2","-2"],["-6","2","14","-10"],["-4","-4","20","-12"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-4","12","-12","4"],["0","-8","24","-24","8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1","-2","1"],["2","-4","2"],["1","-2","1"]]},"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":[["0","0","0"],["0","0","0"],["1","2","1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0","0"],["-2","-8","-10","-4"],["4","16","20","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-12","-12","-4"],["0","8","24","24","8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1","2","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"],["2","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","2"],["-8","-8"],["8","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-12","24","-12"],["32","-64","32"],["-16","32","-16"]]},"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":[["-2","-2"],["-6","-10"],["-4","-12"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-4","4"],["0","-8","8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["2"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["1","-2","1"],["2","-4","2"],["1","-2","1"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["0","-1","1"],["0","-4","4"],["0","-6","6"],["0","-4","4"],["0","-1","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","-24","48","-24"],["0","-112","224","-112"],["0","-214","428","-214"],["0","-214","428","-214"],["0","-118","236","-118"],["0","-34","68","-34"],["0","-4","8","-4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","48","-96","48"],["0","0","176","-352","176"],["0","0","252","-504","252"],["0","0","176","-352","176"],["0","0","60","-120","60"],["0","0","8","-16","8"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-192","384","-192"],["0","0","-1088","2176","-1088"],["0","0","-2416","4832","-2416"],["0","0","-2720","5440","-2720"],["0","0","-1648","3296","-1648"],["0","0","-512","1024","-512"],["0","0","-64","128","-64"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["0"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","1"],["0","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-1","1"]]},"deriv_order":2,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["0","0","1","-2","1"],["0","0","6","-12","6"],["0","0","15","-30","15"],["0","0","20","-40","20"],["0","0","15","-30","15"],["0","0","6","-12","6"],["0","0","1","-2","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","4","-8","4"],["0","0","28","-56","28"],["0","0","85","-170","85"],["0","0","146","-292","146"],["0","0","155","-310","155"],["0","0","104","-208","104"],["0","0","43","-86","43"],["0","0","10","-20","10"],["0","0","1","-2","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-4","4","4","-4"],["0","0","-20","12","36","-28"],["0","0","-41","1","121","-81"],["0","0","-44","-38","208","-126"],["0","0","-26","-62","202","-114"],["0","0","-8","-44","112","-60"],["0","0","-1","-15","33","-17"],["0","0","0","-2","4","-2"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","-4","12","-12","4"],["0","0","0","-20","60","-60","20"],["0","0","0","-41","123","-123","41"],["0","0","0","-44","132","-132","44"],["0","0","0","-26","78","-78","26"],["0","0","0","-8","24","-24","8"],["0","0","0","-1","3","-3","1"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","24","-40","8","8"],["0","0","176","-272","16","80"],["0","0","542","-754","-118","330"],["0","0","918","-1098","-558","738"],["0","0","936","-888","-1032","984"],["0","0","588","-372","-1020","804"],["0","0","222","-50","-566","394"],["0","0","46","14","-166","106"],["0","0","4","4","-20","12"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","16","-48","48","-16"],["0","0","0","112","-336","336","-112"],["0","0","0","324","-972","972","-324"],["0","0","0","504","-1512","1512","-504"],["0","0","0","456","-1368","1368","-456"],["0","0","0","240","-720","720","-240"],["0","0","0","68","-204","204","-68"],["0","0","0","8","-24","24","-8"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["1"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["12","-24","12"],["32","-64","32"],["16","-32","16"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-18","-18"],["-24","-24"],["-8","-8"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["4"],["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"],["2","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","2"],["-8","-8"],["8","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-12","24","-12"],["32","-64","32"],["-16","32","-16"]]},"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":"three_term_recurrence","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_interlacing_report":{"conclusion":{"first_index":0,"interlacing":"strict","interlacing_from":1,"root_region":{"upper":{"closed":false,"value":"0"}},"simple_roots":true,"statement":"every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)"},"hypotheses":[{"evidence":"f(n) = n^2 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) = n^2 at n = 2 + 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","4","1"]},"numerator":["0","0","1"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"the left-hand factor f(n) is nonzero for every n >= 2","status":{"kind":"verified"}},{"evidence":"f(n) a_n = 16 n^2 - 16 n + 4 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 16 n^2 - 16 n + 4 at n = 2 + u have one sign)","name":"leading_coefficient_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["36","48","16"]},"numerator":["4","-16","16"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"a_n != 0 for every n >= 2","status":{"kind":"verified"}},{"evidence":"Q_0 has degree 0, Q_1 degree 1; simple real roots and strict interlacing checked exactly","name":"seeds_interlace","statement":"Q_0 and Q_1 have simple real roots, degrees e and e + 1, and Q_0 strictly interlaces Q_1","status":{"kind":"verified"}},{"evidence":"beta_2 = 1/12 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = (1/16 n^4 - 1/4 n^3 + 23/64 n^2 - 7/32 n + 3/64)/(n^4 - 4 n^3 + 11/2 n^2 - 3 n + 9/16) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = (1/16 n^4 - 1/4 n^3 + 23/64 n^2 - 7/32 n + 3/64)/(n^4 - 4 n^3 + 11/2 n^2 - 3 n + 9/16) at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["9/16","-3","11/2","-4","1"],"method":{"kind":"taylor_shift","shifted_denominator":["225/16","30","47/2","8","1"],"shifted_numerator":["15/16","31/16","95/64","1/2","1/16"]},"numerator":["3/64","-7/32","23/64","-1/4","1/16"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"beta_n = c_n / (a_n a_(n-1)) > 0 for every n >= 3","status":{"kind":"verified"}},{"evidence":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = (1/4 n)/(n - 1/2) (the exact ratio r_n): g(n) > 0 for n >= 2, r_2 >= g(2) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 3 + u have one sign)","name":"root_upper_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["9/128","-111/128","293/64","-431/32","385/16","-213/8","71/4","-13/2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["28125/64","215625/128","179375/64","84625/32","24775/16","4611/8","533/4","35/2","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"every root of Q_n is < 0 for every n >= 0 (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 = 1 with g(n) = (1/4 n)/(n - 1/2) (the exact ratio r_n): g(n) > 0 for n >= 2, r_2 >= g(2) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 3 + u have one sign)","name":"root_lower_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["9/128","-111/128","293/64","-431/32","385/16","-213/8","71/4","-13/2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["28125/64","215625/128","179375/64","84625/32","24775/16","4611/8","533/4","35/2","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"every root of Q_n is > -1 for every n >= 0 (region (-inf, 0) for P)","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x - 1)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 2, with a_n = (16 n^2 - 16 n + 4)/(n^2), b_n = (8 n^2 - 8 n + 2)/(n^2), c_n = (16 n^2 - 32 n + 12)/(n^2); Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","2"],["-8","-8"],["8","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-12","24","-12"],["32","-64","32"],["-16","32","-16"]]},"deriv_order":0,"offset":2,"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)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 2, with a_n = (16 n^2 - 16 n + 4)/(n^2), b_n = (8 n^2 - 8 n + 2)/(n^2), c_n = (16 n^2 - 32 n + 12)/(n^2); Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2): every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)","route":"three_term_recurrence","success":true,"variant":"three_term_recurrence"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = (a_n + b_n (x - 1)) P_(n-1) - c_n (x - 1)^2 P_(n-2) for n >= 2, with a_n = (16 n^2 - 16 n + 4)/(n^2), b_n = (8 n^2 - 8 n + 2)/(n^2), c_n = (16 n^2 - 32 n + 12)/(n^2); Q_n(y) = y^(d_n) P_n(1/y + 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; 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 >= 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"}