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

Proof of `Bags meeting a connected vertex set`

groundedproofs/Lax263307Proofs/ConnectedBags.lean · lax-263307

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

Choose witnesses in the two bags and a walk joining them inside the connected vertex set. For each edge of that walk, use a bag containing its endpoints. The connected bag indices for each vertex join these edge bags into a walk between the original nodes, entirely inside the nodes meeting the vertex set.

Attribution

Bonnet–Chang, connected-bag observation in Lemma 9.