I How is Conjugacy a Group Action?

Mr Davis 97
Messages
1,461
Reaction score
44
I am told that ##\varphi_g (x) = g x g^{-1}## is a group action of G on itself, called conjugacy. However, I am a little confused. I thought that a group action was defined as a binary operation ##\phi : G \times X \rightarrow X##, where ##G## is a group and ##X## is any set. However, this ##\varphi_g## is just a normal function ##\varphi_g : G \rightarrow G##. If this is not a binary operation, how is it a group action?
 
Last edited:
Physics news on Phys.org
Mr Davis 97 said:
I am told that ##\varphi_g (x) = g x g^{-1}## is a group action of G on itself, called conjugacy. However, I am a little confused. I thought that a group action was defined as a binary operation ##\phi : G \times X \rightarrow X##, where ##G## is a group and ##X## is any set. However, this ##\varphi_g## is just a normal function ##\varphi_g : G \rightarrow G##. If this is not a binary operation, how is it a group action?
##\phi = \varphi : G \times G \rightarrow G## defined by ##\phi(g,x) = \varphi (g,x) = \varphi_g(x) = gxg^{-1}## with ##X=G##.
 
fresh_42 said:
##\phi = \varphi : G \times G \rightarrow G## defined by ##\phi(g,x) = \varphi (g,x) = \varphi_g(x) = gxg^{-1}## with ##X=G##.
So is ##\varphi_g## the group action or is ##\varphi##?
 
Mr Davis 97 said:
So is ##\varphi_g## the group action or is ##\varphi##?
Formally, ##(\phi,G,X=G)## is, because it assigns to every group element ##g## a conjugation ##g \mapsto (x \mapsto gxg^{-1})## on ##X=G##, that is ##\phi = \varphi = (\phi=\varphi,G,X)## operates via conjugation ##(\varphi ,G,X) \ni (\varphi,g)=\varphi_g = (x \mapsto gxg^{-1})## on ##X=G##.

It is more important to know what a group action is, which is another word for "operates on". And another expression is "G is represented (here by conjugation) on ##X## (here =##G##)". So it's really easy to get confused when learning these terminology. If you actually want to define it rigorously then you will have to take the entire triple ##(\textrm{form of action, group, set upon the action takes place}) = (\phi, G, X) = (\varphi , G, G)##.

Your first question is based on the confusion, that you might not have considered that ##g \mapsto \varphi_g ## is already a mapping which gives you the missing argument in ##\phi##.
 
You might like to check that a group action by G on a set S is also equivalent to a homomorphism G-->Bij(S) where Bij(S) is the group of bijections of the set S with itself. This shows you that a group action is a way of representing an abstract group inside a concrete group of permutations.
 
##\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...
Back
Top