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.
Uncertainty Principles for Fourier Analysis — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Bessel-Potential Completions and Real-Order Sobolev Spaces
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Power Series and Analytic Functions
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fourier Analysis and the Fast Fourier Transform
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Multipliers and Sobolev Characterisations
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tempered Distributions and the Fourier Transform
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The Winding Number and the Global Cauchy Theorem
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Uncertainty Principles for Fourier Analysis
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Summary
These examples execute the three localisation principles of the companion page at explicit parameters and separate their hypothesis classes. The Gaussian is the running example: it attains equality in the summed Heisenberg inequality, with spatial variance and frequency variance whose product is exactly , so every constant in the library's 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 the Gaussian satisfies both Gaussian bounds and the theorem classifies it as a scalar multiple of itself; in the subcritical regime the interval supplies a nonzero Gaussian satisfying both bounds, so no vanishing conclusion holds; in the supercritical regime the two bounds force and on any Gaussian witness, which is impossible, matching the theorem's conclusion that 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 , with the two identities coinciding at , and the last witness shows that both supports cannot be singletons when : the support-product bound would give . The boundary case , where the delta is the constant function and the configuration does occur, is included to show that the hypothesis is essential.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Finite variance is not compact support
Statement refuted
Assume countable choice. Every nonzero with finite second moments in both domains vanishes almost everywhere outside a compact set, and so does ; equivalently, finite variance forces compact support.
Facts & Assumptions
Given: Countable choice, an integer , a real , and the Gaussian .
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 ()).
For every the Gaussian is absolutely integrable with and Fourier transform (Euclidean Gaussian transform with the 2π normalization); every polynomial times a positive real Gaussian is absolutely integrable. For functions this integral transform represents the Plancherel transform (Agreement of the integral and L2 transforms); the one-dimensional Gaussian integral is (The Gaussian integral ).
Complex change of variables: for the reflection , which is a diffeomorphism with , one has (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).
Means and variances for a nonzero function with finite second moments are as in Spatial and frequency centres and variances of an function with finite second moments; the support-measure hypothesis that is not satisfied here is the one of The support-measure uncertainty inequality .
Compact subsets of are bounded (Heine-Borel in : with the Euclidean metric a subset of 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 with parameters is Lebesgue measurable of measure , whichever of its faces are included). Thus a compact set is contained in a finite-measure cube, whereas has infinite measure since it contains cubes of measure for all .
Counterexample
The Gaussian and its transform are strictly positive and integrable. for every , is continuous and even, and by [F2] with , , so and [F2] identifies its integral and Plancherel transforms, with for every .
Finite second moments and vanishing means. By [F2] with one has , and since , [F2] with gives as well. By [F2], and are integrable polynomial multiples of positive Gaussians. Thus both second moments are finite. The functions and are odd in their -th coordinate while and are even, so [F3] applied to the reflection shows that each of these integrals equals its own negative and hence vanishes; consequently both means are and the variances of [F4] are finite.
No finite-measure support in either domain. Let be measurable with almost everywhere on . Since everywhere, the set where differs from inside is itself, so is null and has full measure, ; the same argument with the strictly positive transform shows that no measurable of finite measure can carry 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 () 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.
The Gaussian attains equality in the Heisenberg inequality
Example
Assume countable choice. Let and and . Then , the means of and of are , and so and ; hence attains equality in The n-dimensional Heisenberg uncertainty inequality, and FA-23's equality family is realised with , , and .
Facts & Assumptions
Given: Countable choice (The Axiom of Countable Choice ()), an integer , , and , whose membership in , finite moments, and zero means are verified below; the variances use Spatial and frequency centres and variances of an function with finite second moments.
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 ()).
For every the Gaussian is absolutely integrable with and transform ; every polynomial times a positive real Gaussian is absolutely integrable (Euclidean Gaussian transform with the 2π normalization); the one-dimensional Gaussian integral is (The Gaussian integral ).
Differentiation under the integral sign: if is integrable in for every in an open interval, differentiable in for almost every , and the -derivative is measurable in with for an integrable and all , then is differentiable with derivative (Differentiation under the integral sign).
Complex change of variables for the reflection (): (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions). Complex carries and Cauchy–Schwarz (Complex completeness, density, and inner product: the consumer interface), and for the integral transform represents its Plancherel transform (Agreement of the integral and L2 transforms), so (Plancherel theorem).
The power function on is differentiable with derivative (Continuity and derivatives of positive-base real powers, Real powers for positive bases, with the zero-base positive-exponent convention); in particular .
The Fourier characterization identifies the classes with as 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 ).
Verification
Norm, transform, evenness and vanishing means. By [F2] with , , and , so by [F2] with and [F4]. Both and are even and strictly positive. The functions and are odd in their -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 , and the variances are the uncentred second moments divided by .
Second moments and variances. Differentiating the identity in the parameter ([F2] with , [F5]) is legitimate by [F3]: on an open neighbourhood with closure contained in the derivative is dominated by for a positive lower bound of that interval, which is integrable by [F2]. Hence for every With and step 1.1 this gives , hence Next, with , so the same identity gives by step 1.1, and therefore
Equality. By step 2.1, , so [F4, F6] give ; 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 and , hence so the inequality of The n-dimensional Heisenberg uncertainty inequality is an equality. The product of variances is and its square root is . Finally the entire family of the published Heisenberg theorem contains at , , .
Critical, subcritical and supercritical Gaussian regimes for Hardy's theorem
Example
Assume countable choice (The Axiom of Countable Choice ()), as Hardy's Gaussian uncertainty principle in and the Gaussian-transform interface do. Let and put . At the critical product the Gaussian satisfies the two Hardy bounds and of Hardy's Gaussian uncertainty principle in with the common constant , and the theorem returns a scalar multiple of the same Gaussian. In the subcritical regime , every with gives the Gaussian satisfying the two bounds with the common constant , so no vanishing conclusion holds (Subcritical Gaussians show the Hardy threshold is sharp). In the supercritical regime the theorem forces , and no Gaussian satisfies both bounds for any positive constants : forces , while forces , and is exactly .
Facts & Assumptions
Given: Countable choice (The Axiom of Countable Choice ()), an integer , reals , the common critical bound , and for the Gaussian (Real powers for positive bases, with the zero-base positive-exponent convention for real powers).
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 ()).
Gaussian transform: for every , is absolutely integrable with transform (Euclidean Gaussian transform with the 2π normalization).
Subcritical sharpness: if , then is a nonempty open interval and every with satisfies and (Subcritical Gaussians show the Hardy threshold is sharp).
Hardy's theorem: if and a measurable satisfies almost everywhere and everywhere, then almost everywhere when , and almost everywhere when (Hardy's Gaussian uncertainty principle in ).
Every unit cube has Lebesgue measure under Countable Choice (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included). Hence a full-measure subset of is unbounded: if it were bounded, a unit cube outside a ball containing it would be contained in its null complement, a contradiction.
Verification
Critical regime. For we have and, by [F2] with , since . Thus meets both Hardy bounds with one common constant . Since , [F4] returns almost everywhere, with ; that is the same Gaussian, so the classification is attained, not merely bounded.
Subcritical regime. Suppose , equivalently . By [F3] the interval is nonempty and every produces a nonzero Gaussian satisfying and . With both bounds hold with a single constant, so the Hardy hypotheses admit a nonzero function and no vanishing conclusion can be drawn.
Supercritical regime. Suppose , equivalently . If and constants satisfied almost everywhere, then would hold on a set of full measure, and a set of full measure is unbounded by [F5]; were , the left side would tend to along that unbounded set, which is impossible for a finite constant, so . Similarly, by [F2], for every would give for every ; if , the left side diverges as , contradicting the finite bound; thus , that is . Both requirements together would give , hence , contrary to the hypothesis; so no Gaussian meets the two bounds, and by [F4] the only function satisfying them is almost everywhere.
Tabulation. Steps 1.1–1.3 separate the three parameter regions: at the Gaussian is a nonzero solution classified as itself, for nonzero Gaussian solutions exist with rate , and for no Gaussian solution exists and every solution vanishes almost everywhere.
Delta and constant functions are finite DFT extremisers
Example
Let , let be the delta at the class of and let be the constant function . Then Hence and , so both functions have support product and attain equality in Finite support-product uncertainty for the unitary DFT. At one has and the two identities coincide.
Facts & Assumptions
Given: An integer , the functions with , for , and for all , the unitary transform of The unitary discrete Fourier transform on (The congruence class and the quotient set , The counting inner product on ).
Character orthogonality: for and , when and otherwise; at the congruence always holds and the sum is (Orthogonality of the characters on ).
Rational powers: is the positive real number with and ; the usual power laws hold (Rational powers of a positive base, Laws of rational exponents), and complex arithmetic is that of the field ( is a field, every element is uniquely , and every nonzero element has inverse ).
Finite support-product uncertainty: for every nonzero , with (Finite support-product uncertainty for the unitary DFT).
Verification
The transform of the delta. In the defining sum every summand with vanishes by definition of , and the summand at equals . Hence for every , that is, .
The transform of the constant function. For a frequency representative , . Apply [F1] with its first parameter and second parameter : the sum is when and otherwise. Hence at and elsewhere, that is, .
Supports, equality, and the case . By step 1.1 the support of is the support of the constant function , namely all classes, while has one element; by step 1.2 the support of is , while has elements. Multiplying gives and , so both attain the equality case of the bound [F3]. At the group has the single class , so and , and the two identities of steps 1.1 and 1.2 coincide.
Both finite supports cannot be singletons when
Statement refuted
For every there exists a nonzero with .
Facts & Assumptions
Given: An integer and the unitary discrete Fourier transform of The unitary discrete Fourier transform on (The congruence class and the quotient set ).
For every nonzero the support product satisfies (Finite support-product uncertainty for the unitary DFT).
At there is exactly one class, and the delta at it is the constant function ; the example Delta and constant functions are finite DFT extremisers computes , so .
Counterexample
Impossibility for . Suppose and a nonzero satisfied . Then the left-hand side of the bound [F1] equals , so , contradicting . Hence no such exists for .
The case . At the group has the single class , and by [F2] the delta is the constant function with ; both its support and the support of its transform equal the one-element set .
Conclusion. The universal claim fails already at , where [F1] forces a support product of at least ; step 1.2 shows that the hypothesis is essential, since the excluded configuration does occur at and the bound of [F1] is exactly attained there.
Sources
- Calder Sheagren, Uncertainty Principles with Fourier Analysis (University of Chicago REU 2017, author PDF)
- Richard S. Laugesen, Harmonic Analysis Lecture Notes (arXiv:0903.3845)
- Aingeru Fernández-Bertolín and Eugenia Malinnikova, Dynamical Versions of Hardy's Uncertainty Principle: A Survey (arXiv:2210.03369)
- Michael E. Taylor, Fourier Analysis, Distributions, and Constant-Coefficient Linear PDE (author PDF)
- Terence Tao, An Uncertainty Principle for Cyclic Groups of Prime Order, Math. Res. Lett. 12 (2005) 121–127 (arXiv:math/0308286)