Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Periodic Fourier partial sums converge in the strict Lp range

Statement

Assume Countable Choice, and use the torus conventions of Period-one Fourier coefficients, partial sums, and convolution on the torus and The one-dimensional torus and its normalized Haar integral: the torus T=R/Z carries normalized Haar measure m with m(T)=1, and SNf=∑∣k∣≤Nf^(k)ek for f∈Lp(T;C).

  1. For every 1<p<∞ and every f∈Lp(T;C), ∥SNf−f∥p⟶0(N→∞).
  2. At the endpoints the operator norms grow at least as the Lebesgue constants. For every N≥1, ∥SN∥L1→L1 ≥ ∫T∣DN∣ dm ≥ 13πlog⁡(N+1),∥SN∥L∞→L∞ ≥ ∫T∣DN∣ dm ≥ 13πlog⁡(N+1). Hence both families (∥SN∥L1→L1)N≥0 and (∥SN∥L∞→L∞)N≥0 are unbounded, and there exist f∈L1(T;C) and g∈L∞(T;C) such that (SNf) fails to converge in L1(T;C) and (SNg) fails to converge in L∞(T;C).

No failure of weak-type (1,1) or of any endpoint mapping weaker than norm convergence is asserted.

Facts & Assumptions

[F1]

The torus integral is normalized, m(T)=1, and translation invariant: ∫Th(x−t) dm(x)=∫Th(u) dm(u) for integrable h. The character ek(x)=e2πikx, the coefficient f^(k)=∫01f(t)e−2πiktdt, the partial sum SNf=∑∣k∣≤Nf^(k)ek, trigonometric polynomials and torus convolution (f∗g)(x)=∫01f(x−t)g(t)dt are defined as in the cited definition, as is ∥f∥p for the normalized measure. Period-one Fourier coefficients, partial sums, and convolution on the torus The one-dimensional torus and its normalized Haar integral

[F2]

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

[F3]

DN=1+2∑k=1Ncos⁡(2πkt) is real, even, continuous and bounded, ∫TDN dm=1, and ∥DN∥1<∞. The Fejer kernel FM=1M+1∑j=0MDj satisfies FM≥0 and ∫TFM dm=1, so ∥FM∥1=1. Dirichlet and Fejer kernels The Fejer kernel is a positive approximate identity

[F4]

For g∈Lp(T;C) and 1≤p<∞ the Cesaro means satisfy σMg=g∗FM, are trigonometric polynomials, and ∥σMg−g∥p→0; hence trigonometric polynomials are dense in Lp(T;C). For a trigonometric polynomial P one has SNP=P whenever N≥deg⁡P. Fejer means converge in L^p for 1 <= p < infinity Cesaro and Abel means of a Fourier series

[F5]

For every 1<p<∞ one has Cp:=sup⁡N≥0∥SN∥Lp→Lp<∞. Uniform Lp bounds for periodic Fourier partial sums

[F6]

For every N≥1, ∥SN:C(T)→C(T)∥=∫T∣DN∣ dm≥13πlog⁡(N+1). Fourier partial-sum operator norm equals the Lebesgue constant

[F7]

For integrable complex h one has ∣∫h dm∣≤∫∣h∣ dm and ∥f+g∥p≤∥f∥p+∥g∥p; Tonelli's theorem applies to nonnegative measurable functions on the finite product T×T. The modulus of an integral is bounded by the integral of the modulus Complex Holder, Minkowski, and the quotient norm Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F8]

For every 1≤p≤∞ the space Lp(T;C) is complete. Complex Lp completeness and almost-everywhere subsequences

[F9]

(Sequential uniform boundedness.) If X is a Banach space, Y a normed space over the same field, and Tk:X→Y, k∈N, are bounded linear maps with ∥Tkx∥≤Mx for every k and every x∈X, then sup⁡k∥Tk∥<∞. Sequential uniform boundedness under countable choice

Proof

technique · direct
1.1F1F2F3F7givenalgebra

For f∈L∞(T;C), the convolution formula [F2] and the integral triangle inequality [F7] give ∣SNf(x)∣≤∫T∣f(x−t)∣ ∣DN(t)∣ dm(t)≤∥f∥∞∥DN∥1 for every x, so SN is bounded on L∞ with ∥SNf∥∞≤∥f∥∞∥DN∥1. For f∈L1(T;C), Tonelli and the translation invariance of [F1] give ∥SNf∥1≤∫T∫T∣f(x−t)∣ ∣DN(t)∣ dm(t)dm(x)=∥f∥1∥DN∥1, so SN is bounded on L1. Both bounds are finite by [F3].

1.2F1F2F3F4algebra

For all M,N≥0 one has SN(FM)=FM∗DN=DN∗FM=σM(DN): the first equality is [F2], the second is the substitution t↦x−t in the absolutely convergent torus convolution, and the third is [F4]. Since ∥FM∥1=1 by [F3], the identity and the Fejer convergence of [F4] give ∥SN(FM)−DN∥1=∥σM(DN)−DN∥1→0 as M→∞.

1.3F2F6algebra

For N≥1, the unit ball of C(T) is contained in the unit ball of L∞(T;C), and for continuous f the partial sum SNf is a trigonometric polynomial, whose essential supremum equals its supremum; hence ∥SN∥L∞→L∞≥∥SN:C(T)→C(T)∥=∫T∣DN∣ dm≥13πlog⁡(N+1) by [F6].

1.4F4F5F7algebra

Let 1<p<∞, f∈Lp(T;C) and ε>0. By [F4] choose a trigonometric polynomial P with ∥f−P∥p<ε/(Cp+2), where Cp is the finite bound of [F5]. For N≥deg⁡P one has SNP=P by [F4], so the triangle inequality [F7] and the bound [F5] give ∥SNf−f∥p≤∥SN(f−P)∥p+∥P−f∥p≤(Cp+1)∥f−P∥p<ε. Hence SNf→f in Lp for every 1<p<∞.

2.1step 1.2F3algebra

For fixed N≥0 and every M≥0, step 1.2 and [F3] give ∥SN(FM)∥1≤∥SN∥1→1∥FM∥1=∥SN∥1→1, while ∥SN(FM)∥1→∥DN∥1; therefore ∥SN∥L1→L1≥∥DN∥1=∫T∣DN∣ dm.

3.1step 1.3step 2.1algebra

By step 1.3 and step 2.1, for every N≥1 both endpoint norms satisfy max⁡(∥SN∥L1→L1,∥SN∥L∞→L∞)≥∫T∣DN∣ dm≥13πlog⁡(N+1), and 13πlog⁡(N+1)→∞. Hence sup⁡N∥SN∥L1→L1=sup⁡N∥SN∥L∞→L∞=∞, which is the norm-growth assertion of part 2.

4.1step 1.1step 3.1F8F9given

Suppose no f∈L1(T;C) failed to converge. Then each f would have sup⁡N∥SNf∥1<∞, and since L1(T;C) is Banach by [F8] and each SN is a bounded linear operator on it by step 1.1, the sequential uniform boundedness principle [F9] would give sup⁡N∥SN∥L1→L1<∞, contradicting step 3.1. Hence there is f∈L1(T;C) with sup⁡N∥SNf∥1=∞; if (SNf) converged to some g in L1, then ∥SNf∥1≤∥g∥1+1 for all large N, a contradiction. So (SNf) does not converge in L1.

4.2step 1.1step 3.1F8F9given

The same argument with L∞(T;C) in place of L1(T;C): each SN is bounded on L∞ by step 1.1, this space is Banach by [F8], and sup⁡N∥SN∥L∞→L∞=∞ by step 3.1, so [F9] supplies g∈L∞(T;C) with sup⁡N∥SNg∥∞=∞, and (SNg) does not converge in L∞.

5.1step 1.4step 4.1step 4.2step 1.3step 2.1∎

Step 1.4 proves part 1, and steps 4.1 and 4.2 together with the norm lower bounds of steps 1.3 and 2.1 prove part 2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

110 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources