Corollary 4 — structure of shortest paths to a vertex of tenacity
ProvedMVBlossoms.corollary_4alternating-pathsblossomsgraph-theorymatchingmicali-vaziranip2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and . Then:
- has a matched neighbour, and every matched neighbour of lies in the blossom ;
- every even level() path is an even level() path followed by an even level() path, and every odd level() path is an even level() path followed by an odd level() path; in both cases the second part lies in .
This is Statement 3 of Theorem 3 at .
Formalization Note Throughout, is a finite simple graph and a matching of ; levels and tenacities take values in . The section's standing assumption (p.2018: "Henceforth, we will assume that ") 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: b = base(v), the unique element of B(v) (Definitions 21, 29) → hypothesis IsBase M v b, i.e. baseSet M v = {b}, for every such b; reason: no junk value for base(v); together with Statement 2 / Corollary 2 it is the printed claim
- encoding: B_{b,t} by Definitions 22 and 31, union over basal v → one recursion blossom M b t on t, union over all w ∈ T_{b,t} ∪ {b}; reason: a non-basal w has an empty blossom, so the union is unchanged; at t = t_m it is Definition 22
- encoding: the blossom B_{b,t_m} → blossom M b t₀ with t₀ : ℕ and (t₀ : ℕ∞) = t_m; reason: t_m is finite under t_m < l_m; t₀ is that natural number
- encoding: "the matched neighbor of v also lies in the blossom" → some matched neighbour exists, and every v' with s(v,v') ∈ M lies in the blossom; reason: the definite description presupposes a matched neighbour (v ∈ U_m is matched since unmatched vertices have tenacity ≥ l_m > t_m), which is unique because M is a matching
Preamble
import Mathlib import Definitions.Def_MVBlossoms_IsEvenLevelPath import Definitions.Def_MVBlossoms_IsOddLevelPath import Definitions.Def_MVBlossoms_tenacity import Definitions.Def_MVBlossoms_lm import Definitions.Def_MVBlossoms_tm import Definitions.Def_MVBlossoms_IsBase import Definitions.Def_MVBlossoms_IsEvenLevelFromPath import Definitions.Def_MVBlossoms_IsOddLevelFromPath import Definitions.Def_MVBlossoms_blossom
Formal statement
namespace MVBlossoms
/-- **Corollary 4.** Vazirani, *A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length*,
Math. Oper. Res. 49(3) (2024), Corollary 4, p.2031: "Let v ∈ Um and b = base(v). Then, the
matched neighbor of v also lies in the blossom, and every even level(v) (odd level(v)) path consists
of an even level(b) path followed by an even level(b;v) (odd level(b;v)) path, where the latter lies
in B_{b,tm} ∪ {b}."
**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`. `t₀ : ℕ` is `t_m`. The conclusion also records that `v`
has a matched neighbor (the article's "the matched neighbor of v" presupposes it). -/
theorem corollary_4 {V : Type} [Fintype V] [DecidableEq V] {G : SimpleGraph V} (M : G.Subgraph)
(hM : M.IsMatching) (hstd : tm M < lm M)
(t₀ : ℕ) (ht₀ : (t₀ : ℕ∞) = tm M) (v b : V) (hv : tenacity M v = tm M) (hb : IsBase M v b) :
((∃ v' : V, s(v, v') ∈ M.edgeSet) ∧ ∀ v' : V, s(v, v') ∈ M.edgeSet → v' ∈ blossom M b t₀) ∧
∀ (f : V) (p : G.Walk f v),
(IsEvenLevelPath M p → ∃ (p₁ : G.Walk f b) (q : G.Walk b v), p = p₁.append q ∧
IsEvenLevelPath M p₁ ∧ IsEvenLevelFromPath M q ∧
∀ x ∈ q.support, x ∈ blossom M b t₀ ∨ x = b) ∧
(IsOddLevelPath M p → ∃ (p₁ : G.Walk f b) (q : G.Walk b v), p = p₁.append q ∧
IsEvenLevelPath M p₁ ∧ IsOddLevelFromPath M q ∧
∀ x ∈ q.support, x ∈ blossom M b t₀ ∨ x = b) := 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), Corollary 4, p.2031
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.