Papers
Topics
Authors
Recent
Search
2000 character limit reached

Compact groups with probabilistically central monothetic subgroups

Published 30 Sep 2021 in math.GR | (2110.00049v3)

Abstract: If $K$ is a closed subgroup of a compact group $G$, the probability that randomly chosen pair of elements from $K$ and $G$ commute is denoted by $Pr(K,G)$. Say that a subgroup $K\leq G$ is $\epsilon$-central in $G$ if $Pr(\langle g \rangle,G)\geq \epsilon$ for any $g$ in $K$. Here $\langle g \rangle$ denotes the monothetic subgroup generated by $g\in G$. Our main result is that if $K$ is $\epsilon$-central in $G$, then there is an $\epsilon$-bounded number $e$ and a normal subgroup $T\leq G$ such that the index $[G:T]$ and the order of the commutator subgroup $[Ke,T]$ both are finite and $\epsilon$-bounded. In particular, if $G$ is a compact group for which there is $\epsilon>0$ such that $Pr(\langle g \rangle,G)\geq \epsilon$ for any $g \in G$, then there is an $\epsilon$-bounded number $e$ and a normal subgroup $T$ such that the index $[G:T]$ and the order of $[Ge,T]$ both are finite and $\epsilon$-bounded.

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.