Phase retrieval from a uniformly discrete point set
Phase retrieval asks to recover a function up to a global phase from the magnitudes of its short-time Fourier transform. The question is whether uniqueness holds when magnitudes are sampled only on a uniformly discrete point set.
For windows of the form e^{-π|x|^2}h(x) with h polynomial, the Bargmann transform identifies the STFT range with polyanalytic Fock spaces. A discrete norming inequality, built from a multidimensional Remez inequality and VC-dimension bounds, propagates smallness from a discrete set to the bulk. Tail estimates on the reproducing kernel control the truncation error. The main theorem is formalized in Lean 4 using Mathlib, with new definitions such as UniformlyDiscrete, PolyFockSpace, and PhaseRetrievalSet.
There exists a uniformly discrete set S in R^{2d} such that STFT magnitudes on S determine every f in L^2(R^d) up to a constant phase. The separation distance is independent of the polynomial degree and proportional to the square root of the dimension.
