Characters and invariant random subgroups of the finitary symmetric group
Simon Thomas

TL;DR
This paper explores the connection between indecomposable characters and ergodic invariant random subgroups of the finitary symmetric group, providing new interpretations and asymptotic analyses of Thoma characters.
Contribution
It establishes a relationship between characters and invariant random subgroups, and interprets Thoma characters as limits of induced characters from Young subgroups.
Findings
Character and subgroup relationship clarified
Thoma characters as asymptotic limits demonstrated
New perspective on finitary symmetric group characters
Abstract
We will describe the relationship between the indecomposable characters of the finitary symmetric group and its ergodic invariant random subgroups; and we will interpret each Thoma character as an asymptotic limit of a naturally associated sequence of characters induced from linear characters of Young subgroups of finite symmetric groups.
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.
Taxonomy
TopicsGeometric and Algebraic Topology · Quasicrystal Structures and Properties · Advanced Algebra and Geometry
Characters and invariant random subgroups of the
finitary symmetric group
Simon Thomas
Mathematics Department
Rutgers University
110 Frelinghuysen Road
Piscataway
New Jersey 08854-8019
USA
Abstract.
We will describe the relationship between the indecomposable characters of and its ergodic invariant random subgroups; and we will interpret each Thoma character as an asymptotic limit of a naturally associated sequence of characters induced from linear characters of Young subgroups of finite symmetric groups.
1. Introduction
If is an infinite set, then the corresponding finitary symmetric group is the group of permutations such that is finite. In his classic paper [7], Thoma classified the indecomposable characters of . More recently, Vershik [11] classified the ergodic invariant random subgroups of ; and he pointed out that the indecomposable characters of are very closely connected with its ergodic invariant random subgroups. In this paper, we will describe the precise relationship between the indecomposable characters of and its ergodic invariant random subgroups. Before we stating our main result, we will recall Thoma’s classification of the the indecomposable characters of and Vershik’s classification111We will take this opportunity to correct an inaccuracy in the statement [11] of Vershik’s classification theorem. of the ergodic invariant subgroups of . Throughout this paper, will denote the set of sequences
[TABLE]
such that
First recall that if is a countable group, then a function is said to be a character if the following conditions are satisfied:
- (i)
for all , . 2. (ii)
for all and . 3. (iii)
.
A character is said to be indecomposable or extremal if it is impossible to express , where and are distinct characters. By Thoma [7], the indecomposable characters of are precisely the functions
[TABLE]
where , are such that , and is the number of cycles of length in the cyclic decomposition of the permutation .
Next suppose that is a countably infinite group and let be the compact space of subgroups . Then a Borel probability measure on which is invariant under the conjugation action of on is called an invariant random subgroup or . For example, suppose that acts via measure-preserving maps on the Borel probability space and let be the -equivariant map defined by
[TABLE]
Then the corresponding stabilizer distribution is an IRS of . In fact, by a result of Abért-Glasner-Virag [1], every IRS of can be realized as the stabilizer distribution of a suitably chosen measure-preserving action. Moreover, by Creutz-Peterson [2], if is an ergodic IRS of , then is the stabilizer distribution of an ergodic action . If is an IRS of , then we can define a corresponding character by
[TABLE]
Equivalently, , where is any measure-preserving action with stabilizer distribution .
In order to describe the ergodic IRSs of , let be such that and let . Then we can define a probability measure on by . Let be the corresponding product probability measure on . Then acts ergodically on via the shift action . For each and , let . Then for , the following statements are equivalent for all .
- (a)
. 2. (b)
. 3. (c)
is infinite. 4. (d)
.
In this case, we will say that is -generic. First suppose that , so that . Let be the restricted direct product of the cyclic groups of order 2. (Warning: throughout this paper, we will regard as a multiplicative group.) Then for each subgroup , we can define a corresponding -equivariant Borel map
[TABLE]
as follows. If is -generic, then , where is the homomorphism
[TABLE]
Otherwise, if is not -generic, then we let . Let be the corresponding ergodic IRS of . Finally, if , then we define and .
Theorem 1.1**.**
If is an ergodic IRS of , then there exists , as above such that .
Remark 1.2**.**
There exist examples of sequences and distinct subgroups , such that . For example, suppose that . Then if and , then . However, since for ,
[TABLE]
it follows that if and , are subgroups of , , then .
Remark 1.3**.**
Suppose that is such that there exist with . Let be any subgroup and let be the set of subgroups such that there exists a -generic with . Then the map is not injective; and it is easily seen that there does not exist a -equivariant Borel map from to such that .
The relationship between the indecomposable characters of and its ergodic IRSs is most obvious when : in this case, it is easily checked that
[TABLE]
where denotes the identically zero sequence. In particular, it follows that is indecomposable. Conversely, the somewhat ad hoc proof of Thomas-Tucker-Drob [9, Theorem 9.2] shows that if , then is decomposable. (We will give a more informative proof below.) Of course, this result implies that if is an indecomposable character with , then there does not exist an ergodic IRS of such that .
In order to understand how arbitrary indecomposable characters are related to the ergodic IRSs of , let be the compact group of homomorphisms . For each , let be the generator of ; and for each homomorphism , let . Then for each , we can define an indecomposable character of by
[TABLE]
Remark 1.5**.**
Suppose that . Let be the list (possibly augmented by a sequence of zeros) in decreasing magnitude of the , , such that ; and let be the list (possibly augmented by a sequence of zeros) in decreasing magnitude of the , , such that . Then clearly .
Conversely, if is any indecomposable character of , then there exists a sequence and a homomorphism such that .
Example 1.6**.**
For later use, notice that if is the trivial homomorphism such that for all , then .
For each subgroup , let be the compact subgroup of those such that for all and let be the Haar probability measure on . The following result describes the relationship between the indecomposable characters of and its ergodic invariant random subgroups.
Theorem 1.7**.**
If , are as above, then for each ,
[TABLE]
Corollary 1.8**.**
* is indecomposable if and only if .
∎*
The following corollary shows that for every indecomposable character of , there exists a canonically associated ergodic IRS.
Corollary 1.9**.**
If is any indecomposable character of , then there exists an and a subgroup such that
[TABLE]
Proof.
Applying Thoma’s classification [7], let , be such that . Let be a list in decreasing magnitude of the entries of the sequences and . Let be such that
[TABLE]
and let . Then
[TABLE]
∎
The remainder of this paper is organized as follows. In Section 2, we will prove Theorem 1.7 via an easy application of Fubini’s Theorem. However, this proof will give no insight into the meaning of equations (1.4) and (1.7). In Section 3, via an application of the Pointwise Ergodic Theorem, we will interpret the integral (1.7) as an asymptotic limit of the Clifford decompositions of a naturally associated sequence of permutation characters of finite symmetric groups; and we will interpret each Thoma character as an asymptotic limit of a naturally associated sequence of characters induced from linear characters of Young subgroups of finite symmetric groups. Finally, in Section 4, slightly correcting the argument of Vershik [11], we will present the proof of Theorem 1.1.
Throughout this paper, we will identify with the set and we will write .
Acknowledgments
I would like to thank Richard Lyons for a very helpful discussion concerning the decomposition of permutation characters. Thanks are also due to the Hausdorff Research Institute for Mathematics for its hospitality during the preparation of this paper.
2. The proof of Theorem 1.7
In this section, we will present the proof of Theorem 1.7; i.e. that if , are as in Section 1, then for each ,
[TABLE]
Clearly we can suppose that . Let be the decomposition of into a product of nontrivial cycles; and for each , let be an -cycle. Notice that for each ,
[TABLE]
and it follows that
[TABLE]
Hence, applying Fubini’s theorem, we obtain that
[TABLE]
where each .
On the other hand, for each , let be the homomorphism such that for each and , the component of is given by
[TABLE]
Then it is clear that
[TABLE]
where
[TABLE]
Thus, in order to prove Theorem 1.7, it is enough to show that for all ,
[TABLE]
Let be the generator of . In the proof of (2.1), we will make use of the observation that if , then
[TABLE]
and hence we have that
[TABLE]
First suppose that . Then for each ,
[TABLE]
and so . Next suppose that
[TABLE]
For each , let . Then clearly we have that ; and if , then
[TABLE]
Hence . This completes the proof of Theorem 1.7.
3. An asymptotic interpretation of Theorem 1.7
In this section, via an application of the Pointwise Ergodic Theorem, we will interpret the integral (1.7) as an asymptotic limit of the Clifford decompositions of a naturally associated sequence of permutation characters of finite symmetric groups.
Suppose that is the union of the strictly increasing chain of finite subgroups and that is an ergodic action on a Borel probability space. Then the following theorem is a special case of more general results of Vershik [10] and Lindenstrauss [5].
The Pointwise Ergodic Theorem**.**
With the above hypotheses, if is a -measurable subset, then for -a.e. ,
[TABLE]
In particular, the Pointwise Ergodic Theorem applies when is the -measurable subset for some . For each and , let be the corresponding -orbit. Then, as pointed out in Thomas-Tucker-Drob [8, Theorem 2.1], the following result is an easy consequence of the Pointwise Ergodic Theorem.
Theorem 3.1**.**
With the above hypotheses, for -a.e. , for all ,
[TABLE]
Of course, the permutation group is isomorphic to , where is the set of cosets of in ; and so
[TABLE]
Suppose that there exists a subgroup with . Then ; and, by Clifford’s Theorem [3, Theorem 11.5],
[TABLE]
where is the set of irreducible characters of such that for all . (Thus can be naturally identified with the set of irreducible characters of the quotient group .) It follows that
[TABLE]
Now suppose that and are as in Section 1 and let be the corresponding ergodic IRS of . Applying Creutz-Peterson [2], let be the stabilizer distribution of the ergodic action and let
[TABLE]
be the corresponding character. Express , where ; and for each and , let be the corresponding -orbit. (As a matter of convention, we set .) Then for -a.e. , we have that
[TABLE]
Fix such an element and let be the corresponding point stabilizer. Then we can suppose that there exists a -generic point such that , where is the homomorphism
[TABLE]
For each , let and let ; and for each , let . Let be the corresponding Young subgroup. Then and
[TABLE]
is an elementary abelian 2-group; and so each character is linear. Hence, applying equations (3.2) and (3.3), we obtain that for each ,
[TABLE]
Slightly abusing notation, for each character , we will also denote the corresponding homomorphism by . For each , let be the generator of ; and for each character , let . If is a -cycle and , then
[TABLE]
If we fix and let , then we have that
[TABLE]
Hence we see that
[TABLE]
and, more generally, if has cycle decomposition , where each is a -cycle, then we see that
[TABLE]
Thus we can interpret Theorem 1.7 as an asymptotic limit of the Clifford decompositions of a naturally associated sequence of permutation characters of finite symmetric groups; and we can interpret each Thoma character as an asymptotic limit of a naturally associated sequence of characters induced from linear characters of Young subgroups of finite symmetric groups.
4. The ergodic invariant random subgroups of
In this section, slightly correcting the argument of Vershik [11], we will present the proof of Theorem 1.1. The classification of the ergodic IRSs of will be based upon the following two insights of Vershik.
- (i)
If is a random subgroup, then the corresponding -orbit equivalence relation is a random equivalence relation on ; and these have been classified by Kingman [4]. 2. (ii)
The induced action of on each infinite orbit can be determined via an application of Wielandt’s Theorem [12, Satz 9.4], which states that if is an infinite set, then and are the only primitive subgroups of .
The proof of Theorem 1.1 will also make use of an elementary result concerning imprimitive actions of finitary permutation groups. Recall that a transitive subgroup is said to act imprimitively if there exists a nontrivial proper -invariant equivalence relation on . In this case, following the usual practice, we will refer to the -classes as -blocks. Now suppose that is an infinite set and is an imprimitive subgroup. Of course, in this case, if is a nontrivial proper -invariant equivalence relation on , then the -blocks must be finite. The following result, which is a variant of Neumann [6, Lemma 2.2], implies that we can always make a “canonical” choice of a nontrivial proper -invariant equivalence relation.222In [11], Vershik suggests choosing the minimal nontrivial -invariant equivalence relation. However, there exist examples of imprimitive finitary groups with more than one minimal nontrivial -invariant equivalence relation. On the other hand, see Claim 4.3.
Lemma 4.1**.**
If is an infinite set and is an imprimitive subgroup, then at least one of the following two conditions holds:
- (i)
there exists a unique maximal proper -invariant equivalence relation on ; 2. (ii)
there exists a unique proper -invariant equivalence relation on which is minimal subject to the condition that contains every minimal nontrivial -invariant equivalence relation on .
Definition 4.2**.**
If is an infinite set and is an imprimitive subgroup, then the associated canonical equivalence relation is defined to be if condition 4.1(i) holds, and is defined to be otherwise.
The proof of Lemma 4.1 will make use of the following observation.
Claim 4.3**.**
If is an infinite set and is an imprimitive subgroup, then there exist only finitely many minimal nontrivial -invariant equivalence relations on .
Proof of Claim 4.3.
Suppose that are distinct minimal nontrivial -invariant equivalence relations on . Fix some element ; and for each , let be the -block such that . Notice that if , then is a block; and hence by the minimality of , , we must have that . For each , choose an element . Let satisfy . If , then and so , which contradicts the fact that . ∎
Proof of Lemma 4.1.
Once again, fix some element . First suppose that there exists a maximal nontrivial proper -invariant equivalence relation on . Then the set of -classes is infinite and acts as a primitive group of finitary permutations on . Applying Wielandt’s Theorem, it follows that induces at least on . Suppose that is a second maximal proper -invariant equivalence relation on . Let be the -block such that and let be the -block such that . Then there exists . Since acts 2-transitively on , it follows that the orbit is infinite; and since , it follows that the orbit is also infinite. But this means that is infinite, which is a contradiction.
Next suppose that there does not exist a maximal proper -invariant equivalence relation on . Then there exists a strictly increasing sequence
[TABLE]
of proper -invariant equivalence relations on . Let . Then is an -invariant equivalence relation such that every -class is infinite and it follows that . For each , let be the -block such that . Then clearly .
Applying Claim 4.3, let be the finitely many minimal nontrivial -invariant equivalence relations on ; and for each , let be the -block such that . Then there exists such that for all ; and it follows that for all . Finally, letting be the intersection of all the proper -invariant equivalence relations such that for all , it is clear that satisfies condition 4.1(ii). ∎
Finally, before beginning the proof of Theorem 1.1, we will present a brief discussion of Kingman’s Theorem [4]. Let
[TABLE]
Then is a compact space and via the shift action
[TABLE]
As expected, a -invariant Borel probability measure on is called an invariant random equivalence relation. For example, let be such that and let . Let be the corresponding product measure on , as defined in Section 1; and for each and , let . Then we can define a -equivariant map from to by letting correspond to the partition
[TABLE]
and it follows that is an ergodic random invariant equivalence relation. The following theorem is due to Kingman [4].
Theorem 4.4**.**
If is an ergodic random invariant equivalence relation, then there exists as above such that .
Remark 4.5**.**
If is such that there exist with , then the map is not injective, and there does not exist a -equivariant Borel map from to such that .
The proof of Theorem 1.1 will also make use of the following easy observation.
Lemma 4.6**.**
If is an ergodic random invariant equivalence relation, then concentrates the equivalence relations such that every -class is either infinite or a singleton.
Proof.
While this result is an immediate consequence of Theorem 4.4, it seems worthwhile to give an elementary proof. So suppose that is a counterexample. Then, by ergodicity, there exists a fixed integer such that
[TABLE]
For each , let be the event that is an -class. Since acts transitively on , there exists a fixed real such that for all . But, since the events are mutually exclusive, this is impossible. ∎
We are now ready to begin the proof of Theorem 1.1. So suppose that is an ergodic IRS of . Clearly we can suppose that .
Lemma 4.7**.**
For -a.e. , if is a nontrivial -orbit, then is infinite and induces at least on .
Proof.
Suppose not. Recall that, by Wielandt’s Theorem [12], if is an infinite set, then and are the only primitive subgroups of . It follows that for -a.e. , either there exists a nontrivial finite -orbit, or else there exists an infinite -orbit on which acts imprimitively. For each such , let be the equivalence relation on such that if , then if and only if , lie in the same -orbit and either:
- (i)
is a nontrivial finite -orbit; or 2. (ii)
is an infinite imprimitive -orbit and .
Otherwise, let be the trivial equivalence relation on . Then clearly the map is -equivariant, and hence is an ergodic invariant random equivalence relation. But concentrates on the with a nontrivial finite -class, which contradicts Lemma 4.6. ∎
The proof of the following lemma will make use of the notion of a diagonal subgroup, which is defined as follows. Suppose that and that are countably infinite sets. Then is said to be a diagonal subgroup if there exist isomorphisms for such that
[TABLE]
Recall that every automorphism of is the restriction of an inner automorphism of the group of all permutations of . It follows that for each , there exists a unique bijection such that . Let be the identity map on ; and for each , let . Then we will write , and say that is the diagonal subgroup determined by the bijections . Finally, in the degenerate case when , we will take to be the only diagonal subgroup of and we will take to be the identity map on .
Lemma 4.8**.**
For -a.e. , if is the set of nontrivial -orbits, then each is infinite and .
Proof.
By Lemma 4.7, for -a.e. , if is a nontrivial -orbit, then is infinite and induces at least on . Let be such a subgroup, let is the set of nontrivial -orbits, and let .
Claim 4.9**.**
There exists a partition of into finite subsets such that
[TABLE]
where the diagonal subgroups are determined by unique bijections for , .
Sketch proof of Claim 4.9.
For each , let , where , and let . Then clearly each is a finite subset of . Let be the collection of minimal subsets such that there exists with . Then, using the simplicity of the infinite alternating group and the fact that projects onto each , it is easily checked that is a partition of and that
[TABLE]
for some collection of bijections
[TABLE]
∎
Let be the equivalence relation on such that if , then if and only if there exists and such that . Clearly the map is -equivariant, and hence is an ergodic invariant random equivalence relation. Applying Lemma 4.6, since every -class is finite, it follows that each . ∎
Let be the -equivariant map from to such that is the -orbit equivalence relation. Then is an ergodic invariant random equivalence relation; and hence, applying Theorem 4.4, it follows that there exists an such that . Since , it follows that . Let . Then for -a.e. , there exists a -generic such that the -orbit decomposition is given by
[TABLE]
As we mentioned in Remark 4.5, if is such that there exist with , then the map is not injective. In more detail, let be the equivalence relation on defined by
[TABLE]
and let be the decomposition of into -classes. Then clearly each is finite. Let be the full direct product of the finite groups , and let be the measure-preserving action defined by
[TABLE]
Then is a (possibly trivial) compact group; and if , are -generic, then if and only if there exists such that .
Definition 4.11**.**
A subgroup is said to be -generic if:
- (i)
there exists a -generic such that the -orbit decomposition is given by (4.10); and 2. (ii)
satisfies the conclusion of Lemma 4.8.
Let be -generic and let be the -generic function chosen so that if is a nontrivial -class, then the corresponding orbits are listed in the order of their least elements. Let
[TABLE]
and let . Once again, let . Then the natural action induces a corresponding action . For each , let be the corresponding -orbit. Since is a compact group, it follows that is a standard Borel space. Furthermore, the Borel map is clearly -invariant. Hence, by ergodicity, there exists a fixed such that for -a.e. . Let be the set of -generic such that . Then both and concentrate on . Hence, in order to complete the proof of Theorem 1.1, it is enough to show that the action is uniquely ergodic. As we will explain, this is a straightforward consequence of the Pointwise Ergodic Theorem.
For each pair , of finite disjoint subsets of , let
[TABLE]
Then the sets form a clopen basis of the space ; and thus it is enough to show that for all such , . Hence, by the Pointwise Ergodic Theorem, it is enough to show that if , , then
[TABLE]
Equivalently, letting and , it is enough to show that
[TABLE]
To see this, first note that after changing our choice of if necessary, we can suppose that . Next fix some and choose an integer such that . Let and let be such that and for all . Then it is easily checked that if is sufficiently large, then
[TABLE]
and so (4.12) holds. This completes the proof of Theorem 1.1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Abért, Y. Glasner and B. Virág, Kesten’s theorem for Invariant Random Subgroups , Duke Math. J. 163 (2014), 465–488.
- 2[2] D. Creutz and J. Peterson, Stabilizers of ergodic actions of lattices and commensurators , Trans. Amer. Math. Soc. 369 (2017), 4119–4166.
- 3[3] C.W. Curtis and I. Reiner, Methods Of Representation Theory , vol. 1, Wiley, New York, 1981.
- 4[4] J. F. C. Kingman, The representation of partition structures , J. London Math. Soc. 18 (1978), 374–380.
- 5[5] E. Lindenstrauss, Pointwise theorems for amenable groups , Electron. Res. Announc. Amer. Math. Soc. 5 (1999), 82–90.
- 6[6] P. M. Neumann, The lawlessness of groups of finitary permutations , Arch. Math. 26 (1975), 561–566.
- 7[7] E. Thoma, Die unzerlegbaren, positiv-definiten Klassenfunktionen der abzählbar unendlichen, symmetrischen Gruppe Math. Z. 85 (1964), 40–61.
- 8[8] S. Thomas and R. Tucker-Drob, Invariant random subgroups of strictly diagonal limits of finite symmetric groups , Bull. Lond. Math. Soc. 46 (2014), 1007–1020.
