{"kind":"theorem_check","report":{"conclusion":{"first_index":0,"interlacing":"weak","interlacing_from":1,"root_region":{"lower":{"closed":true,"value":"0"}},"simple_roots":false,"statement":"every P_n, n >= 0, is nonzero and real-rooted with every root in [0, inf); deg P_n = deg P_(n-1) + 1 for n >= 1; P_(n-1) interlaces P_n (weakly: P_n = a_n P_(n-1) with a_n linear adds one real root) for n >= 1"},"hypotheses":[{"evidence":"q(n) delta_S(n) sum_d c_d(n, x) D^d = f(n) (g H)(n, x) o S_num holds exactly in the Ore algebra (S_n = the identity)","name":"operator_identity","statement":"the step operator T_n of the rule equals a_n(x) S_n","status":{"kind":"verified"}},{"evidence":"P_0 has degree 2; checked exactly","name":"start_row_in_region","statement":"P_0 is nonzero and real-rooted with every root in [0, inf)","status":{"kind":"verified"}},{"evidence":"delta = 1, deg P_(n-1) = n + 1: Lambda(n, deg P_(n-1)) = 1 != 0 for every integer n in [1, +inf) (exact; Taylor shift: the coefficients of Lambda(n, deg P_(n-1)) = 1 at n = 1 + u have one sign)","name":"degree_step","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["1"]},"numerator":["1"],"range":{"first":"1","last":null}},"decision":"holds"},"statement":"deg P_n = deg P_(n-1) + delta for every n >= 1: the coefficient Lambda(n, e) of x^(e + delta) in f(n) T_n(x^e) is nonzero at e = deg P_(n-1)","status":{"kind":"verified"}},{"evidence":"the polynomial has degree <= 1 in x, so it is real-rooted","name":"multiplier_index_factor_reflected_roots_nonpositive","statement":"the polynomial in x is real-rooted with every root <= 0 for every n >= n0","status":{"kind":"verified"}},{"evidence":"c_0(n) c_1(n) >= 0 for every integer n in [1, +inf) (exact; Taylor shift: the coefficients of c_0(n) c_1(n) at n = 1 + u have one sign)","name":"multiplier_index_factor_reflected_coefficients_01_same_sign","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["18","6"]},"numerator":["12","6"],"range":{"first":"1","last":null}},"decision":"holds"},"statement":"the coefficients of x^0 and x^1 have the same sign (or one vanishes) for every n >= n0","status":{"kind":"verified"}}],"iterated_preserver":{"degree_step":1,"induction_start":0,"multiplier_fixed_factor":["1"],"multiplier_index_factor":[{"denominator":["1"],"numerator":["-12","-6"]},{"denominator":["1"],"numerator":["1"]}],"operator_identity":"f(n) T_n = sum_d c_d(n, x) D^d equals f(n) a_n(x) S_n with a_n(x) = (1) ((-12 + -6 n) + (1) x)","region":{"lower":{"closed":true,"value":"0"}},"start_degree":2},"lean_replay":"not_attempted","normal_form":"P_n = a_n(x) S_n(P_(n-1)) for n >= 1, with a_n(x) = (1) ((-12 + -6 n) + (1) x) and S_n = the identity","recurrence":{"first_index":0,"initial_polynomials":[["72","-18","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-12","1"],["-6","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"reference":"Iterated real-rootedness preservers (induction on n): if P_m is nonzero and real-rooted with every root in a closed region R and, for every n > m, P_n = a_n(x) S_n(P_(n-1)) where S_n maps every polynomial that is zero or real-rooted with every root in R to zero or a real-rooted polynomial with every root in R and a_n is real-rooted with every root in R, then every P_n is real-rooted with every root in R (the roots of a product are the roots of its factors); an exact degree step keeps every row nonzero; here S_n is the identity; for R = [0, inf) the reflection x -> -x maps the rows to rows with every root in (-inf, 0]","schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"iterated_preserver"}}