While this submission is a draft, it cannot be used by other submissions.

Proof of `Thin matrix preprocessing and query trade-offs` (1st statement)

groundedproofs/Lax350013Proofs/Certificates.lean · lax-350013

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The corresponding upstream theorem about programs of the word RAM. Direct uses of other exposed machine-level statements appear as proof-network dependencies.