Proof step e-f91a02f39edc297f

parent_provers periodic_product → concludes about Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n). JSON

Theorem

Parent-row provers of polytool polytool ?

Operation

Shared parent provers on the node's own rule

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

Premises

None: this step is a direct theorem check.

Claims

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

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: parent_provers, SHA-256 49ad6f78935d5d19ece4b9e22dfddac41dbb74adca3538fd4eeb719ac9a4597c, 629 bytes (375 compressed); download JSON

Cited by

• n-765f9e2b013b3c68 (one_signed_coefficients)
• n-765f9e2b013b3c68 (hadamard_kernel)
• n-765f9e2b013b3c68 (real_rooted)