Proof step

Liu–Wang theorem for three-term recurrences

Theorem check of the sequence's own rule liu wang three term

Concludes
Triangle T(n,k) by rows: T(n, k) = (n-k+1)*T(n-1, k-1) + k*T(n-1, k) + T(n-2, k-1) with T(n, 1) = T(n, n) = 1.
Premises
none: a direct theorem check
Theorem
[LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-ae55ff74ad330052 · JSON
Operation
Theorem check of the sequence's own rule
{
  "operation": "theorem_check",
  "theorem": "liu_wang_three_term"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": false,
      "value": "0"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 1,
  "kind": "weak",
  "orientation": "previous_interlaces_next"
}
Certificate
theorem_check, SHA-256 200580027c274a1bdbeea2bd0fc36783d527a7a61dbc482c188be1ea980b1890, 5,047 bytes (1,451 compressed); download
polytool replayed the certificate when the step was written.
Cited by

References

  1. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003