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

Proof of `Kuhn's Algorithm Computes a Maximum Matching` (4th statement)

groundedproofs/Lax117284Proofs/Bipartite/KuhnCorrect.lean · lax-117284

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

A saturating result gives the injection l↦itsrightvertexl ↦ its right vertex; conversely a left vertex the algorithm leaves unmatched has failed, and the right vertices reachable from a failed vertex are fewer than the left ones, which no injection respecting the graph allows.