Proof step e-a98b0ab5851394b4

theorem_check three_term_recurrence → concludes about Triangular array read by rows. T(n, k) is the coefficient of x^k in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z. JSON

Theorem

Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?

Operation

Theorem check of the node's own rule

{
  "operation": "theorem_check",
  "theorem": "three_term_recurrence"
}

Premises

None: this step is a direct theorem check.

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": false, "value": "0" } } }
• { "claim": "interlacing", "from_index": 1, "kind": "strict", "orientation": "previous_interlaces_next" }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: theorem_check, SHA-256 900ce8e02936115276154731ccac9e253cba390cd051d022268411a53a48538f, 3,544 bytes (1,238 compressed); download JSON

Cited by

• n-f3e0631eb8740f76 (interlacing)
• n-f3e0631eb8740f76 (real_rooted)
• n-f3e0631eb8740f76 (one_signed_coefficients)
• n-f3e0631eb8740f76 (hadamard_kernel)

References

1. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
2. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023