Meager sets of periodic functions

Jordan Bell
February 6, 2015

The following is often useful.11 1 Walter Rudin, Real and Complex Analysis, third ed., p. 68, Theorem 3.12.

Theorem 1.

If (X,μ) is a measure space, 1≤p≤∞, and fn∈Lp⁢(μ) is a sequence that converges in Lp⁢(μ) to some f∈Lp⁢(μ), then there is a subsequence of fn that converges pointwise almost everywhere to f.

Proof.

Assume that 1≤p<∞. For each n there is some an such that

∥fan-f∥p<2-n.

Then

∑n=1∞∥fan-f∥pp<∑n=1∞2-n⁢p=2-p1-2-p<∞.

Let ϵ>0. We have

{x∈X:lim supn→∞⁡|fan⁢(x)-f⁢(x)|>ϵ}⊂⋂N=1∞⋃n=N∞{x∈X:|fan⁢(x)-f⁢(x)|>ϵ}.

For any N, this gives, using Chebyshev’s inequality,

μ⁢({x∈X:lim supn→∞⁡|fan⁢(x)-f⁢(x)|>ϵ})≤∑n=N∞μ⁢({x∈X:|fan⁢(x)-f⁢(x)|>ϵ})≤ϵ-p⁢∑n=N∞∥fan-f∥pp.

Because ∑n=1∞∥fan-f∥pp<∞, we have ∑n=N∞∥fan-f∥pp→0 as N→∞, which implies that

μ⁢({x∈X:lim supn→∞⁡|fan⁢(x)-f⁢(x)|>ϵ})=0.

This is true for each ϵ>0, hence

μ⁢({x∈X:lim supn→∞⁡|fan⁢(x)-f⁢(x)|>0})=0,

which means that for almost all x∈X,

limn→∞⁡|fan⁢(x)-f⁢(x)|=0.

Assume that p=∞. Let

Ek={x∈X:|fk⁢(x)|>∥fk∥∞}.

The measure of each of these sets is 0, so for

E=⋃kEk

we have μ⁢(E)=0. For x∉E,

|f⁢(x)-fk⁢(x)|≤∥f-fk∥∞→0,k→∞,

showing that for almost all x∈X, fk⁢(x)→f⁢(x). ∎

The following results are in the pattern of A being a strict subset of X implying that A is meager in X.

We first work out two proofs of the following theorem.

Theorem 2.

For 1<p≤∞, Lp⁢(T) is a meager subset of L1⁢(T).

Proof.

For n≥1, let

Cn={f∈L1⁢(𝕋):∥f∥p≤n}.

Let n≥1. If a sequence fk∈Cn converges in L1⁢(𝕋) to some f∈L1⁢(𝕋), then there is a subsequence fak of fk such that for almost all x∈𝕋, fak⁢(x)→f⁢(x), and so fak⁢(x)p→f⁢(x)p. Applying the dominated convergence theorem gives

12⁢π⁢∫𝕋|f⁢(x)|p⁢𝑑x=limk→∞⁡12⁢π⁢∫𝕋|fak⁢(x)|p⁢𝑑x=limk→∞⁡∥fak∥pp≤np,

hence ∥f∥p≤n, showing that f∈Cn. Therefore, Cn is a closed subset of L1⁢(𝕋) On the other hand, let f∈Cn and let g∈L1⁢(𝕋)∖Lp⁢(𝕋). Then f+1k⁢g→f in L1⁢(𝕋), and for each k we have f+1k⁢g∉Cn, as that would imply g∈Lp⁢(𝕋). This shows that f does not belong to the interior of Cn. Because Cn is closed and has empty interior, it is nowhere dense. Therefore

Lp⁢(𝕋)=⋃n=1∞{f∈L1⁢(𝕋):∥f∥p≤n}

is meager in L1⁢(𝕋). ∎

Proof.

The open mapping theorem tells us that if X is an F-space, Y is a topological vector space, Λ:X→Y is continuous and linear, and Λ⁢(X) is not meager in Y, then Λ⁢(X)=Y, Λ is an open mapping, and Y is an F-space.22 2 Walter Rudin, Functional Analysis, second ed., p. 48, Theorem 2.11.

Let j:Lp⁢(𝕋)→L1⁢(𝕋) be the inclusion map. For f∈Lp⁢(𝕋),

∥j⁢(f)∥1=∥f∥1≤∥f∥p,

showing that the inclusion map is continuous. On the other hand, j is not onto, so the open mapping theorem tells us that j⁢(Lp⁢(𝕋))=Lp⁢(𝕋) is meager in L1⁢(𝕋). ∎

Suppose that X is a topological vector space, that Y is an F-space, and that Λn is a sequence of continuous linear maps X→Y. Let L be the set of those x∈X such that

Λ⁢x=limn→∞⁡Λn⁢x

exists. It is a consequence of the uniform boundedness principle that if L is not meager in X, then L=X and Λ:X→Y is continuous.33 3 Walter Rudin, Functional Analysis, second ed., p. 45, Theorem 2.7.

For n≥1, define Λn:L2⁢(𝕋)→ℂ by

Λn⁢f=∑|k|≤nf^⁢(k),f∈L1⁢(𝕋).

Define

L={f∈L2⁢(𝕋):limn→∞⁡Λn⁢f exists}.

The sequence t↦∑k=1nei⁢k⁢tk is a Cauchy sequence in L2⁢(𝕋), hence converges to some f∈L2⁢(𝕋), which satisfies

f^⁢(k)={1kk≥10k≤0.

Then

Λn⁢f=∑k=1n1k→∞,n→∞,

meaning that f∈L2⁢(𝕋)∖L. This shows that L≠L2⁢(𝕋). Therefore, the above consequence of the uniform boundedness principle tells us that L is meager.