Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 21 (Beck–Fiala) — exact linear rounding to at most nnn fractional coordinates

Proved
ProportionalGroupDivision.Main.lemma_21

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

discrepancyfair-divisionindivisible-goodsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1proportionality

Let m>n>0m>n>0m>n>0 be integers, A∈[0,1]n×mA\in[0,1]^{n\times m}A∈[0,1]n×m and x∈[0,1]mx\in[0,1]^mx∈[0,1]m. Then there is x′∈[0,1]mx'\in[0,1]^mx′∈[0,1]m with

Ax=Ax′Ax=Ax'Ax=Ax′

such that all but nnn coordinates of x′x'x′ are rounded, i.e. at most nnn coordinates of x′x'x′ lie outside {0,1}\{0,1\}{0,1}.

Every row value is preserved exactly; the lemma reduces the rounding in Theorem 6 to the case m≤nm\le nm≤n.

Differences from the source:

  • encoding: rows, agents and goods indexed 1, …, n → 0-based indices Fin n; agent (i, j) is a dependent pair with j : Fin (n i); reason: relabelling; changes no instance
Preamble
import Mathlib

open scoped BigOperators
Formal statement
namespace ProportionalGroupDivision.Main

/-- Lemma 21 (Beck–Fiala, PDF p. 20): for integers `m > N > 0`, a matrix `A ∈ [0,1]^{N×m}` and a
point `x ∈ [0,1]^m` there is `x′ ∈ [0,1]^m` with `A x = A x′` such that all but `N` coordinates of
`x′` are rounded (equal to `0` or `1`). -/
theorem lemma_21 (N m : ℕ) (hN : 0 < N) (hNm : N < m) (A : Matrix (Fin N) (Fin m) ℝ)
    (hA : ∀ i g, A i g ∈ Set.Icc (0 : ℝ) 1) (x : Fin m → ℝ) (hx : ∀ g, x g ∈ Set.Icc (0 : ℝ) 1) :
    ∃ x' : Fin m → ℝ, (∀ g, x' g ∈ Set.Icc (0 : ℝ) 1) ∧ A.mulVec x = A.mulVec x' ∧
      (Finset.univ.filter (fun g => x' g ≠ 0 ∧ x' g ≠ 1)).card ≤ N := by sorry

end ProportionalGroupDivision.Main
Source
Alexander Shekhovtsov, Georgy Sokolov, Mikhail Cherniavskii, Andrey Kupavskii, Nearly Tight Bounds for Proportional Group Fair Divisions and One-Sided Discrepancy, STOC 2027 submission #606 (October 2026), PDF SHA-256 b01bf42964a30eaf9c85a3d02713fc0ac4cd63ae8653853fa44b062c0220f39a, Lemma 21, PDF p. 20 = printed p. 20
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