{"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"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["-2"],["-1"]]},"terms":[{"coeff":{"coeffs":[["0","-1","0"],["0","-3","0"],["0","-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["4","-4","1"],["4","-4","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis-map coefficients of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1)."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-12","0"],["-6","-10"],["4","-11"],["2","-3"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["12","-18","6"],["14","-21","7"],["4","-6","2"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0"],["3"],["4"],["1"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["0"],["2"]],"recurrence":{"denominator":{"coeffs":[["0"],["-2"],["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["4","-2"],["8","-3"],["2","2"],["-2","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","3","-1"],["-6","9","-3"],["-4","6","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["3","4","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["-2"],["-1"]]},"terms":[{"coeff":{"coeffs":[["0","-1","0"],["0","-3","0"],["0","-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["4","-4","1"],["4","-4","1"]]},"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":[["0","-6"],["4","-9"],["2","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["8","-12","4"],["4","-6","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["3"],["4"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0"],["6","-9","3"],["8","-12","4"],["2","-3","1"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["18","-27","9"],["48","-72","24"],["44","-66","22"],["16","-24","8"],["2","-3","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["-288","576","-360","72"],["-984","1968","-1230","246"],["-1316","2632","-1645","329"],["-880","1760","-1100","220"],["-312","624","-390","78"],["-56","112","-70","14"],["-4","8","-5","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["-576","1728","-1872","864","-144"],["-1392","4176","-4524","2088","-348"],["-1240","3720","-4030","1860","-310"],["-520","1560","-1690","780","-130"],["-104","312","-338","156","-26"],["-8","24","-26","12","-2"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["2304","-6912","7488","-3456","576"],["6720","-20160","21840","-10080","1680"],["7744","-23232","25168","-11616","1936"],["4560","-13680","14820","-6840","1140"],["1456","-4368","4732","-2184","364"],["240","-720","780","-360","60"],["16","-48","52","-24","4"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","0"],["2","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2","-3","1"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["36","-54","18"],["66","-99","33"],["36","-54","18"],["6","-9","3"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["108","-324","351","-162","27"],["432","-1296","1404","-648","108"],["684","-2052","2223","-1026","171"],["544","-1632","1768","-816","136"],["228","-684","741","-342","57"],["48","-144","156","-72","12"],["4","-12","13","-6","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["-576","1728","-1872","864","-144"],["-2832","8496","-9204","4248","-708"],["-5872","17616","-19084","8808","-1468"],["-6692","20076","-21749","10038","-1673"],["-4580","13740","-14885","6870","-1145"],["-1928","5784","-6266","2892","-482"],["-488","1464","-1586","732","-122"],["-68","204","-221","102","-17"],["-4","12","-13","6","-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","576","-1728","1872","-864","144"],["-576","4272","-9504","9132","-3960","636"],["-1968","10504","-20196","17902","-7392","1150"],["-2632","12288","-21730","18222","-7246","1098"],["-1760","7664","-12872","10388","-4016","596"],["-624","2608","-4236","3328","-1260","184"],["-112","456","-724","558","-208","30"],["-8","32","-50","38","-14","2"]]},"deriv_order":1},{"coeff":{"coeffs":[["-576","2592","-4752","4536","-2376","648","-72"],["-1968","8856","-16236","15498","-8118","2214","-246"],["-2632","11844","-21714","20727","-10857","2961","-329"],["-1760","7920","-14520","13860","-7260","1980","-220"],["-624","2808","-5148","4914","-2574","702","-78"],["-112","504","-924","882","-462","126","-14"],["-8","36","-66","63","-33","9","-1"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["-1152","1728","1440","-3888","2304","-432"],["-3360","1584","14568","-22572","11904","-2124"],["-2720","-9456","44008","-53172","25744","-4404"],["1080","-23316","63738","-66867","30384","-5019"],["3144","-23172","51438","-49371","21396","-3435"],["2160","-12264","24372","-22038","9216","-1446"],["720","-3624","6732","-5838","2376","-366"],["120","-564","1002","-843","336","-51"],["8","-36","62","-51","20","-3"]]},"deriv_order":0},{"coeff":{"coeffs":[["2304","-10368","19008","-18144","9504","-2592","288"],["9024","-40608","74448","-71064","37224","-10152","1128"],["14464","-65088","119328","-113904","59664","-16272","1808"],["12304","-55368","101508","-96894","50754","-13842","1538"],["6016","-27072","49632","-47376","24816","-6768","752"],["1696","-7632","13992","-13356","6996","-1908","212"],["256","-1152","2112","-2016","1056","-288","32"],["16","-72","132","-126","66","-18","2"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["2","-3","1"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-24","24","-6"],["-20","20","-5"],["-4","4","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","15"],["0","11"],["0","2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["-8"],["-6"],["-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":"the parent proof claims no interlacing","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":"the parent proof claims no interlacing","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"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["-2"],["-1"]]},"terms":[{"coeff":{"coeffs":[["0","-1","0"],["0","-3","0"],["0","-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["4","-4","1"],["4","-4","1"]]},"deriv_order":0,"offset":2,"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":"three_term_recurrence_whole_line","statement":"every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; Q_(n-1) strictly interlaces Q_n in y for n >= 1","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 0, is zero or real-rooted with roots in (-inf, +inf)","input_root_region":{},"parent_hypothesis":"every parent row used is real-rooted (anywhere on the line)","parent_root_region":{},"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_interlacing_report":{"conclusion":{"first_index":0,"simple_roots":true,"statement":"every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; Q_(n-1) strictly interlaces Q_n in y for n >= 1"},"hypotheses":[{"evidence":"f(n) = -n^2 - 2 n != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) = -n^2 - 2 n 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":["-8","-6","-1"]},"numerator":["0","-2","-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 = -4 n^2 - 6 n - 2 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = -4 n^2 - 6 n - 2 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":["-30","-22","-4"]},"numerator":["-2","-6","-4"],"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/20 (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/16 n^3 - 1/16 n^2 - 1/16 n)/(n^4 + n^3 - 1/4 n^2 - 1/4 n) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = (1/16 n^4 + 1/16 n^3 - 1/16 n^2 - 1/16 n)/(n^4 + n^3 - 1/4 n^2 - 1/4 n) at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["0","-1/4","-1/4","1","1"],"method":{"kind":"taylor_shift","shifted_denominator":["105","533/4","251/4","13","1"],"shifted_numerator":["6","8","31/8","13/16","1/16"]},"numerator":["0","-1/16","-1/16","1/16","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"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x - 2)) P_(n-1) - c_n (x - 2)^2 P_(n-2) for n >= 2, with a_n = (4 n^2 + 6 n + 2)/(n^2 + 2 n), b_n = (2 n^2 + 3 n + 1)/(n^2 + 2 n), c_n = (n^2 + n)/(n^2 + 2 n); Q_n(y) = y^(d_n) P_n(1/y + 2), 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"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["-2"],["-1"]]},"terms":[{"coeff":{"coeffs":[["0","-1","0"],["0","-3","0"],["0","-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["4","-4","1"],["4","-4","1"]]},"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","schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"three_term_recurrence"},"parent_proof":{"attempts":[],"conditional_on":[],"failing_row_index":2,"rows_checked":10,"statement":"parent row P_2 is nonzero and not real-rooted with coefficients of one sign; this parent gives no proof","status":"refuted"},"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 P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; Q_(n-1) strictly interlaces Q_n in y for n >= 1; so every Q_n, n >= 0, is zero or real-rooted with roots in (-inf, +inf)","whole_line_parent_proof":{"conclusion":{"first_index":0,"simple_roots":true,"statement":"every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; Q_(n-1) strictly interlaces Q_n in y for n >= 1"},"hypotheses":[{"evidence":"f(n) = -n^2 - 2 n != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) = -n^2 - 2 n 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":["-8","-6","-1"]},"numerator":["0","-2","-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 = -4 n^2 - 6 n - 2 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = -4 n^2 - 6 n - 2 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":["-30","-22","-4"]},"numerator":["-2","-6","-4"],"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/20 (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/16 n^3 - 1/16 n^2 - 1/16 n)/(n^4 + n^3 - 1/4 n^2 - 1/4 n) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = (1/16 n^4 + 1/16 n^3 - 1/16 n^2 - 1/16 n)/(n^4 + n^3 - 1/4 n^2 - 1/4 n) at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["0","-1/4","-1/4","1","1"],"method":{"kind":"taylor_shift","shifted_denominator":["105","533/4","251/4","13","1"],"shifted_numerator":["6","8","31/8","13/16","1/16"]},"numerator":["0","-1/16","-1/16","1/16","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"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x - 2)) P_(n-1) - c_n (x - 2)^2 P_(n-2) for n >= 2, with a_n = (4 n^2 + 6 n + 2)/(n^2 + 2 n), b_n = (2 n^2 + 3 n + 1)/(n^2 + 2 n), c_n = (n^2 + n)/(n^2 + 2 n); Q_n(y) = y^(d_n) P_n(1/y + 2), 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"],["0","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["-2"],["-1"]]},"terms":[{"coeff":{"coeffs":[["0","-1","0"],["0","-3","0"],["0","-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["4","-4","1"],["4","-4","1"]]},"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","schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"three_term_recurrence"}},"kind":"preserver_image"}