Papers
Topics
Authors
Recent
Search
2000 character limit reached

Chief factors in Polish groups

Published 2 Sep 2015 in math.GR and math.LO | (1509.00719v4)

Abstract: In finite group theory, chief factors play an important and well-understood role in the structure theory. We here develop a theory of chief factors for Polish groups. In the development of this theory, we prove a version of the Schreier refinement theorem. We also prove a trichotomy for the structure of topologically characteristically simple Polish groups. The development of the theory of chief factors requires two independently interesting lines of study. First we consider injective, continuous homomorphisms with dense normal image. We show such maps admit a canonical factorization via a semidirect product, and as a consequence, these maps preserve topological simplicity up to abelian error. We then define two generalizations of direct products and use these to isolate a notion of semisimplicity for Polish groups.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.