Proof step e-1502106ad4631c34

theorem_check three_term_recurrence → concludes about Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1). 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": 1, "region": {} }
• { "claim": "interlacing", "from_index": 2, "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 717ee8357b3b3ebf4dad85f33b99276eba8c50b3bb40a60c3e369898decd3c18, 2,589 bytes (993 compressed); download JSON

Cited by

• n-976cdb6e4a693ec8 (real_rooted)
• n-976cdb6e4a693ec8 (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