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

Proof of `Algebraic decomposition with boundary data`

groundedproofs/Lax369799Proofs/AlgebraicDecomposition.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

Flatten a normal pattern labelled by the reachable unary pieces. Its projection onto the planted original context preserves and lifts all marks and edges, including the hole's self-loops. Associativity then replaces each piece by its unary value.