Proof step e-484268c09e1d1880

theorem_check three_term_recurrence → concludes about Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions. 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 5e72182cc8dcf66f4d9d7ad1fe68fa3fdfddc84fb8b8fa0cca194fb9a049670c, 3,339 bytes (1,145 compressed); download JSON

Cited by

• n-66e2c3448245b0b7 (real_rooted)
• n-66e2c3448245b0b7 (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