Proof step

Parent-row provers of polytool

Shared parent provers on the sequence's own rule root domain

Concludes: Triangle read by rows, Stirling cycle numbers of order 3, T(n,n) = 1, T(n,k) = 0 if k<0 or k>n, otherwise T(n,k) = T(n-1,k-1)+(n-1)^3*T(n-1,k), for n>=0 and 0<…
Premises: none: a direct theorem check
Theorem: polytool ?
Checked: polytool replayed · Lean not attempted

Technical details

Step id

e-9f8105733f802d03 · JSON

Operation

Shared parent provers on the sequence's own rule

{
  "operation": "parent_provers",
  "route": "root_domain"
}

Claims

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

Certificate

parent_provers, SHA-256 527549de06f85890db53fb76e57a240a5f5584ce01b9c0cc89e78bbf381b1a2f, 1,441 bytes (724 compressed); download

polytool replayed the certificate when the step was written.

Cited by