Proof step

Parent-row provers of polytool

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

Concludes
Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 3*n + 3.
Premises
none: a direct theorem check
Theorem
polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-900563a8e48842d5 · 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 2fe6ebf99fd4ab575d8b9185f003c103b7118e2ba296ca2677f29dfa81ac3f16, 1,588 bytes (741 compressed); download
polytool replayed the certificate when the step was written.
Cited by