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.
Divergence and Almost Everywhere Convergence of Fourier Series
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- 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
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Dirichlet Kernel Localisation and Pointwise Fourier Convergence
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Fejer and Poisson Summability of Fourier Series
- 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
- Hereditary and Productive Behaviour of the Separation Axioms
- 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
- Kolmogorov’s Block Construction and Almost-Everywhere Divergence
- 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
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- 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
- The Baire Principles of Functional Analysis
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Carleson–Hunt Time–Frequency Theorem
- 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
The symmetric Fourier partial sums on can diverge at a prescribed point even for a continuous real function. The local proof connects this failure to the exact Lebesgue-constant operator norm. The maximal-density lemma closes almost-everywhere convergence from a weak maximal estimate and Fejér polynomial approximation.
Under the Axiom of Choice, the proved local Carleson–Hunt maximal inequality Carleson hunt maximal inequality on the torus supplies that estimate, so the convergence corollary establishes almost everywhere for every with . The local Kolmogorov theorem Kolmogorov lone fourier series diverges almost everywhere supplies an function whose symmetric partial sums are unbounded almost everywhere; the endpoint remark explains why a weak or strong maximal estimate cannot hold. All integrals use Haar measure of total mass one.
The Carleson–Hunt and Kolmogorov results assume full AC. Finite polynomial calculations remain choice-free; the continuous-function and maximal-density arguments carry their separately stated choice hypotheses.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Carleson maximal partial-sum operator
Definition
Assume the Axiom of Countable Choice for the torus integrals. Use with Haar measure and the negative-sign Fourier coefficients and symmetric partial sums of Period-one Fourier coefficients, partial sums, and convolution on the torus. For define the Carleson maximal partial-sum operator by
Each coefficient is a finite integral independent of the representative of , and each is a continuous trigonometric polynomial. Thus depends only on the class, at every point. For every real , the set is measurable.
Linearity of finite Fourier sums gives and for nonzero scalars . Also ; with the homogeneity identity holds for as well. This is sublinearity with extended nonnegative values. Including retains the constant Fourier coefficient.
Fourier partial-sum operator norm equals the Lebesgue constant
Statement
On with Haar mass one, for each integer and each prescribed , let . Over either or , on the continuous periodic functions with supremum norm,
For these norms are at least , and hence are unbounded as .
Facts & Assumptions
Given: An integer , a point , and either scalar field, with normalized Haar measure.
For every one-period integrable , every and every , (Fourier partial sums are Dirichlet convolutions).
is real, even, continuous and has integral one (Dirichlet and Fejer kernels).
The norm of a bounded linear map is the supremum of its output norms over the closed unit ball (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
For , ; at integers it equals (Closed form and size bounds for the Dirichlet kernel).
Proof
Put . The convolution formula gives for every . Finite Fourier sums are linear and continuous as functions of , so both maps in the statement are bounded linear maps and .
For and , set and . These disjoint intervals lie in . On them and , so . Each integral is at least .
For define . The denominator is positive, so this is a real continuous periodic function with norm at most one, also admissible in the complex space. Writing , we have . Changing variables in the periodic integral yields . Thus for every , proving both norm identities. Zeros of the kernel cause no discontinuity in this test.
Consequently . For , and both norms equal one by the already proved identities (the test attains the value). This covers the initial index and proves the asserted unboundedness.
Context
The harmonic lower estimate is included here to support the functional and operator norm assertion. It reuses the classical Lebesgue-constant calculation; it is not a separate growth theorem.
A continuous function with divergent Fourier series at a prescribed point
Statement refuted
Continuity of a one-periodic real function guarantees convergence of its Fourier series at a prescribed point.
More precisely, assume DC. For every there exists such that
Facts & Assumptions
Given: DC and a prescribed point .
On real or complex the functional is bounded, has norm , and these norms are unbounded (Fourier partial-sum operator norm equals the Lebesgue constant).
Assuming DC, a pointwise bounded family of bounded linear maps from a Banach space to a normed space has uniformly bounded operator norms (Uniform boundedness principle).
For a nonempty compact metric space , is complete in the supremum metric ( is complete in the supremum metric for every nonempty compact metric space ).
Assuming countable choice, if a one-period integrable function satisfies for some , then (Dini pointwise convergence criterion for Fourier series).
Counterexample
Let with the supremum norm. The interval is nonempty and compact, so a Cauchy sequence in has a continuous uniform limit by the completeness theorem. Its endpoint values remain equal, since for every approximating member . Thus is a real Banach space, identified isometrically with the real continuous periodic functions.
Define by . These maps are real-valued bounded linear functionals, and . If all had , uniform boundedness on this Banach space would make the operator norms uniformly bounded. Hence there exists a real with . Every individual value is finite, so this sequence cannot converge.
For this witness, vanishing on any neighborhood of is impossible: if it vanished there, choose within that neighborhood. The Dini integral with would be zero, giving . DC supplies the countable choice assumed by that criterion. This contradicts the unboundedness in step 2.1 and proves the stated localization observation.
A weak maximal bound implies almost-everywhere Fourier convergence
Statement
Assume countable choice and fix . On the period-one torus with normalized Haar measure, suppose a finite constant satisfies
Then for every , almost everywhere. The conclusion holds for any measurable representative of .
Facts & Assumptions
Given: Countable choice, , a finite weak-bound constant as in the statement, and .
For , is a measurable extended nonnegative function, defined from the continuous finite Fourier sums and independent of the representative (Carleson maximal partial-sum operator).
Assuming countable choice, for each one-periodic complex , , the Fejer means satisfy (Fejer means converge in L^p for 1 <= p < infinity).
For a measurable nonnegative extended function and , (Chebyshev-Markov inequality for the integral).
Proof
Use a finite-valued measurable representative of , changing it on a null set if needed. It is integrable since and the torus has mass one. Set . These are explicit polynomials and . Integrating over gives one for and zero otherwise, so whenever , including constants and the zero polynomial.
The extended function is measurable: a limsup is a countable infimum of countable suprema of measurable functions. For each and , linearity and the triangle inequality give . Hence .
For every , the set is contained in . Apply the assumed weak estimate to the first set and the integral inequality to , , for the second. The latter strict superlevel set is contained in . Subadditivity yields .
Let with fixed. The right side tends to zero, so . Because , has measure at most the sum of these zero measures, hence zero. Outside it the nonnegative errors have limsup zero and therefore tend to zero. Changing the representative alters the conclusion on only a null set. This proves convergence almost everywhere, including whenever its hypothesized weak estimate holds.
Almost-everywhere convergence from the Carleson–Hunt estimate
Statement
Assume the Axiom of Choice and let . Every complex satisfies almost everywhere, with symmetric partial sums and normalized Haar measure on the period-one torus. The conclusion holds for every measurable representative of .
Facts & Assumptions
Given: The Axiom of Choice, , and the normalized torus conventions.
Under AC, a finite constant satisfies for every complex , where (Carleson hunt maximal inequality on the torus).
Under countable choice, a bound for all and all , with finite , implies almost everywhere for every , for every measurable representative (A weak maximal bound implies almost-everywhere Fourier convergence).
For nonnegative measurable and , (Chebyshev-Markov inequality for the integral).
The Axiom of Choice (The Axiom of Choice) implies countable choice and supplies the choice hypothesis of F1 and F2.
Proof
For and , F1 and F3 applied to at give . The maximal function and Fourier conventions in F1 agree with those in F2.
The weak estimate therefore holds for every and every positive threshold with finite . Since lies in the range of F2 and AC supplies countable choice, F2 proves the assertion for every and every measurable representative. The strong estimate is discharged by the local proved theorem F1.
What the Carleson–Hunt proof requires
One local proof route
Assume the Axiom of Choice (The Axiom of Choice) for the Fourier and measure interfaces of the following proved suppliers. The local conclusion is Carleson hunt maximal inequality on the torus, a strong maximal estimate for symmetric partial sums on the normalized period-one torus, at each .
The real-line tile argument uses Carleson density selection and Carleson size selection to select forests and Carleson single tree estimate to bound a tree contribution. The exceptional-set argument and distribution bootstrap of Hunt exceptional set and distribution estimates give finite tile models uniform restricted weak type at every exponent strictly between one and infinity. Then Carleson restricted weak interpolation gives uniform strong bounds at the desired exponent.
The packet averaging and reconstruction argument in Wave packet model dominates the linearised carleson operator passes those model bounds to the real-line Carleson maximal operator on Schwartz inputs. Finally Carleson real line to torus transfer uses a slowly varying Schwartz window on trigonometric polynomials, periodic averaging, Fejer approximation and monotone convergence to obtain the torus estimate. This supplies the transference argument as well as the time-frequency model estimates. The local theorem assembles these interfaces; the assumption AC is inherited from them.
The L1 endpoint is excluded
Endpoint interpretation
Assume the Axiom of Choice (The Axiom of Choice). The local theorem Kolmogorov lone fourier series diverges almost everywhere supplies an integrable function with unbounded symmetric Fourier partial sums almost everywhere. Thus a convergence theorem for every function would be false.
In particular there is no finite such that for all and . Such a weak estimate would imply almost-everywhere convergence for every such by A weak maximal bound implies almost-everywhere Fourier convergence at . Applying that conclusion to the supplied witness contradicts its almost-everywhere unboundedness, because a convergent complex sequence is bounded and the union of the two exceptional null sets remains null.
A strong estimate with finite would imply the forbidden weak estimate by Chebyshev-Markov inequality for the integral applied to , so no such strong estimate exists either. All operators here use symmetric partial sums on the normalized period-one torus. AC supplies the witness and implies the countable choice needed by the maximal convergence principle. Failure at one prescribed point for a continuous function is a different assertion from this failure on a full-measure set for an integrable function.
5 · Examples, counterexamples and false statements
None yet.