Abstract: The lamplighter group over the planar integer grid is proved to not be bi-Lipschitz equivalent to any metric space of negative type, so in particular it does not admit a bi-Lipschitz embedding into L1. This shows the existence of finitely generated metabelian groups on which word metrics are never comparable up to constant factors to conditionally negative definite (CND) kernels, and that the property of admitting a word metric-comparable CND kernel is not preserved by wreath products.
The paper proves that the planar lamplighter group \(\mathbb{Z}_2 \wr \mathbb{Z}^2\) is not CND-comparable, with Euclidean distortion \(\asymp \sqrt{\log n}\) for its finite quotients under the square-root metric.
A quadratic Poincaré inequality comparing Bernoulli noise with randomly sparsified crosses, combined with expected traveling-salesman estimates, yields the lower bound and resolves the Naor–Peres problem on bi-Lipschitz embeddings into \(L_1\).
The results show that wreath products need not preserve CND-comparability, establish sharp \(L_q\) snowflake distortion for \(1\le q\le2\), and determine compression exponents for zero sections over polynomial-growth groups.
Overview and main result
The paper proves that the planar lamplighter group Z2≀Z2, equipped with any word metric, is not bi-Lipschitz equivalent to a metric of negative type. Concretely, the main theorem states that (Z2≀Zn2,d1/2) does not embed into ℓ2 with finite distortion, and more precisely that for every n≥2 the Euclidean distortion of (Z2≀Zn2,d1/2) is of order logn (2608.16706). Since Schoenberg's classical characterization identifies metrics whose square roots embed isometrically into Hilbert space with conditionally negative definite (CND) kernels, the theorem resolves a problem posed by Naor–Peres: Z2≀Z2 admits no bi-Lipschitz embedding into L1.
The result carries three structural corollaries, each stated with its justification in the introduction. First, Z2≀Z2 is the first metabelian (solvable of derived length two) group that fails to be CND-comparable; this is optimal in the derived-length hierarchy since finitely generated Abelian groups are CND-comparable. It is also the first "classical" group known to lack this property — prior examples were groups constructed specifically for the purpose, with derived length at least three or non-amenability. Second, the theorem separates CND-comparability from attaining Hilbert compression exponent $1/2$: Naor–Peres showed that (Z2≀Zn2,d1/2)0 has Hilbert compression exponent exactly (Z2≀Zn2,d1/2)1 and that the supremum is attained, yet the group is not CND-comparable. Third, while wreath products are known to preserve the Haagerup property, coarse Hilbert embeddability, and positive compression exponent, they do not preserve CND-comparability.
The proof also yields quantitative lower bounds on distortion growth: (Z2≀Zn2,d1/2)2 for (Z2≀Zn2,d1/2)3-point subsets, and the authors conjecture this is sharp, i.e., (Z2≀Zn2,d1/2)4.
The quadratic cross inequality
The technical core is a Poincaré-type inequality for functions on the Boolean cube (Z2≀Zn2,d1/2)5. Let (Z2≀Zn2,d1/2)6 be (Z2≀Zn2,d1/2)7-Bernoulli noise on (Z2≀Zn2,d1/2)8 and let (Z2≀Zn2,d1/2)9 be the indicator of a random sparsification of an axis-parallel cross ℓ20 with uniformly random center ℓ21, each cross element retained independently with probability ℓ22. The key proposition asserts that every ℓ23 satisfies
ℓ24
Because the inequality is quadratic and the Walsh characters form an orthonormal basis of ℓ25, it suffices to verify it on characters. For ℓ26, the left side evaluates via ℓ27 to a quantity of order ℓ28, while the right side equals ℓ29 using n≥20. The authors note the implicit constant can be taken as n≥21 and that this is optimal. The use of a single randomly shifted, randomly sparsified cross simplifies the multi-scale union of crosses employed in the antecedent work of Gartland–Ostrovskii.
From the inequality to the lower bound
Assuming an embedding n≥22 of n≥23 into n≥24 with distortion n≥25, one restricts attention to the zero section n≥26 via n≥27 and substitutes into the cross inequality. Two traveling-salesman estimates then drive the argument:
n≥28
The upper bound follows from an explicit n≥29 tour of the cross; the lower bound follows from a general lemma bounding expected TSP cost of Bernoulli subsets via volume growth, instantiated through a proposition showing that for any finite group of polynomial growth degree (Z2≀Zn2,d1/2)0 with nondegenerate diameter, (Z2≀Zn2,d1/2)1 when (Z2≀Zn2,d1/2)2. Combining these gives (Z2≀Zn2,d1/2)3, hence (Z2≀Zn2,d1/2)4, matching the known upper bound from Baudier–Motakis–Schlumprecht–Žák. The passage from the finite quotients to the infinite group uses a lemma establishing mutual constant-distortion compatibility between the zero section of (Z2≀Zn2,d1/2)5 and lamp configurations supported on (Z2≀Zn2,d1/2)6; the nontrivial direction relies on a combinatorial argument handling "transitions" across the boundary of the fundamental box. A remark extends the non-CND-comparability conclusion to (Z2≀Zn2,d1/2)7 for arbitrary infinite finitely generated (Z2≀Zn2,d1/2)8.
Sharpness of the snowflake constants in (Z2≀Zn2,d1/2)9
The same machinery yields an optimal refinement of the Naor–Peres compression theory. For logn0, let logn1 be the best constant in a lower Snowflake bound logn2 for logn3-Lipschitz maps into logn4. The paper proves logn5, sharpening the previously known lower bound logn6 obtained by tracking constants in Naor–Peres. The deduction composes a hypothetical map with the Schoenberg embedding logn7 satisfying logn8, applies the cross inequality, and optimizes over the scale parameter logn9, choosing Z2≀Z20. More generally, the paper establishes
Z2≀Z21
with the upper bound following from the Z2≀Z22 embedding of Baudier et al. composed with the Bretagnolle–Dacunha-Castelle–Krivine embedding Z2≀Z23.
Compression exponents of higher-dimensional zero sections
Independently of the negative-type question, the paper determines the Z2≀Z24 compression exponent of the zero section of Z2≀Z25 whenever Z2≀Z26 has polynomial growth of degree Z2≀Z27: for all Z2≀Z28 and Z2≀Z29,
L10
which recovers the Naor–Peres value L11 at L12 and extends it to all dimensions. The upper bound embeds rescaled Hamming cubes of dimension L13 into the zero section — constructed via witnesses to failure of TSP-efficiency in the sense of Gartland–Randrianantoanina–Randrianarivony — and applies Enflo-type rounding inequalities. The matching lower bound constructs an explicit embedding into L14 built from "doubly local" snapshots L15, which encode multiscale structure through simultaneous ball-and-annulus intersections counted against nets L16; a multiplicity-two property of these snapshots and packing bounds on the nets control both Lipschitzness and the compression lower bound.
Limitations and open questions
The paper leaves several questions open. The L17 distortion estimate L18 is established only for L19; for Z2≀Z20 even bounded distortion is unknown. Whether some snowflake Z2≀Z21 with exponent Z2≀Z22 embeds into Hilbert space remains open (the answer is negative for Z2≀Z23). Relatedly, sketchability of the zero section — equivalently, sketchability of planar TSP tours under the standard connection — is unresolved, though a positive answer to the snowflake question would imply it. The conjectured sharpness Z2≀Z24 is proved only as a lower bound. Finally, the authors ask whether embeddings of Z2≀Z25 into Z2≀Z26 must incur distortion Z2≀Z27, which would be sharp by the known upper bounds; the methods here treat only Z2≀Z28.
Conclusion
This paper settles the Naor–Peres problem by proving that the planar lamplighter group admits no bi-Lipschitz embedding into Z2≀Z29, via a clean quadratic Poincaré inequality comparing Bernoulli noise to random crosses on the Boolean cube, combined with sharp expected-TSP estimates for Bernoulli subsets. The result identifies the first metabelian — indeed the first classical — group failing CND-comparability, demonstrates that wreath products need not preserve this property, and separates CND-comparability from attained Hilbert compression $1/2$0. The accompanying determination of compression exponents for zero sections of lamplighters over all polynomial-growth groups rounds out the quantitative picture, while several natural questions about higher dimensions, larger snowflake exponents, and sketchability remain open.
“Emergent Mind helps me see which AI papers have caught fire online.”
Philip
Creator, AI Explained on YouTube
Sign up for free to explore the frontiers of research
Discover trending papers, chat with arXiv, and track the latest research shaping the future of science and technology.Discover trending papers, chat with arXiv, and more.