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.
Fourier Transform Convolution and Approximate Identities — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- 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
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- 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
- 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
- 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 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 ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples use the negative-sign, normalization established on the companion A page. The interval, Gaussian, Poisson and triangle calculations give explicit transforms, including their zero-frequency values. The Poisson example also identifies Abel summation and checks recovery at Lebesgue points through the radial kernel theorem.
The counterexamples distinguish three different limitations. An integrable function can have a nonintegrable transform. Changing an integrable representative at one point prevents an everywhere inversion claim for that representative. Finally, the Riemann–Lebesgue conclusion has no universal rate: an explicitly chosen series of modulated Gaussians defeats any proposed positive rate tending to zero.
The closing Wiener theorem is Recorded orientation with its exact external source, not a proved supplier. Its translate-span statement is kept distinct from the criterion. The calculations and counterexamples preceding it have their own complete arguments and do not depend on this recorded result.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Transform of an interval indicator
Example
Assume countable choice and . For on , In particular for the transform is with value one at zero.
Facts & Assumptions
Given: and The Axiom of Countable Choice (), with the integral convention of Fourier transform on complex L1 classes.
Complex FTC evaluates continuous derivatives on intervals (Complex integration by parts on intervals and decaying lines).
Euler's formula and the real sine/cosine derivatives give the exponential derivative (, , and , The derivatives of sine and cosine are cosine and minus sine).
The transform of an integrable function is continuous (The L1 transform is bounded and uniformly continuous).
Verification
The interval indicator is integrable with norm . For and , F2 gives the antiderivative . F1 at a and b gives the displayed quotient. If the indicator is null almost everywhere and both the numerator and transform vanish.
At zero frequency the integral is the interval length ; F3 shows this is the continuous extension of the quotient. For the symmetric interval its numerator is by F2, giving the sinc formula and value one. Countable choice is inherited from the interval Lebesgue measure and FTC bridge.
Scaled and tensor Gaussian examples
Example
Assume countable choice. For , has transform on . The normalized density has mass one and transform .
Facts & Assumptions
Given: , and The Axiom of Countable Choice ().
The normalized Gaussian transform formula holds in every positive dimension (Euclidean Gaussian transform with the 2π normalization).
Linear scaling uses the absolute determinant (Translation, modulation, linear dilation and reflection laws).
Verification
Write . F2 and F1 give . Thus the spatial scale is , while the frequency scale is .
At zero frequency the formula gives . Multiplying both sides by gives the mass-one formula. For t=1 the Gaussian is unchanged by Fourier transform; in n coordinates the product of n one-dimensional values gives the factor . Countable choice is inherited from F1 and F2.
Poisson kernel transform and Abel summability on the line
Example
Assume countable choice. For , satisfies . For its Abel mean equals and tends to the Lebesgue value at every Lebesgue point as .
Facts & Assumptions
Given: and The Axiom of Countable Choice (), with Fourier transform on complex L1 classes.
Complex FTC and the trigonometric exponential derivative evaluate finite-interval exponential integrals (Complex integration by parts on intervals and decaying lines, The derivatives of sine and cosine are cosine and minus sine, , , and ).
Positive improper integrals agree with Lebesgue integrals (A nonnegative improper Riemann integral on a half-line agrees with the Lebesgue integral).
Inversion applies when the function and transform are integrable (L1 Fourier inversion with an integrable transform).
Absolute product integrability permits Fubini (Fubini's theorem for L^1 functions on a sigma-finite product).
Bounded integrable radial majorants give recovery of Lebesgue values (Lebesgue-point convergence for radial-majorized kernels).
Verification
Put . It is integrable with integral , by F1 on finite half-intervals and F2 for the positive exponential tails. Integration on gives . The omitted absolute tail is , so the half-line transform is . Reflecting the negative half gives . Their sum is .
The rational P_a is bounded on a compact core and bounded by for , hence integrable by the elementary convergent inverse-square improper tail and F2. F3 applied to q_a gives almost everywhere. Both sides are continuous, so equality holds everywhere (a nonzero continuous difference cannot vanish a.e. on an interval). Evenness then gives the stated transform and, at zero, .
In the Abel integral, inserting gives a double absolute bound . F4 exchanges the integrals and step 1.1 identifies the inner inverse integral with , since P_a is even. Thus the mean is , absolutely at every x since P_a is bounded. Finally and is bounded, decreasing and integrable with radial mass one. F5 gives the asserted Lebesgue-point limit. All integral and pointwise suppliers carry the stated countable choice.
Triangle function and squared sinc
Example
Assume countable choice. The triangle on has , with value one at zero.
Facts & Assumptions
Given: The Axiom of Countable Choice () and .
The interval indicator I has sinc transform, with value one at zero (Transform of an interval indicator).
Fourier turns integrable convolution into multiplication (Fourier transform turns L1 convolution into multiplication).
Verification
The integral is the length of . For this length is ; for it is ; for the intervals are disjoint. At the intersection is a null singleton. Thus everywhere.
By F1 and F2, gives the displayed squared sinc. At zero the value is one, also equal to . Countable choice is inherited from the indicator and convolution suppliers.
An L1 transform need not be integrable
Statement refuted
Every integrable function on has an integrable Fourier transform.
Facts & Assumptions
Given: The Axiom of Countable Choice ().
The transform of is , with value one at zero (Transform of an interval indicator).
Counterexample
Take the f in F1, whose integral and norm are one. For integer and , . Consequently on an interval of length , and its integral there is at least .
These intervals are disjoint. The sum of their lower bounds diverges: the block contributes at least . Hence , despite . The failure concerns absolute integrability, not continuity or decay of the transform. Countable choice is inherited from F1 and Lebesgue interval measure.
Null-set modifications defeat everywhere representative recovery
Statement refuted
Whenever , the inverse Fourier integral equals the chosen representative f at every point.
Facts & Assumptions
Given: The Axiom of Countable Choice () and on .
A singleton on the line is Lebesgue null (Every affine hyperplane of , and hence every proper linear subspace, is Lebesgue null).
The integral of a nonnegative function over a null set vanishes (A nonnegative integral over a null set vanishes).
Null modifications do not change any transform value (The integral transform is representative independent).
Counterexample
F1 and F2 give , so f represents the zero integrable class. F3 gives for every frequency, and hence the transform is integrable too.
The inverse integral at zero is , whereas . Thus the claimed every-point assertion fails. In fact the mean oscillation about the chosen value f(0) equals one on every centered interval, so zero is not a Lebesgue point with that value. This respects the actual almost-everywhere inversion theorem. Countable choice is inherited from F1.
There is no universal Riemann–Lebesgue decay rate
Statement refuted
There is a positive rate function tending to zero such that every satisfies as .
Facts & Assumptions
Given: The Axiom of Countable Choice () and any positive r tending to zero.
has mass one and transform (Euclidean Gaussian transform with the 2π normalization).
Modulation by translates the transform by b (Translation, modulation, linear dilation and reflection laws).
Dominated convergence applies under one integrable majorant (Dominated convergence).
Counterexample
Set . For let be the least positive integer greater than for which . Such integers exist by the assumed limit. This recursion is explicit and uses no choice selection. The series converges absolutely at each x with modulus at most g(x); its measurable limit belongs to by F1.
At each frequency, F3 applied to the partial sums times the unit-modulus Fourier factor, dominated by g, gives by F1 and F2. All summands are nonnegative. Thus and , while . This refutes every proposed rate, even allowing an f-dependent big-O constant. Countable choice is inherited only from the Gaussian and modulation suppliers. This explicit construction is local and is not attributed to a source theorem.
Wiener Tauberian orientation
Recorded orientation
Wiener's Tauberian theorem states that the linear span of all translates of is dense in exactly when has no zeros. This result is recorded, not proved here, and supplies no proof dependency.
Dall'Ara, §3, pp.4–7, proves the convolution-annihilator form: if an family has no common Fourier zero and is annihilated by convolution with every member, then almost everywhere (Corollary 3.4). For a singleton family, the usual – duality and separation of a proper closed subspace translate this into the dense-translate formulation. That equivalence and its functional-analytic assumptions are part of the recorded orientation, not a local proof.
The source's complete route uses its spreading-out lemma, an explicitly convergent Neumann series to solve a convolution equation locally in frequency, and tempered-distribution support. Those later interfaces are not available as proved prerequisites at this location. The no-zero condition here is everywhere nonvanishing; it must not be confused with an density criterion involving almost-everywhere nonvanishing.