Planar Bilipschitz Extension from Separated Nets
Michael Dymond, Vojtěch Kaluža
TL;DR
This work addresses planar bilipschitz extension from discrete sets, proving that any $L$-bilipschitz map on $\mathbb{Z}^{2}$ (and more generally any separated net in $\mathbb{R}^{2}$) extends to a bilipschitz map on $\mathbb{R}^{2}$ with a polynomial bound on the extension constant. The authors develop a multi-stage strategy: approximate a shoreline on horizontal lines, separate discrete image sets with a bilipschitz curve, extend along wide horizontal strips, and glue the pieces using a Kovalev-style extension inside strips. The approach yields explicit polynomial bounds and resolves the two-dimensional Oberwolfach/open problems of Navas and of Alestalo–Trotsenko–Väisälä, while also outlining a path towards higher dimensions via a companion work. The main contribution is a complete, quantitative solution in dimension two, establishing that bilipschitz extensions from separated nets to the plane are always possible with controlled constants, and it links discrete-net extendability to strip-wise, geometrically controlled constructions.
Abstract
We prove that every $L$-bilipschitz mapping $\mathbb{Z}^2\to\mathbb{R}^2$ can be extended to a $C(L)$-bilipschitz mapping $\mathbb{R}^2\to\mathbb{R}^2$ and provide a polynomial upper bound for $C(L)$. Moreover, we extend the result to every separated net in $\mathbb{R}^2$ instead of $\mathbb{Z}^2$, with the upper bound gaining a polynomial dependence on the separation and net constants associated to the given separated net. This answers an Oberwolfach question of Navas from 2015 and is also a positive solution of the two-dimensional form of a decades old open (in all dimensions at least two) problem due to Alestalo, Trotsenko and Väisälä.
