Exact weak displacement kernel and Gaussian smearing
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.gkp_exactSmearingLet , , and . For , put and . The ideal weak displacement kernel is on Schwartz tests. With the positive Weyl phase , evaluating its Gaussian-smearing convolution gives
This is the actual overlap of the smeared comb waves . Their computed squared norms are positive. Individually normalized overlaps are . Pairings and overlaps are integrable, the weak lattice sums converge, and as . This retains the weak-kernel normalization and avoids treating the finite-smearing Gram matrix as the identity.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P65
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open scoped ComplexConjugate Matrix Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.29 (D9)--(D11): weak-kernel convolution and true wavefunction overlap;
normalized overlaps divide by computed norms. D8's inconsistent intermediate signs
are not repeated; D9 agrees with the declared positive Weyl convention. -/
theorem gkp_exactSmearing (mu nu : Fin 2) (d : ℝ) (hd0 : 0 < d) (hd1 : d ≤ 1) (z : ℂ) :
0 < smearedNorm mu d ∧ 0 < smearedNorm nu d ∧
Integrable (fun x : ℝ => conj (smearedWave mu d x) * displaceWave z (smearedWave nu d) x) ∧
smearedKernelIntegral mu nu d z = smearedKernelSum mu nu d z ∧
(∫ x : ℝ, conj (smearedWave mu d x) * displaceWave z (smearedWave nu d) x) =
smearedKernelSum mu nu d z ∧
(∫ x : ℝ, conj (normalizedSmearedWave mu d x) *
displaceWave z (normalizedSmearedWave nu d) x) =
smearedKernelSum mu nu d z /
(Real.sqrt (smearedNorm mu d * smearedNorm nu d) : ℂ) ∧
(∀ f : SchwartzMap ℂ ℂ,
Summable (fun n : ℤ × ℤ => kernelPhase mu nu n * f (kernelLattice mu nu n)) ∧
(∀ e > (0 : ℝ), Integrable (fun a : ℂ => smearedKernelSum mu nu e a * f a)) ∧
Tendsto (fun e : ℝ => (∫ a : ℂ, smearedKernelSum mu nu e a * f a) /
(2 * Real.pi * e ^ 2 : ℂ)) (nhdsWithin 0 (Set.Ioi 0))
(nhds (idealDisplacementKernel mu nu f))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all , all real satisfying , and every , define
and let and
Also set
and
Then and , the function is Lebesgue integrable, and
Furthermore, for every complex-valued Schwartz function on , the series is summable, the function is Lebesgue integrable for every real , and
The labels may coincide or differ; is included, while is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.