Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, pp. 127–128 — a sequence {G_i} for M yields ⟨y, z⟩₀ satisfying (6)–(10)

Proved
EdmondsMatching65.Polyhedron.certificate_of_blossomSequence

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

blossomdualitymatchingp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite graph with edge weights ccc and let MMM be a matching. If there exists a sequence {Gi}i=0n\{G_i\}_{i=0}^n{Gi​}i=0n​ satisfying conditions (a)–(k) of Theorem (M) for GGG, ccc and MMM, then there is a dual vector ⟨y,z⟩\langle y,z\rangle⟨y,z⟩ satisfying (6) and (7) and, relative to MMM, the conditions (8), (9) and (10).

This is the translation of §5: the paper builds ⟨y,z⟩0\langle y,z\rangle_0⟨y,z⟩0​ explicitly by di=w(qi)−w(ui+1)d_i=w(q^i)-w(u^{i+1})di​=w(qi)−w(ui+1) on the node sets SiS_iSi​ absorbed into ui+1u^{i+1}ui+1 (11), z=2dz=2dz=2d (12) and yv=w(v)−∑S∋vdSy_v=w(v)-\sum_{S\ni v}d_Syv​=w(v)−∑S∋v​dS​ (13). It is the "if" direction of Theorem (M) in certificate form.

Formalization Note The graph is given by a finite node type VVV, a finite edge type EEE and, for each edge, the unordered pair of its ends (no loops). Parallel edges are allowed, which covers the contracted graphs of Theorem (M); a simple graph is the special case of an injective end map. Vectors xxx have one real coordinate per edge.

Preamble
import Mathlib
import Definitions.Def_EdmondsMatching65_Polyhedron_Graph
import Definitions.Def_EdmondsMatching65_Polyhedron_DualProgram
import Definitions.Def_EdmondsMatching65_Polyhedron_BlossomSequence
Formal statement
namespace EdmondsMatching65.Polyhedron

theorem certificate_of_blossomSequence {V E : Type*} [Fintype V] [DecidableEq V]
    [Fintype E] [DecidableEq E] (G : Graph V E) (c : E → ℝ) (M : Finset E)
    (hM : IsMatching G M) (s : BlossomSequence G c M) :
    ∃ (y : V → ℝ) (z : Finset V → ℝ), DualFeasible G c y z ∧ CompSlack G c M y z := by sorry

end EdmondsMatching65.Polyhedron
Source
Edmonds, Maximum Matching and a Polyhedron With 0,1-Vertices, J. Res. NBS 69B (1965), pp. 127–128, §5, (11)–(16) and the verification of (6)–(10)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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