2000 character limit reached
On surjectively universal Polish groups
Published 11 Sep 2011 in math.LO | (1109.2283v1)
Abstract: A Polish group is surjectively universal if it can be continuously homomorphically mapped onto every Polish group. Making use of a type of new metrics on free groups \cite{DG}, we prove the existence of surjectively universal Polish groups, answering in the positive a question of Kechris. In fact, we give several examples of surjectively universal Polish groups. We find a sufficient condition to guarantee that the new metrics on free groups can be computed directly. We also compare this condition with CLI groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.