Proof step e-0f37534727a0e0cd

theorem_check three_term_recurrence → concludes about Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength … 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 514bbbcb85dd01ff00aa143d64224bddd7c268e3d970054e7465eb2c44aac299, 5,259 bytes (1,477 compressed); download JSON

Cited by

• n-8ce61d302cec295b (real_rooted)
• n-8ce61d302cec295b (one_signed_coefficients)
• n-8ce61d302cec295b (hadamard_kernel)
• n-8ce61d302cec295b (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