Lax Lean Archive

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

Proof of `Kuhn's Algorithm Computes a Maximum Matching` (1st statement)

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

What this proof establishes

no assumptions

thm✓Lax117284.BipartiteKuhnCorrect (1st statement)

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 invariant of the run (Maximum.kuhnspecMaximum.kuhn_spec): the matching the algorithm keeps always respects the graph and is injective.