Proof step

Three-term recurrence criterion

Theorem check of the sequence's own rule three term recurrence

Concludes: Triangle read by rows: T(n,0)=1, T(n,n)=2, T(n,m) = T(n-1,m-1) + Sum_{k=0..m} T(n-1-k,m-k).
Premises: none: a direct theorem check
Theorem: [Sze39, §3.3; Fav35] polytool ?
Checked: polytool replayed · Lean not attempted

Technical details

Step id

e-556c652affc70e9f · JSON

Operation

Theorem check of the sequence's own rule

{
  "operation": "theorem_check",
  "theorem": "three_term_recurrence"
}

Claims

{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": false,
      "value": "0"
    }
  }
}

{
  "claim": "interlacing",
  "from_index": 2,
  "kind": "strict",
  "orientation": "previous_interlaces_next"
}

Certificate

theorem_check, SHA-256 8b3abc849004055c234e3c05fef22278f5ddbfb2162984e1bf44be6d0ce9c056, 4,552 bytes (1,423 compressed); download

polytool replayed the certificate when the step was written.

Cited by

References

[Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
[Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023