Display (5.4), p. 7 (Filmus–Ward) —
ProvedCurvatureSubmod.LocalSearch.eq_5_4Let be a finite set, monotone increasing and submodular, and the Filmus–Ward potential of ,
Let and be bases of a matroid on and a bijection with a base for every (as in Lemma 5.1); write and . Then
This is Filmus and Ward's inequality [17, Theorem 5.1]: the total gain available from the swaps in the potential controls how far can fall below .
Formalization Note The page states (5.4) "for any submodular function ", citing [17], whose setting is monotone submodular normalised by ; the paper applies it only to the monotone nonnegative of Lemmas A.1 and A.2. The statement therefore assumes monotone increasing and nonnegative. The term of is excluded (see the Setting definition); with that convention the inequality holds for , since the constant adds the same amount to and . The indexing is a sum over .
import Mathlib import Definitions.Def_NonmonotoneSubmod_Shared_Submodular import Definitions.Def_CurvatureSubmod_LocalSearch_Setting
namespace CurvatureSubmod.LocalSearch
/-- Display (5.4), p. 7 (Filmus–Ward [17, Theorem 5.1]):
`(e/(e − 1)) g(A) ≥ g(B) + Σ_i [h(A) − h(A − a_i + b_i)]` for bases indexed as in Lemma 5.1. -/
theorem eq_5_4 {X : Type} [Fintype X] [DecidableEq X] (g : Finset X → ℝ)
(hg0 : ∀ A, 0 ≤ g A) (hgmono : MonoInc g) (hgsub : NonmonotoneSubmod.Shared.Submodular g)
(M : Matroid X) (A B : Finset X)
(hA : M.IsBase (↑A : Set X)) (hB : M.IsBase (↑B : Set X))
(π : X → X) (hπ : Set.BijOn π (↑A : Set X) (↑B : Set X))
(hswap : ∀ x ∈ A, M.IsBase (↑(insert (π x) (A.erase x)) : Set X)) :
g B + ∑ a ∈ A, (hPot g A - hPot g (insert (π a) (A.erase a)))
≤ Real.exp 1 / (Real.exp 1 - 1) * g A := by sorry
end CurvatureSubmod.LocalSearch
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.