Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — an edge of tenacity tmt_mtm​ is a bridge iff both min levels equal (tm−1)/2(t_m-1)/2(tm​−1)/2

Proved
MVBlossoms.lemma_4

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

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

Let (u,v)(u,v)(u,v) be an edge of GGG with tenacity(u,v)=tm\mathrm{tenacity}(u,v)=t_mtenacity(u,v)=tm​, and write tm=2i+1t_m=2i+1tm​=2i+1. Then (u,v)(u,v)(u,v) is a bridge if and only if

min level(u)=min level(v)=i.\mathrm{min\ level}(u)=\mathrm{min\ level}(v)=i .min level(u)=min level(v)=i.

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
  • encoding: "where tm = 2i + 1" → for every natural i with t_m = 2i + 1; reason: such i exists (t_m is finite and odd under t_m < l_m) and is unique
Preamble
import Mathlib
import Definitions.Def_MVBlossoms_minLevel
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 4.** Vazirani, *A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length*,
Math. Oper. Res. 49(3) (2024), Lemma 4, p.2028: "Let (u, v) be an edge of tenacity tm. Then, (u, v)
is a bridge if and only if min level(u) = min level(v) = i, where tm = 2i + 1."

**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`. "i" is any natural number with `t_m = 2i + 1`. -/
theorem lemma_4 {V : Type} [Fintype V] [DecidableEq V] {G : SimpleGraph V} (M : G.Subgraph)
    (hM : M.IsMatching) (hstd : tm M < lm M)
    (u v : V) (hadj : G.Adj u v) (hten : edgeTenacity M u v = tm M) :
    ∀ i : ℕ, tm M = ((2 * i + 1 : ℕ) : ℕ∞) →
      (IsBridge M u v ↔ minLevel M u = (i : ℕ∞) ∧ minLevel M v = (i : ℕ∞)) := 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 4, 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