Bregman-Minc Claim A: sum of Radhakrishnan weights ≤ 1
ProvedBookSixth.bregman_minc_claimAFor any 0-1 matrix with positive row sums and any permutation of the rows, the sum of Radhakrishnan weights . Here 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 BookSixthSource
Radhakrishnan, J. (1997). An entropy proof of Bregman theorem. See also Friedland, S. (2010). A proof of a generalized van der Waerden conjecture.