Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-24 (gpt-6-sol)
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.

L-p convergence of a lacunary series is equivalent to ell-two coefficients

Statement

Assume the Axiom of Choice. For a q-Hadamard-lacunary sequence and coefficients (aj), the partial sums of ∑j≥1ajeλj converge in Lp(T) if and only if (aj)∈ℓ2, for every 1≤p<∞. For 0<p<1, they converge if and only if (aj)∈ℓ2 in the complete metric dp of The Lp distance for 0<p<1 is a complete translation-invariant metric. Completeness above one is supplied by Riesz-Fischer completeness of Lp for 1≤p≤∞, and the finite estimate is L-p norm equivalence for finite Hadamard-lacunary sums.

Facts & Assumptions

Given: The Axiom of Choice and p,q,(λj) and (aj) as in the Statement.

[A1]

AC is used through the two completeness suppliers [F2] in step 2.1.

[F1]

The two-sided finite lacunary estimate holds uniformly over finite coefficient sets (L-p norm equivalence for finite Hadamard-lacunary sums).

[F2]

Under the Axiom of Choice, Lp is complete for 1≤p<∞ (Riesz-Fischer completeness of Lp for 1≤p≤∞), and dp is complete for 0<p<1 (The Lp distance for 0<p<1 is a complete translation-invariant metric).

Proof

technique · apply the finite estimate to tails and use completeness
1.1F1givenalgebra

If (aj)∈ℓ2, its coefficient tails tend to zero. Apply the upper bound in [F1] to each difference Sm−Sn of partial sums. The differences tend to zero in the Lp norm for p≥1 and in the metric dp for 0<p<1, since dp(Sm,Sn)=∥Sm−Sn∥pp.

2.1F2step 1.1

By [F2], these Cauchy sequences have limits in their respective spaces.

3.1F1step 1.1step 2.1algebra∎

Conversely, convergence makes the partial sums Cauchy in the relevant norm or metric. The lower bound in [F1] applied to every Sm−Sn forces ∑n<j≤m∣aj∣2→0 uniformly as m>n→∞; in the metric case take the p-th root first. The nonnegative partial sums ∑j≤n∣aj∣2 are then Cauchy and converge, so (aj)∈ℓ2. This proves both implications.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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