Proof step e-8187ad69de0e901a

parent_provers paper_theorem → concludes about Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n). 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 e716c9c843543ff8be3be21e3c8c467bf66562c966db7bc2bebd81a196bf4f78, 2,062 bytes (867 compressed); download JSON

Cited by

• n-97b51734d39ede6c (real_rooted)
• n-97b51734d39ede6c (one_signed_coefficients)
• n-97b51734d39ede6c (hadamard_kernel)
• n-97b51734d39ede6c (interlacing)