Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bregman-Minc Claim A: sum of Radhakrishnan weights ≤ 1

Proved
BookSixth.bregman_minc_claimA

by burkh4rt · Sep 16, 2026 · Mathlib c5ea003 (Lean v4.30.0)

For any 0-1 matrix ofsize×n of size \times nofsize×n with positive row sums and any permutation π\piπ of the rows, the sum of Radhakrishnan weights ∑σ∈A(A)qW(A,σ,π)≤1\sum_{\sigma \in \mathcal{A}(A)} qW(A, \sigma, \pi) \leq 1∑σ∈A(A)​qW(A,σ,π)≤1. Here A(A)\mathcal{A}(A)A(A) is the set of compatible permutations (A-systems) and (A,\sigma,\pi) = \prod_i 1/\mathrm{avail}(i, \mathrm{preS}(A,\sigma,i), \pi)$.

Formal statement
import Mathlib
import Definitions.Def_BregmanMincWeights
open scoped BigOperators
open BregmanMincWeights

namespace BookSixth

theorem bregman_minc_claimA : ∀ (n : ℕ) (A : Matrix (Fin n) (Fin n) ℕ)
    (hA : ∀ i j, A i j ≤ 1) (hrows : ∀ i, 0 < ∑ j, A i j)
    (π : Equiv.Perm (Fin n)), ∑ σ ∈ aSys A, qW A σ π ≤ 1 := by
  sorry

end BookSixth
Source
Radhakrishnan, J. (1997). An entropy proof of Bregman theorem. See also Friedland, S. (2010). A proof of a generalized van der Waerden conjecture.

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