Buck's measure density is defined via finite coverings by arithmetic progressions, measuring the modular spread of subsets of natural numbers.
It distinguishes between upper, lower, and strict Buck densities, providing a robust framework for nullity criteria and finitely additive probability measures.
The approach enables explicit computable examples and supports universal comparison principles in additive combinatorics and density theory.
Searching arXiv for recent and foundational papers on Buck's measure density and related results.
Buck’s measure density is a measure-theoretic notion of density on subsets of the natural numbers generated by finite coverings by arithmetic progressions. In its classical form, for S⊂N one defines
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},
where r+(m)={n∈N;n≡r(modm)}. A set is Buck measurable when
μ∗(S)+μ∗(N∖S)=1.
This construction, introduced by R. C. Buck in 1946 and developed in later work, lies at the intersection of arithmetic progressions, modular distribution, outer-measure constructions, and finitely additive probability on suitable algebras of sets (Pasteka, 1 Aug 2025, Iacò et al., 2015).
1. Classical definition and measurable structure
In the classical notation, (m)=0+(m) is the set of multiples of m, and for S⊂N, aS={as;s∈S}. Buck’s outer density μ∗ is defined by minimizing the total cost ∑1/mi over finite coverings of μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},0 by residue classes μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},1. The family of Buck measurable sets is denoted by μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},2, and it satisfies two basic structural properties: μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},3 is an algebra of sets, and the restriction
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},4
is a finitely additive probability measure on μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},5 (Pasteka, 1 Aug 2025).
This is the direct arithmetic analogue of an outer-measure-to-measure construction. In later terminology, the upper Buck density is often written μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},6 or μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},7, the conjugate lower Buck density as μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},8 or μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},9, and the induced Buck density r+(m)={n∈N;n≡r(modm)}0 is defined on the domain
r+(m)={n∈N;n≡r(modm)}1
with
r+(m)={n∈N;n≡r(modm)}2
on that domain (Leonetti et al., 2022). This distinction is fundamental: upper and lower Buck densities are defined on all subsets, whereas Buck density in the strict measurable sense is defined only where the upper and lower values coincide (Leonetti et al., 2015).
2. Residue-class formulations and arithmetic meaning
A major structural feature of Buck density is that it admits exact reformulations in terms of residue classes modulo highly divisible integers. For r+(m)={n∈N;n≡r(modm)}3 and r+(m)={n∈N;n≡r(modm)}4, let
r+(m)={n∈N;n≡r(modm)}5
the number of residue classes modulo r+(m)={n∈N;n≡r(modm)}6 hit by r+(m)={n∈N;n≡r(modm)}7. If r+(m)={n∈N;n≡r(modm)}8 is a sequence such that every fixed r+(m)={n∈N;n≡r(modm)}9 divides all sufficiently large μ∗(S)+μ∗(N∖S)=1.0, then
μ∗(S)+μ∗(N∖S)=1.1
for every μ∗(S)+μ∗(N∖S)=1.2 (Pasteka, 1 Aug 2025). In this form, Buck’s outer density is literally the limiting proportion of occupied residue classes modulo sufficiently divisible moduli.
A parallel formulation in additive-combinatorial language uses residue images μ∗(S)+μ∗(N∖S)=1.3 modulo μ∗(S)+μ∗(N∖S)=1.4. For any multiplicatively increasing exhaustive sequence μ∗(S)+μ∗(N∖S)=1.5,
μ∗(S)+μ∗(N∖S)=1.6
so upper Buck density is asymptotically the proportion of residue classes modulo μ∗(S)+μ∗(N∖S)=1.7 that intersect μ∗(S)+μ∗(N∖S)=1.8 (Hennecart, 2024).
This residue-class viewpoint explains both the power and the counterintuitive behavior of Buck density. It is not a sparsity notion based on counting points in intervals. Leonetti and Tringali exhibit the set
μ∗(S)+μ∗(N∖S)=1.9
and state that (m)=0+(m)0 (Leonetti et al., 2019). Likewise, in additive-combinatorial examples built from irrational rotations, one has (m)=0+(m)1 but (m)=0+(m)2 and (m)=0+(m)3 (Hennecart, 2024). These examples show that Buck density measures modular spread rather than interval frequency.
where closure is taken in the compact ring of polyadic integers and (m)=0+(m)5 is Haar measure. This suggests a topological-measure realization of Buck density as a Haar-measure shadow of closure in a profinite-type compactification.
3. Explicit constructions and computable examples
The constructive side of the theory is especially clear in the paper “On Buck’s measurability of certain sets” (Pasteka, 1 Aug 2025). A key technical tool is a weak (m)=0+(m)6-additivity principle: if (m)=0+(m)7 are disjoint sets in (m)=0+(m)8 and
(m)=0+(m)9
then
m0
This substitutes for countable additivity in situations where the tails become Buck-negligible.
A second recurring principle is dilation. If m1 is an increasing sequence with m2, and m3 are such that all elements of the union of these sets are relatively prime to all m4, then
m5
is Buck measurable and
m6
Under the hypotheses used in the paper, the scaling law is
These principles yield explicit classes of measurable sets with computable Buck measures.
Set
Buck measure
m8, the odd numbers
m9
S⊂N0, for S⊂N1
S⊂N2
S⊂N3, with S⊂N4
S⊂N5
S⊂N6
S⊂N7
The set S⊂N8 consists of integers whose S⊂N9-adic exponent belongs to the prescribed set aS={as;s∈S}0, and it decomposes as
aS={as;s∈S}1
The several-prime version imposes simultaneous exponent restrictions on finitely many prime coordinates in the canonical factorization (Pasteka, 1 Aug 2025).
These examples show that Buck density interacts naturally with multiplicative structure. The measurable sets are not limited to periodic sets themselves; they include infinite disjoint unions of suitably scaled measurable pieces and sets defined by conditions on prime exponents.
4. Nullity criteria and arithmetic zero sets
The second major theme is Buck-nullity. For a prime aS={as;s∈S}2 and aS={as;s∈S}3, define
aS={as;s∈S}4
the slice of elements of aS={as;s∈S}5 with aS={as;s∈S}6-adic valuation exactly aS={as;s∈S}7. In the Buck setting, Niven’s theorem is stated as follows: if aS={as;s∈S}8 is a sequence of primes with
aS={as;s∈S}9
then
μ∗0
(Pasteka, 1 Aug 2025). This reduces the proof of Buck-nullity to the analysis of first-layer prime slices.
The paper applies this criterion to several concrete families. If μ∗1 satisfies
μ∗2
then μ∗3. If μ∗4 denotes the set of integers containing at most μ∗5 selected primes with odd exponent in canonical representation, then
μ∗6
If μ∗7 is the set of integers containing at most μ∗8 primes in canonical representation, then
A broader structural theorem is due to Leonetti and Tringali: a set ∑1/mi3 is small, meaning ∑1/mi4 for every upper quasi-density ∑1/mi5, if and only if
∑1/mi6
equivalently if and only if ∑1/mi7 (Leonetti et al., 2019). In this precise sense, upper Buck density is the universal detector of null sets for the whole class of upper quasi-densities considered there. The same paper derives Buck-nullity for integers with less than a fixed number of prime factors, for values of a binary quadratic form whose discriminant is not a perfect square, and for the image of ∑1/mi8 through a non-linear integral polynomial in one variable (Leonetti et al., 2019).
5. Axiomatic placement and generalized extensions
Buck density now sits inside a general axiomatic theory of densities on ∑1/mi9. In the framework of Leonetti and Tringali, an upper density μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},00 satisfies normalization, monotonicity, subadditivity, and the translation-dilation law
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},01
and upper Buck density is explicitly listed among the standard examples (Leonetti et al., 2015). Their main theorem states that every upper quasi-density has the strong Darboux property. Consequently, upper Buck density and lower Buck density satisfy the interpolation principle
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},02
for μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},03 and likewise for μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},04 (Leonetti et al., 2015). This strengthens mere surjectivity onto μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},05: every intermediate Buck-density value is realizable inside every inclusion interval of sets.
A different generalization replaces arithmetic progressions by an abstract system of finite decompositions. Given a set μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},06, finite decompositions
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},07
satisfying a common-refinement condition and a point-separation condition, and a finitely additive probability measure μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},08 on the algebra μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},09 generated by the decomposition atoms, one defines
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},10
A set is μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},11-measurable iff
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},12
and the restriction μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},13 is a finitely additive probability measure (Iacò et al., 2015). The classical Buck density is recovered by taking μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},14, μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},15 equal to the residue classes modulo μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},16, and μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},17. In this generalized form, Buck’s construction becomes a prototype for a decomposition-based outer density linked to compact metric completions, Borel probability measures, and uniform distribution theory (Iacò et al., 2015).
6. Universal comparison principles and additive-combinatorial role
Buck density has acquired a central role well beyond its original measure-theoretic setting. In “On the density of sumsets, II”, the decisive comparison principle is
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},18
for every arithmetic quasi-density μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},19 (Leonetti et al., 2022). Moreover,
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},20
Thus Buck density acts as a universal comparison object, and on the Buck-measurable domain every arithmetic quasi-density agrees with it.
The same paper identifies the practical nullity criterion
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},21
and uses it to prove that if μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},22 is non-empty and μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},23, then for each μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},24 there exists μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},25 such that, for every arithmetic quasi-density μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},26, both μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},27 and μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},28 are in the domain of μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},29 and
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},30
(Leonetti et al., 2022). This relies on periodic approximants modulo μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},31 and on the fact that Buck-null sets occupy only asymptotically negligible numbers of residue classes.
In additive combinatorics, upper Buck density supports a Kneser-type inverse theorem. If μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},32 and
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},33
then there exist a positive integer
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},34
periodic sets μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},35, and exact finite-quotient formulas such as
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},36
together with a quasi-periodic or arithmetic-progression alternative in μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},37 (Hennecart, 2024). This is the upper-Buck analogue of the “small sumset implies periodic structure” paradigm.
The same line of work also exhibits markedly nonclassical behavior. For any μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},38, there exists μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},39 such that
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},40
and for μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},41 there exists μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},42 such that
μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},43
so μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},44 has a Buck density while μ∗(S)=inf{i=1∑kmi1;S⊂i=1⋃k(ri+(mi))},45 does not (Hennecart, 2024). These constructions reinforce a general point: Buck density is highly arithmetic, governed by congruence-class occupancy across scales rather than by interval growth alone.