{"kind":"theorem_check","report":{"conclusion":{"first_index":1,"root_region":{"upper":{"closed":true,"value":"0"}},"simple_roots":false,"statement":"every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, 0] (so its coefficients have one sign); for n >= 2, Q_(n-1) interlaces Q_n (weakly, in the sense of Liu and Wang; no interlacing of the P_n is claimed)"},"hypotheses":[{"evidence":"degrees 0 and 0; real-rooted and Q_1 << Q_2 checked exactly","name":"seed_rows","statement":"Q_1 and Q_2 are nonzero and real-rooted, of degrees e and e or e + 1, and Q_1 << Q_2 (weak interlacing)","status":{"kind":"verified"}},{"evidence":"l_n = ([x^0] A_n) l_(n-1) + ([x^0] B_n) l_(n-2) when deg P_(n-1) - deg P_(n-2) = 0 (then deg P_n - deg P_(n-1) = 0): positive-ratio induction with g(n) = (n)/(n - 1) (the exact ratio): g(n) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of g(n) at n = 3 + u have one sign); u_3/u_2 = 3/2 >= g(3) = 3/2 exactly; t_n <= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of t_n at n = 4 + u have one sign); and s_n + t_n / g(n-1) - g(n) >= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of s_n + t_n / g(n-1) - g(n) at n = 4 + u have one sign)","name":"degree_law","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["-1","1"],"method":{"kind":"taylor_shift","shifted_denominator":["3","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"deg P_n - deg P_(n-1) is 0 or 1 and P_n, P_(n-2) have positive leading coefficients (after the sign normalization) for every n >= 3: constant degree; l_n = ([x^0] A_n) l_(n-1) + ([x^0] B_n) l_(n-2) when deg P_(n-1) - deg P_(n-2) = 0 (then deg P_n - deg P_(n-1) = 0)","status":{"kind":"verified"}},{"evidence":"B_n = -1 <= 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of B_n = -1 at n = 3 + u have one sign)","name":"lag_coefficient_nonpositive","sign_decision":{"certificate":{"condition":"nonpositive","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["-1"]},"numerator":["-1"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"B_n(x) <= 0 for every real x and every n >= 3","status":{"kind":"verified"}},{"evidence":"checked exactly","name":"seed_roots_negative","statement":"Q_1 and Q_2 have every root < 0","status":{"kind":"verified"}},{"evidence":"positive-ratio induction with g(n) = (n)/(n - 1) (the exact ratio): g(n) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of g(n) at n = 3 + u have one sign); u_3/u_2 = 3/2 >= g(3) = 3/2 exactly; t_n <= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of t_n at n = 4 + u have one sign); and s_n + t_n / g(n-1) - g(n) >= 0 for every integer n in [4, +inf) (exact; Taylor shift: the coefficients of s_n + t_n / g(n-1) - g(n) at n = 4 + u have one sign)","name":"constant_terms_positive","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["-1","1"],"method":{"kind":"taylor_shift","shifted_denominator":["3","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"4","last":null}},"decision":"holds"},"statement":"P_n(0) > 0 for every n >= 3 (normalized rows), with P_n(0) = A_n(0) P_(n-1)(0) + B_n(0) P_(n-2)(0)","status":{"kind":"verified"}}],"lean_declarations":["RealRooted.MaWang.strictInterl_of_interlaces_evalCoeff_nonpos"],"lean_replay":"not_attempted","normal_form":"Q_n = A_n(x) Q_(n-1) + B_n(x) Q_(n-2) for n >= 3, with A_n(x) = (2), B_n(x) = (-1); Q_n = P_n / x^(n - 1) for n >= 1, which satisfies the rule below","recurrence":{"first_index":1,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"reference":"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","schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"liu_wang_three_term"}}