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.

✓ 5 results · all verified · 5 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; all 5 also cleared it.

Uncertainty Principles for Fourier Analysis — Examples

1 · Prerequisites

2 · Summary

These examples execute the three localisation principles of the companion page at explicit parameters and separate their hypothesis classes. The Gaussian e−πa∣x∣2 is the running example: it attains equality in the summed Heisenberg inequality, with spatial variance n/(4πa) and frequency variance na/(4π) whose product is exactly (n/4π)2, so every constant in the library's e−2πix⋅ξ convention is checked rather than quoted. The counterexample on the same function shows that finite variance is not compact support: the Gaussian and its transform are strictly positive everywhere, so neither vanishes off a set of finite measure, and the support-measure hypothesis of the companion theorem cannot be deduced from the variance hypotheses.

For Hardy's theorem the three parameter regimes are tabulated. At the critical product ab=1 the Gaussian e−πa∣x∣2 satisfies both Gaussian bounds and the theorem classifies it as a scalar multiple of itself; in the subcritical regime ab<1 the interval (a,1/b) supplies a nonzero Gaussian satisfying both bounds, so no vanishing conclusion holds; in the supercritical regime ab>1 the two bounds force c≥a and c≤1/b on any Gaussian witness, which is impossible, matching the theorem's conclusion that f=0 almost everywhere.

The finite discrete Fourier transform is treated separately, because its product bound is not the Heisenberg product. The delta and the constant function are evaluated explicitly as two examples of extremisers of the support-product bound at every length N, with the two identities coinciding at N=1, and the last witness shows that both supports cannot be singletons when N>1: the support-product bound would give 1≥N. The boundary case N=1, where the delta is the constant function and the configuration does occur, is included to show that the hypothesis N>1 is essential.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Finite variance is not compact support

Statement refuted

Assume countable choice. Every nonzero f∈L2(Rn;C) with finite second moments in both domains vanishes almost everywhere outside a compact set, and so does f^; equivalently, finite variance forces compact support.

Facts & Assumptions

Given: Countable choice, an integer n≥1, a real a>0, and the Gaussian f(x)=e−πa∣x∣2.

[F1]

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

[F2]

For every t>0 the Gaussian e−πt∣x∣2 is absolutely integrable with ∫Rne−πt∣x∣2dx=t−n/2 and L1 Fourier transform t−n/2e−π∣ξ∣2/t (Euclidean Gaussian transform with the 2π normalization); every polynomial times a positive real Gaussian is absolutely integrable. For L1∩L2 functions this integral transform represents the Plancherel transform (Agreement of the integral and L2 transforms); the one-dimensional Gaussian integral is ∫Re−s2ds=π (The Gaussian integral ∫−∞∞e−x2 dx=π).

[F3]

Complex L1 change of variables: for the reflection T(x)=−x, which is a C1 diffeomorphism with ∣det⁡DT∣=1, one has ∫h(−x)dx=∫h(y)dy (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).

[F4]

Means and variances for a nonzero L2 function with finite second moments are as in Spatial and frequency centres and variances of an L2 function with finite second moments; the support-measure hypothesis that is not satisfied here is the one of The support-measure uncertainty inequality ∣E∣∣F∣≥1.

[F5]

Compact subsets of Rn are bounded (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), and every box has its product-of-side-lengths Lebesgue measure under Countable Choice (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included). Thus a compact set is contained in a finite-measure cube, whereas Rn has infinite measure since it contains cubes [−R,R]n of measure (2R)n for all R>0.

Counterexample

technique · direct
1.1F1F2given

The Gaussian and its transform are strictly positive and integrable. f(x)=e−πa∣x∣2>0 for every x, f is continuous and even, and by [F2] with t=2a, ∥f∥22=∫Rnf2=(2a)−n/2<∞, so f∈L1∩L2 and [F2] identifies its integral and Plancherel transforms, with f^(ξ)=a−n/2e−π∣ξ∣2/a>0 for every ξ∈Rn.

2.1F2F3F4givenstep 1.1

Finite second moments and vanishing means. By [F2] with t=2a one has ∥f∥22=(2a)−n/2<∞, and since ∣f^(ξ)∣2=a−ne−2π∣ξ∣2/a, [F2] with t=2/a gives ∥f^∥22=(2a)−n/2<∞ as well. By [F2], ∣x∣2e−2πa∣x∣2 and ∣ξ∣2a−ne−2π∣ξ∣2/a are integrable polynomial multiples of positive Gaussians. Thus both second moments are finite. The functions x↦xj∣f(x)∣2 and ξ↦ξj∣f^(ξ)∣2 are odd in their j-th coordinate while f and f^ are even, so [F3] applied to the reflection T(x)=−x shows that each of these integrals equals its own negative and hence vanishes; consequently both means are 0 and the variances Vx(f),Vξ(f) of [F4] are finite.

3.1F4F5givenstep 1.1step 2.1∎

No finite-measure support in either domain. Let E⊆Rn be measurable with f=0 almost everywhere on Rn∖E. Since f>0 everywhere, the set where f differs from 0 inside Rn∖E is Rn∖E itself, so Rn∖E is null and E has full measure, ∣E∣=∞; the same argument with the strictly positive transform f^ shows that no measurable F of finite measure can carry f^=0 almost everywhere off it. By [F5], compact sets have finite measure, so neither function can have compact support. Consequently the counterexample has finite second moments and finite variances in both domains but neither it nor its transform is supported (a.e.) on a set of finite measure, so finite variance does not force compact support, and the support-measure hypothesis of [F4] is not implied by the variance hypotheses.

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

The Gaussian attains equality in the Heisenberg inequality

Example

Assume countable choice. Let n≥1 and a>0 and f(x):=e−πa∣x∣2. Then ∥f∥22=(2a)−n/2, the means of ∣f∣2 and of ∣f^∣2 are 0, and Vx(f)=n4πa,Vξ(f)=na4π, so Vx(f)Vξ(f)=n216π2 and Vx(f)Vξ(f)=n4π; hence f attains equality in The n-dimensional Heisenberg uncertainty inequality, and FA-23's equality family cexp⁡(−λ∣x−x0∣2/2)exp⁡(2πib0⋅x) is realised with c=1, λ=2πa, and x0=b0=0.

Facts & Assumptions

Given: Countable choice (The Axiom of Countable Choice (ACω)), an integer n≥1, a>0, and f(x)=e−πa∣x∣2, whose membership in L1∩L2, finite moments, and zero means are verified below; the variances use Spatial and frequency centres and variances of an L2 function with finite second moments.

[F1]

Countable choice is assumed; it is the hypothesis carried by the Gaussian transform identity, the parameter differentiation, the reflection substitution and Plancherel below (The Axiom of Countable Choice (ACω)).

[F2]

For every t>0 the Gaussian e−πt∣x∣2 is absolutely integrable with ∫Rne−πt∣x∣2dx=t−n/2 and L1 transform t−n/2e−π∣ξ∣2/t; every polynomial times a positive real Gaussian is absolutely integrable (Euclidean Gaussian transform with the 2π normalization); the one-dimensional Gaussian integral is ∫Re−s2ds=π (The Gaussian integral ∫−∞∞e−x2 dx=π).

[F3]

Differentiation under the integral sign: if f(x,t) is integrable in x for every t in an open interval, differentiable in t for almost every x, and the t-derivative is measurable in x with ∣∂tf(x,t)∣≤g(x) for an integrable g and all t, then t↦∫f(x,t)dx is differentiable with derivative ∫∂tf dx (Differentiation under the integral sign).

[F4]

Complex L1 change of variables for the reflection T(x)=−x (∣det⁡DT∣=1): ∫h(−x)dx=∫h(x)dx (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions). Complex L2 carries ∥⋅∥2 and Cauchy–Schwarz (Complex completeness, density, and inner product: the consumer interface), and for g∈L1∩L2 the integral transform represents its Plancherel transform (Agreement of the integral and L2 transforms), so ∥g^∥2=∥g∥2 (Plancherel theorem).

[F5]

The power function t↦tα on (0,∞) is differentiable with derivative αtα−1 (Continuity and derivatives of positive-base real powers, Real powers for positive bases, with the zero-base positive-exponent convention); in particular ddc(2c)−n/2=−n(2c)−n/2−1.

[F6]

The Fourier characterization identifies the L2 classes with ⟨ξ⟩f^∈L2 as H1=W1,2 under the regular-distribution embedding (Integer-order W^{k,2} and H^k agree with equivalent norms, Statement 1 and Proof step 1.3 at k=1).

Verification

technique · direct
1.1F1F2F4given

Norm, transform, evenness and vanishing means. By [F2] with t=2a, ∥f∥22=∫e−2πa∣x∣2dx=(2a)−n/2<∞, and f^(ξ)=a−n/2e−π∣ξ∣2/a, so ∥f^∥22=a−n∫e−2π∣ξ∣2/adξ=(2a)−n/2 by [F2] with t=2/a and [F4]. Both f and f^ are even and strictly positive. The functions x↦xj∣f(x)∣2 and ξ↦ξj∣f^(ξ)∣2 are odd in their j-th coordinate, so by [F4] (reflection) each integral equals its own negative; since they are integrable by [F2] and the remark above, both vanish. Hence both means are 0, and the variances are the uncentred second moments divided by (2a)−n/2.

2.1F2F3F5step 1.1

Second moments and variances. Differentiating the identity ∫Rne−2πc∣x∣2dx=(2c)−n/2 in the parameter c>0 ([F2] with t=2c, [F5]) is legitimate by [F3]: on an open neighbourhood with closure contained in (0,∞) the derivative −2π∣x∣2e−2πc∣x∣2 is dominated by 2π∣x∣2e−2πc0∣x∣2 for a positive lower bound c0 of that interval, which is integrable by [F2]. Hence for every c>0 ∫Rn∣x∣2e−2πc∣x∣2dx=12π n(2c)−n/2−1=n4πc(2c)−n/2. With c=a and step 1.1 this gives ∫∣x∣2∣f∣2=n4πa∥f∥22, hence Vx(f)=∫∣x∣2∣f∣2∥f∥22=n4πa. Next, ∣f^(ξ)∣2=a−ne−2π∣ξ∣2/a=a−ne−2πc∣ξ∣2 with c=1/a, so the same identity gives ∫∣ξ∣2∣f^∣2dξ=a−nna4π(2/a)−n/2=na4π(2a)−n/2=na4π∥f^∥22 by step 1.1, and therefore Vξ(f)=∫∣ξ∣2∣f^∣2∥f^∥22=na4π.

3.1F4F6step 1.1step 2.1∎

Equality. By step 2.1, ∫(1+∣ξ∣2)∣f^∣2<∞, so [F4, F6] give f∈H1; the finite spatial moment is also verified there. Hence the domain of the cited Heisenberg corollary is satisfied. Steps 1.1 and 2.1 give ∥∣x∣f∥22=n4πa∥f∥22 and ∥∣ξ∣f^∥22=na4π∥f∥22, hence ∥∣x∣f∥2∥∣ξ∣f^∥2=∥f∥22n4πana4π=n4π∥f∥22, so the inequality of The n-dimensional Heisenberg uncertainty inequality is an equality. The product of variances is n4πa⋅na4π=n216π2 and its square root is n4π. Finally the entire family cexp⁡(−λ∣x−a0∣2/2)exp⁡(2πib0⋅x) of the published Heisenberg theorem contains f at c=1, λ=2πa, a0=b0=0.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Critical, subcritical and supercritical Gaussian regimes for Hardy's theorem

Example

Assume countable choice (The Axiom of Countable Choice (ACω)), as Hardy's Gaussian uncertainty principle in Rn and the Gaussian-transform interface do. Let a,b>0 and put C0:=max⁡{1,a−n/2}. At the critical product ab=1 the Gaussian f(x)=e−πa∣x∣2 satisfies the two Hardy bounds ∣f(x)∣≤e−πa∣x∣2 and ∣f^(ξ)∣≤a−n/2e−π∣ξ∣2/a of Hardy's Gaussian uncertainty principle in Rn with the common constant C0, and the theorem returns a scalar multiple of the same Gaussian. In the subcritical regime ab<1, every c with a<c<1/b gives the Gaussian e−πc∣x∣2 satisfying the two bounds with the common constant Cc:=max⁡{1,c−n/2}, so no vanishing conclusion holds (Subcritical Gaussians show the Hardy threshold ab=1 is sharp). In the supercritical regime ab>1 the theorem forces f=0, and no Gaussian satisfies both bounds for any positive constants C,C′: ∣e−πc∣x∣2∣≤Ce−πa∣x∣2 forces c≥a, while ∣fc^∣≤C′e−πb∣ξ∣2 forces c≤1/b, and a≤1/b is exactly ab≤1.

Facts & Assumptions

Given: Countable choice (The Axiom of Countable Choice (ACω)), an integer n≥1, reals a,b>0, the common critical bound C0=max⁡{1,a−n/2}, and for c>0 the Gaussian fc(x):=e−πc∣x∣2 (Real powers for positive bases, with the zero-base positive-exponent convention for real powers).

[F1]

Countable choice is assumed; it is the hypothesis carried by the Gaussian transform identity and by the two cited theorems (The Axiom of Countable Choice (ACω)).

[F2]

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

[F3]

Subcritical sharpness: if ab<1, then (a,1/b) is a nonempty open interval and every c with a<c<1/b satisfies ∣fc(x)∣≤e−πa∣x∣2 and ∣fc^(ξ)∣≤c−n/2e−πb∣ξ∣2 (Subcritical Gaussians show the Hardy threshold ab=1 is sharp).

[F4]

Hardy's theorem: if a,b,C>0 and a measurable g satisfies ∣g(x)∣≤Ce−πa∣x∣2 almost everywhere and ∣g^(ξ)∣≤Ce−πb∣ξ∣2 everywhere, then g=0 almost everywhere when ab>1, and g(x)=g∧(0)an/2e−πa∣x∣2 almost everywhere when ab=1 (Hardy's Gaussian uncertainty principle in Rn).

[F5]

Every unit cube has Lebesgue measure 1 under Countable Choice (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included). Hence a full-measure subset of Rn is unbounded: if it were bounded, a unit cube outside a ball containing it would be contained in its null complement, a contradiction.

Verification

technique · direct
1.1F2F4given

Critical regime. For g=fa we have ∣g(x)∣=e−πa∣x∣2≤C0e−πa∣x∣2 and, by [F2] with t=a, ∣g^(ξ)∣=a−n/2e−π∣ξ∣2/a≤C0e−πb∣ξ∣2 since b=1/a. Thus g meets both Hardy bounds with one common constant C0. Since ab=1, [F4] returns g(x)=g^(0)an/2e−πa∣x∣2 almost everywhere, with g^(0)=∫g=a−n/2; that is the same Gaussian, so the classification is attained, not merely bounded.

1.2F3given

Subcritical regime. Suppose ab<1, equivalently a<1/b. By [F3] the interval (a,1/b) is nonempty and every c∈(a,1/b) produces a nonzero Gaussian fc satisfying ∣fc∣≤e−πa∣x∣2 and ∣fc^∣≤c−n/2e−πb∣ξ∣2. With Cc=max⁡{1,c−n/2} both bounds hold with a single constant, so the Hardy hypotheses admit a nonzero function and no vanishing conclusion can be drawn.

1.3F1F2F4F5given

Supercritical regime. Suppose ab>1, equivalently a>1/b. If c>0 and constants C,C′>0 satisfied e−πc∣x∣2≤Ce−πa∣x∣2 almost everywhere, then eπ(a−c)∣x∣2≤C would hold on a set of full measure, and a set of full measure is unbounded by [F5]; were c<a, the left side would tend to +∞ along that unbounded set, which is impossible for a finite constant, so c≥a. Similarly, by [F2], ∣fc^(ξ)∣=c−n/2e−π∣ξ∣2/c≤C′e−πb∣ξ∣2 for every ξ would give eπ(b−1/c)∣ξ∣2≤C′cn/2 for every ξ; if b>1/c, the left side diverges as ∣ξ∣→∞, contradicting the finite bound; thus 1/c≥b, that is c≤1/b. Both requirements together would give a≤c≤1/b, hence ab≤1, contrary to the hypothesis; so no Gaussian meets the two bounds, and by [F4] the only function satisfying them is 0 almost everywhere.

2.1step 1.1step 1.2step 1.3∎

Tabulation. Steps 1.1–1.3 separate the three parameter regions: at ab=1 the Gaussian e−πa∣x∣2 is a nonzero solution classified as itself, for ab<1 nonzero Gaussian solutions exist with rate c∈(a,1/b), and for ab>1 no Gaussian solution exists and every solution vanishes almost everywhere.

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

Delta and constant functions are finite DFT extremisers

Example

Let N≥1, let δ0∈CZ/NZ be the delta at the class of 0 and let 1 be the constant function 1. Then FNδ0=N−1/21,FN1=N1/2δ0. Hence ∣supp⁡δ0∣=1=∣supp⁡FN1∣ and ∣supp⁡1∣=N=∣supp⁡FNδ0∣, so both functions have support product N and attain equality in Finite support-product uncertainty for the unitary DFT. At N=1 one has δ0=1 and the two identities coincide.

Facts & Assumptions

Given: An integer N≥1, the functions δ0,1∈CZ/NZ with δ0([0])=1, δ0(x)=0 for x≠[0], and 1(x)=1 for all x, the unitary transform (FNf)(k)=N−1/2∑x=0N−1f([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, The counting inner product on CZ/NZ).

[F1]

Character orthogonality: for N≥1 and k,ℓ∈Z, ∑x=0N−1e2πi(k−ℓ)x/N=N when k≡ℓ(modN) and 0 otherwise; at N=1 the congruence always holds and the sum is 1 (Orthogonality of the characters x↦e2πikx/N on Z/NZ).

[F2]

Rational powers: N±1/2 is the positive real number with N−1/2N1/2=1 and (N−1/2)2=N−1; the usual power laws hold (Rational powers ar of a positive base, Laws of rational exponents), and complex arithmetic is that of the field C (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)).

[F3]

Finite support-product uncertainty: ∣supp⁡f∣⋅∣supp⁡FNf∣≥N for every nonzero f, with supp⁡f={x:f(x)≠0} (Finite support-product uncertainty for the unitary DFT).

Verification

technique · direct
1.1F2given

The transform of the delta. In the defining sum (FNδ0)(k)=N−1/2∑x=0N−1δ0([x]N)e−2πikx/N every summand with x≢0(modN) vanishes by definition of δ0, and the summand at x=0 equals 1. Hence (FNδ0)(k)=N−1/2 for every k, that is, FNδ0=N−1/21.

1.2F1F2given

The transform of the constant function. For a frequency representative k∈Z, (FN1)(k)=N−1/2∑x=0N−1e−2πikx/N. Apply [F1] with its first parameter 0 and second parameter k: the sum is N when k≡0(modN) and 0 otherwise. Hence (FN1)(k)=N−1/2⋅N=N1/2 at k=[0] and 0 elsewhere, that is, FN1=N1/2δ0.

2.1F2F3step 1.1step 1.2∎

Supports, equality, and the case N=1. By step 1.1 the support of FNδ0 is the support of the constant function 1, namely all N classes, while supp⁡δ0={[0]} has one element; by step 1.2 the support of FN1 is {[0]}, while supp⁡1 has N elements. Multiplying gives ∣supp⁡δ0∣⋅∣supp⁡FNδ0∣=N and ∣supp⁡1∣⋅∣supp⁡FN1∣=N, so both attain the equality case of the bound [F3]. At N=1 the group has the single class [0], so δ0=1 and N−1/2=N1/2=1, and the two identities of steps 1.1 and 1.2 coincide.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Both finite supports cannot be singletons when N>1

Statement refuted

For every N≥1 there exists a nonzero f∈CZ/NZ with ∣supp⁡f∣=∣supp⁡FNf∣=1.

Facts & Assumptions

Given: An integer N≥1 and the unitary discrete Fourier transform FN of The unitary discrete Fourier transform on Z/NZ (The congruence class [a]n and the quotient set Z/n).

[F1]

For every nonzero f∈CZ/NZ the support product satisfies ∣supp⁡f∣⋅∣supp⁡FNf∣≥N (Finite support-product uncertainty for the unitary DFT).

[F2]

At N=1 there is exactly one class, and the delta δ0 at it is the constant function 1; the example Delta and constant functions are finite DFT extremisers computes F1δ0=δ0, so ∣supp⁡δ0∣=∣supp⁡F1δ0∣=1.

Counterexample

technique · direct
1.1F1given

Impossibility for N>1. Suppose N>1 and a nonzero f satisfied ∣supp⁡f∣=∣supp⁡FNf∣=1. Then the left-hand side of the bound [F1] equals 1, so 1≥N, contradicting N>1. Hence no such f exists for N>1.

1.2F2given

The case N=1. At N=1 the group Z/1Z has the single class [0], and by [F2] the delta δ0 is the constant function 1 with F1δ0=δ0; both its support and the support of its transform equal the one-element set {[0]}.

2.1step 1.1step 1.2∎

Conclusion. The universal claim fails already at N=2, where [F1] forces a support product of at least 2; step 1.2 shows that the hypothesis N>1 is essential, since the excluded configuration does occur at N=1 and the bound of [F1] is exactly attained there.

Sources