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.

Divergence and Almost Everywhere Convergence of Fourier Series

1 · Prerequisites

2 · Summary

The symmetric Fourier partial sums on T=R/Z 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 SNf→f almost everywhere for every f∈Lp(T) with 1<p<∞. The local Kolmogorov theorem Kolmogorov lone fourier series diverges almost everywhere supplies an L1 function whose symmetric partial sums are unbounded almost everywhere; the endpoint remark explains why a weak or strong (1,1) 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

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-09-23 (gpt-6-sol)Open item page →

Carleson maximal partial-sum operator

Definition

Assume the Axiom of Countable Choice for the torus L1 integrals. Use T=R/Z with Haar measure m(T)=1 and the negative-sign Fourier coefficients and symmetric partial sums of Period-one Fourier coefficients, partial sums, and convolution on the torus. For f∈L1(T) define the Carleson maximal partial-sum operator by

Cf(x):=sup⁡N∈Z≥0∣SNf(x)∣∈[0,∞].

Each coefficient is a finite integral independent of the representative of f, and each SNf is a continuous trigonometric polynomial. Thus C depends only on the L1 class, at every point. For every real a, the set {Cf>a}=⋃N≥0{∣SNf∣>a} is measurable.

Linearity of finite Fourier sums gives C(f+g)≤Cf+Cg and C(af)=∣a∣Cf for nonzero scalars a. Also C0=0; with 0⋅∞:=0 the homogeneity identity holds for a=0 as well. This is sublinearity with extended nonnegative values. Including N=0 retains the constant Fourier coefficient.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Fourier partial-sum operator norm equals the Lebesgue constant

Statement

On T=R/Z with Haar mass one, for each integer N≥0 and each prescribed x0∈T, let TN,x0f=SNf(x0). Over either R or C, on the continuous periodic functions with supremum norm,

∥TN,x0∥=∥SN:C(T)→C(T)∥=∫T∣DN(t)∣ dm(t).

For N≥1 these norms are at least 13πlog⁡(N+1), and hence are unbounded as N→∞.

Facts & Assumptions

Given: An integer N≥0, a point x0∈T, and either scalar field, with normalized Haar measure.

[F1]

For every one-period integrable f, every N≥0 and every x, SNf(x)=∫01f(x−t)DN(t) dt (Fourier partial sums are Dirichlet convolutions).

[F2]

DN(t)=1+2∑k=1Ncos⁡(2πkt) is real, even, continuous and has integral one (Dirichlet and Fejer kernels).

[F3]

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).

[F4]

For t∉Z, DN(t)=sin⁡((2N+1)πt)/sin⁡(πt); at integers it equals 2N+1 (Closed form and size bounds for the Dirichlet kernel).

Proof

technique · direct estimates and continuous approximation
1.1F1F3

Put LN=∫01∣DN(t)∣ dt. The convolution formula gives ∣SNf(x)∣≤LN∥f∥∞ for every x. Finite Fourier sums are linear and continuous as functions of x, so both maps in the statement are bounded linear maps and ∥TN,x0∥≤∥SN∥≤LN.

1.2F4algebra

For N≥1 and 0≤j≤N−1, set aj=(j+1/6)/(2N+1) and bj=(j+5/6)/(2N+1). These disjoint intervals lie in (0,1/2). On them ∣sin⁡((2N+1)πt)∣≥1/2 and 0<sin⁡(πt)≤πt, so LN≥12π∑j=0N−1∫ajbjdt/t. Each integral is at least (bj−aj)/bj=2/3j+5/6≥23(j+1).

2.1F1F2F3step 1.1

For δ>0 define fδ(u)=DN(x0−u)/max⁡{δ,∣DN(x0−u)∣}. The denominator is positive, so this is a real continuous periodic function with norm at most one, also admissible in the complex space. Writing a=∣DN(x0−u)∣, we have 0≤a−a2/max⁡{δ,a}≤δ. Changing variables in the periodic integral yields 0≤LN−TN,x0fδ≤δ. Thus ∥TN,x0∥≥LN−δ for every δ>0, proving both norm identities. Zeros of the kernel cause no discontinuity in this test.

3.1F2step 2.1step 1.2algebra∎

Consequently LN≥13π∑j=1N1/j≥13π∫1N+1dt/t=13πlog⁡(N+1). For N=0, D0=1 and both norms equal one by the already proved identities (the test f=1 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.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

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 x0∈T there exists f∈C(T,R) such that

sup⁡N≥0∣SNf(x0)∣=∞.

Facts & Assumptions

Given: DC and a prescribed point x0∈T=R/Z.

[F1]

On real or complex C(T) the functional f↦SNf(x0) is bounded, has norm ∥DN∥1, and these norms are unbounded (Fourier partial-sum operator norm equals the Lebesgue constant).

[F2]

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).

[F3]

For a nonempty compact metric space K, C(K,R) is complete in the supremum metric (C(K,R) is complete in the supremum metric for every nonempty compact metric space K).

[F4]

Assuming countable choice, if a one-period integrable function h satisfies ∫0δ∣h(x+t)+h(x−t)−2s∣ dt/t<∞ for some δ∈(0,1/2), then SNh(x)→s (Dini pointwise convergence criterion for Fourier series).

Counterexample

technique · direct application of uniform boundedness
1.1F3algebra

Let X={f∈C([0,1],R):f(0)=f(1)} with the supremum norm. The interval is nonempty and compact, so a Cauchy sequence in X has a continuous uniform limit by the completeness theorem. Its endpoint values remain equal, since ∣f(0)−f(1)∣≤2∥f−fj∥∞ for every approximating member fj. Thus X is a real Banach space, identified isometrically with the real continuous periodic functions.

2.1F1F2step 1.1

Define TN:X→R by TNf=SNf(x0). These maps are real-valued bounded linear functionals, and sup⁡N∥TN∥=∞. If all f∈X had sup⁡N∣TNf∣<∞, uniform boundedness on this Banach space would make the operator norms uniformly bounded. Hence there exists a real f∈X with sup⁡N∣TNf∣=∞. Every individual value is finite, so this sequence cannot converge.

3.1F4step 2.1given∎

For this witness, vanishing on any neighborhood of x0 is impossible: if it vanished there, choose 0<δ<1/2 within that neighborhood. The Dini integral with s=0 would be zero, giving SNf(x0)→0. DC supplies the countable choice assumed by that criterion. This contradicts the unboundedness in step 2.1 and proves the stated localization observation.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A weak maximal bound implies almost-everywhere Fourier convergence

Statement

Assume countable choice and fix 1≤p<∞. On the period-one torus with normalized Haar measure, suppose a finite constant A≥0 satisfies

m{Cg>λ}≤Aλ−p∥g∥pp(g∈Lp(T), λ>0).

Then for every f∈Lp(T), SNf(x)→f(x) almost everywhere. The conclusion holds for any measurable representative of f.

Facts & Assumptions

Given: Countable choice, 1≤p<∞, a finite weak-bound constant A≥0 as in the statement, and f∈Lp(T).

[F1]

For g∈L1(T), Cg=sup⁡N≥0∣SNg∣ is a measurable extended nonnegative function, defined from the continuous finite Fourier sums and independent of the representative (Carleson maximal partial-sum operator).

[F2]

Assuming countable choice, for each one-periodic complex f∈Lp([0,1]), 1≤p<∞, the Fejer means satisfy ∥σjf−f∥p→0 (Fejer means converge in L^p for 1 <= p < infinity).

[F3]

For a measurable nonnegative extended function h and t>0, m{h≥t}≤t−1∫h dm (Chebyshev-Markov inequality for the integral).

Proof

technique · polynomial approximation and level-set estimates
1.1F1F2given

Use a finite-valued measurable representative of f, changing it on a null set if needed. It is integrable since ∣f∣≤1+∣f∣p and the torus has mass one. Set Qj=σjf=(j+1)−1∑r=0jSrf. These are explicit polynomials and ∥f−Qj∥p→0. Integrating e2πi(k−ℓ)x over [0,1] gives one for k=ℓ and zero otherwise, so SNQj=Qj whenever N≥j, including constants and the zero polynomial.

2.1F1step 1.1

The extended function H(x)=lim sup⁡N→∞∣SNf(x)−f(x)∣ is measurable: a limsup is a countable infimum of countable suprema of measurable functions. For each j and N≥j, linearity and the triangle inequality give ∣SNf−f∣≤∣SN(f−Qj)∣+∣f−Qj∣. Hence H≤C(f−Qj)+∣f−Qj∣.

3.1F3step 2.1given

For every λ>0, the set {H>2λ} is contained in {C(f−Qj)>λ}∪{∣f−Qj∣>λ}. Apply the assumed weak estimate to the first set and the integral inequality to h=∣f−Qj∣p, t=λp, for the second. The latter strict superlevel set is contained in {h≥λp}. Subadditivity yields m{H>2λ}≤(A+1)λ−p∥f−Qj∥pp.

4.1step 1.1step 3.1algebra∎

Let j→∞ with λ fixed. The right side tends to zero, so m{H>2λ}=0. Because H≥0, {H>0}=⋃r=1∞{H>2/r} 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 p=1 whenever its hypothesized weak estimate holds.

CorollaryStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Almost-everywhere convergence from the Carleson–Hunt estimate

Statement

Assume the Axiom of Choice and let 1<p<∞. Every complex f∈Lp(T) satisfies SNf→f almost everywhere, with symmetric partial sums and normalized Haar measure on the period-one torus. The conclusion holds for every measurable representative of f.

Facts & Assumptions

Given: The Axiom of Choice, 1<p<∞, and the normalized torus conventions.

[F1]

Under AC, a finite constant Cp satisfies ∥Cg∥p≤Cp∥g∥p for every complex g∈Lp(T), where Cg=sup⁡N≥0∣SNg∣ (Carleson hunt maximal inequality on the torus).

[F2]

Under countable choice, a bound m{Cg>λ}≤Aλ−p∥g∥pp for all g∈Lp and all λ>0, with finite A≥0, implies SNf→f almost everywhere for every f∈Lp, for every measurable representative (A weak maximal bound implies almost-everywhere Fourier convergence).

[F3]

For nonnegative measurable h and t>0, m{h≥t}≤t−1∫h dm (Chebyshev-Markov inequality for the integral).

[F4]

The Axiom of Choice (The Axiom of Choice) implies countable choice and supplies the choice hypothesis of F1 and F2.

Proof

1.1F1F3given

For g∈Lp and λ>0, F1 and F3 applied to (Cg)p at t=λp give m{Cg>λ}≤λ−p∫(Cg)p dm≤Cppλ−p∥g∥pp. The maximal function and Fourier conventions in F1 agree with those in F2.

2.1F2F4step 1.1given∎

The weak estimate therefore holds for every g and every positive threshold with finite A=Cpp. Since 1<p<∞ lies in the range 1≤p<∞ of F2 and AC supplies countable choice, F2 proves the assertion for every f and every measurable representative. The strong estimate is discharged by the local proved theorem F1.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

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 1<p<∞.

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.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

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 L1(T) function would be false.

In particular there is no finite A≥0 such that m{Cg>λ}≤A∥g∥1/λ for all g∈L1 and λ>0. Such a weak (1,1) estimate would imply almost-everywhere convergence for every such g by A weak maximal bound implies almost-everywhere Fourier convergence at p=1. 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 (1,1) estimate ∥Cg∥1≤B∥g∥1 with finite B would imply the forbidden weak estimate by Chebyshev-Markov inequality for the integral applied to Cg, 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.

Sources