Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — three characterizations of submodularity

Proved
BarelyTestable.LowerBound.characterizations

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

lowerboundp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1property-testingsubmodularity

For every real function fff on the nnn-dimensional Boolean cube, the following three conditions are equivalent: the lattice submodularity inequality, nonnegative slack on every valid coordinate square, and diminishing returns on comparable vertices. Explicitly,

Submodular(f)  ⟺  every square has nonnegative slack  ⟺  ∀S⊆T, u∉T: f(T∪{u})−f(T)≤f(S∪{u})−f(S).\mathrm{Submodular}(f)\iff\text{every square has nonnegative slack}\iff\forall S\subseteq T,\ u\notin T:\ f(T\cup\{u\})-f(T)\le f(S\cup\{u\})-f(S).Submodular(f)⟺every square has nonnegative slack⟺∀S⊆T, u∈/T: f(T∪{u})−f(T)≤f(S∪{u})−f(S).

Both equivalences are included, also for zero- and one-dimensional cubes. This connects the reused unrestricted lattice definition to the local square tests.

Differences from the source:

  • encoding: Boolean vectors with coordinates numbered from 1 → finite subsets of Fin n, numbered from 0; reason: the incidence-vector bijection preserves every vertex, union, intersection and coordinate square
Preamble
import Mathlib
import Definitions.Def_BarelyTestable_LowerBound_Cube

set_option autoImplicit false
Formal statement
namespace BarelyTestable.LowerBound

open NonmonotoneSubmod.Shared MeasureTheory

/-- Lemma 2.2, p.9: all three conditions, with both equivalences. -/
theorem characterizations {n : ℕ} (f : Oracle (Fin n)) :
    (Submodular f ↔ NonnegativeSquares f) ∧
    (Submodular f ↔ DiminishingReturns f) := by sorry

end BarelyTestable.LowerBound
Source
Diptaksho Palit, Yuichi Yoshida, STOC 2027 submission #722 (October 2026), Lemma 2.2, p. 9 (printed = PDF page); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/722.pdf; PDF SHA256 a095e6ef801edf5b0ce3967efca977e04b7a0b4374e874116509d73837bd14f3
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