Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — the triangle dichotomy for mincuts

Proved
MSTCuts2027.Parallel.triangle_cut_dichotomy

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-algorithmsminimum-cutp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1parallel-algorithms

Let FFF be a symmetric real cut function, u,v,xu,v,xu,v,x three vertices, and CCC a (u,v)(u,v)(u,v)-mincut that keeps xxx on the side of uuu. Then exactly one of the following holds:

  1. λ1(x,v)=λ1(u,v)\lambda_1(x,v)=\lambda_1(u,v)λ1​(x,v)=λ1​(u,v), and CCC is an (x,v)(x,v)(x,v)-mincut;
  2. λ1(x,v)<λ1(u,v)\lambda_1(x,v)<\lambda_1(u,v)λ1​(x,v)<λ1​(u,v), and any cut is an (x,v)(x,v)(x,v)-mincut if and only if it is an (x,u)(x,u)(x,u)-mincut.

This is the fact behind EliminateTriangle: one known cut decides which edge of a triangle of G1G_1G1​ can be discarded.

Differences from the source:

  • encoding: three vertices, C keeps x on the side of u → x ≠ u, x ≠ v, and (x ∈ C ↔ u ∈ C); reason: x ≠ v follows anyway, and x = u is not a triangle; the cut (C, V∖C) is unoriented, so "side" is membership agreement
Preamble
import Mathlib
import Definitions.Def_FlowsNetworks_MultiTerminal_SpanningSubtree
import Definitions.Def_MSTCuts2027_Parallel_CutModel
Formal statement
namespace MSTCuts2027.Parallel

/-- Lemma 4: exactly one of the two assertions holds. -/
theorem triangle_cut_dichotomy {V : Type} [Fintype V] [DecidableEq V]
    (F : Finset V → ℝ) (hF : IsSymmetricCutFunction F)
    (u v x : V) (hxu : x ≠ u) (hxv : x ≠ v) (C : Finset V) (hC : IsMincut F u v C)
    (hside : x ∈ C ↔ u ∈ C) :
    Xor (lam F x v = lam F u v ∧ IsMincut F x v C)
      (lam F x v < lam F u v ∧ ∀ D : Finset V, IsMincut F x v D ↔ IsMincut F x u D) := by sorry

end MSTCuts2027.Parallel
Source
Baswana–Roy, Using MSTs to Compute All-Pairs Mincuts and Beyond ..., STOC 2027 submission #21, pinned preprint SHA-256 faa337be0f0f1bfbbcf924cb3591bd51ded2a6ef2c9e2154e00534a840156a11, Lemma 4, printed p. 6, PDF p. 8
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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