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

Proof of `Bounded optimal flatten-resolutions`

groundedproofs/Lax369799Proofs/OptimalResolutions.lean · lax-369799

What this proof establishes

no assumptions

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

Compress one oversized local variable map at a time. Context smallification preserves the outer algebra value, and the compression construction preserves the flatten-resolution. The number of oversized vertices strictly decreases. Associativity identifies the outer evaluations with the flattened values.