Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 — a max level path to a vertex of tenacity tmt_mtm​ contains a unique bridge of tenacity tmt_mtm​

Proved
MVBlossoms.lemma_5

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

alternating-pathsblossomsgraph-theorymatchingmicali-vaziranip2o-gran-per-chapterp2o-plan-paperp2o-v1

Let vvv be a vertex with tenacity(v)=tm\mathrm{tenacity}(v)=t_mtenacity(v)=tm​ and let ppp be a max level(vvv) path. Then exactly one edge of ppp is a bridge of tenacity tmt_mtm​.

This is Statement 1 of Theorem 3 at t=tmt=t_mt=tm​, with uniqueness.

Formalization Note Throughout, G=(V,E)G=(V,E)G=(V,E) is a finite simple graph and MMM a matching of GGG; levels and tenacities take values in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}. The section's standing assumption tm<lmt_m<l_mtm​<lm​ (p.2018: "Henceforth, we will assume that tm<lmt_m<l_mtm​<lm​") is a hypothesis.

Differences from the source:

  • encoding: levels, tenacities and l_m equal ∞ when no path exists (Definitions 3, 4) → values in ℕ∞, defined as infima (⊤ for an empty family); reason: Lean convention; same instances
Preamble
import Mathlib
import Definitions.Def_MVBlossoms_IsMaxLevelPath
import Definitions.Def_MVBlossoms_tenacity
import Definitions.Def_MVBlossoms_edgeTenacity
import Definitions.Def_MVBlossoms_lm
import Definitions.Def_MVBlossoms_tm
import Definitions.Def_MVBlossoms_IsBridge
Formal statement
namespace MVBlossoms

/-- **Lemma 5.** Vazirani, *A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length*,
Math. Oper. Res. 49(3) (2024), Lemma 5, p.2028: "Let v be a vertex of tenacity tm and p be a max
level(v) path. Then, p contains a unique bridge of tenacity tm."

**Formalization Note.** `V` is finite (`Fintype`), `G` is a simple graph and `M` a matching (`hM`); levels and
tenacities are in `ℕ∞` (definitions `evenLevel`, `oddLevel`, `tenacity`, `edgeTenacity`). The paper's standing assumption `t_m < l_m` ("Henceforth, we will assume that tm<lm",
p.2018; restated on p.2027) is the hypothesis `hstd`. Edges of `p` are unordered pairs `e : Sym2 V`
(`p.edges`); uniqueness is `∃!` over them. -/
theorem lemma_5 {V : Type} [Fintype V] [DecidableEq V] {G : SimpleGraph V} (M : G.Subgraph)
    (hM : M.IsMatching) (hstd : tm M < lm M)
    (v : V) (hv : tenacity M v = tm M) {f : V} (p : G.Walk f v) (hp : IsMaxLevelPath M p) :
    ∃! e : Sym2 V, e ∈ p.edges ∧
      ∃ a b : V, e = s(a, b) ∧ IsBridge M a b ∧ edgeTenacity M a b = tm M := by sorry

end MVBlossoms
Source
Vazirani, A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length, Math. Oper. Res. 49(3) (2024), Lemma 5, p.2028
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me