This paper investigates the size and structure of topologically invariant means on function spaces related to locally compact groups, proving new results about their cardinality and convergence properties using ultrafilter theory.
Contribution
It introduces a unified approach to analyze invariant means on $L_ ext{infty}(G)$ and $VN(G)$, proving the existence of orthogonal nets converging to invariance and confirming Paterson's conjecture.
Findings
01
Cardinality of invariant means is maximally large, as determined by ultrafilter theory.
02
Existence of orthogonal nets in $L_1(G)$ and $A(G)$ converging to invariance.
03
Proof of Paterson's conjecture relating invariant means to conjugacy class precompactness.
Abstract
In 1970, Chou showed there are ∣N∗∣=22N topologically invariant means on L∞(G) for any noncompact, σ-compact amenable group. Over the following 25 years, the sizes of the sets of topologically invariant means on L∞(G) and VN(G) were determined for any locally compact group. Each paper on a new case reached the same conclusion -- "the cardinality is as large as possible" -- but a unified proof never emerged. In this paper, I show L1(G) and A(G) always contain orthogonal nets converging to invariance. An orthogonal net indexed by Γ has ∣Γ∗∣ accumulation points, where ∣Γ∗∣ is determined by ultrafilter theory. Among a smattering of other results, I prove Paterson's conjecture that left and right topologically invariant means on L∞(G) coincide iff G has precompact conjugacy classes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Counting topologically invariant means on L∞(G) and VN(G) with ultrafilters
John Hopfensperger
Department of Mathematics, University at Buffalo,
Buffalo, NY 14260-2900, USA
In 1970, Chou showed there are ∣N∗∣=22N topologically invariant means on L∞(G) for any noncompact, σ-compact amenable group.
Over the following 25 years, the sizes of the sets of topologically invariant means on L∞(G) and VN(G) were determined for any locally compact group.
Each paper on a new case reached the same conclusion – “the cardinality is as large as possible” – but a unified proof never emerged.
In this paper, I show L1(G) and A(G) always contain orthogonal nets converging to invariance.
An orthogonal net indexed by Γ has ∣Γ∗∣ accumulation points, where ∣Γ∗∣ is determined by ultrafilter theory.
Among a smattering of other results, I prove Paterson’s conjecture that left and right topologically invariant means on L∞(G) coincide iff G has precompact conjugacy classes.
Key words and phrases:
Amenable groups; Invariant means; FC groups; Fourier algebras; Ultrafilters; Cardinality
The present paper will form part of the author’s PhD thesis under supervision of Ching Chou.
Chapter 1 Background
1. History
1.1**.**
Følner’s condition for amenable discrete groups says,
for all finite K⊂G and ϵ>0 there exists finite F(K,ϵ)⊂G which is (K,ϵ)-invariant.
The set Γ of all ordered pairs γ=(K,ϵ) is a directed set, ordered by increasing K and decreasing ϵ.
Define mγ∈ℓ∞∗(G) by mγ(f)=∣Fγ∣1∑x∈Fγf(x).
Then the net {mγ}γ∈Γ converges to invariance, and any limit point is an invariant mean on ℓ∞(G).
The analogue of Følner’s condition for locally compact amenable groups says,
for all compact K⊂G and ϵ>0, there exists compact F⊂G which is (K,ϵ)-invariant.
The analogous definition of mγ∈L∞∗(G) is mγ(f)=∣Fγ∣1∫Fγf(x)dx.
If m is any limit point of {mγ}γ∈Γ, it is not only invariant but topologically invariant.
That is, m(ϕ)=m(f∗ϕ) for any ϕ∈L∞(G) and f∈L1(G) with ∥f∥1=∫Gf=1.
1.2**.**
Non-topologically invariant means are harder to come by.
All invariant means on a discrete group are topologically invariant, and
it was not until 1972 that [Rud72] and [Gra73] independently discovered a construction of non-topologically invariant means for any non-discrete G that is amenable-as-discrete.
Several papers have discussed the implications of this construction.
Notably, [Ros76] combined it with a Baire category argument to construct 22N invariant means that are not topologically invariant.
The general problem of enumerating non-topologically invariant means seems intractable.
For instance, the famously difficult Banach-Ruziewicz problem boils down to whether SO(n,R) admits any non-topologically invariant means, c.f. [CLR85, Proposition 1.3].
1.3**.**
Let TLIM(G) denote the topologically left-invariant means on L∞(G), and TIM(G) the (two-sided) topologically invariant means.
In [Pat79], Paterson conjectured that TLIM(G)=TIM(G) iff G has precompact conjugacy classes, and proved it assuming G is compactly generated.
The short and insightful paper [Mil81] proved Paterson’s conjecture assuming G is σ-compact, and gave me the ideas to prove it in full generality.
1.4**.**
For any set S, let ∣S∣ denote its cardinal number – that is, the first ordinal α such that there exists a bijection from α to S.
(There exists an ordinal of each cardinality by the axiom of choice.)
By definition, an ordinal is the set of all previous ordinals.
Thus the cardinal usually called ℵ0 is none other than N={0,1,…}.
1.5**.**
Let κ=κ(G) be the first ordinal such that there is a family K of compact subsets of G with ∣K∣=κ and G=⋃K.
It’s not hard to prove ∣TIM(G)∣≤∣TLIM(G)∣≤22κ.
Of course when κ=1, the unique topologically invariant mean is Haar measure.
But when κ≥N, ∣TIM(G)∣ actually equals 22κ.
Here is an abbreviated history of this surprising result, which took almost 20 years to establish:
When κ=N, [Cho70] defined π:L∞(G)→ℓ∞(N) by π(f)(n)=∣Un∣1∫Unf, where {Un} is a Følner sequence of mutually disjoint sets.
Thus π∗:ℓ∞∗(N)→L∞∗(G) is an embedding.
Let c0={f∈ℓ∞(N):limnf(n)=0} and F={m∈ℓ∞∗(N):∥m∥=1,m≥0,m∣c0≡0}, so that π∗[F]⊂TLIM(G).
Regarding the nonprincipal ultrafilters on N as elements of F, we see ∣TLIM(G)∣≥∣βN−N∣=22N.
When G is discrete and κ≥N, [Cho76] proved ∣TIM(G)∣≥22κ.
When G is non-discrete and κ≥N, [LP86] proved ∣TLIM(G)∣≥22κ.
These papers take the more direct approach of constructing disjoint, translation-invariant subsets of βG.
The full result ∣TIM(G)∣≥22κ was finally proved by [Yan88].
Yang realized that the trick to generalizing Chou’s embedding argument is to replace N by the indexing set of a Følner net.
1.6**.**
When G is discrete abelian, κ(G)=1 and Haar measure is the unique topologically invariant mean on L∞(G).
More generally, let μ=μ(G) be the first ordinal such that G has a neighborhood basis U at the origin with ∣U∣=μ.
When G is abelian, κ(G)=μ(G) by [HR79, (24.48)].
Thus when G is non-discrete abelian, κ(G)≥N and ∣TIM(G)∣=22μ.
When G is non-abelian, the group von Neumann algebra VN(G) is the natural analogue of L∞(G).
If TIM(G) denotes the set of topologically invariant means on VN(G), then the analogous results hold:
When μ=1, TIM(G) is the singleton comprising the point-measure δe, as proved by [Ren72].
When μ≥N, ∣TIM(G)∣=22μ.
This is proved by [Cho82] when μ=N, using an embedding π∗:ℓ∞∗(N)→VN(G)∗,
and by [Hu95] when μ>N, using a family {πγ∗:ℓ∞∗(μ)→VN(G)∗}γ<μ of embeddings!
2. Ultrafilters
The following exposition is sparse. For more details, see [HS12, Chapter 3].
2.1**.**
Suppose {xγ}={xγ}γ∈Γ is an infinite subset of the compact Hausdorff space X.
Obviously {xγ} has limit points in X, but how do we “name” them?
Regarding Γ as a discrete topological space, let f:Γ→X be the continuous function γ↦xγ.
Let f~:βΓ→X be the unique continuous extension of f to the Stone-Čech compactification of Γ.
Since f~[βΓ] is compact and has f[Γ] as a dense subset,
the limit points of {xγ} are precisely the points f~(p) with p∈βΓ.
We usually write p-limγxγ instead of f~(p).
2.2**.**
In functional analysis, the Stone-Čech compactification βΓ of a completely regular space Γ is realized as the Gelfand spectrum of the Banach algebra C(Γ).
In particular, suppose Γ is discrete, and p∈βΓ is a nonzero multiplicative functional on C(Γ)=ℓ∞(Γ).
For any S⊂Γ, we have ⟨p,1S⟩=⟨p,1S⋅1S⟩=⟨p,1S⟩2.
Thus p may be regarded as a {0,1}-valued measure on Γ.
But, by definition, an ultrafilter on Γ is nothing more than a set of the form {S⊂Γ:p(S)=1} where p is a nonzero {0,1}-valued measure.
(Equivalently, it is a maximal collection of subsets of Γ that is closed under finite intersections and does not contain ∅.)
In this way, the combinatoric construction of βΓ as the set of all ultrafilters on Γ is identical to the Gelfand spectrum construction.
2.3**.**
In functional analysis, we embed Γ in βΓ by sending γ to the point-measure δγ, which corresponds to the principal ultrafilter pγ={S⊂Γ:γ∈S}.
The defining feature of a principal ultrafilter is that its smallest element has cardinality 1.
For any cardinal κ, we can define the κ-uniform ultrafilters as those whose smallest elements have cardinality κ.
As we shall see, there are 22∣Γ∣∣Γ∣-uniform ultrafilters on Γ.
Of course, since βΓ⊂P(P(Γ)), there can’t be more than 22∣Γ∣ ultrafilters in total.
2.4**.**
Consider the case when Γ is a directed set.
Let Γ∗ denote the set of ultrafilters in βΓ that include every tail Tα={γ∈Γ:γ>α},
and suppose ∣Tα∣=∣Γ∣=κ for each α∈Γ.
Notice that any finite intersection Tγ1∩…∩Tγn contains Tα, where α≥γ1,…,γn, hence ∣Tγ1∩…∩Tγn∣=κ.
Lemma 2.5**.**
Γ∗ has cardinality 22κ, the same as βΓ.
Proof.
This follows immediately from [HS12, Theorem 3.62], which actually says something a bit stronger:
Let Γ be an infinite set with cardinality κ, and let T be a collection of at most κ subsets of Γ such that ∣⋂F∣=κ for any finite F⊂T.
Then there are 22κκ-uniform ultrafilters containing T.
∎
3. Projections and Means
3.1**.**
A positive unital functional on a von Neumann algebra X is called a state.
A state u is called normal if ⟨u,supαPα⟩=supα⟨u,Pα⟩ for any family {Pα}⊂X of (orthogonal) projections.
Let P1 denote the set of normal states on X.
Sakai famously proved that the linear span of P1 forms the predual of X – that is, span(P1)∗=X.
For each u∈P1, we can define a projection S(u) called the support of u, which is the inf of all projections P such that ⟨P,u⟩=⟨I,u⟩=1.
Now u,v∈P1 are called orthogonal if S(u)S(v)=0.
Lemma 3.2**.**
Suppose {uγ}γ∈Γ⊂P1 are mutually orthogonal.
In other words, S(uγ)S(uβ)=0 when γ=β.
Then the map βΓ→X∗ given by p↦p-limγuγ is one-to-one.
Proof.
Suppose p,q are distinct ultrafilters, say E∈p and EC∈q.
Let P=supγ∈ES(uγ).
Clearly ⟨p-limγuγ,P⟩=1.
For any β∈EC, P≤1−S(uβ), hence ⟨uβ,P⟩=0, hence ⟨q-limγuγ,P⟩=0.
∎
3.3**.**
For example, L∞(G) is a von Neumann algebra of multipliers on L2(G), and its predual is L1(G).
Let P1(G) denote the normal states on L∞(G).
By Sakai’s result, the linear span of P1(G) is L1(G),
so P1(G) itself must be {f∈L1(G):f≥0,∥f∥1=1}.
Given f∈P1(G), let supp(f)={x∈G:f(x)=0}.
Clearly S(f) is the indicator function 1supp(f).
From this, we conclude f,g∈P1(G) are orthogonal if supp(f)∩supp(g)=∅.
3.4**.**
Let X be any von Neumann algebra.
Endow X∗ with the w∗-topology,
and let M⊂X∗ be the set of all states.
In the context of amenability, M is traditionally called the set of means on X.
Notice ∥m∥=1 for each m∈M, since T≤∥T∥I for any self-adjoint T.
Notice P1 is convex and M is compact convex.
Lemma 3.5** (Hahn-Banach).**
Suppose A,B⊂X∗ are disjoint compact convex sets.
Then they are separated by some T∈X, in the sense
infa∈Aℜ⟨a,T⟩>supb∈Bℜ⟨b,T⟩.
If A,B consist of positive functionals, decompose T into self-adjoint parts as T1+iT2.
Then infa∈A⟨a,T1⟩>supb∈B⟨b,T1⟩.
Proof.
See any text on functional analysis, for example [Rud91, Theorems 3.4 and 3.10].
∎
Lemma 3.6**.**
P1 is dense in M.
Proof.
Suppose to the contrary that a mean m lies outside cℓ(P1).
Applying Lemma 3.5 to the sets {m} and cℓ(P1), obtain self-adjoint T∈X such that
⟨m,T⟩>supu∈P1⟨u,T⟩.
Letting S=T+∥T∥I≥0, we have ⟨m,S⟩>supu∈P1⟨u,S⟩=∥S∥,
contradicting ∥m∥=1.
∎
Chapter 2 Topologically Invariant Means on L∞(G)
4. TI-nets in P1(G)
4.1**.**
In previous sections, ∣E∣ has denoted the cardinal number of E.
But when E⊂G, ∣E∣ is understood to denote its left Haar measure.
Integrals are always taken with respect to left Haar measure.
The modular function △:G→R× is a continuous homomorphism defined by ∣Ut∣=∣U∣△(t).
The map f↦f† defined by f†(x)=f(x−1)△(x−1) is an involution of L1(G) that sends P1(G) to itself.
Left and right translation are defined by ltf(x)=f(t−1x) and rtf(x)=f(xt), so that lxy=lxly and rxy=rxry.
Additionally, we define Rtf(x)=f(xt−1)△(t−1), so that Rt∣U∣1U=∣Ut∣1Ut.
Notice Rxy=RyRx.
4.2**.**
For T∈L∞(G) and f,g∈L1(G), define fT by ⟨fT,g⟩=⟨T,f∗g⟩,
and Tf by ⟨Tf,g⟩=⟨T,g∗f⟩.
Equivalently, fT(t)=⟨Rtf,T⟩, and Tf(t)=⟨ltf,T⟩.
A mean m is said to be topologically left invariant if ⟨m,fT⟩=⟨m,T⟩ for all f∈P1(G) and T∈L∞(G).
(This is equivalent to the traditional definition, ⟨m,f∗T⟩=⟨m,T⟩.)
Likewise, m is topologically right invariant if ⟨m,Tf⟩=⟨m,T⟩, and topologically two-sided invariant if it is both of the above.
The sets of topologically left/right/two-sided invariant means on L∞(G) are denoted TLIM(G)/TRIM(G)/TIM(G).
4.3**.**
A net {fγ}⊂P1(G) is called a weak left TI-net if ⟨g∗fγ−fγ,T⟩→0 for all g∈P1(G) and T∈L∞(G).
By Lemma 3.6, topologically left invariant means are precisely the limit points of weak left TI-nets.
{fγ} is simply called a left TI-net if ∥g∗fγ−fγ∥1→0 for all g∈P1(G).
The method of [RW01] can be used to construct weak TI-nets that are not TI-nets, which makes Corollary 4.7 interesting.
The analogous definitions and statements for right/two-sided TI-nets are obvious.
4.4**.**
As in 1.5, suppose K is a collection of compact sets covering G with ∣K∣=κ.
Let K′ be the set of all finite unions in K.
Pick any compact U⊂G with nonempty interior.
Then K′′={UK:K∈K′} is a collection of compact sets satisfying:
(1) ∣K′′∣=κ.
(2) K′′ is closed under finite unions.
(3) ⋃K∈K′′K∘=G.
Hence there is no loss of generality in supposing K itself satisfies (1)-(3).
It follows that every compact C⊂G is contained in some K∈K.
4.5**.**
Suppose G is noncompact amenable.
Let Γ={(K,n):K∈K,n∈N}.
Følner’s condition says that for each γ=(K,n), we can pick a compact set Fγ that is (K,n1)-left-invariant.
In other words, letting λγ=∣Fγ∣1Fγ,
we have
∥lxλγ−λγ∥1<n1 for each x∈K.
Now Γ becomes a directed set when endowed with the following partial-order:
[(K,m)⪯(J,n)]⟺[K⊆J and m≤n].
By condition (2) above, notice that each tail of Γ has cardinality κ⋅N=κ=∣Γ∣, as required by Lemma 2.5.
Lemma 4.6**.**
{λγ} is a left TI-net.
Proof.
Pick f∈P1(G).
Since compactly supported functions are dense in P1(G), we may suppose f has compact support C.
Pick K∈K containing C.
In particular, ∥f∗λγ−λγ∥1<1/n whenever γ⪰(K,n).
∎
Corollary 4.7**.**
Every topologically left invariant mean is the limit of a left TI-net.
(Likewise for right/two-sided invariant means, although we omit the proof for those cases.)
Proof.
Suppose m is not the limit of any left TI-net.
Then there exist T1,…,Tn∈L∞(G), f∈P1(G), and ϵ>0
such that for any g∈P1(G) with ∥f∗g−g∥1<ϵ, maxi=1…n∣⟨m−g,Ti⟩∣>ϵ.
Let γ be large enough that ∥f∗λγ−λγ∥1<ϵ, and let λ=λγ.
By Lemma 3.6, pick g∈P1(G) with maxi=1…n∣⟨m−g,Ti⟩∣<ϵ and maxi=1…n∣⟨m−g,λTi⟩∣<ϵ.
Now ∥f∗(λ∗g)−(λ∗g)∥1<ϵ,
so by hypothesis ∣⟨m−λ∗g,Ti⟩∣>ϵ for some i.
But by choice of g, ∣⟨m−λ∗g,Ti⟩∣=∣⟨m,Ti⟩−⟨g,λTi⟩∣=∣⟨m−g,λTi⟩∣<ϵ, a contradiction.
∎
Corollary 4.8**.**
Let ργ=λγ†. Then {ργ} is a right TI-net.
Proof.
For any f∈P1(G), ∥ργ∗f−ργ∥1=∥f†∗λγ−λγ∥1→0.
∎
Lemma 4.9**.**
If {fγ} is a left TI-net, and {gγ} is a right TI-net, then {fγ∗gγ} is a two-sided TI-net.
Proof.
First of all, fγ∗gγ≥0 and ∥fγ∗gγ∥1=1, so {fγ∗gγ}⊂P1(G).
Now for each h∈P1(G), ∥h∗fγ∗gγ−fγ∗gγ∥≤∥h∗fγ−fγ∥⋅∥gγ∥→0
and ∥fγ∗gγ∗h−fγ∗gγ∥≤∥fγ∥⋅∥gγ∗h−gγ∥→0.
∎
4.10**.**
The next lemma generalizes [Cho70, Theorem 3.2].
Intuitively it says, “we can prove facts about the entire set TLIM(G), simply by proving them about the right-translates of a single left TI-net.”
After that, we have generalizations to TRIM(G) and TIM(G).
Lemma 4.11**.**
For any p∈Γ∗,
let Xp={p-limγ[Rtγλγ]:{tγ}∈GΓ}.
Then cℓ(conv(Xp))=TLIM(G).
Proof.
Suppose m∈TLIM(G) lies outside the closed convex hull of Xp.
As in the proof of Lemma 3.6,
there exists T∈L∞(G,R) with ⟨m,T⟩>supν∈Xp⟨ν,T⟩.
For each γ,
⟨m,T⟩=⟨m,λγT⟩≤∥λγT∥∞=supt[λγT(t)]=supt⟨Rtλγ,T⟩.
In particular, if γ=(K,n), choose tγ so that
⟨m,T⟩<⟨Rtγλγ,T⟩+1/n.
Now ⟨m,T⟩≤⟨p-limγ[Rtγλγ],T⟩, contradicting our choice of m.
∎
Lemma 4.12**.**
For any p∈Γ∗,
let Xp={p-limγ[ltγργ]:{tγ}∈GΓ}.
Then cℓ(conv(Xp))=TRIM(G).
Proof.
Essentially the same as the proof of Lemma 4.11 but the third line becomes:
For each γ,
⟨m,T⟩=⟨m,Tργ⟩≤∥Tργ∥∞=supt[Tργ(t)]=supt⟨ltργ,T⟩.
∎
Lemma 4.13**.**
For any p∈Γ∗,
let Xp={p-limγ[λγ∗(ltγργ)]:{tγ}∈GΓ}.
Then cℓ(conv(Xp))=TIM(G).
Proof.
Essentially the same as the proof of Lemma 4.11 but the third line becomes:
For each γ,
⟨m,T⟩=⟨m,λγTργ⟩≤∥λγTργ∥∞=supt[λγTργ(t)]=supt⟨λγ∗(ltργ),T⟩.
∎
Lemma 4.14**.**
There exists {tγ}∈GΓ such that {FγtγFγ−1} are mutually disjoint.
Since supp(λγ∗(ltργ))⊂FγtFγ−1, it follows from 3.3 and Lemma 4.9 that {λγ∗(ltργ)} is an orthogonal TI-net.
Proof.
Since ∣Γ∣=κ, let (Γ,<) denote the well-ordering of Γ induced by some bijection with κ.
Let t0=e.
As induction hypothesis, suppose {FγtγFγ−1}γ<α are disjoint, where α∈Γ.
If it is impossible to find tα such that {FγtγFγ−1}γ≤α are disjoint, then
{Fα−1FγtγFγ−1Fα}γ<α is a collection of compact sets of cardinality less than κ covering G, a contradiction.
∎
Lemma 4.15**.**
Let K⊂G be any compact set with nonempty interior, and {Ktγ}γ<κ be a covering of G by translates of K.
For each n, let λn∈P1(G) be (K−1,n1)-left-invariant, and let ρn=λn†.
Finally, let X={Rtγρn:n∈N,γ<κ}.
Then TLIM(G)⊂cℓ(conv(X)), and ∣cℓ(conv(X))∣≤22κ.
Proof.
Suppose m∈TLIM(G) lies outside the closed convex hull of X.
As in Lemma 3.6, there exists T∈L∞(G,R) and ϵ>0
with ⟨m,T⟩>2ϵ+⟨Rtγρn,T⟩ for all n∈N and all γ<κ.
Let n be large enough that ∥T∥∞/n<ϵ.
Let s be chosen so that supt⟨Rtρn,T⟩<ϵ+⟨Rsρn,T⟩. Say s∈Ktα.
By definition of ρn,
⟨Rsρn,T⟩<⟨Rtαρn,T⟩+∥T∥∞/n.
Now ⟨m,T⟩=⟨m,ρnT⟩≤∥ρnT∥∞=supt⟨Rtρn,T⟩<2ϵ+⟨Rtαρn,T⟩ contradicting the choice of m.
This proves TLIM(G)⊂cℓ(conv(X)).
Let convQ(X) denote the set of all finite convex combinations in X with rational coefficients.
Evidently ∣convQ(X)∣=∣X∣=κ, and cℓ(conv(X))=cℓ(convQ(X)).
Since cℓ(conv(X)) is a regular Hausdorff space with dense subset convQ(X), it has cardinality at most 22∣convQ(X)∣=22κ.
∎
Theorem 4.16**.**
∣TIM(G)∣=∣TLIM(G)∣=22κ.
Proof.
By Lemma 4.14, there exists be an orthogonal TI-net {φγ}.
By Lemma 3.2,
the map p↦p-limγφγ is one-to-one from Γ∗ to TIM(G), so ∣TIM(G)∣≥∣Γ∗∣.
By Lemma 2.5, ∣Γ∗∣=22κ.
Of course, TIM(G)⊂TLIM(G), so 22κ≤∣TIM(G)∣≤∣TLIM(G)∣.
Lemma 4.15 yields the opposite inequality.
∎
5. A Proof of Paterson’s Conjecture
Let tg be shorthand for gtg−1.
We write G∈[FC]− to signify that each conjugacy class tG={tg:g∈G} is precompact.
When G∈[FC]− is furthermore discrete, each conjugacy class must be finite.
In this case, we write G∈FC.
Lemma 5.1**.**
If G∈FC, then G is amenable.
Proof.
It suffices to show that each finitely-generated subgroup is amenable.
Suppose K⊂G is finite, and let ⟨K⟩ denote the subgroup generated by K.
For any x∈⟨K⟩, let C(x)={y∈⟨K⟩:xy=x}.
Evidently C(x) is a subgroup, whose right cosets correspond to the (finitely many) distinct values of xy.
Therefore [⟨K⟩:C(x)] is finite.
Let Z denote the center of ⟨K⟩.
Clearly Z=⋂x∈KC(x).
Thus [⟨K⟩:Z]≤∏x∈K[⟨K⟩:C(x)] is finite.
Since ⟨K⟩ is finite-by-abelian, it is amenable.
∎
Theorem 5.2**.**
G∈[FC]− iff G is a compact extension of Rn×D, for some D∈FC and n∈N.
In light of Theorem 5.1, any group of the form Rn×D is amenable.
Compact extensions of amenable groups are amenable.
∎
Corollary 5.4**.**
If G∈[FC]−, then G is unimodular.
Proof.
Clearly groups of the form Rn×D are unimodular, since D is discrete.
Compact extensions of unimodular groups are unimodular.
∎
Lemma 5.5**.**
If G∈[FC]−, and C⊂G is compact, then CG={cg:c∈C,g∈G} is precompact.
In [Mil81], Milnes obverves that this lemma would imply Theorem 5.7.
He is unable to prove it, apparently because he is unaware of Theorem 5.2.
Proof.
By Theorem 5.2, let G/K=Rn×D, where K⊲G is a compact normal subgroup.
Let π:G→G/K denote the canonical epimorphism.
Pick C⊂G compact.
Notice CG is precompact if π(CG) is, because the kernel of π is compact.
Since π(C) is compact, π(C)⊂B×F for some box B⊂Rn and finite F⊂D.
Now π(CG)=π(C)π(G)⊂(B×F)Rn×D=B×FD.
Evidently FD is finite, hence B×FD is compact, proving π(CG) is precompact.
∎
5.6**.**
As in 4.5, let {Fγ}γ∈Γ be a Følner net for G, and λγ=1Fγ/∣Fγ∣ the corresponding left TI-net.
Assuming G is unimodular, by [Cho70, Theorem 4.4] we can choose Fγ to be symmetric.
Hence λγ(x)=λγ(x−1)=λγ†(x), and {λγ} is a two-sided TI-net.
Theorem 5.7** (Following Milnes).**
If G∈[FC]− then TLIM(G)⊂TIM(G).
Proof.
By Corollary 5.4, G is unimodular.
As above, take {λγ}={λγ†} to be a TI-net.
Recall Lemma 4.11, which says cℓ(conv(Xp))=TLIM(G).
So it suffices to prove Xp⊂TIM(G).
To this end, we will show {Rtγλγ} is a right TI-net for any {tγ}∈GΓ.
Let xγ be shorthand for tγxtγ−1.
Now ∥rxRtγλγ−Rtγλγ∥1=∣Fγtγ∣∣Fγtγx−1ΔFγtγ∣=∣Fγ∣∣Fγxγ−1ΔFγ∣=∥rxγλγ−λγ∥1=∥lxγλγ−λγ∥1.
For any compact C⊂G, notice {xγ:x∈C,γ∈Γ}⊂CG, which is precompact by Lemma 5.5.
By the same argument as Lemma 4.6,
∥(Rtγλγ)∗f−Rtγλγ∥1→0 for any f∈P1(G).
∎
Lemma 5.8**.**
If xG is not precompact, then there is a σ-compact open subgroup H≤G such that xH is not precompact.
Proof.
Let U be any compact neigborhood of t0=e.
Inductively pick tn+1 such that xtn+1U∩{xt0,…,xtn}U=∅.
This is possible, otherwise xG is contained in the compact set {xt0,…,xtn}UU−1, a contradiction.
Now the sequence {xt0,xt1,…} does not accumulate anywhere, so it escapes any compact set.
Take H to be the subgroup generated by {xt0,xt1,…}U.
∎
Theorem 5.9**.**
If G has an element x such that xG is not precompact, then TLIM(G)=TIM(G).
Proof.
Let H≤G be any σ-compact open subgroup such that xH is not precompact.
Pick a sequence of compact sets {Hn} such that
∀nHn⊂Hn+1∘,
and ⋃nHn=H.
It follows that any compact K⊂H is contained in some Hn.
Inductively construct a sequence {cn}⊂H satisfying the following properties:
(1) cn∈H∖Kn, where Kn=⋃m<nHn−1Hmcm{x,x−1}.
(2) (cnxcn−1)∈Hn−1Hn.
Since Kn is compact, xH∖Kn is not precompact, and in particular escapes Hn−1Hn.
Thus it is possible to satisfy (1) and (2) simultaneously.
Now A=⋃nHncn and B=⋃nHncnx are easily seen to be disjoint:
If they are not disjoint, then Hncnx∩Hmcm=∅ for some n,m.
If n>m, then cn∈Hn−1Hmcmx−1, violating (1).
If n<m, then cm∈Hm−1Hncnx, violating (1).
If n=m, then cnxcn−1∈Hn−1Hn, violating (2).
Let T be a transversal for G/H.
Notice TA∩TB=∅, since A,B are disjoint subsets of H.
Define π:TH→H by π(th)=h, which is continuous since H is open.
Let {Fγ} be a Følner net for G.
Each Fγ is compact, hence π[Fγ]⊂Hn(γ) for some n(γ).
Let cγ=cn(γ).
Now π[Fγcγ]=π[Fγ]cγ⊂A, hence Fγcγ⊂π−1[A]=TA.
Likewise Fγcγx⊂TB.
Since this holds for each γ, C=⋃γFγtγ⊂TA and D=⋃γFγtγx⊂TB.
Thus C∩D=∅.
Let m=p-limγ[Rtγ∣Fγ∣1Fγ] for some p∈Γ∗.
Now m(1C)=1, but m(rx1C)=m(1D)=0, hence m∈TLIM(G)∖TIM(G).
∎
Chapter 3 Topologically Invariant means on VN(G)
6. Background on Fourier Algebra
The algebras A(G) and VN(G) are defined and studied in the influential paper [Eym64].
Chapter 2 of [KL18] gives a modern treatment of the same material in English.
6.1**.**
Let λ denote the left-regular representation.
By definition, VN(G)=λ[G]′′=λ[L1(G)]′′.
P1(G) denotes the set of normal states on VN(G), and the linear span of P1(G) is denoted by A(G).
It turns out that P1(G) consists of all vector states of the form ωf(T)=⟨Tf,f⟩ where ∥f∥2=1.
By the polarization identity, A(G) consists of all functionals of the form ωf,g(T)=⟨Tf,g⟩, with f,g∈L2(G).
6.2**.**
A(G) can also be characterized as the set of all functions uf,g(x)=⟨λ(x)f,g⟩=g∗fˇ(x) with f,g∈L2(G).
As such, the elements of A(G) are continuous and vanish at infinity.
The duality with VN(G) is given by ⟨T,uf,g⟩=⟨Tf,g⟩.
In particular, ⟨λ(h),u⟩=∫h(x)u(x)dx for all h∈L1(G).
A(G) is a commutative Banach algebra with pointwise operations and norm ∥u∥=sup∥T∥=1∣⟨T,u⟩∣.
Equivalently, ∥u∥ is the sup of ∫h(x)u(x)dx over all h∈L1(G) such that ∥λ(h)∥≤1.
Since ∥λ(h)∥≤∥h∥1, we conclude ∥u∥≥∥u∥∞.
6.3**.**
If u∈A(G) is positive as a functional on VN(G), we write u≥0.
It’s easy to see u≥0
iff u=uf,f for some f∈L2(G)
iff ∥u∥∞=u(e)=⟨I,u⟩=∥u∥.
In particular, P1(G)={u∈A(G):∥u∥=u(e)=1} is closed under multiplication.
Suppose ∥f∥2=∥g∥2=1.
Then ∥uf,f−ug,g∥=sup∥T∥=1∣⟨Tf,f⟩−⟨Tg,g⟩∣≤sup∥T∥=1∣⟨T(f−g),f⟩∣+∣⟨Tg,(f−g)⟩∣≤2∥f−g∥2.
7. TI-nets in P1(G)
7.1**.**
For T∈VN(G) and u,v∈A(G), define uT by ⟨uT,v⟩=⟨T,uv⟩.
A mean m is said to be topologically invariant if
⟨m,uT⟩=⟨m,T⟩ for all u∈P1(G) and T∈VN(G).
TIM(G) denotes the set of topologically invariant means on VN(G).
There is no distinction between left/right topologically invariant means, since multiplication in P1(G) is commutative.
7.2**.**
A net {uγ}⊂P1(G) is called a weak TI-net if
limγ⟨vuγ−uγ,T⟩=0 for all v∈P1(G) and T∈VN(G).
By Lemma 3.6, topologically invariant means are precisely the limit points of weak TI-nets.
{uγ} is simply called a TI-net if limγ∥vuγ−uγ∥=0 for all v∈P1(G).
Lemma 7.3**.**
Pick any net {uγ}⊂P1(G).
Suppose that supp(uγ) is eventually small enough to fit in any V∈C(G).
Then {uγ} is a TI-net.
Proof.
This is [Ren72, Proposition 3].
I’ll repeat the proof for convenience.
Pick u∈P1(G).
Since compactly supported functions are dense in A(G), it suffices to consider the case when u has compact support C.
A(G) is regular by [KL18, Proposition 2.3.2], so we can pick v∈A(G) with v≡1 on C.
Since u−v(e)=0, by [KL18, Lemma 2.3.7] we can find some w∈A(G) with ∥(u−v)−w∥<ϵ and w≡0 on some neighborhood W of e.
Suppose γ is large enough that supp(uγ)⊂W∩C.
Then vuγ=uγ, and wuγ=0,
hence ∥uuγ−uγ∥=∥(u−v)uγ∥≤∥(u−v−w)uγ∥+∥wuγ∥≤∥(u−v−w)∥<ϵ.
∎
7.4**.**
Let C(G) denote the compact, symmetric neighborhoods of e.
As a consequence of Lemma 7.3, we see that P1(G) has TI-nets for any G, in contrast to P1(G) which has TI-nets only when G is amenable:
If {Uγ}⊂C(G) is a neighborhood basis at e, directed by inclusion, let uγ=(1Uγ∗1Uγ)/∣Uγ∣.
Since supp(uγ)⊂Uγ2, and {Uγ2} is a neighborhood basis at e, {uγ} is a TI-net.
Lemma 7.3 has a sort of converse, given by the following lemma.
Lemma 7.5**.**
Every m∈TIM(G) is the limit of a net {uγ}
such that supp(uγ) is eventually small enough to fit in any V∈C(G).
Proof.
Suppose to the contrary that there exist V∈C(G), T∈VN(G), and ϵ>0 such that ∣⟨m−u,T⟩∣>ϵ for all u∈P1(G) with supp(u)⊂V.
Fix any u∈P1(G) with supp(u)⊂V.
By Lemma 3.6, pick v∈P1(G) with ∣⟨m−v,T⟩∣<ϵ,
and ∣⟨m−v,uT⟩∣<ϵ.
Now vu∈P(G) with supp(vu)⊂V.
But ∣⟨m−vu,T⟩∣=∣⟨m,T⟩−⟨vu,T⟩∣=∣⟨m,uT⟩−⟨v,uT⟩∣=∣⟨m−v,uT⟩∣<ϵ, a contradiction.
∎
Corollary 7.6**.**
Every m∈TIM(G) is the limit of a TI-net.
Corollary 7.7**.**
∣TIM(G)∣≤22μ
Proof.
Recall that μ is the minimal cardinality of a neighborhood basis at e.
Pick any V∈C(G). By the previous lemma, TIM(G) is in the closure of X={u∈P1(G):supp(u)⊂V}.
Therefore, it suffices to find a set D with ∣D∣=μ and X⊂cℓ(D).
Let B={f∈L2(G):∥f∥2=1,supp(f)⊂V}, and let C comprise the continuous functions in B.
Obviously C is dense in B, and it is routine to show that C has a dense subset C′ of cardinality μ.
Now D={uf,f:f∈C′} is the desired set.
∎
7.8**.**
Let uf,f be a normal state on VN(G), and P the projection onto the linear span of f.
Since P has rank one, it is clearly the inf of all projections Q such that 1=⟨Qf,f⟩=⟨Q,uf,f⟩.
In the terminology of 3.1, P is the support of uf,f.
Thus a family {ufα,fα}⊂A(G) is orthogonal iff {fα}⊂L2(G) is orthogonal.
Apparently neither Chou nor Hu made this observation.
If it seems obvious, it is because we took care to express normal states as uf,f.
For example, in order to construct an orthogonal TI-sequence, [Cho82, pages 210-213] takes three pages to describe a generalized Gram-Schmidt procedure for normal states on a von Neumann algebra.
This procedure does not generalize beyond sequences, and [Hu95] is unable to construct an orthogonal net when μ>N.
Lemma 7.9**.**
When μ=N, P1(G) contains an orthogonal TI-sequence.
Proof.
Let {Un}⊂C(G) be a descending neighborhood basis at e, such that ∣Un∖Un+1∣>0.
Let Vn=Un∖Un+1, and fn=1Vn/∣Vn∣1/2.
In light of Lemma 7.3 and 7.8, {ufn,fn} is the desired sequence.
∎
Lemma 7.10**.**
Let U⊂C(G). If ⋂U={e}, then U is a neighborhood sub-basis at e (hence ∣U∣≥μ).
Proof.
Suppose ⋂U={e}, and let V be any open neighborhood of e.
Since ∅={e}∩VC=⋂U∈U[U∩VC] is an intersection of compact sets, it follows that some finite sub-intersection is also empty.
In other words, U1∩…∩Un⊂V for some U1,…,Un∈U.
∎
Lemma 7.11** (Kakutani-Kodaira).**
Let U⊂C(G).
Suppose each U∈U has a “successor” V∈U, such that V2⊂U.
Then H=⋂U is a compact subgroup of G.
Proof.
H is compact, because it is the intersection of compact sets in a Hausdorff space.
Suppose x,y∈H. Suppose U,V∈U with V2⊂U.
Since x,y∈H⊂V, xy∈V2⊂U.
Since U was arbitrary, we conclude xy∈H.
Likewise, x−1∈H because each U is symmetric.
∎
7.12**.**
Suppose H is a compact subgroup of G, with normalized Haar measure ν.
Let L2(H\G) be the set of functions in L2(G) that are constant on right-cosets of H.
Define Pf(x)=∫f(hx)dν(h).
Now it is routine to check that P is the orthogonal projection onto L2(H\G).
The only interesting detail, needed to prove P=P∗, is that ∫f(hx)dν(h)=∫f(h−1x)dν(h) because H is unimodular.
7.13**.**
Suppose {Hγ}={Hγ}γ<μ is a descending chain of compact subgroups.
Let Pγ denote the orthogonal projection onto L2(Hγ\G).
Then {Pγ} is an ascending chain of projections, and {Pγ+1−Pγ} is a chain of mutually orthogonal projections.
Suppose we construct functions {fγ}⊂L2(G) with fγ∈L2(Hγ+1\G)−L2(Hγ\G), so that (Pγ+1−Pγ)fγ=0.
Letting gγ=(Pγ+1−Pγ)fγ, we see {uγ}={ugγ,gγ/∥gγ∥22} is a chain of mutually orthogonal functions in P1(G), since S(uγ)≤Pγ+1−Pγ.
Consider the condition fγ∈L2(Hγ+1\G)−L2(Hγ\G).
How can we achieve this?
Let νγ denote the Haar measure of Hγ.
Pick Uγ∈C(G) small enough that νγ(Uγ4∩Hγ)<1.
Construct Hγ+1 small enough that Hγ+1⊂Uγ, and let fγ=1Hγ+1Uγ. Obviously fγ∈L2(Hγ+1\G).
On the other hand,
Pγfγ(x)=νγ({h∈Hα:hx∈Hγ+1Uγ})<1=fγ(x)
for any x∈Hγ+1Uγ.
Hence Pγfγ=fγ, and fγ∈L2(Hγ\G).
We need to add one more detail to our construction, to make the chain of orthogonal functions {uγ} into a TI-net.
Namely, suppose {Vγ}⊂C(G) is a neighborhood basis at e, and {Uγ,Hγ} satisfy HγUγ2⊂Vγ.
Then supp(gγ)⊂HγHγ+1Uγ⊂Vγ,
hence supp(uγ)⊂Vγ2.
Let Γ denote the set of ordinals less than μ, ordered by α≺γ⟺Vγ⊂Vα.
By Lemma 7.3, {uγ}γ∈Γ is a TI-net.
Notice that each tail of Γ has cardinality ∣Γ∣=μ, as required by Lemma 2.5.
Lemma 7.14**.**
When μ>N, P1(G) contains an orthogonal TI-net of cardinality μ.
Proof.
Fix {Vγ}γ<μ⊂C(G), a well-ordered neighborhood basis at e.
Of course this well-ordering has no topological meaning, but it’s necessary for transfinite induction.
The purpose of our induction is to select {Uγ,Hγ}γ<μ as in 7.13, from which the lemma clearly follows.
For 0≤β<μ, suppose we have picked {Uγ,Hγ}γ<β such that (1)-(4) hold for all γ<β:
(1) Hγ is the intersection of (γ+1)⋅N elements of C(G), and is a subgroup of each previous Hα.
(2) If γ=α+1 is a successor ordinal, then Hγ⊂Uα.
(3) HγUγ2⊂Vγ.
(4) νγ(Hγ∩Uγ4)<1.
Let {Wn}⊂C(G) be any chain with W0⊂Vβ and Wn+12⊂Wn for all n.
If β=α+1, we may suppose W0⊂Uα.
Let Hβ=⋂({Wn}∪{Hγ}γ<β).
Notice HβW22⊂W0⊂Vβ.
Since Hβ is the intersection of (β+1)⋅N<μ elements of C(G),
it follows from Lemma 7.10 that Hβ={e}.
In particular, it is possible to pick U∈C(G) with νβ(Hβ∩U4)<1.
Let Uβ=U∩W2.
Now Uβ,Hβ satisfy (1)-(4).
∎
Theorem 7.15**.**
∣TIM(G)∣=22μ.
Proof.
Let {uγ}γ∈Γ be the orthogonal TI-net of of Lemma 7.9 or Lemma 7.14, depending on μ.
By Lemma 3.2, p↦p-limγuγ is an injection of Γ∗ into TIM(G).
Thus ∣TIM(G)∣≥∣Γ∗∣=22μ by Lemma 2.5.
The opposite inequality is Corollary 7.7.
∎
Bibliography20
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[Cho 70] Ching Chou. On topologically invariant means on a locally compact group. Trans. Amer. Math. Soc. , 151(2):443–456, 1970.
2[Cho 76] Ching Chou. The exact cardinality of the set of invariant means on a group. Proc. Amer. Math. Soc. , 55(1):103–106, 1976.
3[Cho 82] Ching Chou. Topological Invariant Means on the von Neumann algebra V N ( G ) 𝑉 𝑁 𝐺 VN(G) . Trans. Amer. Math. Soc. , 273(1):207–229, 1982.
4[CLR 85] Ching Chou, Anthony To-Ming Lau, and Joseph Rosenblatt. Approximation of Compact Operators by Sums of Translations. Illinois J. Math. , 29(2):340–350, 1985.
5[Eym 64] P. Eymard. L’algèbre de fourier d’un groupe localement compact. Bulletin de la S.M.F. , 92:181–236, 1964.
6[Gra 73] Edmond Granirer. Criteria for compactness and for discreteness of locally compact amenable groups. Proc. Amer. Math. Soc. , 40(2):615–624, 1973.
7[HR 79] Edwin Hewitt and Kenneth Ross. Abstract Harmonic Analysis I . Springer-Verlag, 2 nd edition, 1979.
8[HS 12] Neil Hindman and Dona Strauss. Algebra in the Stone-Čech compactification, theory and applications . de Gruyter, 2 nd edition, 2012.