The theorem of F. and M. Riesz

Jordan Bell
July 1, 2014

1 Totally ordered groups

Suppose that G is a locally compact abelian group and that P⊂G is a semigroup (satisfies P+P⊂P) that is closed and satisfies P∩(-P)={0} and P∪(-P)=G. We define a total order on G by x≤y when y-x∈P. We verify that this is indeed a total order. (We remark that nowhere in this do we show the significance of P being closed; but in this note we shall be speaking about discrete abelian groups where any set is closed.)

If x≤y and y≤z, then y-x∈P and z-y∈P and hence z-x=(z-y)+(y-x)∈P+P⊂P, showing that x≤z, so ≤ is transitive. If x≤y and y≤x then y-x∈P and x-y∈P, the latter of which is equivalent to y-x=-(x-y)∈-P, hence y-x∈P∩(-P), and then P∩(-P)={0} implies that y-x=0, i.e. x=y, so ≤ is antisymmetric. If x,y∈P then y-x is either 0, in which case x=y, or it is contained in one and only one of P and -P, and then respectively x<y or y<x, showing that ≤ is total.

Moreover, the total order ≤ induced by the semigroup P is compatible with the group operation in G: if x≤y and z∈G, then (y+z)-(x+z)=y-x∈P, showing that x+z≤y+z.

We say that G with the total order induced by P is a totally ordered group. We shall use the following lemma in the next section.11 1 Walter Rudin, Fourier Analysis on Groups, p. 194, Theorem 8.1.2.

Lemma 1.

Suppose that Γ is a discrete abelian group. Γ can be totally ordered if and only if γ∈Γ having finite order implies that γ=0.

2 Functions of analytic type

If G is a compact abelian group, then G is connected if and only if γ∈G^ having finite order implies that γ=0.22 2 Walter Rudin, Fourier Analysis on Groups, p. 47, Theorem 2.5.6. Combined with Lemma 1, we get that a compact abelian group is connected if and only if its dual group can be ordered.

Suppose in the rest of this section that G is a connected compact abelian group, and let ≤ be a total order on G^ induced by some semigroup. We say that a function f∈L1⁢(G) is of analytic type if γ<0 implies that f^⁢(γ)=0, and we say that a measure μ∈M⁢(G) is of analytic type if γ<0 implies that μ^⁢(γ)=0. (We denote by M⁢(G) the set of regular complex Borel measures on G.) For 1≤p≤∞, we denote by Hp⁢(G) those elements of Lp⁢(G) that are of analytic type. We emphasize that the notion of a function or measure being of analytic type depends on the total order ≤ on G^.

We remind ourselves that when ℳ is a σ-algebra on a set X and μ is a measure on ℳ, if A∈ℳ and μ⁢(E)=μ⁢(A∩E) for all E∈ℳ then we say that μ is concentrated on A. Measures λ,μ on ℳ are said to be mutually singular if they are concentrated on disjoint sets.

Let m be the Haar measure on G such that m⁢(G)=1, and suppose that σ is a positive element of M⁢(G). The Lebesgue decomposition tells us that there is a unique pair of finite Borel measures σs and σa on G such that (i) σ=σs+σa, (ii) σa is absolutely continuous with respect to m, and (iii) σs and m are mutually singular. Then the Radon-Nikodym theorem tells us that there is a unique nonnegative w∈L1⁢(m) such that d⁢σa=w⁢d⁢m. Thus,

d⁢σ=d⁢σs+w⁢d⁢m.

We define Ω to be the set of all trigonometric polynomials Q on G such that Q^⁢(γ)=0 for γ≤0. We also define K={1+Q:Q∈Ω}. K⊂L2⁢(σ), and we denote by K¯ its closure in the Hilbert space L2⁢(σ).

Lemma 2.

K¯ is a convex set.

Proof.

Let f,g∈K be distinct and let 0≤t≤1. There are Pn,Qn∈Ω such that 1+Pn→f and 1+Qn→g, and

(1-t)⁢f+t⁢g=limn→∞⁡((1-t)⁢(1+Pn)+t⁢(1+Qn))=limn→∞⁡(1+(1-t)⁢Pn+t⁢Qn).

For each n, (1-t)⁢Pn+t⁢Qn∈Ω, so we have written (1-t)⁢f+t⁢g as a limit of elements of K, showing that (1-t)⁢f+t⁢g∈K¯ and hence that K¯ is convex. ∎

As K¯ is a closed convex set in the Hilbert space L2⁢(σ), there is a unique ϕ∈K¯ such that d⁢(0,K¯)=∥0-ϕ∥ (namely, that attains the infimum of the distance of elements of K¯ to the origin), which we can write as

∥ϕ∥=infQ∈Ω⁡∥1+Q∥.

ϕ is the unique element of K¯ such that

⟨ϕ,ψ-ϕ⟩=0,ψ∈K¯.

The following lemma establishes properties of ϕ.33 3 Walter Rudin, Fourier Analysis on Groups, p. 199, Lemma 8.2.2.

Lemma 3.
  1. 1.

    ϕ=0 almost everywhere with respect to σs.

  2. 2.

    ϕ⁢w∈L2⁢(m) and |ϕ|2⁢w=∥ϕ∥2 almost everywhere with respect to m.

  3. 3.

    If ∥ϕ∥>0 and h=1ϕ, then h∈H2⁢(m) and h^⁢(0)=1.

Proof.

We write c=∥ϕ∥. Let 1+Qn∈K such that 1+Qn→ϕ. If g∈L2⁢(σ) and ϕ+g∈K¯, then ⟨ϕ,(ϕ+g)-ϕ⟩=0, i.e. ⟨ϕ,g⟩=0. Let γ>0. On the one hand, γ∈Ω so ϕ+γ=limn→∞⁡1+(Qn+γ)∈K¯, hence ⟨ϕ,γ⟩=0 and so ⟨γ,ϕ⟩=0. On the other hand, define g=ϕ⁢γ, which satisfies

ϕ+g=ϕ⁢(1+γ)=limn→∞⁡(1+Qn)⁢(1+γ)=limn→∞⁡1+γ+Qn+Qn⁢γ,

and because γ>0, each term of γ+Qn+Qn⁢γ belongs to Ω, showing that ϕ+g∈K¯, from which we get ⟨ϕ,g⟩=0 and so ⟨g,ϕ⟩=0. We have proved that

∫G⟨x,γ⟩⁢ϕ⁢(x)¯⁢𝑑σ⁢(x)=0,γ>0, (1)

and

∫G⟨x,γ⟩⁢|ϕ⁢(x)|2⁢𝑑σ⁢(x)=0,γ>0. (2)

Taking the complex conjugate of (2) gives

∫G⟨x,γ⟩⁢|ϕ⁢(x)|2⁢𝑑σ⁢(x)=0,γ<0.

Defining d⁢λ=|ϕ|2⁢d⁢σ we have λ∈M⁢(G). The above and (2) give

λ^⁢(γ)=0,γ≠0.

As well,

λ^⁢(0)=∫G|ϕ|2⁢𝑑σ=c2.

Because λ∈M⁢(G) and λ^∈L1⁢(G^), there is some f∈L1⁢(G) such that d⁢λ=f⁢d⁢m, defined by

f⁢(x)=∫G^λ^⁢(γ)⁢⟨x,γ⟩⁢𝑑mG^⁢(γ),γ∈G^,

where mG^ is the Haar measure on G^ that assigns measure 1 to each singleton.44 4 Walter Rudin, Fourier Analysis on Groups, p. 30. That is, d⁢λ=f⁢d⁢m where f⁢(x)=c2⁢mG^⁢({0})=c2, hence d⁢λ=c2⁢d⁢m. Combined with d⁢λ=|ϕ|2⁢d⁢σ we get

|ϕ|2⁢d⁢σ=c2⁢d⁢m.

Therefore |ϕ|2⁢d⁢σ is absolutely continuous with respect to m, and because |ϕ|2⁢d⁢σ=|ϕ|2⁢d⁢σs+|ϕ|2⁢w⁢d⁢m, it follows that |ϕ|2⁢d⁢σs=0, that is, that ϕ⁢(x)=0 for σs-almost all x∈G, proving the first claim. Furthermore, |ϕ|2⁢d⁢σ=|ϕ|2⁢w⁢d⁢m and using |ϕ|2⁢d⁢σ=c2⁢d⁢m we get |ϕ⁢(x)|2⁢w⁢(x)=c2 for m-almost all x∈G. Because w∈L1⁢(m) and |ϕ⁢w|2=c2⁢w, we get ϕ⁢w∈L2⁢(m), proving the second claim.

So far we have not supposed that c>0. If indeed c>0, then |h|2=|ϕ|-2=c-2⁢w, giving h∈L2⁢(m). For γ∈G^,

∫Gh⁢(x)⁢⟨x,γ⟩⁢𝑑m⁢(x) = ∫G|ϕ⁢(x)|-2⁢ϕ⁢(x)¯⁢⟨x,γ⟩⁢𝑑m⁢(x)
= c-2⁢∫G⟨x,γ⟩⁢ϕ⁢(x)¯⁢w⁢(x)⁢𝑑m⁢(x)
= c-2⁢∫G⟨x,γ⟩⁢ϕ⁢(x)¯⁢𝑑σ⁢(x).

This and (1) yield

∫Gh⁢(x)⁢⟨x,γ⟩⁢𝑑m⁢(x)=0,γ>0,

in other words,

h^⁢(γ)=0,γ<0,

namely, h is of analytic type, i.e. h∈H2⁢(m). Moreover, for each n∈ℕ we check that Qn+ϕ∈K¯ and hence that ⟨1+Qn,ϕ⟩=⟨1,ϕ⟩, giving

c2⁢h^⁢(0)=∫Gϕ¯⁢𝑑σ=∫G(1+Qn)⁢ϕ¯⁢𝑑σ.

This is true for all n∈ℕ, so we obtain

c2⁢h^⁢(0)=∫G|ϕ|2⁢𝑑σ=∥ϕ∥2=c2,

i.e. h^⁢(0)=1, proving the third claim. ∎

The above lemma is used to prove the following theorem.55 5 Walter Rudin, Fourier Analysis on Groups, p. 200, Theorem 8.2.3. The proof of this theorem in Rudin is not long, but I don’t understand the first step in his proof so I have not attempted to write it out.

Theorem 4.

Suppose that G is a connected compact abelian group and that μ∈M⁢(G) is of analytic type. If the Lebesgue decomposition of μ is

d⁢μ=d⁢μs+f⁢d⁢m,

where μs and m are mutually singular and f∈L1⁢(m), then μs∈M⁢(G) is of analytic type and f is of analytic type, and μ^s⁢(0)=0.

3 The theorem of F. and M. Riesz

We are now equipped to prove the theorem of F. and M. Riesz.66 6 Walter Rudin, Fourier Analysis on Groups, p. 201, §8.2.4.

Theorem 5 (F. and M. Riesz).

If μ∈M⁢(T) and μ^⁢(n)=0 for every negative integer n, then μ is absolutely continuous with respect to Haar measure.

Proof.

Write d⁢μ=d⁢μs+f⁢d⁢m, where μs and m are mutually singular and f∈L1⁢(m). Theorem 4 tells us that μs is of analytic type, i.e. μ^s⁢(n)=0 for n<0, and that μ^s⁢(0)=0. Therefore, if μs≠0 then there is a minimal positive integer n0 for which μ^s⁢(n0)≠0. Defining λ^⁢(n)=μ^s⁢(n0+n), we get that λ∈M⁢(𝕋) and that λ and m are mutually singular. But λ^⁢(n)=μ^s⁢(n0+n)=0 for n<0, so λ is of analytic type, and therefore Theorem 4 says that μ^s⁢(n0)=λ^⁢(0)=0 (because λ and m are mutually singular), a contradiction. Hence μ^s⁢(n)=0 for all n∈ℤ, which implies that μs=0. But this means that μ is absolutely continuous with respect to m, completing the proof. ∎