DimdPoly #
Showcase: stable phase recovery for Hermite-Fock expansions #
This file is the explained, proved public version of the qualitative fixed-dimension phase-retrieval theorem.
The public statement deliberately uses only ordinary Mathlib objects:
- a point is a vector
z : Fin d -> ℂ; - a finite signal is a finitely supported coefficient array
F : Finsupp (Fin d -> ℕ) ℂ; - the basis functions are written out as explicit finite products of explicit one-variable complex Hermite polynomials;
TrueHermitePoly κ Fis the finite linear combination∑ α, F α * Φ κ α;TrueHermitePolys κis the set of all functions that arise this way;TrueHermiteFunctions κis the GaussianL^2closure of those finite functions;- the stability defect is an explicit Gaussian
L^2norm of a difference of measured magnitudes.
The theorem stable_phase_retrieval is the main qualitative statement: it keeps
the reference signal P finite, but allows the comparison signal Q to lie in
the Gaussian L^2 closure of TrueHermitePolys κ.
Explicit Hermite-Fock basis #
The normalized one-variable Hermite-Fock basis polynomial.
The fixed index k is the Hermite level, while n is the coefficient index.
Lean's Finset.range N is the finite set {0, ..., N - 1}. Thus
Finset.range (min n k + 1) indexes exactly j = 0, ..., min n k, matching
the inclusive upper limit in the paper formula.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The d-variable basis element.
For each coordinate q, take the one-variable basis polynomial determined by
κ q and α q, then multiply the results over all coordinates.
Equations
- DimdPolyShowcaseChallenge.Φ κ α z = ∏ q : Fin d, DimdPolyShowcaseChallenge.HermitePoly (κ q) (α q) (z q)
Instances For
The finite Hermite-Fock polynomial attached to a finite coefficient array.
This is the reader-friendly finite model: it is just a finite sum of explicit basis polynomials with complex coefficients.
Equations
- DimdPolyShowcaseChallenge.TrueHermitePoly κ F z = F.sum fun (α : Fin d → ℕ) (c : ℂ) => c * DimdPolyShowcaseChallenge.Φ κ α z
Instances For
The set of all finite Hermite-Fock polynomials at level κ.
This is just the range of the explicit coefficient formula above. Thus a
function P belongs to TrueHermitePolys κ exactly when it can be written
as TrueHermitePoly κ F for some finite coefficient array F.
Equations
Instances For
Gaussian measure and coefficient geometry #
The Gaussian L² closure of finite Hermite-Fock polynomials at level κ.
Note that functions in L² are only defined up to almost-everywhere equality,
and come with integrability guarantees so we use f =ᵐ[γ] P to denote this
"equal in measure" statement.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Stable phase retrieval for Gaussian L² limits of finite Hermite-Fock polynomials.
This is the main qualitative statement. The comparison signal Q is an element
of the Gaussian L² closure of the finite Hermite-Fock polynomials.