Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1 — some S⊆US\subseteq US⊆U, ∣S∣≤2k−1|S|\le 2k-1∣S∣≤2k−1, recovers δ(U)\delta(U)δ(U) against the sink Uˉ\bar UUˉ

Proved
CutSetEnum.theorem_2_1

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

combinatorial-optimizationhypergraph-k-cutp2o-gran-per-chapterp2o-plan-paperp2o-v1submodularityterminal-cuts

Let G=(V,E)G=(V,E)G=(V,E) be a hypergraph and k≥2k\ge2k≥2 an integer, and let (U,Uˉ)(U,\bar U)(U,Uˉ) be a 2-partition of VVV with d(U)=OPTk-cutd(U)=OPT_{k\text{-cut}}d(U)=OPTk-cut​. Then there is a non-empty set S⊆US\subseteq US⊆U with

∣S∣≤2k−1|S|\le 2k-1∣S∣≤2k−1

such that every minimum (S,Uˉ)(S,\bar U)(S,Uˉ)-terminal cut (A,Aˉ)(A,\bar A)(A,Aˉ) satisfies δ(A)=δ(U)\delta(A)=\delta(U)δ(A)=δ(U).

This is the one-sided half of Theorem 1.4: the sink terminal set is all of Uˉ\bar UUˉ. It already settles Theorem 1.4 when ∣Uˉ∣≤2k−1|\bar U|\le 2k-1∣Uˉ∣≤2k−1.

Differences from the source:

  • reading: “there exists a set S ⊆ U” → S ⊆ U and S non-empty; reason: (S, T)-terminal cuts are defined only for non-empty S (p.4); the stronger reading, and true: an empty witness can be replaced by any singleton {u} ⊆ U
  • encoding: d(U) = OPT_k-cut (a minimum over k-partitions) → IsOptKCutValue H k (d H U): some k-partition has cost d(U) and none has less; reason: no sInf, so no junk value when V has fewer than k vertices; same instances
  • encoding: (A, Ā) an (S, T)-terminal cut, a 2-partition with S ⊆ A ⊆ V \ T → published IsTerminalCut S T A := S ⊆ A ∧ Disjoint A T (no separate 2-partition clause); reason: for non-empty S and T the two coincide
  • encoding: δ(A) = δ(U), equality of sets of hyperedges → cutSet H A = cutSet H U, equality of sub-multisets of the hyperedge multiset; reason: parallel copies of a hyperedge cross a cut together, so multiset and set equality agree
Preamble
import Mathlib
import Definitions.Def_HyperKCut_Structure_Model
import Definitions.Def_CutSetEnum_cutSet
import Definitions.Def_CutSetEnum_IsOptKCutValue

open HyperKCut.Structure
Formal statement
namespace CutSetEnum

variable {V : Type} [Fintype V] [DecidableEq V]

/-- **Theorem 2.1: a source set `S ⊆ U` with `|S| ≤ 2k − 1` recovers `δ(U)` against sink `Ū`.**
Beideman, Chandrasekaran & Wang, arXiv:2204.09178v2, Theorem 2.1, p.10 (PDF 11): "Let G = (V, E)
be a hypergraph and let OPT_k-cut be the optimum value of Hypergraph-k-Cut in G for some integer
k ≥ 2. Suppose (U, Ū) is a 2-partition of V with d(U) = OPT_k-cut. Then, there exists a set S ⊆ U
with |S| ≤ 2k − 1 such that every minimum (S, Ū)-terminal cut (A, Ā) satisfies δ(A) = δ(U)."

**Formalization Note.** `(U, Uᶜ)` is a 2-partition: `U` and `Uᶜ` non-empty. "d(U) = OPT_k-cut" is
`IsOptKCutValue H k (d H U)` (attained and least). The conclusion asserts `S` non-empty, because
the paper defines `(S, T)`-terminal cuts only for non-empty `S` and `T`. Terminal cuts are the
published `IsMinTerminalCut` (no separate 2-partition clause; equivalent for non-empty terminal
sets). The conclusion quantifies over **every** minimum `(S, Uᶜ)`-terminal cut and compares
cut-sets (`cutSet`, multiset equality), not cut values. -/
theorem theorem_2_1
    (H : HyperKCut.Structure.Hypergraph V) (k : ℕ) (hk : 2 ≤ k)
    (U : Finset V) (hU : U.Nonempty) (hUc : Uᶜ.Nonempty)
    (hopt : IsOptKCutValue H k (d H U)) :
    ∃ S : Finset V, S ⊆ U ∧ S.Nonempty ∧ S.card ≤ 2 * k - 1 ∧
      ∀ A : Finset V, IsMinTerminalCut H S Uᶜ A → cutSet H A = cutSet H U := by sorry

end CutSetEnum
Source
Beideman, Chandrasekaran & Wang, Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k, arXiv:2204.09178v2, Theorem 2.1, p.10 (PDF 11)
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