Proof step

Parent-row provers of polytool

Shared parent provers on the sequence's own rule paper theorem

Concludes
Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
Premises
none: a direct theorem check
Theorem
polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-b7e2357d6bcd12b4 · JSON
Operation
Shared parent provers on the sequence's own rule
{
  "operation": "parent_provers",
  "route": "paper_theorem"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 1,
  "kind": "weak",
  "orientation": "previous_interlaces_next"
}
Certificate
parent_provers, SHA-256 bcc5131d8d59b10e0cb04bcdba712ffd3a8759f9df32bcac96b9c918ad2f3f46, 2,197 bytes (909 compressed); download
polytool replayed the certificate when the step was written.
Cited by