Proof step

Parent-row provers of polytool

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

Concludes: Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 tiles (0 <= k <= floor(n/2…
Premises: none: a direct theorem check
Theorem: polytool ?
Checked: polytool replayed · Lean not attempted

Technical details

Step id

e-1f99e3f22550f3d4 · 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 fb44ae1ac070d3bb33d9fd5903ab40d155130f9b70c133e778326e94de1cbe58, 2,411 bytes (1,012 compressed); download

polytool replayed the certificate when the step was written.

Cited by