Proof step e-66ab36c44d35dd53

theorem_check three_term_recurrence → concludes about Triangle read by rows: T(n, k) = T(n-1, k-1) - T(n-2, k), with T(n, n) = 1, T(n, n-1) = -2. 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": {} }
• { "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 725dbf991220eec45879bf4678a53d9c627237bcb9b8b733c558275647a2c960, 2,590 bytes (988 compressed); download JSON

Cited by

• n-4ca7e225b5e9bcc6 (real_rooted)
• n-4ca7e225b5e9bcc6 (interlacing)

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