Proof step e-b87132cd573fb9e2

theorem_check three_term_recurrence → concludes about Delannoy paths counted by number of weak peaks. 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": {} }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: theorem_check, SHA-256 83e7ad4e4ce3b9b5b1ca32b94dd205c6f0771a0bc7433064eb03fa37d37ce223, 3,485 bytes (1,201 compressed); download JSON

Cited by

• n-b31aa1a3fd93d174 (real_rooted)

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