Efficient Quantisation and Weak Covering of High Dimensional Cubes

Let Zn={Z1,…,Zn}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {Z}}_n = \{Z_1, \ldots , Z_n\}$$\end{document} be a design; that is, a collection of n points Zj∈[-1,1]d\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Z_j \in [-1,1]^d$$\end{document}. We study the quality of quantisation of [-1,1]d\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[-1,1]^d$$\end{document} by the points of Zn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {Z}}_n$$\end{document} and the problem of quality of coverage of [-1,1]d\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[-1,1]^d$$\end{document} by Bd(Zn,r)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{{\mathcal {B}}}}_d({\mathbb {Z}}_n,r)$$\end{document}, the union of balls centred at Zj∈Zn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Z_j \in {\mathbb {Z}}_n$$\end{document}. We concentrate on the cases where the dimension d is not small, d≥5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$d\ge 5$$\end{document}, and n is not too large, n≤2d\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\le 2^d$$\end{document}. We define the design Dn,δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathbb {D}}_{n,\delta }}$$\end{document} as a 2d-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{d-1}$$\end{document} design defined on vertices of the cube [-δ,δ]d\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[-\delta ,\delta ]^d$$\end{document}, 0≤δ≤1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$0\le \delta \le 1$$\end{document}. For this design, we derive a closed-form expression for the quantisation error and very accurate approximations for the coverage area vol([-1,1]d∩Bd(Zn,r))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {vol}}{([-1,1]^d \cap {{{\mathcal {B}}}}_d({\mathbb {Z}}_n,r))}$$\end{document}. We provide results of a large-scale numerical investigation confirming the accuracy of the developed approximations and the efficiency of the designs Dn,δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathbb {D}}_{n,\delta }}$$\end{document}.


Main Problems of Interest
We will study the following two main characteristics of designs Z n = {Z 1 , . . . , Z n } ⊂ R d .
The mean squared quantisation error for a design Z n is defined by 2. Weak covering. Denote the proportion of the cube [−1, 1] d covered by the union of n balls B d (Z n , r ) = n j=1 B d (Z j , r ) by For given radius r > 0, the union of n balls B d (Z n , r ) makes the (1 − γ )-coverage of the cube [−1, 1] d if Complete coverage corresponds to γ = 0. In this paper, the complete coverage of [−1, 1] d will not be enforced and we will mostly be interested in weak covering, that is, achieving (2) with some small γ > 0.
Two n-point designs Z n and Z n will be differentiated in terms of performance as follows: (a) Z n dominates Z n for quantisation if θ(Z n ) < θ(Z n ); (b) if for a given γ ≥ 0, C d (Z n , r 1 ) = C d (Z n , r 2 ) = 1 − γ and r 1 < r 2 , then the design Z n provides a more efficient (1 − γ )-coverage than Z n and is therefore preferable. In Sect. 1.4 we extend these definitions by allowing the two designs to have different number of points and, moreover, to have different dimensions. Numerical construction of n-point designs with moderate values of n with good quantisation and coverage properties has recently attracted much attention in view of diverse applications in several fields including computer experiments [7,8,11], global optimization [15], function approximation [12,13], and numerical integration [9]. Such designs are often referred to as space-filling designs. Readers can find many additional references in the citations above. Unlike the exiting literature on spacefilling, we concentrate on theoretical properties of a family of very efficient designs and derivation of accurate approximations for the characteristics of interest.

Relation Between Quantisation and Weak Coverage
The two characteristics, C d (Z n , r ) and θ(Z n ), are related: C d (Z n , r ), as a function of r ≥ 0, is the c.d.f. of the r.v. (X , Z n ) while θ(Z n ) is the second moment of the distribution with this c.d.f.: In particular, this yields that if an n-point design Z * n maximises, in the set of all npoint designs, C d (Z n , r ) for all r > 0, then it also minimises θ(Z n ). Moreover, if r.v.
(X , Z n ) stochastically dominates (X , Z n ), so that C d (Z n , r ) ≤ C d (Z n , r ) for all r ≥ 0 and the inequality is strict for at least one r , then θ(Z n ) < θ(Z n ).
The relation (3) can alternatively be written as where C d (Z n , √ r ), considered as a function of r , is the c.d.f. of the r.v. 2 (X , Z n ) and hence θ(Z n ) is the mean of this r.v. Relation (4) is simply another form of (1).

Re-Normalised Versions and Formulation of Optimal Design Problems
In view of (13), the naturally defined re-normalised version of (4) and (3), Q d (Z n ) is the expectation of n 2/d 2 (X , Z n )/(4d) and the second moment of the r.v. n 1/d (X , Z n )/(2 √ d) respectively. This suggests the following re-normalization of the radius r with respect to n and d: We can then define optimal designs as follows. Let d be fixed, Z n = {Z n } be the set of all n-point designs and Z = ∞ n=1 Z n be the set of all designs.
Here 0 ≤ γ ≤ 1 and for a given design Z n ∈ Z n , where Importance of the factor √ d in (5) will be seen in Sect. 3.5 where we shall study the asymptotical behaviour of (1 − γ )-coverings for large d.

Thickness of Covering
Let γ = 0 in Definition 1.2. Then r 1 (Z n ) is the covering radius associated with Z n so that the union of the balls B d (Z n , r ) with r = r 1 (Z n ) makes a coverage of [−1, 1] d . Let us tile up the whole space R d with the translations of the cube [−1, 1] d and corresponding translations of the balls B d (Z n , r ). This would make a full coverage of the whole space; denote this space coverage by B d (Z (n) , r ). The thickness Θ of any space covering is defined, see [1, (1), Chap. 2], as the average number of balls containing a point of the whole space. In our case of B d (Z (n) , r ), the thickness is The normalised thickness, θ , is the thickness Θ divided by vol(B d (0, 1)), the volume of the unit ball, see [1, (2), Chap. 2]. In the case of B d (Z (n) , r ), the normalised thickness is where we have recalled that r = r 1 (Z n ) and R 1−γ (Z n ) = n 1/d r 1−γ (Z n )/(2 √ d) for any 0 ≤ γ ≤ 1. We can thus define the normalised thickness of the covering of the cube by the same formula and extend it to any 0 ≤ γ ≤ 1: In view of (9), we can reformulate the definition (7) of the (1 − γ )-covering optimal design by saying that this design minimises (normalised) thickness in the set of all (1 − γ )-covering designs.

The Design of the Main Interest
We will be mostly interested in the following n-point design Z n = D n,δ defined only for n = 2 d−1 : Without loss of generality, while considering the design D n,δ we assume that the point Z 1 ∈ D n,δ = {Z 1 , . . . , Z n } is Z 1 = δ = (δ, . . . , δ). Similarly, the first point in D (0) n is Z 1 = 1/2 = (1/2, . . . , 1/2). Note also that for numerical comparisons, in Sect. 4 we shall introduce one more design.
The design D n,1/2 extends to the lattice D d (shifted by 1/2) containing points X = (x 1 , . . . , x d ) with integer components satisfying x 1 + . . . + x d = 0 (mod 2), see [1,Sect. 7.1,Chap. 4]; this lattice is sometimes called "checkerboard lattice". The motivation to theoretically study the design D n,δ is a consequence of numerical results reported in [14] and [4], where the present authors have considered n-point designs in d-dimensional cubes providing good coverage and quantisation and have shown that for all dimensions d ≥ 7, the design D n,δ with suitable δ provides the best quantisation and coverage per point among all other designs considered. Aiming at practical applications mentioned in Sect. 1.2, our aim was to consider the designs with n which is not too large and in any case does not exceed 2 d .
If the number of points n in a design is much larger than 2 d , then we may use the following scheme of construction of efficient quantisers in the cube [−1, 1] d : (a) construct one of the very efficient lattice space quantisers, see [1, Sect. 3, Chap. 2], (b) take the lattice points belonging to a very large cube, and (c) scale the chosen large cube to [−1, 1] d . In view of [2, Thm. 8.9], as n → ∞, the normalised quantisation error Q d (Z n ) of the sequence of resulting designs Z n converges to the respective quantisation error of the lattice space quantiser. However, for any given n the study of quantisation error of such designs is difficult (both, numerically and theoretically) as there could be several non-congruent types of Voronoi cells due to boundary conditions. Note also that the boundary conditions make significant difference in relative efficiencies of the resulting designs. In particular, the checkerboard lattice D d is better than the integer-point lattice Z d for all d ≥ 3 as a space quantiser and becomes the best lattice space quantiser for d = 4 but in the case of cube [−1, 1] d , the design D n,δ (with optimal δ) makes a better quantiser than D (0) n for d ≥ 7 only; see Sect. 2.4 for theoretical and numerical comparison of the two designs.

Structure of the Rest of the Paper and the Main Results
In Sect. 2 we study Q d (D n,δ ), the normalised mean squared quantisation error for the design D n,δ . There are two important results, Theorems 2.2 and 2.3. In Theorem 2.2, we derive the explicit form for the Voronoi cells for the points of the design D n,δ and in Theorem 2.3 we derive a closed-form expression for Q d (D n,δ ) for any δ > 0. As a consequence, in Corollary 2.4 we determine the optimal value of δ.
The main result of Sect. 3 is Theorem 3.2, where we derive closed-form expressions (in terms of C d,Z ,r , the fraction of the cube [−1, 1] d covered by a ball B d (Z , r )) for the r )). Then, using accurate approximations for C d,Z ,r , we derive approximations for vol ([−1, 1] d ∩ B d (Z n , r )). In Theorem 3.4 we derive asymptotic expressions for the (1−γ )-coverage radius for the design D d,1/2 and show that for any γ > 0, the ratio of the (1 − γ )-coverage radius to the 1-coverage radius tends to 1/ √ 3 as d → ∞. Numerical results of Sect. 3.5 confirm that even for rather small d, the 0.999-coverage radius is much smaller than the 1-coverage radius providing the full coverage.
In Sect. 4 we demonstrate that the approximations developed in Sect. 3 are very accurate and make a comparative study of selected designs used for quantisation and covering.
In Appendices A-C, we provide proofs of the most technical results. In Appendix D, for completeness, we briefly derive an approximation for C d,Z ,r with arbitrary d, Z , and r .
The two most important contributions of this paper are: a) derivation of the closedform expression for the quantisation error for the design D n,δ , and b) derivation of accurate approximations for the coverage area vol

Consider any n-point design
The mean squared quantisation error θ(Z n ) introduced in (1) can be written in terms of the Voronoi cells as follows: where This reformulation has significant benefit when the design Z n has certain structure. In particular, if all of the Voronoi cells V (Z i ), i = 1, . . . , n, are congruent, then we can simplify (10) to In Sect. 2.4, this formula will be the starting point for derivation of the closed-form expression for θ(Z n ) for the design D n,δ .

Re-Normalisation of the Quantisation Error
To compare efficiency of n-point designs Z n with different values of n, one must suitably normalise θ(Z n ) with respect to n. Specialising a classical characteristic for quantisation in space, as formulated in [1, (86), Chap. 2], we obtain Note that Q d (Z n ) is re-normalised with respect to dimension d too, not only with respect to n. Normalization 1/d with respect to d is very natural in view of the definition of the Euclidean norm. Using (10), for the cube [−1, 1] d , (12) can be expressed as

Proposition 2.1 Consider the design D
Proof Consider the Voronoi cells created by the design D where C 0 is the cube (14) and Proof The design D n,δ is symmetric with respect to all components implying that all n = 2 d−1 Voronoi cells are congruent immediately yielding that their volumes equal 2.
n,δ is introduced in Proposition 2.1, and C 0 is the Voronoi set of δ for design D (0) n,δ , C 0 ⊂ V (δ) for design D n,δ too. Consider the d cubes adjacent to C 0 : . This part is exactly the set U j defined by (16). This can be seen as follows. A part of C j also belongs to the Voronoi set of the point X jk = δ − 2δe j − 2δe k , where e l = (0, . . . , 0, 1, 0, . . . , 0) with 1 placed at l-th place; all components of X jk are δ except j-th and k-th components which are −δ. We have to have |x j | ≤ x k , for a point X ∈ C j to be closer to Z 1 than to X jk . Joining all constraints for we obtain (16) and hence (15).

Explicit Formulae for the Quantisation Error
Proof To compute θ(D n,δ ), we use (11), where, in view of Theorem 2.2, vol(V (Z 1 )) = 2. Using the expression (15) Consider the two terms in (20) separately. The first term is easy: For the second term we have Inserting the obtained expressions into (20) we obtain (18). The expression (19) is a consequence of (13), (18), and n = 2 d−1 .
A simple consequence of Theorem 2.3 is the following corollary.

Corollary 2.4
The optimal value of δ minimising θ(D n,δ ) and Q d (D n,δ ) is for this value, Let us make several remarks.
1. The value δ * can be alternatively characterised by the well-known optimality condition of a general design saying that each design point of an optimal quantiser must be a centroid of the related Voronoi cell; see e.g. [10]. Specifically, each design point Z i ∈ D n,δ is the centroid of V (Z i ) if and only if δ = δ * . 2. From (19), for the design D n,1/2 we get this value is always slightly larger than (24).   Table 4 of [14] and Table 5 of [4].
Let us now briefly illustrate the results above. In Fig. 1, the black circles depict the quantity Q d (D n,δ * ) as a function of d. The quantity Q d (D (0) n ) = 1/12 is shown with the solid red line. We conclude that from dimension seven onwards, the design D n,δ * provides better quantisation per points than the design D all values of r . Then, in Sect. 3.3, we shall obtain approximations for C d (D n,δ , r ). The accuracy of the approximations will be assessed in Sect. 4.2.

Reduction to Voronoi Cells
For an n-point design Z n = {Z 1 , . . . , Z n }, denote the proportion of the Voronoi cell around Z i covered by the ball B d (Z i , r ) as The following lemma is straightforward.
In view of Theorem 2.2, for design D n,δ all Voronoi cells V (Z i ) are congruent and vol(V (Z i )) = 2; recall that n = 2 d−1 . By then applying Lemma 3.1 and without loss of generality we have chosen Z 1 = δ = (δ, δ, . . . , δ) ∈ R d , we have for any r > 0

Expressing C d (D n,ı , r) Through C d,Z,r
Theorem 3.2 Depending on the values of r and δ, the quantity C d (D n,δ , r ) can be expressed through C d,Z ,r for suitable Z as follows.

Approximation for C d (D n,ı , r)
Accurate approximations for C d,Z ,r for arbitrary d, Z , and r were developed in [14]. By using the general expansion in the central limit theorem for sums of independent non-identical r.v., the following approximation was developed: A short derivation of this approximation is included in Appendix D. Using (30), we formulate the following approximation for C d (D n,δ , r ).

Lemma 3.3
For any r ≥ 0, 0 < δ < 1, and δ = (δ, δ, . . . , δ) ∈ R d , the quantity C d (D n,δ , r ) can be bounded as follows: The proof of Lemma 3.3 is given in Appendix B. In Figs. 3 and 4, using the approximation given in (30) we study the tightness of the bounds given in (31). In these figures, the dashed red line, dashed blue line and solid black line depict the upper bound, the lower bound and the approximation for C d (D n,δ , r ) respectively. We see that the upper bound is very sharp across r and d; this behaviour is not seen with the lower bound.

'Do Not Try to Cover the Vertices'
In this section, we theoretically support the recommendation 'do not try to cover the vertices' which was first stated in [14] and supported in [4] on the basis of numerical evidence. In other words, we will show on the example of the design D n,1/2 that in large dimensions the attempt to cover the whole cube rather than 0.999 of it leads to a dramatic increase of the required radius of the balls. For any 0 < γ < 1 and 0 ≤ δ ≤ 1, the limit of R 1−γ (D n,δ ), as d → ∞, exists and achieves minimal value for δ = 1/2. Moreover, Proof is given in Appendix C.
In Figs. 5 and 6 using a solid red line we depict the approximation of C d (D n,1/2 , r ) as a function of R = n 1/d r /(2 √ d), see (5). The vertical green line illustrates the value of R 0.999 and the vertical blue line depicts . These figures illustrate that as d increases, for all γ we have R 1−γ /R 1 slowly tending to 1/ √ 3. From the proof of Theorem 3.4, it transpires that C d (D n,δ , r ) as a function of R converges to the jump function with the jump at 1/(2 √ 3).

Numerical Studies
For comparative purposes, we introduce another design which is one of the most popular designs (both, for quantisation and covering) considered in applications.
Design S n : Z 1 , . . . , Z n are taken from a low-discrepancy Sobol's sequence on the cube For constructing the design S n , we use the R-implementation provided in the wellknown 'SobolSequence' package [3]. For S n , we have set n = 1024 and F2 = 10 (an input parameter for the Sobol sequence function). Sobol sequences S n attain their best space-filling properties when n is a power of 2; that is, when n = 2 for some integer . We have chosen = 10. As we study renormalised characteristics Q d ( · ) and R 1−γ ( · ) of designs, exact value of for S n with n = 2 is almost irrelevant: in particular, numerically computed values Q d (S 2 ) and R 1−γ (S 2 ) for = 8,9,11,12 are almost indistinguishable from the corresponding values for = 10 provided below in Tables 1 and 2. By varying values of , we are not improving space-filling properties of S 2 . In fact, increase of generally leads to a slight deterioration of normalised space-filling characteristics (including Q d ( · ) and R 1−γ ( · )) of Sobol sequences.

Quantisation and Weak Covering Comparisons
In Table 1, we compare the normalised mean squared quantisation error Q d (Z n ) defined in (13) across three designs: D n,δ * with δ * given in (23), D (0) n and S n . In Table 2, we compare the normalised statistic R 1−γ introduced in (7), where we have fixed γ = 0.01. For designs D n,δ (with the optimal value of δ), D n,1/2 and D (0) n we have also included R 1 , the smallest normalised radius that ensures the full coverage. Let us make some remarks concerning Tables 1 and 2.
-In conjunction with Fig. 1, Table 1 shows that for d ≥ 7, the quantisation for design D n,δ * is superior over all other designs considered. -For the weak coverage statistic R 1−γ , the superiority of D n,δ with optimal δ over all other designs considered is seen for d ≥ 10. -For the designs D n,δ , the optimal value of δ minimising R 1−γ depends on γ . n ) = 1/12. This non-monotonic behaviour can be seen in Table 1.
-Unlike the case of Q d (D n,δ * ), such non-monotonic behaviour is not seen for the quantity R 1−γ and R 1−γ (D n,δ ) monotonically decreases as d increases. Also, Theorem 3.4 implies that for any γ ∈ (0, 1),  Table 2 Normalised statistic R 1−γ across d with γ = 0.01 (value in brackets corresponds to optimal δ)

Stochastic Dominance
In Figs. 13 and 14, we depict the c.d.f.'s for the normalised distance n 1/d (X , Z n )/ (2 √ d) for two designs: D n,δ * in red, and D (0) n in black. We can see that the design D n,δ * stochastically dominates the design D n is preferable to the design D n,δ * although there is no clear domination; this is in line with findings from Sects. 2.4 and 4.1, see e.g. Fig. 1, Tables 1 and 2.
In Fig. 15, we depict the c.d.f.'s for the normalised distance n 1/d (X , n (in red) and design S n (in black). We can see that for d = 5, the design D  In view of (26), C d (D n,δ , r ) = V d,δ,r for all 0 ≤ δ ≤ 1 and r ≥ 0 and we shall derive expressions for V d,δ,r rather than C d (D n,δ , r ).
Case (b): δ ≤ r ≤ 1 + δ. Using (15) we obtain The first quantity in the numerator has been considered in case (a) and it is simply C d,2δ−1,2r . Therefore we aim to reformulate the second quantity within the brackets, Notice further that where 1 = (1, . . . , 1) and |t| = (|t|, . . . , |t|) are constant vectors in R d−1 . Note that Finally, by the preservation of covered fraction, we obtain As a result, Case (c): r ≥ 1 + δ. Case (c) is almost identical to case (b), with the only change occurring within the lower limit of integration in (33); the lower limit of the integral remains at −1 for all r ≥ 1 + δ. Since the steps are almost identical to case (b), they are omitted and we simply conclude: With any point X = (x 1 , x 2 , . . . , x d ) ∈ U j (here x j is negative and |x j | ≤ |x k | ≤ 1 for k = j) we associate pointX = (−x 1 , x 2 , . . . , x j−1 , −x j , x j+1 , . . . , x d ) ∈ V j by changing sign in the first and j-the component of X ∈ U j . Setting without loss of generality j = 2, we have for these two points: where the inequality follows from the inequalities x 1 ≥ 0, x 2 < 0, and |x 2 | < x 1 containing in the definition of U 2 . Therefore, To prove the lower bound in (31) for all r we must consider two cases: r ≤ δ and r ≥ δ. For r ≥ δ, using (35) we have where C 1 is given in (17  = (a, b, b, . . . , b) ∈ R d . Then the limit lim d→∞ C d,Z a,b;d ,2r exists and Proof Define As the r.v. η z introduced in Appendix D are concentrated on a finite interval, for finite a and b the quantities of ρ a := E(|η a − a 2 − 1/3| 3 ) and ρ b := E(|η b − b 2 − 1/3| 3 ) are bounded. By applying the Berry-Esseen theorem (see [5, Sect. 2, Chap. 5]) to C d,Z a,b ,2r , there exists some constant C such that where σ 2 a = var(η a ) and σ 2 b = var(η b ). By the squeeze theorem, it is clear that if 4α 2 − b 2 − 1/3 > 0 and hence α > 1/3 + b 2 /2, then C d,Z a,b ,2r → 1 as d → ∞. If α < 1/3 + b 2 /2, then C d,Z a,b ,2r → 0 as d → ∞. If α = 1/3 + b 2 /2, then C d,Z a,b ,2r → 1/2 as d → ∞.  , r ), we obtain the result.
To determine the value of r that leads to the full coverage, we utilise the following simple lemma.