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 2, 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)^2*T(n-1, k), for …
Premises: none: a direct theorem check
Theorem: polytool ?
Checked: polytool replayed · Lean not attempted

Technical details

Step id

e-75340211638327c5 · 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 3e0c7328d6b719bc603cab17920fce024f285b6ef735f49051dc62ef7b3331bf, 1,413 bytes (715 compressed); download

polytool replayed the certificate when the step was written.

Cited by