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

Proof of `Computing balanced light separators from registered flow-cut outputs`

groundedproofs/Lax263307Proofs/ComputedSeparators.lean · lax-263307

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 fixed registered solver is called on canonically labeled remainders. Its actual cut prefixes determine the entire bounded cut list. The resulting computed parts are the vertices of the checked balanced partition.