Divergence of separated nets with respect to displacement equivalence

We introduce a hierarchy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi :(0,\infty )\rightarrow (0,\infty )$$\end{document}ϕ:(0,∞)→(0,∞). Two separated nets are called \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}ϕ-displacement equivalent if, roughly speaking, there is a bijection between them which, for large radii R, displaces points of norm at most R by something of order at most \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi (R)$$\end{document}ϕ(R). We show that the spectrum of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}ϕ-displacement equivalence spans from the established notion of bounded displacement equivalence, which corresponds to bounded \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}ϕ, to the indiscrete equivalence relation, corresponding to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi (R)\in \varOmega (R)$$\end{document}ϕ(R)∈Ω(R), in which all separated nets are equivalent. In between the two ends of this spectrum, the notions of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}ϕ-displacement equivalence are shown to be pairwise distinct with respect to the asymptotic classes of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi (R)$$\end{document}ϕ(R) for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R\rightarrow \infty $$\end{document}R→∞. We further undertake a comparison of our notion of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}ϕ-displacement equivalence with previously studied relations on separated nets. Particular attention is given to the interaction of the notions of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}ϕ-displacement equivalence with that of bilipschitz equivalence.


Introduction
In the present work, we compare the metric structures of separated nets by examining how much mappings between them displace points.The notion of displacement of a mapping is defined as follows: If disp(f ) < ∞, then we say that f is a mapping of bounded displacement.
Research into separated nets in Euclidean spaces has broadly centred around the question of to what extent any two separated nets in a Euclidean space are similar, as metric spaces.To formulate this question more precisely, it is necessary to prescribe what it means for two separated nets to be considered similar, or put differently, to define a symmetric relation on the class of separated nets in a Euclidean space.Two such notions, which are in fact equivalence relations, have been studied most prominently.
The most narrow of these notions is that of bounded displacement equivalence.Two separated nets X, Y ⊆ R d are said to be bounded displacement equivalent, or BD equivalent, if there exists a bijection f : X → Y for which disp(f ) < ∞.To demonstrate how constrictive BD equivalence is, we point out that for any separated net X ⊆ R d , X is not BD equivalent to 2X. 1Hence, even linear bijections R d → R d may transform a separated net to a BD non-equivalent separated net.
For the second notion, two separated nets X, Y ⊆ R d are called bilipschitz equivalent, or BL equivalent, if there is a bilipschitz bijection f : X → Y .This defines a much looser form of equivalence in comparison to BD equivalence.In fact, it is a highly non-trivial question, posed by Gromov [6] in 1993, whether BL equivalence distinguishes at all between the separated nets of a multidimensional Euclidean space.Moreover, we point out that BD equivalence is easily seen to be stronger than BL equivalence.
For all Euclidean spaces of dimension at least two, Gromov's question was answered negatively in 1998 by Burago and Kleiner [1] and (independently) McMullen [9]; the papers [1] and [9] verify the existence of a separated nets in R d , d ≥ 2, which are not BL equivalent to the integer lattice.
In the recent work [3], the authors introduce the notion of ω-regularity of a separated net.Definition 1.2.Given separated nets X, Y ⊆ R d and a strictly increasing, concave function ω defined on a positive open interval starting at 0 and satisfying lim t→0 ω(t) = 0, a mapping f : X → Y is called a homogeneous ω-mapping if there are constants K > 1 and a > 0 such that for all R > 0 and x, y ∈ X ∩ B(0, R) with ∥y − x∥ 2 < aR.The separated net X ⊆ R d is called ω-regular with respect to the separated net Y ⊆ R d if there exists a bijection f : X → Y such that both f and f −1 are homogeneous ω-mappings.Otherwise X is called ω-irregular with respect to Y .In the case that Y = Z d , these terms are shortened to ω-regular and ω-irregular respectively.
From now on, we will refer to functions ω with the properties given in Definition 1.2 as moduli of continuity.The function ω(t) = t will be called the Lipschitz modulus of continuity and functions ω(t) = t β with β ∈ (0, 1) will be referred to as Hölder moduli of continuity.When we prescribe a modulus of continuity ω by a formula such as ω(t) = t β , it should be understood that this formula defines ω on some interval (0, a) with a > 0. The precise value of a and indeed the behaviour of ω(t) for t ≥ a is irrelevant to the notions of Definition 1.2.
It is clear that for two moduli of continuity ω 1 , ω 2 satisfying ω 2 (t) ∈ o(ω 1 (t)) for t → 0,2 the notion of ω 1 -regularity is formally weaker than that of ω 2 -regularity.Further for the Lipschitz modulus of continuity ω(t) = t, ω-regularity of X with respect to Y is nothing other than the BL equivalence of X and Y .Thus, the result of Burago and Kleiner and (independently) McMullen discussed above can be formulated as follows: In every Euclidean space R d with d ≥ 2 there exists an ω-irregular separated net for the function ω(t) = t.
The notion of ω-regularity of separated nets is motivated by a result of McMullen [9,Theorem 5.1], which stands in contrast to the existence of BL non-equivalent nets.McMullen [9] proves that for any two separated nets X and Y in Euclidean space, X is ω-regular with respect to Y for some Hölder modulus of continuity ω(t) = t β for some β ∈ (0, 1).In the work [3], the present authors investigate ω-regularity for ω lying asymptotically in between the Lipschitz modulus of continuity and Hölder moduli of continuity.The paper [3] proves that there are separated nets in every R d , d ≥ 2, which are ω-irregular for the modulus of continuity where α 0 = α 0 (d) is a positive constant determined by the dimension d of the space.This is formally a stronger result than the existence of BL nonequivalent separated nets.
Growth of restricted displacement constants.
Looking at the value of disp(f ) for bijections f between two separated nets X and Y gives only a very crude comparison of their metric structures.Roughly speaking 'most' pairs of separated nets X and Y are BD non-equivalent, so that disp(f ) = ∞ for every such bijection.This motivates a more subtle form of metric comparison of separated nets in Euclidean space via displacement: Although we expect generally that disp(f ) = ∞ for any bijection between two separated nets, so that lim R→∞ disp R (f ) = ∞, it remains of interest in such cases to determine the optimal asymptotic growth of disp R (f ) as R → ∞ among such bijections.Indeed, this allows for a more flexible notion of displacement equivalence.Definition 1.4.Let ϕ : (0, ∞) → (0, ∞) be an increasing, concave function and X and Y be separated nets of R d .We say that X and Y are ϕ-displacement equivalent if there exists a bijection f : Remark 1.5.In Definition 1.3 and Definition 1.4 it may appear that the origin 0 ∈ R d has a special role: it is the reference point with respect to which the quantity disp R (f ) is defined.It is therefore natural to ask, whether a different choice of reference point in Definition 1.3 would give rise to a different notion of ϕ-displacement equivalence in Definition 1.4.However, this is not the case, due to the conditions on the functions ϕ admitted in Definition 1.4 and the inequality where disp w R (f ) denotes the quantity of Definition 1.3 obtained when w ∈ R d is used as the reference point instead of 0 ∈ R d .Remark 1.6.We require the concavity of ϕ in Definition 1.4 in order to verify that ϕ-displacement equivalence is a true equivalence relation.However, the reader may ask whether it is possible to admit a larger class of functions ϕ.It is the authors' view that admitting only concave functions ϕ in Definition 1.4 is not a major restriction.Recall that for every increasing function Observe that the concave condition in Definition 1.4 implies that ϕ(R) ∈ O(R) and thus superlinear functions such as ϕ(R) = R 2 are excluded.However, excluding superlinear functions ϕ is not any restriction because, were they to be admitted, then the resulting notions of ϕ(R)-displacement equivalence for all functions ϕ(R) ∈ Ω(R) would coincide and equal the trivial equivalence relation in which all separated nets of R d are equivalent.This last assertion is a consequence of Proposition 2.6 of the present work.

Structure of the Paper and Main Results
To finish this introduction, we outline the structure of the paper and summarise the main contributions of the present work.
Section 2 and 3 present preliminary results and observations which can mostly be thought of as easy consequences of the new definition of ϕ-displacement equivalence, but are nevertheless worth highlighting in view of the authors.In Section 2 we verify that the notions of ϕ-displacement equivalence given by Definition 1.4 are equivalence relations: Proposition 2.7.Let ϕ : (0, ∞) → (0, ∞) be an increasing, concave function.Then the notion of ϕ-displacement equivalence of separated nets in R d given by Definition 1.4 is an equivalence relation on the set of separated nets of R d .
We further show that the notion of ϕ-displacement equivalence for ϕ(R) ∈ Ω(R) does not distinguish between separated nets: In contrast, Section 3 deals with negative results and identifies certain barriers to ϕ-displacement equivalence for ϕ ∈ o(R).
Our first main result demonstrates that the notions of ϕ-displacement equivalence for increasing, concave functions ϕ : (0, ∞) → (0, ∞) form a fine spectrum starting from the strictest form of ϕ-displacement equivalence, namely BD equivalence, which corresponds to ϕ-equivalence for bounded ϕ(R) ∈ O(1), to the weakest form of ϕ-displacement equivalence, namely that corresponding to ϕ(R) ∈ Ω(R).In the spectrum between O(1) and Ω(R) we show that the notions of ϕ-displacement equivalence are pairwise distinct with respect to the asymptotic classes of functions ϕ(R) for R → ∞.We prove namely the following statement: . Moreover, such Y can be found so that X and Y are bilipschitz equivalent.
Theorem 4.1 will be proved in Section 4; Corollary 1.7 is an immediate consequence of Theorem 4.1.Note that Theorem 4.1 also verifies the optimality of Proposition 2.6.
The theme of Sections 5 and 6 is the comparison of the established notion of BL equivalence with the spectrum of ϕ-displacement equivalence for increasing, concave functions ϕ : (0, ∞) → (0, ∞).We begin, in Section 5, with the strictest form of ϕ-displacement equivalence, namely BD equivalence.In Section 6 we then move onto ϕ-displacement equivalence for unbounded ϕ.
We compare the notions of BL equivalence and ϕ-displacement equivalence by looking at the intersection of the BL equivalence classes with the classes of ϕ-displacement equivalence.The cardinality of the set of equivalence classes of separated nets has already attracted some research attention.Magazinov [8] shows that in every Euclidean space of dimension at least two, the set of BL equivalence classes of separated nets has the cardinality of the continuum.Since BD equivalence is stronger than BL equivalence, this also implies that there are uncountably many distinct BD classes.In [5, Theorem 1.3], Frettlöh, Smilansky and Solomon also verify the existence of uncountably many, pairwise distinct BD equivalence classes of separated nets in R 2 .Interestingly, the class representatives of the uncountably many, pairwise distinct BD equivalence classes given in [5] all come from the same BL equivalence class.
Independently of the aforementioned works [8] and [5], we are able to verify that every Euclidean space has uncountably many, pairwise distinct BD equivalence classes of separated nets.Further, we provide new information, namely that there are uncountably many pairwise distinct BD equivalence classes inside each BL equivalence class.Hence, we are able to present a new result, which we prove in Section 5: Theorem 5.1.For every d ∈ N, every bilipschitz equivalence class of separated nets in R d decomposes as a union of uncountably many pairwise distinct bounded displacement equivalence classes.
For unbounded functions ϕ(R), the analysis of the interaction of the BL classes and the ϕ-displacement equivalence classes of separated nets in R d is more challenging.In light of Theorem 5.1, the natural problem is to characterise the increasing, concave functions ϕ(R) ∈ o(R) for which ϕ-displacement equivalence is stronger than BL equivalence; note that Theorem 5.1 takes care of the functions ϕ(R) ∈ O(1).In Section 6 we resolve this matter.We verify, namely, that ϕ-displacement is stronger than BL equivalence if and only if ϕ(R) ∈ O(1).In particular, this means that BD equivalence is the only form of ϕ-displacement equivalence for which Theorem 5.1 holds.Section 6 should also be placed in the context of ω-regularity of separated nets.Recall that BL equivalence corresponds to the notion of ω-regularity for the modulus of continuity ω(t) = t.For the weaker modulus of continuity ω of (1) and any function ϕ(R) ∈ O Rω 1 R , the authors prove in [3] that the ϕ-displacement equivalence class of the integer lattice does not contain any ω-irregular separated nets.This may support the following conjecture: Conjecture 1.8.Let d ≥ 2, ω be a modulus of continuity in the sense of Definition 1.2 and ϕ : (0, ∞) → (0, ∞) be an increasing concave function.Then the class of ω-irregular separated nets in R d has non-empty intersection with the ϕ-displacement equivalence class of the integer lattice Z d if and only if Rω 1 R ∈ o(ϕ(R)).Indeed the 'only if' implication of Conjecture 1.8 for the modulus of continuity ω of ( 1) is precisely the result [3, Proposition 1.3] referred to above.In Section 6 of the present work, we show that for every increasing, unbounded, concave function ϕ : (0, ∞) → (0, ∞), the ϕ-displacement class of the integer lattice intersects distinct BL classes; in particular it contains ωirregular separated nets for ω(t) = t.A matter of interest is whether every such ϕ-displacement equivalence class intersects every BL equivalence class.This question remains open, but we are able to show that every such ϕdisplacement equivalence class intersects uncountably many BL equivalence classes: Theorem 6.1.Let d ≥ 2 and ϕ : (0, ∞) → (0, ∞) be an unbounded, increasing, concave function.Then there is an uncountable family (X ψ ) ψ∈Λ of pairwise bilipschitz non-equivalent separated nets in R d for which each X ψ is ϕ-displacement equivalent to Z d .
We point out that Theorem 6.1 is a refinement of the lower bound from [8] and is obtained entirely independently.Moreover, put together with the fact that BD equivalence is stronger than BL equivalence, Theorem 6.1 verifies Conjecture 1.8 for the special case of the Lipschitz modulus of continuity ω(t) = t.We further remark that equivalence of separated nets and cardinality of sets of their equivalence classes have been studied in connection with the notion of repetitivity of separated nets; see [2] and [11].Our methods for constructing separated nets verifying Theorem 6.1 appear to destroy repetitivity and so there seem to be serious obstructions to employing them to, for example, prove a BL equivalence version of the dichotomy [11,Theorem 1.1] for BD equivalence.
At this point, we also wish to state formally the characterisation announced in the above discussion of Section 6.This result is an immediate consequence of Theorem 5.1 and Theorem 6.1: Theorem 1.9.Let d ≥ 2 and ϕ : (0, ∞) → (0, ∞) be an increasing, concave function.Then, ϕ-displacement equivalence of separated nets in R d is stronger than bilipschitz equivalence if and only if ϕ is bounded.
Finally, we finish this article in Section 7 with a useful application of the ϕ-displacement equivalence spectrum.Whilst [3] verifies the existence of separated nets which are ω-irregular for ω of the form (1), it leaves one important issue unresolved: namely, whether ω-regularity for ω of the form (1) is distinct from the notion of bilipschitz equivalence (that is, ω-regularity for ω(t) = t).In view of the results [9, Theorem 5.1] and [1, Theorem 1.1], it is clear that there are Hölder moduli of continuity of the form ω 1 (t) = t β for some β ∈ (0, 1) so that for ω 2 (t) = t, the notions of ω 1 -and ω 2 -regularity are distinct; ω 1 -regularity is strictly weaker than ω 2 -regularity.However, the most that can be established on the basis of the existing literature is that there are at least two distinct notions of ω-regularity.In particular, [3] does not address the issue of whether there are any moduli of continuity ω strictly in between the Hölder moduli of continuity and the Lipschitz modulus of continuity, such as ω of the form (1), which define further distinct notions of ω-regularity.This is quite unsatisfactory because it leaves open the possibility that the result [3, Theorem 1.2] is in fact identical to [1, Theorem 1.1] and the corresponding result in [9], although it is formally stronger.
In the present article we verify that for the modulus of continuity ω of the form (1), the notion of ω-regularity is strictly weaker than BL equivalence.This confirms that the 'highly irregular'3 separated nets given in [3, Theorem 1.2] are indeed more irregular in a meaningful way than the BL non-equivalent separated nets of McMullen [9]  Despite this progress, we are only able to increase the number of known pairwise distinct forms of ω-regularity by one: Corollary 7.2.For any dimension d ≥ 2 there exist moduli of continuity ω 1 , ω 2 , ω 3 in the sense of Definition 1.2 so that whenever i, j ∈ {1, 2, 3} with i < j the set of ω j -regular separated nets of R d is strictly contained in the set of ω i -regular separated nets.
It therefore remains an interesting research objective to expose the hierarchy of notions of ω-regularity.The authors would conjecture that, at least for moduli of continuity ω lying asymptotically in between the Lipschitz modulus of continuity and the modulus of continuity of (1), we get a fine hierarchy of notions of ω-regularity.More precisely, we conjecture that whenever two moduli of continuity ω 1 and ω 2 satisfy ω 2 ∈ o(ω 1 (t)), ω 2 (t) ∈ Ω(t) and ω 1 (t) ∈ O t log 1 t α 0 for t → 0, then the notion of ω 1 -regularity of separated nets in R d is strictly weaker than that of ω 2 -regularity.
Functions and Asymptotics.Throughout the work we use the standard asymptotic notation O, o, Ω, Θ, with the following meaning.Let f, g be two positive real-valued functions defined on an unbounded domain in (0, ∞).For example, this allows for f and g to be real sequences.Then we write We sometimes write equations or inequalities using the above asymptotic notation.For example, the inequalities ) should be interpreted as follows: there exist sequences Although the symbol ω also belongs to the standard asymptotic notation, we will avoid using it in this context.The reason for this is that we use the letter ω to denote moduli of continuity and for the notions of ω-regularity of Definition 1.2.Since any asymptotic statement using the asymptotic ω notation can be rephrased using the little o notation, this is not a problem.A function f : A ⊆ R → R will be called increasing if f (t) ≥ f (s) whenever s, t ∈ A and t ≥ s.If both inequalities ≥ in this condition may be replaced by the strict inequality >, then we call f strictly increasing.The notions of decreasing and strictly decreasing are defined analogously.
Then there exists a concave increasing function Ψ : (0, ∞) → (0, ∞) with the following properties: Proof.Consider the family M of all concave functions ζ : (0, ∞) → (0, ∞) such that ψ(t) ≤ ζ(t) for all t ∈ (0, ∞).We define Ψ : (0, ∞) → (0, ∞) by As the pointwise infimum of a family of concave functions, Ψ is itself concave.Moreover, the definitions of M and Ψ ensure that (a) is satisfied.The concavity of Ψ, (a) and the fact that ψ is increasing then imply that Ψ is also increasing.To verify (b), note first that boundedness of ψ implies boundedness of Ψ.We may therefore assume that ψ is unbounded.Let θ ∈ (0, 1), n ∈ N and observe that the concave function t → θΨ(t) + ψ(n) does not belong to M. We deduce from this the existence of The sequence (R n ) n∈N obtained in this manner witnesses (b).Finally, we prove (c).Given ε > 0, choose T > 0 large enough so that ψ(t) ϕ(t) ≤ ε for all t ≥ T .Then the function t → ψ(T ) + εϕ(t) belongs to M and so for all t ≥ T .
Metric notions.In a metric space (M, dist M ), a set Z ⊆ M will be called and this infimum will be referred to as the separation constant (or just the separation) of Z (in M ).Moreover, Z will be called δ-separated if its separation constant is at least δ.We will refer to the set Z as a net of M if and this supremum will be called the net constant of Z in M .We will call Z a θ-net of M if its net constant is at most θ.Thus, Z will be called a separated net of (or in) M if Z is both separated and a net of M .Throughout the work, we will only be concerned with separated nets of subsets of a Euclidean space R d .For a set F ⊆ R d the separated nets of F are defined according to the above discussion, where the relevant metric space M is given by the set F together with the metric on F induced by the Euclidean distance in R d .
Given two sets S, T ⊆ R d we let In the case that S = {s} is a singleton we just write dist(s, T ) instead of dist({s} , T ).We write B(x, r) and B(x, r) respectively for the open and closed balls with centre x ∈ R d and radius r ≥ 0.Moreover, we use the same notation for neighbourhoods of sets, i.e, B(A, r) := x∈A B(x, r), where A ⊆ R d , and similarly for B(A, r).
Set related notions.The cardinality of a set A will be denoted by |A|.For m ∈ N we let [m] := {1, 2, . . ., m}.We also write R + for the set of positive real numbers.
Measures.The symbol L will be used to denote the Lebesgue measure on the given Euclidean space R d .Given a measurable function ρ : Q ⊆ R d → (0, ∞) we let ρL denote the measure on Q defined by The displacement class of two separated nets.We also introduce some notation to conveniently capture the ϕ-displacement equivalences of two separated nets.

Key properties of ϕ-displacement equivalence.
The next proposition records some sufficient conditions for deriving information on the growth of disp R (f −1 ) from that of disp R (f ).
Proposition 2.3.Let X, Y be two separated nets in R d , ϕ : (0, ∞) → (0, ∞) be an increasing concave function satisfying ϕ(R) ∈ o(R) and let f : for every x ∈ X and by ϕ(R) ∈ o(R) there is R 0 > 0 such that for every x ∈ X with ∥x∥ 2 ≥ R 0 it holds that ∥x∥ 2 − ϕ(∥x∥ 2 ) ≥ ∥x∥ 2 /2.Hence, using the concavity and the monotonicity of ϕ, we can deduce that provided by Lemma 2.1.We may now apply Proposition 2.3 to ϕ = Ψ and f to verify the corollary.
The next example shows that if the assumption ϕ(R) ∈ o(R) in Proposition 2.3 is weakened to ϕ(R) ∈ O(R), then the proposition fails.It also shows, in contrast to Corollary 2.4, that no conclusion on the asymptotic class of disp R (f −1 ) may be derived from the condition disp R (f ) ∈ O(R).
Example 2.5.Let ζ : (0, ∞) → (0, ∞) be an increasing function.Then there exist separated nets X, Y ⊆ R and a bijection f : Proof.Let X ′ := 2Z and Y ′ := Z.Let ψ : N → 1 2 +N be any strictly increasing function and define Obviously, X, Y are separated nets in R. Now we can define a bijection f : X → Y as follows: To finish Section 2, we prove two results announced in the introduction; their statements are repeated here for the reader's convenience.Proposition 2.6.Let X, Y be two separated nets in R d .Then there is a bijection f : Proof.We will assume that 0 / ∈ X, Y ; this can be ensured by an arbitrarily small shift.Then we observe that the condition disp R (h) ∈ O(R) for a mapping h : Next we observe that the claim holds for X and Y if and only if there are r 1 , r 2 > 0 such that it holds for r 1 X and r 2 Y ; assume that g : ) is also a bijection and satisfies for every x ∈ X.Moreover, note that it is enough to prove that for every X, Y there is always an injection f : X → Y satisfying disp R (f ), disp R (f −1 ) ∈ O(R) instead of a bijection-the result then follows by Rado's version of Hall's marriage theorem [10] from infinite graph theory.Given two injections f X : X → Y and f Y : Y → X we can define a binary relation E ⊆ X ×Y so that {x, y} ∈ E if and only if f X (x) = y or f Y (y) = x.Thus, E is the union of the graphs of f X and f −1 Y .By Rado's theorem there is a bijection f : ).Now let s > 0 stand for the separation of X and b > 0 for the net constant of Y .We choose r > 0 such that 2rb < s.For every x ∈ X we find g(x) ∈ rY such that ∥x − g(x)∥ 2 ≤ rb.As 2rb < s, if g(x) = g(x ′ ), then x = x ′ for any x, x ′ ∈ X.Thus, g is injective and the three observations above finish the proof.
for some constant K ′ > 0 independent of R and x.The existence of K ′ satisfying the last inequality is due to the conditions on ϕ.

Negative Results
The present section deals with obstructions to the existence of a bijection The first lemma establishes that, in the case that Y = Z d and such a bijection f : X → Z d exists, the separated net X is forced to have quite a special property.In particular it is easy to come up with examples of X not having the property described in the next lemma and thus not admitting any bijection f : stand for a normalised counting measure supported on the set 1 r X ∩ B(0, 1) and let (R n ) n∈N ⊂ R + be a sequence converging to infinity.Then the sequence (µ Rn ) n∈N converges weakly to L| B(0,1) .
Proof.We write B := B(0, 1).Let s, b > 0 be the separation and the net constants of X, respectively.We set X n := 1  Rn X ∩ B and observe that each In other words, ∥f n − id∥ ∞ ∈ o(1).We also observe that Applying (3), we get that As X n is s Rn -separated, the right-hand side above belongs to o(R n ).Therefore, using Kirszbraun's Theorem [7], each f n can be extended to an o(R n )-Lipschitz mapping f n : B → R d .Now for any x ∈ B we choose where the o(1) expression above is independent of x.This shows that f n converges uniformly to id | B .
As a shortcut, we write µ n := µ Rn .By an application of Prokhorov's theorem, we observe that the sequence (µ n ) converges weakly to the Lebesgue measure on B if and only if all of its weakly convergent subsequences do.Therefore, it is enough to verify the assertion of the lemma for an arbitrary weakly convergent subsequence of (µ n ).We may assume, without loss of generality, that this given weakly convergent subsequence is the original sequence (µ n ) and write µ for its weak limit.Using [4,Lem. 5.6] we get that f n ♯ (µ n ) converges weakly to id | B ♯ (µ) = µ.Consequently, it suffices to prove that The definition implies that ε is decreasing and from the assumption disp R (f ) ∈ o(R) it follows that ε(R n ) goes to zero as n goes to infinity.For every x ∈ X it holds that ∥f (x)∥ 2 ≥ ∥x∥ 2 − ε(∥x∥ 2 ) ∥x∥ 2 .This inequality in combination with the bijectivity of f : X → Z d and the fact that ε is decreasing implies for every R > 0, where the ball on the right hand side should be interpreted as the empty set if its radius is negative.Indeed, observe that any point in the set on the right hand side has the form f (x) for some x ∈ X which satisfies ) and therefore ∥x∥ 2 < R. Now we compare f n ♯ (µ n ) to the standard normalised counting measure It is clear that ν n ⇀ L. Thus, it suffices to verify that for any continuous function φ : R d → R with compact support it holds that Rn Z d , we can rewrite the absolute value above as This expression can be bounded above by Further, we argue that (5) can be bounded above by For every n ∈ N (4) implies that Using the definition of ε(R n ) we immediately get that for any which together with ( 7) proves (6).
By centering an axes-aligned cube of side length 1 Rn at each point of the set 1  Rn The last quantity is easily seen to be of order Rn .This implies that the upper bound of ( 6), and thus, also (5) go to zero as n goes to infinity.
We now recall the notion of natural density of a separated net.We will see that the natural density of separated nets is invariant under bijections f with disp R (f ) ∈ o(R).Definition 3.2.Let X be a separated net in R d .Then its natural density 4 , denoted by α(X), is defined as provided the limit exists; otherwise it is undefined.
Proposition 3.3.Let X, Y be two separated nets in R d such that either α(X) ̸ = α(Y ), or exactly one of α(X), α(Y ) is not defined.Then there is no bijection Proof.The assumption on α(X) and α(Y ) implies that there is an unbounded, increasing sequence (R n ) n∈N such that 4 Sometimes the term asymptotic density is used instead in the literature.
is defined, but L ̸ = 1.We may assume without loss of generality that L > 1. Otherwise just interchange X and Y and use Corollary 2.4.We choose C ∈ (1, L) and find n 0 ∈ N such that for every n ≥ n 0 it holds that Therefore, for every n ≥ max {n 0 , n 1 } we see that X ∩ B(0, R n ) > Y ∩ B(0, KR n ) , and thus, there must be In view of Proposition 3.3 it is natural to ask whether for two separated nets X, Y ⊆ R d the condition that both natural densities α(X) and α(Y ) are well defined and coincide is sufficient for the existence of a bijection f : X → Y with disp R (f ) ∈ o(R).We finish this section with an example which demonstrates that this is not the case: Proof.Fix a hyperplane H going through 0. We will denote the closed positive and the open negative half-spaces that it determines by H + and H − , respectively.Moreover, fix c ∈ (1, 2) and define Then, clearly, µ Rn defined as in the statement of Lemma 4 The spectrum of ϕ-displacement equivalence.
In the present section we prove Theorem 4.1: Theorem 4.1.Let ϕ : (0, ∞) → (0, ∞) be an increasing, concave function with ϕ(R) ∈ o(R) and X ⊆ R d be a separated net.Then there exists a separated net Y ⊆ R d such that every bijection f : X → Y satisfies disp R (f ) / ∈ o(ϕ(R)) and there exists a bijection g : . Moreover, such Y can be found so that X and Y are bilipschitz equivalent.
Let us begin working towards a proof of Theorem 4.1.The proof is based on the following construction, which we present in a bit more general form than what is strictly needed for the proof of Theorem 4.1: Construction 4.2.Let X be a separated net in R d and let (R i ) i∈N ⊂ R + be a strictly increasing sequence converging to infinity.Moreover, let ϕ : (0, ∞) → (0, ∞) be an unbounded increasing function.The aim is to construct a set Y in R d which will, roughly speaking, be a piecewise rescaled version of X and such that disp R (Y, X) ⊆ Ω(ϕ(R)).In the applications, we will choose ϕ and (R i ) i∈N in a way that will ensure that Y is a separated net.However, the construction described here is more general.
Formally, we will construct Y as an image of X.For any R > 0 we set R := R + ϕ(R).We also define R 0 := R 0 := 0. The desired mapping g : X → R d will be radial, so we first define its radial part γ : [0, ∞) → [0, ∞).We set γ(R i ) := R i and prescribe that in between these specified values the function γ interpolates linearly.Thus, γ is a piecewise linear function with breaks precisely at the points R i .Finally, we define g(x) := γ(∥x∥ 2 ) ∥x∥ 2 x and Y := g(X).
For later use we introduce a sequence (c i ) i∈N representing the slopes of γ.That is, for every i ∈ N we require that γ(R
Proposition 4.3.Assume, additionally to the assumptions of Construction 4.2, that ϕ(R) ∈ O(R) and that there is K > 1 such that R i ≥ KR i−1 for every i ∈ N. Then γ and g are bilipschitz and Y is a separated net.
Proof.Assuming that γ is bilipschitz, it is easy to see that g is bilipschitz as well, as g is a radial map with radial part γ; just consider the points in spherical coordinates.Moreover, a bilipschitz image in The function γ is bilipschitz if and only if the sequence (c i ) i∈N is bounded and bounded away from zero.As ϕ is increasing and (R i ) i∈N is strictly increasing, we immediately obtain By the assumption on ϕ and the definition Using the assumption on the growth of (R j ) j∈N , we obtain Lemma 4.4.Let ϕ, (R i ) i∈N , X, Y and s be as in Construction 4.2 and let f : Y → X be an injective mapping.If, in addition, there is Proof.By Construction 4.2, for every i ∈ N it holds that Let R > R 1 be given and let i ∈ N be the unique index such that R i−1 < R ≤ R i .Then using the assumption on the growth of ϕ(R i+1 ), we can write The last quantity is greater than, say, ϕ(R)/2K for every R large enough.
Lemma 4.5.Let ϕ, (R i ) i∈N , X, Y and g be as in Construction 4.2.If, in addition, there is Proof.Since R i is strictly increasing and ϕ is increasing, we have c i ≤ 1 for every i ∈ N. Because γ is a piecewise affine function with slopes c i ≤ 1 and γ(0) = 0 the distance from γ to the identity is an increasing function (with respect to [0, R] with R variable).This, in turn, means that the displacement of g on the ball B(0, R) is realised on the points of X closest to the boundary of the ball.Now, we immediately get the bound Then the growth condition on ϕ(R i ) allows us to derive the bound where the last inequality is true thanks to the choice of i.
Finally, we are ready to finish off the proof of Theorem 4.1: Proof of Theorem 4.1.We may assume that ϕ is unbounded, otherwise we may simply choose Y as a non-zero but small perturbation of X.Such Y is BD, and thus, also BL equivalent to X, while every bijection X → Y needs to displace the perturbed points by a non-zero distance.
We choose any K > 1 and set R i := K i for ever i ∈ N.This choice satisfies all the assumptions on (R i ) in Proposition 4.3 and Lemmas 4.4 and 4.5, where the ϕ(R i+1 ) ≤ Kϕ(R i ) assumption of the latter two statements is satisfied due to the concavity of ϕ.We apply Construction 4.2 using these objects and obtain a set Y and a bijection g : X → Y .Proposition 4.3 says that Y is a separated net and g : X → Y witnesses the BL equivalence of X and Y .Applying Lemma 4.5 we get that disp R (g 5 Continuously many, pairwise distinct BD equivalence classes.
The objective of the present section is to prove Theorem 5.1, whose statement we repeat for the reader's convenience: Theorem 5.1.For every d ∈ N, every bilipschitz equivalence class of separated nets in R d decomposes as a union of uncountably many pairwise distinct bounded displacement equivalence classes.
The proof of Theorem 5.1 is based on the following proposition: Proposition 5.2.Let d ∈ N, X be a separated net in R d and ϕ 1 , ϕ 2 : (0, ∞) → (0, ∞) be increasing, unbounded and concave functions such that Proof.Assume for a contradiction that Y 1 and Y 2 are BD equivalent and consider a bijection f : Let g : Y 1 → X be a bijection for which disp R (g) ∈ O(ϕ 1 ) and let K > 0 be sufficiently large so that disp R (g) ≤ Kϕ 1 (R) for all R > 1.Then, we may define a bijection h : which is true for some Proof of Theorem 5.1.Fix d ∈ N and a representative X of a given BL equivalence class of separated nets in R d .Let Λ denote the set of all increasing, unbounded and concave functions (0, ∞) → (0, ∞).For each ϕ ∈ Λ, we apply Theorem 4.1 to obtain a separated net Y ϕ in R d belonging to the same BL equivalence class as X and satisfying disp R (X, Y ) ∩ o(ϕ(R)) = ∅.Now, Proposition 5.2 verifies that the family of separated nets (Y ϕ ) ϕ∈Λ contains uncountably many pairwise BD non-equivalent separated nets.
6 The intersection between the BL classes and the classes of bounded growth of displacement In this section we prove Theorem 6.1: Theorem 6.1.Let d ≥ 2 and ϕ : (0, ∞) → (0, ∞) be an unbounded, increasing, concave function.Then there is an uncountable family (X ψ ) ψ∈Λ of pairwise bilipschitz non-equivalent separated nets in R d for which each The proof of Theorem 6.1 will require several lemmas, some of which are quite technical.Therefore, we first describe the main ideas of the proof informally.
The proof consists of three main ingredients.The first one is an observation that in order to construct a separated net X in R d that is not bilipschitz equivalent to Z d it is possible to start with Z d and modify it only inside a collection of pairwise disjoint cubes (S k ) k∈N of increasing size; see Figure 1.The actual position of these cubes, as long as they remain disjoint, is irrelevant with respect to bilipschitz non-equivalence with Z d .
Moreover, we can actually get that there is even no bilipschitz injection X → Z d which would also be a bijection between a neighbourhood of S k and a certain neighbourhood of the image of S k , for each k separately; this is based on the work of Burago and Kleiner [1, Lemma 2.1] and formalised in Lemma 6.3 below.
The second ingredient is exploiting the last property of the construction of X mentioned above.It sometimes allows us to rule out bilipschitz bijections between two different nets X 1 and X 2 arising in the way described above, instead of just bilipschitz bijections between X and Z d .We will see that if f : X 1 → X 2 is a bijection such that infinitely many of the cubes (S 1 k ) used to construct X 1 are mapped by f to parts of X 2 equal to Z d , then f is not bilipschitz; see Lemma 6.6.Thus, if we place the cubes (S 1 k ) 'very differently' inside R d in comparison to the cubes (S 2 k ) used to define X 2 (see Figure 1), we may hope that for every bilipschitz mapping f : X 1 → R d there will be infinitely many i ∈ N such that the image f (S 1 i ) will miss all cubes in (S 2 k ); this is substantiated in Lemma 6.2.Since it is possible to come up with uncountably many 'very different' ways how to place the cubes (S k ) Figure 1: Examples of 'very different' separated nets X 1 (left) and X 2 (right).The cubes in (S 1 k ) are the same as in (S 2 k ), but the distance of S 1 k to the origin grows with k much slower than that of S 2 k .
in R d , we will obtain an uncountable family (X ψ ) ψ∈Λ of pairwise bilipschitz non-equivalent separated nets.The last ingredient is responsible for showing that each of the nets X ψ in the family described above is ϕ-displacement equivalent to Z d .We observe that the construction of each X := X ψ inside its corresponding collection (S k ) can ensure that |X ∩ S k | = Z d ∩ S k for every k ∈ N-this is the purpose of Lemma 6.4.Since outside S k each X is equal to Z d , this allows us to define a bijection X → Z d with controlled growth of displacement: Outside (S k ) we use the identity function and inside S k we can use any bijection X ∩ S k → Z d ∩ S k .The displacement of the resulting bijection on B(0, R) is then no larger than the diameter of the largest S k intersecting B(0, R); this is formalized in Lemma 6.7.
We continue providing formal arguments for the claims outlined above.
Then there are infinitely many i ∈ N such that Proof.Since F is defined only on the set D, in every application of F in this proof the argument of F should always be intersected with D to ensure that the whole expression is well-defined; however, to improve the readability of formulas, we omit it.
We define i(k We split the proof into two cases.First, we assume that there is A ∈ N such that for every k ∈ N there is n : Note that diam g 2 (U i(n) ), diam g 2 (U i(n)+1 ) ∈ o(ψ 2 (n + A + 1)) according to the assumptions.Thanks to the assumption ψ 2 (R + A + 1) ∈ o(ψ 1 (R)), we get that F j∈N g 1 (U j ) ∩ g 2 (U i(n)+1 ) = ∅ provided k (and thus n) is large enough.This establishes the assertion in the present case.
Next we assume that for every A ∈ N it holds that i(k) > k + A for every k large enough.In particular, there exists k 0 ∈ N such that i(k) > k for every k ≥ k 0 .Moreover, we assume that k 0 is large enough so that whenever k ≥ k 0 and F • g 1 (U k ) ∩ g 2 (U i ′ ) ̸ = ∅, we have i ′ = i(k).This is possible, as either no such indices i ′ exist, or according to Condition 2 in the present case.Now it suffices to use the fact that diam F • g 1 (U k ) ∈ o(ψ 2 (k)), which follows from the assumptions.
We continue by contradiction: assume that there is i 0 ∈ N such that for every i ≥ i 0 it holds that F k∈N g 1 (U k ) ∩ g 2 (U i ) ̸ = ∅.We will also assume that i 0 > max {i(j) : j ∈ N, j ≤ k 0 , i(j) < ∞}.Given the property of i(•) proven above this means that for every i ≥ i 0 there is k ≥ k 0 such that i  can contain at most k − k 1 numbers within the set {k 1 + K, . . ., k + K}.But this, in turn, means that there is l ∈ N, l > k such that i(l) ≤ k + K.At the same time, i(l) > l + K ≥ k + K + 1; a contradiction.
for each k ∈ N. Then h is not bilipschitz.In fact, Proof.The argument of the present proof in its original form is due to Burago and Kleiner; see [1, Proof of Lemma 2.1].Moreover, a more detailed presentation of the argument is given by the present authors in [3, Proof of Lemma 3.4].Therefore, we present the first part of the proof here quite succinctly, leaving several verifications to the reader, which may be thought of as exercises.For further details, we refer the reader to the works [1] and [3].Observe that for all k.Suppose for a contradiction that the supremum of ( 9) is finite.Then, denoting by l k the sidelength of the square S k , we deduce that the mappings f k := 1 l k h • ϕ k , extended using Kirszbraun's theorem from d , are uniformly Lipschitz and, after composing each f k with a translation if necessary so that the image of every f k contains 0, they are also uniformly bounded.Applying the Arzelà-Ascoli theorem, we may pass to a subsequence of (f k ) k∈N which converges uniformly to a Lipschitz mapping f : Using the fact that each f k is bilipschitz on the finer and finer net Γ k of − 1 2 , 3 2 d , we deduce that f is also bilipschitz.
Let µ k denote the normalised counting measure on so, by hypothesis, µ k converges weakly to ρL.We claim that the pushforward measures This claim, together with the uniform convergence of f k to f , implies that , contrary to the hypothesis on ρ.Therefore, to complete the proof, it only remains to verify the claim, that is, to prove that . This remaining part of the proof is more subtle.The argument we give here is not present in [1], but is an adaptation of [3, Proof of Lemma 3.2].Although the adaptation is quite simple, it requires good familiarity with the proof in [3] to construct it.Therefore, we provide more details here.
Consider the sequence of measures which clearly converges weakly to the Lebesgue measure on R d .For a given continuous function φ : R d → R with compact support we need to verify We bound the expression in (10) above by the sum of two terms: The first term is at most ∥φ∥ , which vanishes as k → ∞ due to the weak convergence of ν k to L, the uniform convergence of f k to f and the fact that f is bilipschitz.We do not provide further details here; the verification is left as an exercise with reference to [3, Lemma 3.1].
The second term may be bounded above by We will argue that for all k sufficiently large.Once this is established the quantity of ( 12) is seen to be at most which converges to zero as k → ∞.Hence, to complete the verification of the weak convergence of , we prove (13).
From now on we treat k as fixed but sufficiently large.Recall that the sequence of mappings Since the mappings f i : − 1 2 , 3 2 d → R d were obtained as Kirszbraun's extensions of f i | Γ i , we additionally note that Lip(f i ) ≤ U for all i ∈ N. We also write b for the maximum of the net constants of Thus, any point in A k has the form f k (x) for some In the remaining case we have It is now enough to define Ξ k so that |Ξ k ∩ T k,i | = n k,i for all i ∈ [m d k ] and the separation and net constants of Ξ k in S k may be bounded respectively below and above independently of k.For each i ∈ [m d k ], we suggest the following prescription of the set Ξ k ∩ T k,i : imagine we have a pot containing n k,i points.In the first step, we take one point out of the pot and place it at the centre of the cube T k,i .Assume now that j ≥ 1 and that after j steps we have placed exactly one point from the pot at the centre of each cube in each of the the first j − 1 dyadic partitions of the cube T k,i .In step j + 1, we consider the jth dyadic partition of T k,i and arbitrarily transfer remaining points from the pot onto the vacant centres of each of the 2 dj cubes in this partition until either the pot is empty or all of the 2 dj centres are occupied.When the pot is empty, the procedure terminates and the placement of the n k,i points determines the set Ξ k ∩ T k,i .Construction 6.5.Let ρ : [0, 1] d → (0, ∞) be a measurable function with 0 < inf ρ ≤ sup ρ < ∞ and [0,1] d ρ dL = 1, l = (l k ) k∈N be a strictly increasing sequence of natural numbers and ψ : (0, ∞) → (0, ∞) be an increasing inequality like l 2 n k 4 > 2l n k holds for all k ∈ N. We will no longer mention this explicitly.
For each k ∈ N, we set R 15), ( 14) and S 1,n ⊆ R 1,n .Thus, the only condition of Lemma 6.3 which is not clearly satisfied by the sequences R k , S k , Υ k and the function h 8); we verify it shortly.However, first we point out that, once these conditions are verified, applying Lemma 6.3 in the above setting gives that h = f | k∈N Υ k and therefore also f is not bilipschitz, which is the desired contradiction.
Proof.The conditions on the sidelength and the location of S k and on the size of |Ξ k | in Construction 6.5 and Lemma 6.4(i) ensure that |X ψ ∩ S k | = Z d ∩ S k .Therefore, we may define a bijection h : X ψ → Z d as follows: on the set X ψ \ k∈N S k we define h as the identity.Finally, for each k ∈ N we define h| X ψ ∩S k arbitrarily as a bijection X ψ ∩ S k → Z d ∩ S k .The mapping h defined above clearly satisfies (16) On the other hand, the conditions of Construction 6.5, in particular the properties of the mapping g ψ coming from Lemma 6.2 and 0 ∈ g ψ (U 1 ), ensure that for every k > 1.Moreover, given R > inf x∈S 2 ∥x∥ 2 , there is a maximal n ∈ N, n ≥ 2 such that inf x∈Sn ∥x∥ 2 ≤ R. We infer, using (17), that R ≥ ψ(n).This, in combination with (16) implies ∈ O(1).
7 Hierarchy of ω-regularity of separated nets.
Here we prove Theorem 7.1 and Corollary 7.2.The statements are repeated for the reader's convenience.We also recall from the introduction that for two moduli of continuity ω 1 , ω 2 , in the sense of Definition 1.2, satisfying ω 2 ∈ o(ω 1 ) the notion of ω 1 -regularity is formally weaker than ω 2 -regularity.That is, the set of ω 2 -regular separated nets is contained in the set of ω 1separated nets.
Theorem 7.1.Let d ≥ 2, α 0 = α 0 (d) be the quantity of [3,Theorem 1.2] and ω be a modulus of continuity in the sense of Definition 1.2 such that ω(t) = t log 1 t α 0 for t ∈ (0, a) and some a > 0. Then the set of ω-regular separated nets in R d strictly contains the set of separated nets bilipschitz equivalent to Z d .Proof.Define ϕ : (0, ∞) → (0, ∞) by ϕ(t) = (log t) α 0 .Then, by Theorem 6.1 there is a separated net X ⊆ R d which is BL non-equivalent to the integer lattice Z d , but for which disp R (X, Z d )∩O(ϕ(R)) ̸ = ∅.At the same time, [3, Theorem 1.2 & Proposition 1.3] assert that there are ω-irregular separated nets Y ⊆ R d and that all such separated nets Y satisfy disp R (Y, Z d )∩O(ϕ(R)) = ∅.We conclude that the separated net X must be ω-regular.
Corollary 7.2.For any dimension d ≥ 2 there exist moduli of continuity ω 1 , ω 2 , ω 3 in the sense of Definition 1.2 so that whenever i, j ∈ {1, 2, 3} with i < j the set of ω j -regular separated nets of R d is strictly contained in the set of ω i -regular separated nets.

Theorem 7 . 1 .
and Burago and Kleiner [1, Theorem 1.1].Let d ≥ 2, α 0 = α 0 (d) be the quantity of [3, Theorem 1.2] and ω be a modulus of continuity in the sense of Definition 1.2 such that ω(t) = t log 1 t α 0 for t ∈ (0, a) and some a > 0. Then the set of ω-regular separated nets in R d strictly contains the set of separated nets bilipschitz equivalent to Z d .

Proposition 2 . 7 .
Let ϕ : (0, ∞) → (0, ∞) be an increasing, concave function.Then the notion of ϕ-displacement equivalence of separated nets in R d given by Definition 1.4 is an equivalence relation on the set of separated nets of R d .Proof.Reflexivity is obvious.The symmetry of ϕ-displacement equivalence follows from Proposition 2.3 if ϕ(R) ∈ o(R) and from Proposition 2.6 otherwise.To verify the transitivity, consider separated nets X, Y, Z of R d for which X and Y are ϕ-displacement equivalent and Y and Z are ϕdisplacement equivalent.Let the bijections f : X → Y and g : Y → Z witness this.Then g • f is a bijection X → Z and there is a constant K

Lemma 6 . 3 .
Let ρ : [0, 1] d → (0, ∞) be a measurable function with 0 < inf ρ ≤ sup ρ < ∞ and the property that the equationΦ ♯ ρL = L| Φ([0,1] d ) has no bilipschitz solutions Φ : [0, 1] d → R d .Let (R k ) k∈N and (S k ) k∈N be sequences of pairwise disjoint cubes in R d such that diam R k and diam S kare unbounded and increasing and 2S k ⊆ R k for every k ∈ N, where 2S k denotes the cube with the same midpoint as S k and sidelength twice the sidelength of S k .For each k ∈ N, let ϕ k : R d → R d denote the unique affine mapping R d → R d with scalar linear part satisfying ϕ k ([0, 1] d ) = S k .For each k ∈ N, let Υ k be a finite subset of R k such that k∈N Υ k is a separated net of k∈N R k and the normalised counting measure on the set ϕ −1 k (Υ k ∩ S k ) converges weakly to ρL.Let h : k∈N Υ k → Z d be an injective mapping such that ) − x∥ 2 = max x∈B(0,R)∩ k∈N S k ∥h(x) − x∥ 2 ≤ max k : S k ∩B(0,R)̸ =∅ diam S k .
required.Lemma 6.4.Let ρ : [0, 1] d → (0, ∞) be a measurable function with 0 < inf ρ ≤ sup ρ < ∞ and [0,1] d ρ dL = 1.Let (S k ) k∈N be a sequence of pairwise disjoint cubes in R d such that the sidelength l k ∈ N of S k is unbounded and increasing.Let (ϕ k ) k∈N denote the sequence of affine mappings ϕ k with scalar linear part l k and ϕ k ([0, 1] d ) = S k .Then there exists a sequence (Ξ k ) k∈N of finite sets Ξ k ⊆ S k with the following properties:(i) |Ξ k | = l d k for every k ∈ N, (ii) k∈N Ξ k is a separated net of k∈N S k , (iii) The sequence (µ k ) k∈N ,where µ k is the normalised counting measure on the set ϕ −1 k (Ξ k ), converges weakly to ρL.Proof.If property (i) is omitted, the proof is contained in [1, Proof of Lemma 2.1]; similar constructions are also given in [4] and [3].Getting property (i) only requires taking a little extra care in the construction of [1, Proof of Lemma 2.1].Therefore, we present only minimal details here; the calculations and the verification of (i)-(iii) are left to the reader.Let m k := √ l k for k ∈ N. Fix k ∈ N. We describe how to obtain the set Ξ k ⊆ S k .Consider the standard partition (T k,i ) i∈[m d k ] of the cube S k into m d k subcubes of equal size and choose a sequence (n k