No Uncountable Polish Group Can be a Right-Angled Artin Group
Gianluca Paolini, Saharon Shelah

TL;DR
This paper demonstrates that uncountable Polish groups cannot have a generator system with a length function satisfying specific properties, implying such groups cannot be automorphism groups of uncountable structures, extending previous results.
Contribution
It proves that uncountable Polish groups cannot be right-angled Artin groups, generalizing earlier results for free and free Abelian groups.
Findings
Uncountable Polish groups cannot admit certain length functions.
Automorphism groups of countable structures are not uncountable right-angled Artin groups.
Extends previous results from free and free Abelian groups.
Abstract
We prove that no uncountable Polish group can admit a system of generators whose associated length function satisfies the following conditions: (i) if , then ; (ii) if and , then . In particular, the automorphism group of a countable structure cannot be an uncountable right-angled Artin group. This generalizes results from [3] and [5], where this is proved for free and free Abelian uncountable 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
TopicsAdvanced Topology and Set Theory · Geometric and Algebraic Topology · Mathematical Dynamics and Fractals
No Uncountable Polish Group Can be a Right-Angled Artin Group
Gianluca Paolini
Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Israel
and
Saharon Shelah
Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Israel and Department of Mathematics, Rutgers University, U.S.A.
Abstract.
We prove that no uncountable Polish group can admit a system of generators whose associated length function satisfies the following conditions:
- (i)
if , then ; 2. (ii)
if and , then .
In particular, the automorphism group of a countable structure cannot be an uncountable right-angled Artin group. This generalizes results from [3] and [5], where this is proved for free and free abelian uncountable groups.
Partially supported by European Research Council grant 338821. No. 1112 on Shelah’s publication list.
In a meeting in Durham in 1997, Evans asked if an uncountable free group can be realized as the group of automorphisms of a countable structure. This was settled in the negative by Shelah [3]. Independently, in the context of descriptive set theory, Becher and Kechris [1] asked if an uncountable Polish group can be free. This was also answered negatively by Shelah [4], generalizing the techniques of [3]. Inspired by the question of Becher and Kechris, Solecki [5] proved that no uncountable Polish group can be free abelian. In this paper we give a general framework for these results, proving that no uncountable Polish group can be a right-angled Artin group (see below for a definition). We actually prove more:
Theorem 1**.**
Let be an uncountable Polish group and a group admitting a system of generators whose associated length function satisfies the following conditions:
- (i)
if , then ; 2. (ii)
if and , then .
Then is not isomorphic to , in fact there exists a subgroup of of size (the bounding number) such that is not embeddable in .
Proof.
Let be such that , for every , and such that and , for every . Let be a set of power of increasing functions which is unbounded with respect to the partial order of eventual domination. For transparency we also assume that for every we have . For , define the following set of equations:
[TABLE]
By [4], for every , is solvable in . Let witness it, i.e.:
[TABLE]
Let be the subgroup of generated by . Towards contradiction, suppose that is an embedding of into , and let be a system of generators for whose associated length function satisfies conditions (i) and (ii) of the statement of the theorem. For and , let:
[TABLE]
Now, is a function from to and so there exists unbounded such that for every the value is a constant . Fix such a and , and let increasing satisfying the following:
- (1)
; 2. (2)
.
Claim 1.1*.* For every , .
Proof. By induction on . The case is clear by the choice of and . Let . Because of assumption (i) on , the choice of and the choice of and , we have:
[TABLE]
Now, by the choice of , we can find and such that . Notice then that by the claim above and the choice of and we have:
[TABLE]
[TABLE]
Thus, by (1) and the fact that , using assumption (ii) we infer that . Hence,
[TABLE]
Furthermore, if , then, again by assumption (ii), we have that , and so , which contradicts the choice of . Hence, , contradicting (2). It follows that the embedding from into cannot exist. ∎
Definition 2**.**
Given a graph , the right-angled Artin group is the group with presentation .
Thus, for a graph with no edges (resp. a complete graph) is a free group (resp. a free abelian group).
Definition 3**.**
Let be a right-angled Artin group and its associated length function. We say that an element is cyclically reduced if it cannot be written as with .
Fact 4**.**
Let be a right-angled Artin group, its associated length function and . Then:
- (1)
* can be written as with cyclically reduced and ;* 2. (2)
if and is cyclically reduced, then ; 3. (3)
if and is as in (1), then .
Proof.
Item (1) is proved in [2, Proposition on pg.38]. The rest is folklore. ∎
Corollary 5**.**
No uncountable Polish group can be a right-angled Artin group.
Proof.
By Theorem 1 it suffices to show that for every right-angled Artin group the associated length function satisfies conditions (i) and (ii) of the theorem, but by Fact 4 this is clear. ∎
As well known, the automorphism group of a countable structure is naturally endowed with a Polish topology which respects the group structure, hence:
Corollary 6**.**
The automorphism group of a countable structure can not be an uncountable right-angled Artin group.
The situation is different for right-angled Coxeter groups, in fact the structure with many disjoint unary predicates of size is such that , i.e. is the right-angled Coxeter group on (a complete graph on continuum many vertices). Notice that in this group for any we have:
- (i)
; 2. (ii)
, and .
We hope to investigate realizability of uncountable right-angled Coxeter groups as groups of automorphisms of countable structures in a future work.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Howard Becker and Alexander S. Kechris. The Descriptive Set Theory of Polish Group Actions . London Math. Soc. Lecture Notes Ser. 232, Cambridge University Press, 1996.
- 2[2] Herman Servatius. Automorphisms of Graph Groups . J. Algebra 126 (1989), 34-60.
- 3[3] Saharon Shelah. A Countable Structure Does Not Have a Free Uncountable Automorphism Group . Bull. London Math. Soc. 35 (2003), 1-7.
- 4[4] Saharon Shelah. Polish Algebras, Shy From Freedom . Israel J. Math. 181 (2011), 477-507.
- 5[5] Sławomir Solecki. Polish Group Topologies . In: Sets and Proofs, London Math. Soc. Lecture Note Ser. 258. Cambridge University Press, 1999.
