Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
โ† Formalpedia

ยง6, p. 353 โ€” L_v is the largest set in ๐’ž not containing v, the union of the M_u not containing v, and L_v โˆช {v} โˆˆ ๐’ž

Proved
SchrijverSFM.Ring.L_spec

by mikedeng1 ยท Oct 7, 2026 ยท Mathlib 0df444a (Lean v4.33.1)

lower-idealp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ring-familysubmodular-minimization

Let VVV be a finite set and C\mathcal CC a ring family on VVV with โˆ…,VโˆˆC\emptyset, V \in \mathcal Cโˆ…,VโˆˆC and Muโ‰ MvM_u \ne M_vMuโ€‹๎€ =Mvโ€‹ for uโ‰ vu \ne vu๎€ =v, where MvM_vMvโ€‹ is the smallest set of C\mathcal CC containing vvv. For vโˆˆVv \in VvโˆˆV let LvL_vLvโ€‹ be the union of all sets of C\mathcal CC not containing vvv. Then:

  1. LvโˆˆCL_v \in \mathcal CLvโ€‹โˆˆC and vโˆ‰Lvv \notin L_vvโˆˆ/Lvโ€‹;
  2. every YโˆˆCY \in \mathcal CYโˆˆC with vโˆ‰Yv \notin Yvโˆˆ/Y satisfies YโІLvY \subseteq L_vYโІLvโ€‹, so LvL_vLvโ€‹ is the largest set in C\mathcal CC not containing vvv;
  3. LvL_vLvโ€‹ is the union of those MuM_uMuโ€‹ not containing vvv:
Lv=โ‹ƒuโˆˆV,ย vโˆ‰MuMu;L_v = \bigcup_{u \in V,\ v \notin M_u} M_u;Lvโ€‹=uโˆˆV,ย vโˆˆ/Muโ€‹โ‹ƒโ€‹Muโ€‹;
  1. Lvโˆช{v}โˆˆCL_v \cup \{v\} \in \mathcal CLvโ€‹โˆช{v}โˆˆC.

Item 4 is what makes the weight c(v)=maxโก{0,f(Lv)โˆ’f(Lvโˆช{v})}c(v) = \max\{0, f(L_v) - f(L_v \cup \{v\})\}c(v)=max{0,f(Lvโ€‹)โˆ’f(Lvโ€‹โˆช{v})} of display (23) depend only on the values of fff on C\mathcal CC.

Formalization Note Items 1โ€“3 are the parenthetical description of LvL_vLvโ€‹ on p. 353; item 4 is implicit in (23), which evaluates fff at Lvโˆช{v}L_v \cup \{v\}Lvโ€‹โˆช{v}, and it needs the hypothesis Muโ‰ MvM_u \ne M_vMuโ€‹๎€ =Mvโ€‹.

Preamble
import Mathlib
import Definitions.Def_NonmonotoneSubmod_Shared_Submodular
import Definitions.Def_SchrijverSFM_Ring_Setting
Formal statement
namespace SchrijverSFM.Ring

theorem L_spec {V : Type} [Fintype V] [DecidableEq V]
    (C : Set (Finset V)) (hC : IsRingFamily C) (hempty : โˆ… โˆˆ C) (huniv : Finset.univ โˆˆ C)
    (hM : โˆ€ u v : V, u โ‰  v โ†’ M C u โ‰  M C v) (v : V) :
    L C v โˆˆ C โˆง v โˆ‰ L C v โˆง (โˆ€ Y โˆˆ C, v โˆ‰ Y โ†’ Y โІ L C v) โˆง
      L C v = (Finset.univ.filter (fun u => v โˆ‰ M C u)).biUnion (fun u => M C u) โˆง
      insert v (L C v) โˆˆ C := by sorry

end SchrijverSFM.Ring
Source
Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combin. Theory Ser. B 80 (2000), p. 353, ยง6, sentence defining L_v and display (23)
Human review
  • Endorsed by Shuze Chen ยท Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 ยท Oct 7, 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