Integer approximation with an exact affine barycenter #
A rational affine combination and an integer affine combination of weight one produce integer combinations of every sufficiently large weight. The integer correction depends only on the remainder modulo one common denominator, and therefore has uniformly bounded error.
theorem
EGZ.BalancedCombination.Data.exists_integer_approximation
{d : ℕ}
(D : Data d)
(β : ↥D.support → ℚ)
(hsum : ∑ q : ↥D.support, β q = 1)
(hvec : ∀ (i : Fin d), ∑ q : ↥D.support, β q * ↑(↑q i) = ↑(D.center i))
:
Exact integer affine combinations approximate n * β with a bounded
error independent of n. Positivity is not needed for this algebraic step.
theorem
EGZ.BalancedCombination.Data.exists_coefficients_of_rational
{d : ℕ}
(D : Data d)
(ε : ℝ)
(hε : 0 < ε)
(β : ↥D.support → ℚ)
(hβ : ∀ (q : ↥D.support), 0 < β q)
(hsum : ∑ q : ↥D.support, β q = 1)
(hvec : ∀ (i : Fin d), ∑ q : ↥D.support, β q * ↑(↑q i) = ↑(D.center i))
(hcap :
∀ (θ : ℝ),
0 < θ →
IsCentral D.support D.weight θ D.center.real →
∀ (q : ↥D.support), ↑(β q) ≤ (1 + ε / 2) * D.weight q / (θ * ∑ r : ↥D.support, D.weight r))
:
A single positive rational affine combination satisfying all the relaxed caps yields the balanced integer combinations, with constants independent of the centrality parameter.