Proof step e-7c3667820056c57c

parent_provers paper_theorem → concludes about 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… JSON

Theorem

Parent-row provers of polytool polytool ?

Operation

Shared parent provers on the node's own rule

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

Premises

None: this step is a direct theorem check.

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }
• { "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "previous_interlaces_next" }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: parent_provers, SHA-256 50c63492d7603c7830e32bbeabbb1f739baaf646c714daefe7225db2e2524b16, 2,276 bytes (967 compressed); download JSON

Cited by

• n-e3d901814302c059 (real_rooted)
• n-e3d901814302c059 (one_signed_coefficients)
• n-e3d901814302c059 (hadamard_kernel)
• n-e3d901814302c059 (interlacing)