Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Fractional covering and the exact integrality gap
For a finite set of nonzero elements of an abelian group, let be its dissociated subsets and put
The fractional covering number is the minimum of over nonnegative weights satisfying for every . The integral covering number requires each weight to be zero or one.
The source interface
Bourgain's Sidon sets and Riesz products, Section 2, Theorem (3)--(4) and Lemma 3, supplies an absolute constant : if every subset of has a dissociated subset of relative size at least , then every nonnegative weighting of has a dissociated subset with
The constant is uniform in and the ambient group. The theorem is consumed as a published source result. Its statement and the proof of Lemma 3, including its use of Lemma 2, were read in the printed article; this page does not reproduce or independently verify that source proof. The reference is J. Bourgain, Annales de l'Institut Fourier 35 (1985), no. 1, 137--148, specifically pp. 138--144, DOI 10.5802/aif.1003. The canonical source card records statement-level checking of the qualitative characterization. It does not independently verify the quantitative dependence used in (1).
Consequences for the finite target
Finite linear-programming duality and (1) give
For the lower bound, choose a nonempty and give each point of weight , where is its largest dissociated size. Give other points weight zero. Every dissociated set has weight at most one, so this is a feasible dual solution of value . Maximize over .
For the upper bound, an arbitrary feasible dual weighting has . Equation (1), with , bounds its total weight by . Duality then proves the claimed upper bound. These deductions are author-recorded by Plasma AI; they do not constitute an independent review of Bourgain.
Consequently the negative finite target in the proof sketch is equivalent to the existence of finite integer sets with bounded and unbounded . This does not require a transitive symmetry group. In particular, making a family asymmetric cannot produce unbounded fractional covering while keeping one positive hereditary extraction constant.
Equivalently, a positive solution needs a function such that implies for every finite integer configuration. The two formulations exchange constants using (2). The same reformulation applies to rational vector configurations through the exact realization of ternary relations. It supplies a necessary restriction on constructions, not such a rounding function.
For a transitive group of permutations preserving dissociation there is the sharper identity
Indeed, averaging the translates of a largest dissociated set meets any in points on average. Thus is at least this quantity, proving the lower bound on ; gives equality. The same translates, with equal weights, give the matching fractional cover.
The Grow--Whicher example has and . It therefore shows that the exact identity (3) can fail without symmetry. It does not evade the uniform comparison (2), and repeatedly amplifying that fractional separation cannot by itself produce the required counterexample.
Remaining construction problem
A separate finite obstruction is L211, the thirteen-point example: , , but . Its rational covering certificate gives weighted extraction with constant . Thus even that stronger hypothesis does not round to two colors. The claim and its complete finite evidence are author-recorded at tier 0.
A counterexample must realize a gap between integral and fractional covering while controlling the entire ternary part of its rational relation space. A high-chromatic planted hypergraph with a bounded fractional coloring is insufficient unless all additional ternary relations forced by the rational span preserve proportional extraction. The inherited realization lemma explains this closure requirement. No construction meeting both conditions is supplied here.