Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2.2 strictification — viε(S)=vi(S)+ε∣S∣v^\varepsilon_i(S)=v_i(S)+\varepsilon|S|viε​(S)=vi​(S)+ε∣S∣ is strictly increasing, keeps strict comparisons and symmetries, and EFX for vεv^\varepsilonvε implies EFX for vvv

Proved
EFXCounterex.Submodular.strictification

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

counterexampleefxfair-divisionp2o-gran-per-chapterp2o-plan-paperp2o-v1weighted-coverage

Let vvv be a profile of normalized monotone valuations of nnn agents over mmm goods. There is ε0>0\varepsilon_0>0ε0​>0 such that for every common ε∈(0,ε0)\varepsilon\in(0,\varepsilon_0)ε∈(0,ε0​) the perturbed profile viε(S)=vi(S)+ε∣S∣v^\varepsilon_i(S)=v_i(S)+\varepsilon|S|viε​(S)=vi​(S)+ε∣S∣ satisfies: (i) every viεv^\varepsilon_iviε​ is normalized; (ii) every viεv^\varepsilon_iviε​ is strictly increasing under inclusion; (iii) every strict comparison is preserved: vi(S)<vj(T)v_i(S)<v_j(T)vi​(S)<vj​(T) implies viε(S)<vjε(T)v^\varepsilon_i(S)<v^\varepsilon_j(T)viε​(S)<vjε​(T); (iv) every allocation that is EFX for vεv^\varepsilonvε is EFX for vvv; (v) every simultaneous relabelling (σ,π)(\sigma,\pi)(σ,π) of agents and goods that is a symmetry of vvv is a symmetry of vεv^\varepsilonvε.

Differences from the source:

  • encoding: valuations v_i : 2^M → R≥0, normalized and monotone → v : Fin n → Finset (Fin m) → ℝ with IsNormalized (v i) and IsMonotone (v i); reason: a normalized monotone real set function is nonnegative, so the instances are the same
  • encoding: an allocation is a tuple of pairwise disjoint bundles whose union is M (empty bundles allowed, no unallocated goods) → X : Fin n → Finset (Fin m) with IsAllocation X := LittleCharity.EFX.IsPartialAllocation X ∧ LittleCharity.EFX.pool X = ∅; reason: pairwise disjoint plus empty pool (no unallocated good) is exactly 'union is M'
  • reading: "For a sufficiently small common ε > 0" → ∃ ε₀ > 0, ∀ ε, 0 < ε → ε < ε₀ → …; reason: the standard meaning of 'sufficiently small'
  • reading: the paragraph's profile v (any valuations on the agents N and goods M) → any n, m and any normalized monotone profile v : Fin n → Finset (Fin m) → ℝ; reason: §3.2.2 states the step for an arbitrary monotone profile; p. 14: 'The two steps transfer every monotone EFX counterexample'
  • reading: "preserve every original strict comparison" → ∀ i j S T, v i S < v j T → perturb ε v i S < perturb ε v j T; reason: the stronger reading, which also covers comparisons between two agents' values; the per-agent comparisons are the case i = j
  • encoding: "every symmetry of the original profile under simultaneous relabeling of agents and goods" → every σ : Equiv.Perm (Fin n), π : Equiv.Perm (Fin m) with IsProfileSymmetry v σ π (v (σ i) (π(S)) = v i S for all i, S); reason: a symmetry is a relabelling that leaves the profile unchanged
Preamble
import Mathlib
import Definitions.Def_LittleCharity_EFX_Setting
import Definitions.Def_EFXCounterex_Submodular_Setting
Formal statement
namespace EFXCounterex.Submodular

/-- §3.2.2 (pp. 13–14), strictification. For any profile of normalized monotone valuations on `n`
agents and `m` goods, there is `ε₀ > 0` such that for every common `ε ∈ (0, ε₀)` the perturbed
profile `v^ε_i(S) = v_i(S) + ε|S|` is normalized and strictly increasing under inclusion, preserves
every strict comparison `v_i(S) < v_j(T)` of the original profile (for the same agent or two
agents), every EFX allocation for `v^ε` is EFX for `v`, and
every symmetry of `v` under a simultaneous relabelling of agents and goods is a symmetry of
`v^ε`. -/
theorem strictification {n m : ℕ} (v : Fin n → Finset (Fin m) → ℝ)
    (hnorm : ∀ i, IsNormalized (v i)) (hmono : ∀ i, IsMonotone (v i)) :
    ∃ ε₀ : ℝ, 0 < ε₀ ∧ ∀ ε : ℝ, 0 < ε → ε < ε₀ →
      (∀ i, IsNormalized (perturb ε v i)) ∧
      (∀ i, IsStrictlyIncreasing (perturb ε v i)) ∧
      (∀ i j S T, v i S < v j T → perturb ε v i S < perturb ε v j T) ∧
      (∀ X : Fin n → Finset (Fin m), IsAllocation X →
        LittleCharity.EFX.IsEFX (perturb ε v) X → LittleCharity.EFX.IsEFX v X) ∧
      (∀ (σ : Equiv.Perm (Fin n)) (π : Equiv.Perm (Fin m)),
        IsProfileSymmetry v σ π → IsProfileSymmetry (perturb ε v) σ π) := by sorry

end EFXCounterex.Submodular
Source
Akrami, Mackenzie, Mayorov, Mehlhorn, Srinivas, Suzuki, Weidenbach 2026, Counterexamples to EFX for Submodular and Subadditive Valuations, arXiv:2605.06451 (supplied manuscript, sha256 700243a1…), §3.2.2, display v^ε_i(S) = v_i(S) + ε|S| and the paragraph after it, pp. 13–14
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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