Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 13 results · all verified · 12 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Uncertainty Principles for Fourier Analysis

1 · Prerequisites

2 · Summary

This page isolates three inequivalent notions of localisation of a function on Rn and states precisely how much can be said about each. The variance formulation measures spread by the second moments of ∣f∣2 and ∣f^∣2; the support-measure formulation counts the measures of sets off which f and f^ vanish; the Hardy formulation assumes Gaussian decay of both and exhibits a threshold at the critical product ab=1. Gaussian decay in both domains implies finite second moments, but the hypotheses are not interchangeable; the companion page supplies the Gaussian computations and the separating examples.

The variance part begins with the spatial and frequency centres and variances of a nonzero L2 function with finite second moments, whose well-definedness is discharged by Cauchy-Schwarz and Plancherel. The Fourier characterization of H1 identifies this domain with f∈H1 and xf∈L2. Translation and modulation are then shown to centre the variance pair without changing the product, and the coordinate commutator estimate ∥xjf∥2∥Djf∥2≥12∥f∥22, with Djf the weak derivative, is proved by compact cutoffs and vanishing L2 tails. Fourier differentiation and finite-tuple Cauchy-Schwarz convert that estimate into the summed n-dimensional Heisenberg bound ∥∣x∣f∥2∥∣ξ∣f^∥2≥n4π∥f∥22 on the same H1-with-finite-spatial-moment domain. The sharp theorem and its equality classification are owned by the functional-analysis track and remain quoted only on Schwartz functions; this pair extends the lower bound, not that classification.

The support-measure part proves ∣E∣∣F∣≥1 for a nonzero L2 function supported on E whose continuous L1 transform is supported on F, with no regularity beyond measurability and finiteness of the two measures. The complex-analytic route to compact-support rigidity is developed next: compact support makes the transform a function with entire coordinate slices by differentiation under the integral sign, Gaussian decay gives the same entire continuation together with the growth bound ∣F(z)∣≤Ca−n/2eπ∣Im⁡z∣2/a, and a separately holomorphic function vanishing on a real box is identically zero. Combining the continuation with the nonempty open complement of a compact frequency support yields the qualitative theorem: a nonzero L1 function with compact support cannot have compactly supported transform.

The Hardy part states and proves the Gaussian uncertainty principle on Rn by coordinate slices: entire continuation and one-variable rigidity give vanishing in the supercritical case and successive Gaussian factors in the critical case. The separate-holomorphy vanishing lemma then extends the critical factorization to complex arguments. The proof's complex-analytic cost is the entire growth-rigidity lemma with its two sector bounds and Phragmen-Lindelof argument, and the remark on proof cost records which part of the argument is real-variable and which is complex-analytic. The subcritical Gaussians show that the threshold is sharp: for ab<1 every Gaussian e−πc∣x∣2 with a<c<1/b satisfies both Gaussian bounds, so no vanishing conclusion can hold. The page closes by contrasting the finite support-product bound of the unitary discrete Fourier transform, whose right side is N and whose equality set is different, with the continuous inequalities, and by recording the sense in which the three localisation notions are not interchangeable.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-6.1-sol)Open item page →

Spatial and frequency centres and variances of an L2 function with finite second moments

Definition

Assume countable choice (The Axiom of Countable Choice (ACω)). Let n≥1 and let f∈L2(Rn;C) (The space Lp(μ) as the quotient by null functions) be nonzero with finite second moments, ∫Rn∣x∣2∣f(x)∣2 dx<∞,∫Rn∣ξ∣2∣f^(ξ)∣2 dξ<∞, where f^ is the Plancherel transform of Plancherel theorem. Define the spatial mean a=(a1,…,an) and spatial variance Vx(f), and the frequency mean b=(b1,…,bn) and frequency variance Vξ(f), by aj:=1∥f∥22∫Rnxj∣f(x)∣2 dx,Vx(f):=1∥f∥22∫Rn∣x−a∣2∣f(x)∣2 dx, bj:=1∥f^∥22∫Rnξj∣f^(ξ)∣2 dξ,Vξ(f):=1∥f^∥22∫Rn∣ξ−b∣2∣f^(ξ)∣2 dξ. These are the probability-normalised means and variances of the measures ∣f(x)∣2dx/∥f∥22 and ∣f^(ξ)∣2dξ/∥f^∥22. The integrals are read in the componentwise convention of Integrable real and complex functions, and their integrals, with ∣f∣2=ff‾ and xj,ξj the real coordinate functions; the frequencies are measured in the e−2πix⋅ξ convention of Plancherel theorem and Complex Lp classes and Euclidean test-function conventions. No centring is asserted here: the mean is subtracted in the variance but the transformation property of the pair (Vx,Vξ) is proved separately in Centring by translation and modulation preserves the variance product.

Well-definedness

Since f≠0 in L2, we have ∥f∥2>0. By the L2 Cauchy–Schwarz inequality and the pairing convention of Complex completeness, density, and inner product: the consumer interface, applied to the functions x↦∣xj∣ ∣f(x)∣ and ∣f∣, ∫Rn∣xj∣ ∣f(x)∣2 dx≤∥∣xj∣f∥2∥f∥2≤∥∣x∣f∥2∥f∥2<∞, where ∣xj∣≤∣x∣ and the hypothesis on the second moment bound the first factor. Each numerator ∣∫xj∣f∣2∣ is therefore finite, and the same estimate with ∣x−a∣2≤2∣x∣2+2∣a∣2 makes the spatial variance numerator finite. On the frequency side Plancherel theorem gives ∥f^∥2=∥f∥2>0 and, together with the assumed second moment of f^, the same Cauchy–Schwarz estimate makes both frequency numerators finite. Hence all four quantities are well-defined finite real numbers and a,b∈Rn.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The coordinate inequality ∥xjf∥2∥Djf∥2≥12∥f∥22

Statement

Assume Countable Choice. Let n≥1, j∈{1,…,n} and f∈H1(Rn;C) with xf∈L2(Rn;Cn). Here H1=W1,2 under the regular-distribution identification of Integer-order W^{k,2} and H^k agree with equivalent norms, and Djf∈L2 denotes the weak partial derivative. Then ∥xjf∥2 ∥Djf∥2≥12∥f∥22. By the Fourier characterization of H1, this is the coordinate estimate on the natural domain where both ∣x∣f and ∣ξ∣f^ lie in L2. Both sides vanish when f=0; for nonzero f the right side is positive.

Facts & Assumptions

Given: Countable Choice, n≥1, j∈{1,…,n}, and f∈H1(Rn;C) with xf∈L2(Rn;Cn).

[A1]

Countable Choice is the assumption carried by the Sobolev and compact-support integration-by-parts interfaces below (The Axiom of Countable Choice (ACω)).

[F1]

The Fourier characterization identifies H1 with W1,2 under the regular-distribution embedding, so each weak derivative Dkf belongs to L2; its Fourier-side weight is ⟨ξ⟩f^ (Integer-order W^{k,2} and H^k agree with equivalent norms).

[F2]

There is a real smooth cutoff χ with 0≤χ≤1, χ=1 on ∣x∣≤1, χ=0 on ∣x∣≥2, and Dj(χ(x/R))=R−1(Djχ)(x/R) (Explicit compactly supported smooth cutoffs).

[F3]

For u∈W1,2 and a smooth multiplier ρ with bounded derivatives, ρu∈W1,2 and Dj(ρu)=(Djρ)u+ρDju (Weak Leibniz rule with a smooth factor).

[F4]

If u,v∈W1,2(Rn) and one factor is compactly supported as an almost-everywhere class, then ∫uDjv=−∫vDju (Integration by parts for dual-exponent Sobolev functions).

[F5]

Complex L2 satisfies Cauchy–Schwarz, so the product of two L2 functions is integrable (Complex completeness, density, and inner product: the consumer interface).

[F6]

If integrable functions converge almost everywhere under a common integrable majorant, their integrals converge (Dominated convergence).

[F7]

The Sobolev test identity is bilinear and does not conjugate its test function (Integer-order Sobolev spaces and their norms, Complex Lp classes and Euclidean test-function conventions).

Proof

technique · cutoff integration by parts, followed by vanishing $L^2$ tails
1.1A1F1F7given

Since f∈H1=W1,2 by [F1], each weak derivative Dkf lies in L2. Conjugating the bilinear weak-derivative test identity for f shows that f‾∈W1,2 and Dkf‾=Dkf‾: for each ϕ∈Cc∞, apply the identity to ϕ‾ and conjugate it.

2.1F2F3F4step 1.1given

For R≥1 set χR(x)=χ(x/R) and ρR(x)=xjχR(x). By [F2], ρR∈Cc∞; by [F3] and step 1.1, vR:=ρRf‾ belongs to W1,2 and is compactly supported, with DjvR=(χR+xjDjχR)f‾+xjχRDjf‾. Applying [F4] to u=f and v=vR gives ∫fDjvR=−∫vRDjf, hence ∫χR∣f∣2+∫xjDjχR∣f∣2=−2Re⁡∫xjχRf‾Djf. The last identity uses that χR and xj are real-valued, so the two derivative terms are complex conjugates.

3.1F2F5F6step 2.1

Let R→∞ through positive integers. We have χR(x)→1 pointwise and 0≤χR≤1, so dominated convergence [F6] gives ∫χR∣f∣2→∥f∥22. The derivative DjχR vanishes unless R≤∣x∣≤2R, and ∣xjDjχR∣≤2∥Djχ∥∞ there by [F2]; for every fixed x this factor is eventually zero. Since ∣f∣2∈L1, [F6] gives ∫xjDjχR∣f∣2→0. Finally, xjf‾Djf∈L1 by [F5], because xjf,Djf∈L2; dominated convergence with ∣χR∣≤1 yields ∥f∥22=−2Re⁡∫xjf‾Djf.

4.1F5step 3.1∎

By [F5] and ∣Re⁡z∣≤∣z∣, ∥f∥22≤2∫∣xjf∣ ∣Djf∣≤2∥xjf∥2∥Djf∥2. Dividing by 2 proves the inequality. If f=0 both sides vanish; if f≠0 the lower bound is positive.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Compact support gives an entire Fourier-Laplace transform by slices

Statement

Let n≥1 and let f∈L1(Rn;C) vanish almost everywhere outside a compact set K⊆Rn. Define F(z):=∫Rnf(x)e−2πi x⋅z dx,z∈Cn. Then the integral converges absolutely for every z and its value does not depend on the representative of the L1 class; for every j and every fixed values of the other n−1 complex coordinates, the coordinate slice w↦F(z1,…,zj−1,w,zj+1,…,zn) is entire on C, with ∂∂zjF(z)=∫Rnf(x) (−2πixj)e−2πi x⋅z dx; and F(x)=f∧(x) for every x∈Rn, where f∧ is the L1 transform of Fourier transform on complex L1 classes.

Facts & Assumptions

Given: An integer n≥1, a class f∈L1(Rn;C) vanishing almost everywhere outside a compact set K⊆Rn, and points z∈Cn and w∈C; here x⋅z=∑k=1nxkzk for x∈Rn.

[F1]

The complex exponential satisfies exp⁡(ζ+η)=exp⁡ζexp⁡η and exp⁡′=exp⁡, so (exp⁡ζ−1)/ζ→1 as ζ→0 through nonzero complex values; ∣exp⁡(ζ)∣=eRe⁡ζ (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential, The complex exponential is entire and its complex derivative is itself, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0).

[F2]

For an integrable complex function u, ∣∫u∣≤∫∣u∣ (The modulus of an integral is bounded by the integral of the modulus).

[F3]

The Lebesgue integral is complex-linear on L1, and integrable functions that agree almost everywhere have equal integrals (The Lebesgue integral is linear on L1(μ), Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree).

[F4]

The L1 transform f^(ξ)=∫Rnf(x)e−2πix⋅ξ dx is absolutely convergent at every real ξ, is unchanged by null-set modifications of the representative, and satisfies ∣f^(ξ)∣≤∥f∥1 (Fourier transform on complex L1 classes, The integral transform is representative independent).

[F5]

A nonempty compact subset K⊆Rn is bounded, so M:=sup⁡x∈K∣x∣<∞ and Sj:=sup⁡x∈K∣xj∣≤M for every j; if K≠∅ each Sj is attained on K by the extreme value theorem (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value). Only finiteness of Sj is used below.

[F6]

Complex-valued functions are measurable when their components are; pointwise sums, products, and compositions with continuous functions of the coordinates of measurable complex-valued functions are measurable, and so is the modulus (Complex Lp classes and Euclidean test-function conventions).

[F7]

A function on an open subset of C is holomorphic when it is complex differentiable at every point of its domain, and holomorphic on all of C means entire (Complex differentiability at a point, the complex derivative, holomorphic functions, and entire functions).

Proof

technique · direct
1.1givenF3F5F6

Fix a representative. If K=∅ then f=0 almost everywhere, so every integral below vanishes by [F3], giving F≡0, and all claims of the lemma hold trivially; assume K≠∅ and let M be the bound of [F5]. Multiplying f by the indicator of the closed set K produces a measurable representative in L1 that vanishes everywhere outside K and agrees with f almost everywhere, so no integral below changes ([F3, F6]); from here we use this representative.

1.2givenF1F3F5F6

Absolute convergence and representative independence. For x∈K the exponential law and modulus formula [F1] give ∣f(x)e−2πix⋅z∣=∣f(x)∣e2πx⋅Im⁡z≤∣f(x)∣e2πM∣Im⁡z∣, while for x∉K both sides vanish. Hence ∫Rn∣f(x)e−2πix⋅z∣ dx≤e2πM∣Im⁡z∣∥f∥1<∞ for the given z, and since z was arbitrary the integral defining F converges absolutely at every point of Cn. If f~=f almost everywhere is a second representative, the two integrands agree almost everywhere and are both integrable, so the two integrals agree by [F3]; thus the value is representative-independent.

2.1givenF1F6step 1.2

The slice as a one-variable integral. Fix j and complex numbers zk for k≠j, and set g(x):=f(x)e−2πi∑k≠jxkzk. Then g is measurable and ∣g(x)∣≤∣f(x)∣e2πM∣Im⁡z∣ for every x by the same bound as in step 1.2, so g∈L1; for w∈C define h(w):=∫Rng(x)e−2πixjw dx. By the addition law [F1] the integrand equals f(x)e−2πix⋅z′ with z′=(z1,…,zj−1,w,zj+1,…,zn), so h(w)=F(z′) and step 1.2 shows that the integral for h(w) converges absolutely at every w∈C.

3.1givenF1F3step 2.1

Difference quotients are integrals. Fix w∈C and s∈C∖{0}. For every x the addition law [F1] gives e−2πixj(w+s)−e−2πixjw=e−2πixjw(e−2πixjs−1), and both integrands g(x)e−2πixj(w+s) and g(x)e−2πixjw are integrable because g∈L1 and the exponential factors are bounded on the support of g by step 2.1. Applying additivity and scaling from [F3] therefore yields h(w+s)−h(w)s=∫Rng(x)e−2πixjw e−2πixjs−1s dx.

4.1F1F2F3F5step 2.1step 3.1

Uniform remainder estimate. Put S:=Sj≤M and L:=∫g(x)(−2πixj)e−2πixjw dx, which is absolutely convergent since ∣xj∣≤S on the support of g. If S=0, step 3.1 is identically zero and L=0. Otherwise, for any ε>0, [F1] gives δ>0 such that ∣(eζ−1)/ζ−1∣<ε when 0<∣ζ∣<δ. For 0<∣s∣<δ/(2πS), setting ζ=−2πixjs therefore bounds the difference between the quotient integrand and its limiting integrand by 2πSεe2πS∣Im⁡w∣∣g(x)∣ on K, with zero remainder when xj=0. By [F2] and linearity [F3], ∣h(w+s)−h(w)s−L∣≤2πSεe2πS∣Im⁡w∣∥g∥1. Since ε is arbitrary, the complex difference quotient tends to L directly, without selecting a sequence.

5.1F4F7givenstep 4.1∎

Conclusion. The limit in step 4.1 shows that h is complex differentiable at every w∈C with derivative h′(w)=∫Rng(x)(−2πixj)e−2πixjw dx; a function holomorphic on all of C is entire by definition ([F7]). Rewriting the derivative integrand gives the displayed formula for ∂F/∂zj. At real z=ξ∈Rn the defining integral of F is literally the L1 transform formula, so F(ξ)=f^(ξ) at every real ξ by [F4].

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Gaussian decay gives an entire Fourier-Laplace transform and its growth bound

Statement

Assume countable choice (The Axiom of Countable Choice (ACω)). Let n≥1, a>0, C≥0, and let f:Rn→C be measurable with ∣f(x)∣≤Ce−πa∣x∣2 for almost every x (so f∈L1). Define F(z):=∫Rnf(x)e−2πi x⋅z dx. Then the integral converges absolutely for every z∈Cn and is independent of the representative of the class; every coordinate slice of F is entire, with ∂∂zjF(z)=∫Rnf(x)(−2πixj)e−2πi x⋅z dx; F(x)=f^(x) for every x∈Rn; and ∣F(z)∣≤C a−n/2eπ∣Im⁡z∣2/a(z∈Cn).

Facts & Assumptions

Given: An integer n≥1, reals a>0 and C≥0, a measurable f:Rn→C with ∣f(x)∣≤Ce−πa∣x∣2 for almost every x, points z∈Cn and w∈C, and countable choice (The Axiom of Countable Choice (ACω)).

[F1]

Countable choice is assumed; it is the hypothesis carried by the change-of-variables corollary and by the Gaussian integral identity used below (The Axiom of Countable Choice (ACω)).

[F2]

The complex exponential is defined by its power series, satisfies exp⁡(ζ+η)=exp⁡ζexp⁡η and ∣exp⁡ζ∣=eRe⁡ζ, and is entire with exp⁡′=exp⁡, so (exp⁡ζ−1)/ζ→1 as ζ→0 through nonzero complex values (The complex exponential by its power series, exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, The complex exponential is entire and its complex derivative is itself).

[F3]

For every ζ∈C, ∣eζ−1∣≤∣ζ∣e∣ζ∣: the defining power series of The complex exponential by its power series is absolutely convergent, so the triangle inequality for series bounds ∣eζ−1∣≤∑m≥1∣ζ∣m/m!=e∣ζ∣−1≤∣ζ∣e∣ζ∣.

[F4]

If measurable complex-valued hn,h satisfy hn→h almost everywhere and ∣hn∣≤G almost everywhere for one nonnegative measurable G with ∫G<∞, then ∫hn→∫h (Dominated convergence).

[F5]

The Lebesgue integral is complex-linear on L1, and integrable functions that agree almost everywhere have equal integrals (The Lebesgue integral is linear on L1(μ), Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree).

[F6]

For nonnegative measurable functions the integral is monotone and ∫c φ=c∫φ for c>0; and ∣∫h∣≤∫∣h∣ (Monotonicity and nonnegative homogeneity of the nonnegative integral, The modulus of an integral is bounded by the integral of the modulus).

[F7]

The Gaussian Lebesgue integral and its translations: for every b>0, ∫Rne−πb∣x∣2dx=b−n/2 (Euclidean Gaussian transform with the 2π normalization at ξ=0); and for h∈L1 and c∈Rn the translation T(x)=x−c has det⁡DT=1, so ∫h(x−c) dx=∫h(y) dy (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).

[F9]

The L1 transform is f^(ξ)=∫f(x)e−2πix⋅ξdx, absolutely convergent at every real ξ (Fourier transform on complex L1 classes, The integral transform is representative independent).

[F10]

A function is holomorphic on an open subset of C when complex differentiable at every point, and holomorphic on all of C means entire (Complex differentiability at a point, the complex derivative, holomorphic functions, and entire functions).

Proof

technique · direct
1.1F5givenchoose

Fix a representative satisfying the bound. By [F5] we may modify f on the null set where ∣f(x)∣>Ce−πa∣x∣2 without changing any integral below; after this modification ∣f(x)∣≤Ce−πa∣x∣2 holds for every x, and f remains measurable.

1.2F1F6F7F8algebra

Two exact integrals. (i) For v∈Rn the algebraic identity −πa∣x∣2+2πx⋅v=π∣v∣2/a−πa∣x−v/a∣2 and the scalar rule of [F6], the translation identity of [F7] applied to y↦e−πa∣y∣2, and the Gaussian identity of [F7] give ∫Rne−πa∣x∣2+2πx⋅vdx=eπ∣v∣2/a∫Rne−πa∣x−v/a∣2dx=eπ∣v∣2/a a−n/2. (ii) For c≥0, the elementary inequality 2π∣x∣c≤πa4∣x∣2+4πac2 (from 2AB≤A2+B2 with A=πa2∣x∣ and B=2πac), together with ∣x∣e−πa∣x∣2/2≤e1/(2πa) — which follows from [F8] as ∣x∣≤e∣x∣ and s−πa2s2≤12πa for s≥0 — gives ∣x∣e−πa∣x∣2+2π∣x∣c≤e1/(2πa)e(4π/a)c2e−πa∣x∣2/4; by [F6] and [F7] (with b=a/4) this is integrable with ∫Rn∣x∣e−πa∣x∣2+2π∣x∣c dx≤(4a)n/2e1/(2πa)e(4π/a)c2<∞.

2.1F2F5F6step 1.1step 1.2

Absolute convergence, growth bound, and representative independence. Put v:=Im⁡z. The exact modulus identity in [F2] and the assumed Gaussian bound give, almost everywhere, ∣f(x)e−2πix⋅z∣=∣f(x)∣e2πx⋅v≤Ce−πa∣x∣2+2πx⋅v. Completing the square as in computation (i) of step 1.2 and applying [F6] yields ∫Rn∣f(x)e−2πix⋅z∣ dx≤C∫Rne−πa∣x∣2+2πx⋅v dx=Ca−n/2eπ∣v∣2/a<∞. Hence the integral defining F converges absolutely at the arbitrary point z, and [F6] gives the growth bound ∣F(z)∣≤Ca−n/2eπ∣Im⁡z∣2/a. If f~=f almost everywhere is another representative, the integrands agree almost everywhere; the same majorant makes both integrable, so [F5] gives equal integrals.

3.1F2givenstep 1.2step 2.1

The slice as a one-variable integral. Fix j and complex numbers zk for k≠j, and let v′ be the vector of their imaginary parts, with zero in coordinate j. Set g(x):=f(x)e−2πi∑k≠jxkzk. Then g is measurable and ∣g(x)∣≤Ce−πa∣x∣2+2πx⋅v′ almost everywhere, so g∈L1 by the completed-square calculation of step 1.2. For w∈C put h(w):=∫Rng(x)e−2πixjw dx. The addition law [F2] turns the integrand into f(x)e−2πix⋅z′ with z′=(z1,…,zj−1,w,zj+1,…,zn), so h(w)=F(z′); step 2.1 gives absolute convergence at every w.

4.1F2F5step 3.1

Difference quotients are integrals. Fix w∈C and s∈C∖{0}. For every x the addition law [F2] gives e−2πixj(w+s)−e−2πixjw=e−2πixjw(e−2πixjs−1), and both integrands are integrable by step 3.1; additivity and scaling from [F5] therefore yield h(w+s)−h(w)s=∫Rng(x)e−2πixjw e−2πixjs−1s dx.

5.1F3F4step 1.2step 3.1step 4.1

Pointwise limit and an integrable majorant. Let sn→0 be any sequence in C∖{0}. By [F2] the quotients converge pointwise to g(x)(−2πixj)e−2πixjw. By [F3], whenever ∣sn∣≤1 one has ∣(e−2πixjsn−1)/sn∣≤2π∣xj∣e2π∣xj∣. The n-th quotient integrand is therefore bounded in modulus by 2πC∣x∣e−πa∣x∣2+2π∣x∣(∣Im⁡w∣+∣v′∣+1), where v′ is from step 3.1. Its integral is finite by computation (ii) of step 1.2. Passing to the tail of the sequence, dominated convergence [F4] gives lim⁡n→∞h(w+sn)−h(w)sn=∫Rng(x)(−2πixj)e−2πixjw dx, and the limit integral is absolutely convergent by the same majorant.

6.1F9F10step 5.1∎

Conclusion. Since the nonzero null sequence sn→0 was arbitrary, step 5.1 shows that h is complex differentiable at every w∈C, with h′(w)=∫Rng(x)(−2πixj)e−2πixjw dx; being holomorphic on all of C, the slice is entire by [F10], and rewriting the derivative gives the displayed formula for ∂F/∂zj. At real z=ξ∈Rn the defining integral is literally the L1 transform formula, so F(ξ)=f^(ξ) by [F9].

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Entire rigidity under Gaussian growth and real-axis decay

Statement

Let a>0, b>0 and let F:C→C be entire. Suppose there are C1,C2≥0 with ∣F(x+iy)∣≤C1eπy2/a,∣F(x)∣≤C2e−πbx2(x,y∈R). Then: (i) if ab>1, F≡0; (ii) if ab=1, F(z)=F(0)e−πz2/a for every z∈C. All constants are absorbed into the two bounds; no further hypothesis on F is imposed.

Facts & Assumptions

Given: Reals a>0, b>0, an entire F:C→C, constants C1,C2≥0 satisfying the two displayed bounds, and C:=max⁡(C1,C2).

[F2]

Sums, scalar multiples and products of complex differentiable functions are complex differentiable with the usual rules, and a composition of complex differentiable maps is complex differentiable (Linearity, product, reciprocal, and quotient rules for complex derivatives, The chain rule for complex derivatives); holomorphy on all of C means entire (Complex differentiability at a point, the complex derivative, holomorphic functions, and entire functions).

[F3]

On the slit plane S=C∖{x∈R:x≤0} the principal logarithm is holomorphic, and for w∈C the principal power z↦zprw=exp⁡(wLog⁡z) is holomorphic on S (Complex logarithms, the principal logarithm, and principal and multivalued complex powers, The principal logarithm is the normalised holomorphic branch on the slit plane); for real s>0 one has ∣zprs∣=∣z∣s, and [0,∞)→R, t↦ts, is continuous (Real powers for positive bases, with the zero-base positive-exponent convention, Continuity and derivatives of positive-base real powers).

[F4]

Every bounded entire function is constant (Liouville's theorem: every bounded entire function is constant).

[F5]

Maximum modulus principle with boundary and infinity control: if Ω⊆C is a domain, G is holomorphic on Ω and M≥0 is such that for every ε>0 every boundary point of Ω has a neighbourhood V with ∣G∣<M+ε on V∩Ω, while ∣G∣<M+ε outside some large circle inside Ω, then ∣G∣≤M on Ω (Maximum modulus principle with boundary and infinity control).

[F6]

Every z≠0 has a polar form z=reiα with r=∣z∣>0 and α=arg⁡z (Every nonzero complex number has a unique polar form r(cos⁡θ+isin⁡θ) with r>0 and −π<θ≤π); the Cartesian field laws (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)) and [F1] give the identities Re⁡(z2)=(Re⁡z)2−(Im⁡z)2, Im⁡(z2)=∣z∣2sin⁡2α and (Re⁡z)2=∣z∣2cos⁡2α; by [F1] these give ∣e±iδz2∣=e∓δ∣z∣2sin⁡2α for real δ>0.

Proof

technique · direct

To prove the asserted cases (i) and (ii), it suffices to treat ab≥1; assume b≥1/a throughout the proof. This makes the real-axis bound for the critical function uniform on the two anchor rays used in the sector argument.

1.1F1F2F6given

The critical function. Put Φ(z):=eπz2/aF(z). The map z↦πz2/a is a polynomial, hence complex differentiable everywhere, and composing it with the entire exponential and multiplying by the entire F shows that Φ is entire ([F1, F2]). For real x and y, using ∣eπz2/a∣=eπRe⁡(z2)/a and the two hypotheses, ∣Φ(x)∣=eπx2/a∣F(x)∣≤C2e−π(b−1/a)x2≤C2,∣Φ(iy)∣=e−πy2/a∣F(iy)∣≤C1, and, since Re⁡(z2)=(Re⁡z)2−(Im⁡z)2, ∣Φ(z)∣=eπ((Re⁡z)2−(Im⁡z)2)/a∣F(z)∣≤C1eπ(Re⁡z)2/a. In particular ∣Φ(0)∣=∣F(0)∣≤C2≤C.

1.2F1F2F3F6construct

Sector data. Fix δ>0 and any θ with arctan⁡π2aδ<θ<π2; equivalently πcos⁡2θ/a<δsin⁡2θ. Fix also ε>0 small enough that (2+ε)θ<π, and put σε:=cos⁡(2+ε)θ2>0,ηε:=π2−(2+ε)θ2, defining two auxiliary functions on the sectors S1={0<arg⁡z<θ} and S2={π−θ<arg⁡z<π}, both contained in the slit plane S of [F3]: hε(z):=exp⁡ ⁣(iε eiμ zpr2+ε),qδ(z):=eiδz2  (z∈S1),qδ(z):=e−iδz2  (z∈S2), with μ:=ηε on S1 and μ:=ηε−(2+ε)(π−θ) on S2. Since zpr2+ε is holomorphic on S and exponentials and polynomials are entire, hε and qδ are holomorphic on each sector, and so is Gε:=hεqδΦ ([F1, F2, F3]). For z=reiα in the closure of either sector, ∣zpr2+ε∣=r2+ε and ∣hε(z)∣=exp⁡ ⁣(−εr2+εsin⁡(μ+(2+ε)α))≤e−εσεr2+ε≤1, because μ+(2+ε)α∈[π2−(2+ε)θ2,π2+(2+ε)θ2] for α∈[0,θ] on S1 and for α∈[π−θ,π] on S2. Also ∣qδ(z)∣=e∓δIm⁡(z2) with the sign making ∣qδ∣≤1 on the sector.

2.1F1F3F6givenstep 1.1step 1.2

Boundary bounds. On the far ray arg⁡z=θ of S1 one has Re⁡z=rcos⁡θ and, by [F6], ∣qδ(z)∣=e−δr2sin⁡2θ, so steps 1.1 and 1.2 give ∣Gε(z)∣≤∣qδ(z)∣∣Φ(z)∣≤C1exp⁡(r2(πcos⁡2θ/a−δsin⁡2θ))≤C1≤C by the choice of θ. On the far ray arg⁡z=π−θ of S2 one has Re⁡z=−rcos⁡θ and ∣qδ(z)∣=e−δr2sin⁡2θ as well, so the same computation gives ∣Gε(z)∣≤C1≤C there. On the anchor rays arg⁡z=0 and arg⁡z=π the identity [F6] gives ∣qδ(z)∣=1, and the display of step 1.2 gives ∣hε∣≤1; hence ∣Gε(z)∣≤C2≤C there, and at z=0 one has ∣Gε(0)∣=∣F(0)∣≤C.

3.1F1F3F5step 1.2step 2.1

Boundedness on the sectors. In the closure of either sector, steps 1.1 and 1.2 give ∣Gε(z)∣≤C1exp⁡(r2(πa+2δ)−εσεr2+ε)⟶0(r→∞), because cos⁡2α≤1 and ∣sin⁡2α∣≤1 on the compact angular interval; this is the control at infinity. Step 2.1 gives ∣Gε∣≤C on the boundary rays, and ∣Gε∣ is continuous on the closed sector (the principal power extends continuously from S to the closure of each sector, and ∣Gε∣ is a finite product of continuous functions), so every boundary point has a neighbourhood V with ∣Gε∣<C+ε′ on V intersected with the sector. The maximum modulus principle [F5], applied to the domains S1 and S2, therefore gives ∣Gε∣≤C on both sectors.

4.1F1step 3.1

Removing the auxiliary and the sector truncation. Fix δ>0. The perturbation hε tends to 1 pointwise as ε→0 along any sequence with (2+ε)θ<π, so step 3.1 gives ∣qδΦ∣≤C on each sector S1(θ),S2(θ) for every admissible θ∈(arctan⁡π2aδ,π2). Since θ was arbitrary in that interval and the sectors with larger θ contain those with smaller θ, while qδ does not depend on θ, taking θ→π/2 yields ∣eiδz2Φ(z)∣≤C for every z with 0<arg⁡z<π/2 and ∣e−iδz2Φ(z)∣≤C for every z with π/2<arg⁡z<π. Letting now δ↓0 along any sequence, ∣qδ(z)∣→1 at each fixed z by [F1] (the exponent iδz2→0), so ∣Φ(z)∣≤C(0<arg⁡z<π, z≠0).

5.1F2givenstep 4.1

The lower half-plane. The function Φ~(z):=Φ(−z) is entire ([F2]) and satisfies the same three estimates as Φ in step 1.1, since the bounds ∣F(−x)∣≤C2e−πbx2, ∣F(−iy)∣≤C1eπy2/a and the growth estimate only involve absolute values and (Re⁡(−z))2=(Re⁡z)2. Applying steps 1.1–4.1 to Φ~ gives ∣Φ(−z)∣≤C for 0<arg⁡z<π, that is, ∣Φ(w)∣≤C for −π<arg⁡w<0.

6.1F4givenstep 1.1step 4.1step 5.1∎

Conclusion of the critical case and of (i). By steps 4.1 and 5.1 the entire function Φ satisfies ∣Φ∣≤C off the coordinate axes, while on the axes step 1.1 gives ∣Φ(x)∣≤C2≤C and ∣Φ(iy)∣≤C1≤C directly. Hence Φ is a bounded entire function, so Φ is constant by [F4]; the constant is Φ(0)=F(0). Therefore, whenever b≥1/a, F(z)=F(0)e−πz2/a(z∈C). If ab>1 then b>1/a, so the display applies; evaluating at real x gives ∣F(0)∣e−πx2/a=∣F(x)∣≤C2e−πbx2, that is, ∣F(0)∣≤C2e−π(b−1/a)x2 for every real x, and letting x→∞ forces F(0)=0 and hence F≡0. If ab=1 then the display is assertion (ii).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Subcritical Gaussians show the Hardy threshold ab=1 is sharp

Statement

Assume countable choice. Let n≥1 and let a,b>0 with ab<1. Then (a,1/b) is a nonempty open interval, and for every c with a<c<1/b the Gaussian fc(x):=e−πc∣x∣2 satisfies ∣fc(x)∣≤e−πa∣x∣2,∣fc^(ξ)∣≤c−n/2e−πb∣ξ∣2(x,ξ∈Rn). In particular Hardy's two Gaussian bounds hold at every subcritical pair ab<1 with a nonzero function, so the vanishing and classification conclusions genuinely require ab≥1.

Facts & Assumptions

Given: Countable choice (The Axiom of Countable Choice (ACω)), an integer n≥1, reals a,b>0 with ab<1, and a real c with a<c<1/b.

[F1]

Countable choice is assumed; it is the hypothesis carried by the Gaussian transform identity used below (The Axiom of Countable Choice (ACω)).

[F2]

For every t>0, the Gaussians e−πt∣x∣2 are absolutely integrable and have L1 Fourier transform t−n/2e−π∣ξ∣2/t at every frequency; every polynomial times a positive real Gaussian is absolutely integrable (Euclidean Gaussian transform with the 2π normalization).

[F3]

The real exponential is strictly increasing on R (The exponential function is strictly increasing); the real power cs of a positive base is a positive real number, and s↦cs, t↦ts are continuous on their domains (Real powers for positive bases, with the zero-base positive-exponent convention, Continuity and derivatives of positive-base real powers).

Proof

technique · direct
1.1F3given

The interval and the first bound. Since b>0, the inequality ab<1 is equivalent to a<1/b, so (a,1/b) is a nonempty open interval and the given c satisfies c>a>0. The function fc is continuous and hence measurable, with fc>0 and fc(0)=1. For every x∈Rn one has −πc∣x∣2≤−πa∣x∣2 because c≥a, and the real exponential is strictly increasing [F3], so 0<fc(x)=e−πc∣x∣2≤e−πa∣x∣2. Hence ∣fc(x)∣≤e−πa∣x∣2 for every x, and fc≠0.

2.1F1F2F3step 1.1

The transform and the second bound. By [F2] the Gaussian fc is absolutely integrable and its L1 Fourier transform is fc^(ξ)=c−n/2e−π∣ξ∣2/c for every ξ∈Rn; this is a positive real number. Since c<1/b gives b<1/c, one has −π∣ξ∣2/c≤−πb∣ξ∣2, and strict increase of the exponential [F3] gives e−π∣ξ∣2/c≤e−πb∣ξ∣2. The factor c−n/2 is positive by [F3]. Therefore ∣fc^(ξ)∣=c−n/2e−π∣ξ∣2/c≤c−n/2e−πb∣ξ∣2 for every ξ.

3.1givenstep 1.1step 2.1∎

Conclusion. By steps 1.1 and 2.1 the nonzero Gaussian fc satisfies both Gaussian bounds of the subcritical pair (a,b) whenever a<c<1/b, and such c exists at every pair with ab<1. Hence at every subcritical pair the two Gaussian hypotheses admit a nonzero solution, so the vanishing conclusion cannot hold below that threshold. Nor can the critical classification with rate a hold: fc(x)/e−πa∣x∣2=e−π(c−a)∣x∣2 equals 1 at 0 and is smaller at x=(1,0,…,0), so is nonconstant. By continuity it cannot be constant almost everywhere either.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Separately holomorphic functions vanishing on a real box are zero

Statement

Let n≥1 and let G:Cn→C be separately holomorphic: for every j and every fixed w∈Cn, the one-variable map z↦G(w1,…,wj−1,z,wj+1,…,wn) is entire on C. If there are nondegenerate intervals I1,…,In⊆R with G=0 on I1×⋯×In, then G≡0 on Cn.

Facts & Assumptions

Given: An integer n≥1, a separately holomorphic G:Cn→C, and nondegenerate intervals I1,…,In (that is, each Ij contains a nonempty open subinterval, so it has more than one point) with G=0 on I1×⋯×In.

[F1]

Identity theorem: if two functions holomorphic on a complex domain Ω⊆C agree on a set having an accumulation point in Ω, then they agree on Ω (Identity theorem for holomorphic functions).

[F2]

A function is entire when it is complex differentiable on all of C, that is, holomorphic on the domain C; a separately holomorphic G has every one-variable slice entire by hypothesis (Complex differentiability at a point, the complex derivative, holomorphic functions, and entire functions).

[F3]

If J⊆R has nonempty interior and p lies in that interior, then p is an accumulation point of J in C: some open ball (p−ε,p+ε) is contained in J, and for every neighbourhood radius r>0, p+min⁡(ε,r)/2 is a point of J different from p within that neighbourhood. Every coordinate slice of a separately holomorphic function is determined by the values it takes on such a set.

Proof

technique · induction on $n$
1.1baseF1F2F3given

Base case n=1. Here G is an entire function of one variable and vanishes on the nondegenerate interval I1. Choose p in the interior of I1; by [F3], p is an accumulation point in C of the set where G and the zero function agree, and both are entire [F2]. The identity theorem [F1] on the domain C gives G≡0.

1.2ihgivenchoose

Inductive hypothesis and setup. Assume n≥2 and that the assertion holds for n−1 variables. Choose p∈int⁡I1, which is possible because I1 is nondegenerate, and fix an arbitrary z′∈Cn−1; it remains to show G(p,z′)=0.

2.1F2givenstep 1.2

The slice in the last n−1 variables. The map z′↦G(p,z′) on Cn−1 is separately holomorphic, because each of its one-variable slices is a slice of G with all other coordinates fixed, hence entire by [F2]. It vanishes on the box I2×⋯×In, whose factors are nondegenerate, so the induction hypothesis of step 1.2 applies and gives G(p,z′)=0.

3.1step 2.1

Vanishing on a slab. The point p∈int⁡I1 in step 1.2 was chosen arbitrarily in the interior, so step 2.1 gives G=0 on int⁡I1×Cn−1.

4.1F1F2F3step 1.2step 3.1

The slice in the first variable. For the fixed z′ of step 1.2, the one-variable map w↦G(w,z′) is entire by [F2] and vanishes on the nondegenerate interval int⁡I1 by step 3.1. Its zero set therefore has the accumulation point p of [F3] inside the domain C, and [F1] gives G(w,z′)=0 for every w∈C.

5.1step 1.2step 4.1discharge-induction∎

Conclusion. Since z′∈Cn−1 was arbitrary in step 1.2, step 4.1 gives G≡0 on Cn, which discharges the induction step and completes the induction.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The support-measure uncertainty inequality ∣E∣∣F∣≥1

Statement

Assume countable choice. Let f∈L2(Rn;C) be nonzero and let E,F⊆Rn be Lebesgue measurable sets of finite measure such that f=0 almost everywhere on Rn∖E and f^=0 almost everywhere on Rn∖F. Here f^ denotes the continuous L1 transform (The integral transform is representative independent), which is defined because ∣E∣<∞ forces f∈L1. Then ∣E∣ ∣F∣≥1. No regularity of E or F beyond measurability and finite measure is assumed, and no complex analysis is used.

Facts & Assumptions

Given: Countable choice (The Axiom of Countable Choice (ACω)), a nonzero f∈L2(Rn;C), and Lebesgue measurable sets E,F of finite measure with f=0 almost everywhere off E and f^=0 almost everywhere off F.

[F1]

Countable choice is assumed; it is the hypothesis carried by the L1 transform interface, the agreement theorem, and Plancherel below (The Axiom of Countable Choice (ACω)).

[F2]

For g∈L1(Rn;C) the L1 transform is defined at every frequency, satisfies ∣g^(ξ)∣≤∥g∥1, and is unchanged by null-set modifications of the representative (The integral transform is representative independent); it is continuous and vanishes at infinity (Riemann–Lebesgue lemma).

[F3]

Hölder's inequality with conjugate exponents p=q=2: for measurable real u∈L2 and v∈L2 one has ∫∣uv∣≤∥u∥2∥v∥2 (Holder's inequality for integrals, including the endpoint cases); L1 and L2 are the quotient spaces of The space Lp(μ) as the quotient by null functions with the norms of Complex Lp classes and Euclidean test-function conventions, and integrable functions that agree almost everywhere have equal integrals (Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree).

[F4]

If g∈L1∩L2, its bounded continuous L1 transform represents the Plancherel transform F2g almost everywhere (Agreement of the integral and L2 transforms), and Plancherel gives ∥F2g∥2=∥g∥2 (Plancherel theorem).

Proof

technique · direct
1.1F1F2F3given

The function is integrable and its transform is bounded. Since f=0 almost everywhere on Rn∖E, one has ∫Rn∣f∣=∫E∣f∣; applying [F3] with u=∣f∣ and v=1E, whose L2 norm is ∣E∣1/2<∞, gives ∫E∣f∣≤∥f∥2∣E∣1/2<∞. Hence f∈L1∩L2, its L1 transform f^ is defined and continuous [F2], and ∣f^(ξ)∣≤∥f∥1≤∣E∣1/2∥f∥2 for every ξ∈Rn.

2.1F4givenstep 1.1

Plancherel size from the two supports. As f∈L1∩L2, the continuous transform f^ represents F2f almost everywhere [F4]; since f^=0 almost everywhere off F, also F2f=0 almost everywhere off F. Therefore F2f is represented by the function that vanishes off F and equals f^ on F, and ∫Rn∣F2f∣2=∫F∣f^∣2≤∣F∣ sup⁡ξ∈Rn∣f^(ξ)∣2≤∣E∣ ∣F∣ ∥f∥22, where the last inequality inserts the uniform bound of step 1.1 and ∣F∣<∞ is used.

3.1F4givenstep 2.1∎

Conclusion. Plancherel's isometry [F4] gives ∥F2f∥22=∥f∥22, so step 2.1 yields ∥f∥22≤∣E∣∣F∣∥f∥22. Since f is nonzero, ∥f∥22>0, and dividing gives ∣E∣∣F∣≥1.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The n-dimensional Heisenberg uncertainty inequality

Statement

Assume Countable Choice. Let n≥1 and let f∈H1(Rn;C) satisfy xf∈L2(Rn;Cn). Write f^=F2f for its Plancherel transform. Then ∥∣x∣f∥2 ∥∣ξ∣f^∥2≥n4π∥f∥22. The Fourier characterization of H1 makes this exactly the domain where both spatial and Plancherel-frequency second moments are finite. For f=0 both sides vanish. Equality cases on this full domain are not decided here; the published sharp equality theorem is stated for Schwartz functions.

Facts & Assumptions

Given: Countable Choice, n≥1, f∈H1(Rn;C) with xf∈L2(Rn;Cn), its weak derivatives Djf, and its Plancherel transform f^=F2f.

[A1]

Countable Choice is the hypothesis carried by the Sobolev, multiplier, and Plancherel interfaces below (The Axiom of Countable Choice (ACω)).

[F1]

The integer-order Fourier characterization identifies H1 with W1,2 and hence supplies every Djf∈L2 (Integer-order W^{k,2} and H^k agree with equivalent norms).

[F2]

For a weak derivative in L2, F2(Djf)(ξ)=2πiξjF2f(ξ) almost everywhere (Distributional derivatives are polynomial Fourier multipliers).

[F3]

Plancherel is a complex-linear isometry on L2 (Plancherel theorem).

[F4]

Cauchy–Schwarz for finite tuples in complex L2 gives ∑j=1najbj≤(∑jaj2)1/2(∑jbj2)1/2 for nonnegative real aj,bj (Complex completeness, density, and inner product: the consumer interface).

[F5]

The coordinate estimate ∥xjf∥2∥Djf∥2≥12∥f∥22 holds on this H1-with-finite-spatial-moment domain (The coordinate inequality ∥xjf∥2∥Djf∥2≥12∥f∥22).

Proof

technique · convert the coordinate estimate by Plancherel, sum, and apply finite-dimensional Cauchy–Schwarz
1.1A1F1F2F3F5given

Fix j∈{1,…,n}. By [F1] the weak derivative Djf is in L2, and by [F2]–[F3] ∥Djf∥2=∥F2(Djf)∥2=2π∥ξjf^∥2. Applying the coordinate estimate [F5] and dividing by 2π yields ∥xjf∥2 ∥ξjf^∥2≥14π∥f∥22.

2.1F4step 1.1∎

Summing the inequalities of step 1.1 gives ∑j=1n∥xjf∥2 ∥ξjf^∥2≥n4π∥f∥22. By [F4] the left side is at most (∑j∥xjf∥22)1/2(∑j∥ξjf^∥22)1/2=∥∣x∣f∥2 ∥∣ξ∣f^∥2, where the equalities follow by summing the coordinate integrals. This proves the asserted inequality, including n=1.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Centring by translation and modulation preserves the variance product

Statement

Assume countable choice. Let f∈L2(Rn;C) be nonzero with finite second moments, spatial mean a, frequency mean b, and variances Vx(f),Vξ(f) as in Spatial and frequency centres and variances of an L2 function with finite second moments (Translation of a function on Rn). Define g(x):=e−2πi b⋅xf(x+a). Then g∈L2 is nonzero with finite second moments, its spatial mean is 0 and its frequency mean is 0, and for every j ∥xjg∥2=∥(xj−aj)f∥2,∥ξjg^∥2=∥(ξj−bj)f^∥2. Consequently Vx(g)=Vx(f), Vξ(g)=Vξ(f), and Vx(g)Vξ(g)=Vx(f)Vξ(f).

Facts & Assumptions

Given: Countable choice (The Axiom of Countable Choice (ACω)), a nonzero f∈L2(Rn;C) with finite second moments and means and variances a,b,Vx(f),Vξ(f) as in Spatial and frequency centres and variances of an L2 function with finite second moments, and g(x)=e−2πib⋅xf(x+a).

[F1]

Countable choice is assumed; it is used by the change-of-variables interface and to select the L2-approximating sequence in step 2.2 (The Axiom of Countable Choice (ACω)).

[F2]

Complex L1 change of variables: for a C1 diffeomorphism T with absolute Jacobian determinant ∣det⁡DT∣ and h∈L1, ∫h(Tx)∣det⁡DT(x)∣dx=∫h(y)dy; the affine maps x↦x+a and ξ↦ξ+b have determinant 1 (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions). Complex L2 carries the norm ∥⋅∥2 of Complex completeness, density, and inner product: the consumer interface.

[F3]

Translation and modulation: with τaf(x)=f(x−a) and Mbf(x)=e2πib⋅xf(x), for f∈S one has τaf^(ξ)=e−2πia⋅ξf^(ξ) and Mbf^(ξ)=f^(ξ−b) at every frequency (Translation, modulation, linear dilation and reflection laws, Translation of a function on Rn).

[F4]

Schwartz functions lie in L1∩L2; Schwartz space is dense in L2, the integral Fourier transform of any L1∩L2 function represents its Plancherel transform almost everywhere, and Plancherel is an isometry (Schwartz derivatives are integrable, Schwartz space is dense in L2, Agreement of the integral and L2 transforms, Plancherel theorem).

[F5]

Integrable functions that agree almost everywhere have equal integrals (Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree).

Proof

technique · direct
1.1F2given

The centred function is admissible on the spatial side. Translation preserves null equivalence and the L2 norm by [F2], while modulation has unit modulus, so g∈L2 and ∥g∥2=∥f∥2>0. Substituting y=x+a gives ∫∣x∣2∣g(x)∣2dx=∫∣y−a∣2∣f(y)∣2dy≤2∫∣y∣2∣f(y)∣2dy+2∣a∣2∥f∥22<∞. Also ∫∣xj∣∣g(x)∣2dx<∞ by Cauchy--Schwarz from g,xjg∈L2. Thus the spatial mean and variance of g are defined; frequency-side finiteness is established in the frequency computation below.

2.1F2givenstep 1.1

Spatial side. Substituting y=x+a and using ∣g(x)∣2=∣f(x+a)∣2 [F2] gives, for each j, ∫xj∣g(x)∣2dx=∫yj∣f(y)∣2dy−aj∫∣f(y)∣2dy=∥f∥22aj−∥f∥22aj=0,∫xj2∣g(x)∣2dx=∫(yj−aj)2∣f(y)∣2dy. Hence the spatial mean of g is 0, ∥xjg∥2=∥(xj−aj)f∥2, and Vx(g)=∥g∥2−2∫∣x∣2∣g∣2=∥f∥2−2∫∣y−a∣2∣f(y)∣2dy=Vx(f).

2.2F1F2F3F4F5givenstep 1.1

Frequency side. Choose fk∈S with fk→f in L2, using [F4] and countable choice [F1], and set gk=M−b(τ−afk). By [F4], fk∈L1∩L2; [F2] shows translation and modulation preserve both spaces and their norms, so gk∈L1∩L2. Translation and modulation preserve L2 distances, hence gk→g in L2; Plancherel gives F2fk→F2f and F2gk→F2g. By [F3], for each k the integral transforms satisfy g^k(ξ)=e2πia⋅(ξ+b)f^k(ξ+b), and [F4] identifies these transforms with their Plancherel classes. Translation and multiplication by this unit-modulus phase are isometries on L2 by [F2], so passing to the norm limits proves the Plancherel-class identity g^(ξ)=e2πia⋅(ξ+b)f^(ξ+b) almost everywhere. First, the affine change of variables η=ξ+b gives ∫∣ξ∣2∣g^(ξ)∣2dξ=∫∣η−b∣2∣f^(η)∣2dη<∞, so the first moments are absolutely integrable by Cauchy--Schwarz. Using [F5] for representatives, the same substitution now yields ∫ξj∣g^(ξ)∣2dξ=∫(ηj−bj)∣f^(η)∣2dη=∥f∥22bj−∥f∥22bj=0,∫ξj2∣g^(ξ)∣2dξ=∫(ηj−bj)2∣f^(η)∣2dη. Thus g has finite frequency second moments and mean 0, ∥ξjg^∥2=∥(ξj−bj)f^∥2, and Vξ(g)=∥g^∥2−2∫∣ξ∣2∣g^∣2=∥f^∥2−2∫∣η−b∣2∣f^(η)∣2dη=Vξ(f); Plancherel and the unitary covariance give ∥g^∥2=∥g∥2=∥f∥2=∥f^∥2.

3.1step 2.1step 2.2∎

Conclusion. Steps 2.1 and 2.2 give Vx(g)=Vx(f), Vξ(g)=Vξ(f) and hence Vx(g)Vξ(g)=Vx(f)Vξ(f), and both centred means vanish.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Hardy's Gaussian uncertainty principle in Rn

Statement

Assume countable choice. Let n≥1 and a,b,C>0 and let f:Rn→C be measurable with ∣f(x)∣≤Ce−πa∣x∣2 for almost every x; then f∈L1 and f^ is its continuous L1 transform (Fourier transform on complex L1 classes). Suppose ∣f^(ξ)∣≤Ce−πb∣ξ∣2 for every ξ∈Rn. Then: (i) if ab>1, f=0 almost everywhere; (ii) if ab=1, there is c∈C with f(x)=ce−πa∣x∣2 for almost every x; necessarily c=f^(0) an/2 with f^(0)=∫f. Equality in (ii) is asserted almost everywhere only; no continuity of f is assumed.

Facts & Assumptions

Given: Countable choice (The Axiom of Countable Choice (ACω)), reals a,b,C>0, and a measurable f:Rn→C with ∣f(x)∣≤Ce−πa∣x∣2 for almost every x and ∣f^(ξ)∣≤Ce−πb∣ξ∣2 for every ξ∈Rn.

[F1]

Countable choice is assumed; it is the hypothesis carried by the entire continuation, the Gaussian transform and the uniqueness theorem below (The Axiom of Countable Choice (ACω)).

[F2]

Gaussian decay gives an entire continuation: f∈L1, F(z):=∫Rnf(x)e−2πi x⋅zdx converges absolutely for every z∈Cn, has entire coordinate slices, satisfies F(x)=f^(x) for real x, and ∣F(z)∣≤Ca−n/2eπ∣Im⁡z∣2/a for every z∈Cn (Gaussian decay gives an entire Fourier-Laplace transform and its growth bound).

[F3]

One-variable rigidity: if a,b>0, C1,C2≥0 and the entire φ:C→C satisfies ∣φ(x+iy)∣≤C1eπy2/a and ∣φ(x)∣≤C2e−πbx2 for all real x,y, then φ≡0 when ab>1, and φ(z)=φ(0)e−πz2/a for all z∈C when ab=1 (Entire rigidity under Gaussian growth and real-axis decay).

[F4]

A separately holomorphic G:Cn→C vanishing on a nondegenerate real box is identically zero (Separately holomorphic functions vanishing on a real box are zero).

[F5]

For every t>0 the Gaussian e−πt∣x∣2 is absolutely integrable with L1 transform t−n/2e−π∣ξ∣2/t (Euclidean Gaussian transform with the 2π normalization).

[F6]

The L1 transform is defined by g^(ξ)=∫g(x)e−2πix⋅ξdx, so g^(0)=∫g; if g,h∈L1 have equal transforms then g=h almost everywhere; a scalar multiple has the correspondingly scaled transform (Fourier transform on complex L1 classes, Uniqueness of the L1 Fourier transform).

Proof

technique · apply one-variable rigidity on coordinate slices, then iterate the critical factors
1.1F1F2given

Entire continuation. By [F1, F2], f∈L1 and its continuation F has entire coordinate slices, F(x)=f^(x) for real x, and ∣F(z)∣≤Ca−n/2eπ∣Im⁡z∣2/a,∣F(x)∣≤Ce−πb∣x∣2.

2.1F3step 1.1

Coordinate rigidity. Fix j and real coordinates yk for k≠j. The entire slice φ(w)=F(y1,…,yj−1,w,yj+1,…,yn) satisfies ∣φ(u+iv)∣≤Ca−n/2eπv2/a,∣φ(u)∣≤Ce−πb∑k≠jyk2e−πbu2. Thus [F3] applies with C1=Ca−n/2 and C2=Ce−πb∑k≠jyk2. If ab>1, every such slice is zero, so F=0 on Rn. If ab=1, every such slice satisfies φ(w)=φ(0)e−πw2/a.

3.1F4step 2.1

Critical factorization. If ab=1, apply the slice identity in step 2.1 successively to coordinates 1,…,n of a real point x, leaving the other coordinates real at each application. This gives F(x)=F(0)∏j=1ne−πxj2/a=F(0)e−π∣x∣2/a. In fact the same formula holds for complex z: the difference F(z)−F(0)e−π∑jzj2/a has entire coordinate slices and vanishes on [0,1]n, so [F4] makes it identically zero. This includes n=1.

4.1F2F5F6step 2.1step 3.1∎

Fourier uniqueness and the constant. If ab>1, step 2.1 gives f^=0 and [F6] yields f=0 almost everywhere. If ab=1, [F5] says g(x)=F(0)an/2e−πa∣x∣2 is integrable with transform F(0)e−π∣ξ∣2/a, equal to f^ by step 3.1. By [F6], f=g almost everywhere. Hence the scalar is c=F(0)an/2=f^(0)an/2, and f^(0)=∫f.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

A nonzero L1 function and its transform cannot both have compact support

Statement

Assume countable choice, used through the L1 uniqueness theorem. Let f∈L1(Rn;C) and let K1,K2⊆Rn be compact sets such that f=0 almost everywhere on Rn∖K1 and f∧=0 on Rn∖K2, where f∧ is the continuous L1 transform (Fourier transform on complex L1 classes). Then f=0 almost everywhere. In particular, if f is nonzero and L1 with compact support, its transform cannot have compact support.

Facts & Assumptions

Given: Countable choice (The Axiom of Countable Choice (ACω)), a function f∈L1(Rn;C), compact sets K1,K2⊆Rn with f=0 almost everywhere on Rn∖K1 and f^=0 on Rn∖K2.

[F1]

Countable choice is assumed; it is the hypothesis carried by the L1 uniqueness theorem below (The Axiom of Countable Choice (ACω)).

[F2]

Compact support gives an entire continuation: F(z):=∫Rnf(x)e−2πi x⋅zdx converges absolutely at every z∈Cn, has entire coordinate slices, and satisfies F(x)=f^(x) for every real x (Compact support gives an entire Fourier-Laplace transform by slices).

[F3]

A separately holomorphic map on Cn that vanishes on a nondegenerate real box I1×⋯×In is identically zero (Separately holomorphic functions vanishing on a real box are zero).

[F4]

If g,h∈L1(Rn;C) have equal L1 transforms, then g=h almost everywhere (Uniqueness of the L1 Fourier transform).

[F5]

A subset of Rn is compact if and only if it is closed and bounded; in particular compact subsets are closed (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line). Consequently a nonempty open set U⊆Rn contains a nondegenerate box: if ξ∈U and the ball of radius ε>0 around ξ lies in U, then ∏j=1n[ξj−ε/(2n),ξj+ε/(2n)]⊆U, since every point of this box is at Euclidean distance at most ε/2 from ξ.

Proof

technique · direct
1.1F2given

The entire continuation of f. By [F2] there is a function F:Cn→C with entire coordinate slices and F(x)=f^(x) for every real x; hence F is separately holomorphic and vanishes wherever f^ does.

1.2F5givenchoose

A box outside the compact frequency support. Since K2 is bounded by [F5] and n≥1, choose R>0 such that K2⊆{∣x∣≤R} and take ξ=(R+1,0,…,0)∉K2. Since K2 is closed, its complement is a nonempty open set; [F5] supplies a nondegenerate real box there. The argument also applies when K2 is empty.

2.1F3givenstep 1.1step 1.2

Vanishing of the continuation. On the box from step 1.2, f^=0 by hypothesis and F=f^ by step 1.1. Thus the separately holomorphic function F vanishes on a nondegenerate real box. By [F3], F≡0 on Cn, so f^≡0 on Rn.

3.1F1F4step 2.1∎

Return to the original function. The L1 functions f and 0 now have equal transforms, so [F1, F4] gives f=0 almost everywhere. Consequently a nonzero compactly supported L1 function cannot also have compactly supported transform.

RemarkRemark: Literature-sourcedProof: Not suppliedjudge pass (gpt-6.1-sol)Open item page →

The sharp Heisenberg theorem is owned by functional analysis

Remarks

Assume countable choice, as does the cited theorem. The sharp Heisenberg uncertainty inequality and its equality classification are owned by functional analysis: the published theorem Heisenberg uncertainty and Gaussian equality of the functional-analysis track states that for f∈S(Rn) and a,b∈Rn ∥∣x−a∣f∥2 ∥∣ξ−b∣f^∥2≥n4π∥f∥22, with equality for nonzero f exactly for f(x)=cexp⁡(−λ∣x−a∣2/2)exp⁡(2πib⋅x), c≠0, λ>0. Both this inequality and its sharp equality classification are quoted here only on the Schwartz domain of the published source. Under this library's e−2πix⋅ξ convention its coordinate form on that domain is ∥xjf∥2∥ξjf^∥2≥(4π)−1∥f∥22.

This page does not extend the source's equality classification beyond Schwartz functions. Separately, the local cutoff argument in The coordinate inequality ∥xjf∥2∥Djf∥2≥12∥f∥22 supplies the coordinate real-variable inequality on the natural H1 domain with xf∈L2, Centring by translation and modulation preserves the variance product centres the variance formulation, and The n-dimensional Heisenberg uncertainty inequality records the summed n-dimensional inequality on that same domain. Gaussian attainment in this convention is checked in The Gaussian attains equality in the Heisenberg inequality ↗.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Proof cost and complex-analysis interface for Hardy uncertainty

Remarks

The complex-analysis cost of Hardy's Gaussian uncertainty principle in Rn is the one-variable rigidity in Entire rigidity under Gaussian growth and real-axis decay. For the critical function Φ(z)=eπz2/aF(z), that lemma first bounds qδΦ on two sectors of aperture θ<π/2, with qδ=eiδz2 on the first and qδ=e−iδz2 on the second. It then uses hε(z)=exp⁡(iεeiμzpr2+ε), with the sector-dependent phase μ specified in its step 1.2, so that ∣hε(z)∣≤e−εσε∣z∣2+ε uniformly in angle. Boundary and infinity control give the sector bound; removing the perturbations and applying Liouville gives critical rigidity. Coordinate slices then yield the higher-dimensional theorem.

The estimate ∣F(x+iy)∣≤C1eπy2/a comes from the spatial Gaussian bound; the critical decay is e−πx2/a. Tao's real-variable proof in the cited post proves a weaker, non-sharp threshold ab>C0. This describes that particular proof, not a limitation of all real-variable methods: the cited survey, §1, printed p. 2, also records a complete sharp real-variable proof.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Finite support-product uncertainty for the unitary DFT

Statement

Let N≥1, let f∈CZ/NZ be nonzero and let FN be the unitary discrete Fourier transform of The unitary discrete Fourier transform on Z/NZ. Writing supp⁡f:={x:f(x)≠0} and supp⁡FNf:={k:(FNf)(k)≠0}, ∣supp⁡f∣⋅∣supp⁡FNf∣≥N. At N=1 the bound is equality for every nonzero f. No convergence or regularity hypothesis is involved.

Facts & Assumptions

Given: An integer N≥1 and a nonzero f∈CZ/NZ, with S:=supp⁡f, T:=supp⁡FNf, the counting inner product ⟨g,h⟩=∑x∈Z/Ng(x)h(x)‾ and norm ∥g∥22=∑x∣g(x)∣2 of The counting inner product on CZ/NZ, and the unitary transform (FNg)(k)=N−1/2∑x=0N−1g([x]N)e−2πikx/N of The unitary discrete Fourier transform on Z/NZ (The congruence class [a]n and the quotient set Z/n).

[F1]

Finite sums in a commutative monoid are order-independent and linear with respect to scalar multiplication, and satisfy the triangle inequality ∣∑jzj∣≤∑j∣zj∣; the standard rules for real finite sums hold (A finite sum in a commutative monoid indexed by an arbitrary finite set, Laws of finite sums and finite products). The complex triangle inequality follows by induction on the number of summands from ∣z+w∣≤∣z∣+∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F2]

Cauchy–Schwarz for the counting inner product: ∣⟨g,h⟩∣≤∥g∥2∥h∥2 (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors, The counting inner product on CZ/NZ), where ∥g∥22=⟨g,g⟩=∑x∣g(x)∣2.

[F3]

Finite Parseval: ⟨FNg,FNh⟩=⟨g,h⟩ for all g,h; in particular ∥FNg∥2=∥g∥2 (Finite Parseval and Plancherel identity for the unitary DFT).

Proof

technique · direct
1.1F3F4given

The two supports. Since f≠0 there is a class with f(x)≠0, so S≠∅ and ∥f∥22=∑x∣f(x)∣2>0 by [F4]. Applying [F3] with g=h=f and restricting the sum over all classes to the support T, ∑k∈T∣(FNf)(k)∣2=∥FNf∥22=∥f∥22>0, so T≠∅ as well.

1.2F1F2given

Pointwise bound on the support of the transform. For k∈T, the triangle inequality and the normalisation N−1/2 of the transform give ∣(FNf)(k)∣≤N−1/2∑x∈S∣f(x)∣, the sum running only over S because the remaining summands vanish. Cauchy–Schwarz [F2] applied on Z/NZ to u(x)=∣f(x)∣ and v(x)=1S(x) gives ∑x∈S∣f(x)∣=⟨u,v⟩≤∥u∥2∥v∥2=∣S∣1/2∥f∥2. Hence ∣(FNf)(k)∣≤N−1/2∣S∣1/2∥f∥2 for every k∈T.

2.1F1F3step 1.1step 1.2

Summing over the support. Squaring the bound of step 1.2 and summing over the ∣T∣ classes of T gives ∥FNf∥22=∑k∈T∣(FNf)(k)∣2≤∣T∣ N−1∣S∣ ∥f∥22. By Parseval [F3] the left side is ∥f∥22, and step 1.1 gives ∥f∥22>0, so dividing yields ∣S∣ ∣T∣≥N.

3.1step 2.1given∎

The case N=1 and conclusion. If N=1 the group Z/1Z has the single class [0], N−1/2=1 and e−2πi⋅0⋅0=1, so (FNf)([0])=f([0]); hence T=S={[0]} for nonzero f and ∣S∣∣T∣=1=N, an equality. Together with step 2.1 this proves the claim for every N≥1.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

Uncertainty principles measure different notions of localisation

Remarks

Three inequivalent notions of localisation are in play on this page and their hypotheses and conclusions are not interchangeable: the variance pair (Vx,Vξ) of Spatial and frequency centres and variances of an L2 function with finite second moments with the product bound The n-dimensional Heisenberg uncertainty inequality; support measure with the product bound The support-measure uncertainty inequality ∣E∣∣F∣≥1 and the compact-support dichotomy; and Gaussian decay with the Hardy threshold Hardy's Gaussian uncertainty principle in Rn, whose critical rigidity is isolated in Entire rigidity under Gaussian growth and real-axis decay. Gaussian decay implies finite second moments in both domains, but need not give compact support. Finite variance is not compact support — the Gaussian of Finite variance is not compact support ↗ has finite variances in both domains and full support — while Gaussian decay and its critical rigidity remain a stronger, distinct formulation. The finite product bound Finite support-product uncertainty for the unitary DFT is not the Heisenberg product: its right side is N, not (4π)−1, and its equality set is different. No implication among these statements is asserted beyond the ones proved on this page.

5 · Examples, counterexamples and false statements

None yet.

Sources