Elementary property of maximal compact subgroup

quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32
It is said on wiki* that

"Maximal compact subgroups are not unique unless the group G is a semidirect product of a compact group and a contractible group, but they are unique up to conjugation, meaning that given two maximal compact subgroups K and L, there is an element g in G such that gKg^{-1}=L – hence a maximal compact subgroup is essentially unique, and people often speak of "the" maximal compact subgroup."

Why is that so? If the action of G on itself by conjugation were transitive it would be obvious but it isn't, is it?


*http://en.wikipedia.org/wiki/Maximal_compact_subgroup#Existence_and_uniqueness
 
Physics news on Phys.org
Just to clarify, what I am asking about is the "unique up to conjugation" part, not the first part about uniqueness in the case G is a semidirect product of a compact group and a contractible group.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top