Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dvoretzky Covering Problem

Updated 23 January 2026
  • Dvoretzky covering problem is a probabilistic model that examines when a space—typically the unit circle—is fully covered by random intervals based on prescribed lengths and statistical laws.
  • Extensions involve general measures and higher-dimensional settings, using potential theory and capacity estimates to establish sharp coverage thresholds.
  • Martingale and harmonic analysis techniques reveal that the structure of non-covered sets is intricately linked to Fourier asymptotics and multifractal properties.

The Dvoretzky covering problem addresses the probabilistic covering of sets—most notably, the unit circle—by randomly placed intervals with prescribed lengths and statistical laws governing their centers. Initially posed by A. Dvoretzky, the question is: for which sequences of lengths, and under what statistical framework for the placement of intervals, is every point of a space almost surely covered infinitely often or at least once? The problem links extremal probability, Fourier analysis, potential theory, and multifractal geometry, and has seen extensions from the uniform circle model to arbitrary measures and spaces of higher dimension.

1. Classical Dvoretzky Covering Model and Shepp’s Criterion

In the canonical setting, the space is T=R/Z\mathbb{T} = \mathbb{R}/\mathbb{Z}, the unit circle. Let %%%%1%%%% be i.i.d. random variables, each uniform on T\mathbb{T}, denoting arc centers. Given a fixed, decreasing sequence (n)(\ell_n) with n0\ell_n \to 0, define random arcs In:=(ωn,ωn+n)I_n := (\omega_n,\,\omega_n+\ell_n) (mod 1).

A central object is the limsup set: lim supnIn={tT:tIn for infinitely many n}.\limsup_n I_n = \{ t \in \mathbb{T} : t \in I_n \text{ for infinitely many } n \}.

The core question is: Under what conditions on (n)(\ell_n) does

P(T=lim supIn)=1\mathbb{P}\left( \mathbb{T} = \limsup I_n \right) = 1

hold? Shepp (1972) gave a sharp necessary and sufficient condition: n=1n2exp(1++n)=    full covering a.s.\sum_{n=1}^\infty n^{-2} \exp\left(\ell_1 + \cdots + \ell_n\right) = \infty \iff \text{full covering a.s.} When this condition fails, a random exceptional set E:=Tlim supInE := \mathbb{T} \setminus \limsup I_n remains, whose properties have been the subject of intense analysis (Tan, 12 Nov 2025, Fan et al., 2019).

2. Extensions to General Measures and Geometric Sets

The model has evolved to include non-uniform laws for centers and to address covering problems on the real line and higher dimensions. The law of arc centers can be any Borel probability measure μ\mu, not necessarily uniform. In such general settings, the random covering set is

Er(ω)=k=1n=kB(ωn,rn),E_r(\omega) = \bigcap_{k=1}^\infty \bigcup_{n=k}^\infty B(\omega_n, r_n),

with (rn)(r_n) a sequence of radii and (ωn)(\omega_n) i.i.d. from μ\mu.

Anttila and Myllyoja (Anttila et al., 16 Jan 2026) provide a comprehensive solution for arbitrary analytic target sets ARA \subset \mathbb{R} and arbitrary Borel measures:

  • Define Xμ,r={xX:n[μ(B(x,rn))]2<}X_{\mu, r} = \{ x \in X : \sum_n [\mu(B(x, r_n))]^2 < \infty \} ("thin points").
  • Introduce a capacity Capμ,r(A)\mathrm{Cap}_{\mu, r}(A) based on the energy

Iμ,r(ν)=exp(n=1μ(B(x,rn)B(y,rn)))dν(x)dν(y).I_{\mu, r}(\nu) = \iint \exp\bigg(\sum_{n=1}^\infty \mu\big(B(x, r_n) \cap B(y, r_n)\big) \bigg) \, d\nu(x)\,d\nu(y).

Main theorem: P{AEr}=1    Capμ,r(AXμ,r)=0.\mathbb{P}\{A \subset E_r\} = 1 \iff \mathrm{Cap}_{\mu, r}(A \cap X_{\mu, r}) = 0. This both generalizes and sharpens the potential-theoretic criterion by Kahane for the uniform case.

3. Fine Structure and Harmonic Analysis of the Exceptional Set

If Shepp’s covering criterion is not met, the residual non-covered set EE exhibits intricate harmonic and geometric structure (Tan, 12 Nov 2025). Notably:

  • When n=α/n\ell_n = \alpha / n (0<α<10 < \alpha < 1), almost surely dimH(E)=1α\dim_H(E) = 1 - \alpha.
  • The work (Tan, 12 Nov 2025) establishes that for a large class of (n)(\ell_n), the set EE supports a natural multiplicative chaos measure μD\mu_D. This measure is constructed as the weak a.s. limit of product-martingale densities

Mn(t)=k=1n11(0,k)(tωk)1k.M_n(t) = \prod_{k=1}^n \frac{1 - 1_{(0, \ell_k)}(t - \omega_k)}{1 - \ell_k}.

The measure μD\mu_D is supported on EE and is absolutely continuous under suitable convolution powers.

  • Crucially, μD\mu_D is a Rajchman measure, i.e., its Fourier coefficients vanish at infinity,

μ^D(n)0,|\widehat{\mu}_D(n)| \to 0,

so EE is a set of multiplicity (MM-set); if μD\mu_D is continuous, EE is an M0M_0-set. This connects probabilistic covering phenomena to questions of uniqueness in Fourier series.

4. Potential Theory, Capacity, and Critical Exponents

Potential-theoretic methods are central to all modern solutions. Kahane’s φ\varphi-capacity for a kernel

φ(xy)=exp(n=1max(2rnxy,0))\varphi(|x-y|) = \exp\left(\sum_{n=1}^\infty \max(2r_n - |x-y|, 0)\right)

governs, for probability measure ν\nu,

Iφ(ν)=φ(xy)dν(x)dν(y).I_\varphi(\nu) = \iint \varphi(|x-y|)\, d\nu(x)\, d\nu(y).

A compact AA is covered a.s. iff Capφ(A)=0\mathrm{Cap}_\varphi(A) = 0 (Anttila et al., 16 Jan 2026).

For general measures, the capacity is replaced by the generalized Iμ,rI_{\mu, r} energy. The "thin point" contribution appears—if xx sees only finitely many overlapping balls in the second moment sense, then xx is not covered.

A key implication is that for polynomially decaying radii rn=cntr_n = c n^{-t}, there is a sharp phase transition:

  • If t1>D=supxdimloc(μ,x)t^{-1} > D = \sup_{x} \underline{\dim}_{\rm loc}(\mu, x), full measure is covered a.s.
  • If t1<Dt^{-1} < D, covering fails a.s.
  • At the threshold t=1/Dt = 1/D the outcome is dictated by the constant cc and multifractal structure—specifically, the spectrum of average densities (Anttila et al., 16 Jan 2026).

5. Coverings with Non-Uniform Laws: Sharp Thresholds and Genericity

The extension to non-uniform laws for arc centers employs the essential infimum mfm_f of a density ff and the set KfK_f of points on which ff attains this value. The principal threshold, for mf>0m_f > 0 and dimBKf<1\overline{\dim}_\mathrm{B} K_f < 1, is: lim supn1++nlnn1mf    full covering a.s.\limsup_{n \to \infty} \frac{\ell_1 + \cdots + \ell_n}{\ln n} \geq \frac{1}{m_f} \iff \text{full covering a.s.} This extends Shepp’s criterion and shows that the box-counting dimension of KfK_f governs the transition: when KfK_f is "small," non-uniformity can dramatically lower the threshold for covering (Hirayama et al., 2021, Fan et al., 2019).

The Menshov-type theorem further demonstrates that, except in the uniform case, one can force covering by arbitrarily small perturbations of ff if Kf=0|K_f| = 0, indicating a strong form of genericity in the critical regime (Hirayama et al., 2021).

6. High-Dimensional and Convex Geometric Analogues

Dvoretzky-type covering phenomena appear in high-dimensional convex geometry, notably in questions of covering the unit ball BXB_X of a Banach space by finitely many closed convex sets (Raja, 2024). Here, principal results include:

  • For fixed k,nk, n, any covering of BXB_X in sufficiently high dimension contains, among its pieces, an nn-dimensional ball of radius arbitrarily close to 1.
  • In infinite-dimensional XX, given mild translation conditions, one finds an infinite-dimensional ball of radius <1/2<1/2 in one of the covering sets.

These structural insights extend the reach of Dvoretzky’s classical theorem on almost Euclidean sections and tie covering problems in probability to the geometry of Banach spaces.

7. Proof Methodologies and Martingale Techniques

A consistent theme in both classical and modern work is the use of second-moment (Billard) methods and martingale convergence, now refined with products of survival indicators and multiplicative chaos tools. Weak convergence arguments, energy/capacity estimates, and measurable-selection principles (e.g., Jankov–von Neumann uniformization in (Anttila et al., 16 Jan 2026)) are employed to rigorously establish sufficiency and necessity of coverage criteria. In harmonic settings, convolution powers and Fourier asymptotics validate singularity or Rajchman properties essential for multiplicity assertions (Tan, 12 Nov 2025).


The Dvoretzky covering problem, from its probabilistic-geometric origins, now embodies a rich interplay between probability, real and harmonic analysis, fractal geometry, and potential theory. Its modern complete characterizations for general measures and analytic sets illuminate both probabilistic covering and deep structural properties of exceptional sets (Anttila et al., 16 Jan 2026, Tan, 12 Nov 2025, Hirayama et al., 2021, Fan et al., 2019, Raja, 2024).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Dvoretzky Covering Problem.