How Do Elements of Direct Product Groups Commute in Particle Physics?

foobar
Messages
17
Reaction score
0
From Gauge Theory of particle physics, Cheng and Li I don't understand the flollowing:

"Given any two groups G={g1,..} H= {h1,h2,...}
if the g's commute with the h's we can define a direct product group G x H={g_ih_j} with the multplication law:
g_kh_l . g_mh_n = g_kh_m . h_lh_n

Examples of direct product groups are SU(2) x U(1) ( the group consists of elements which are direct products of SU(2) matrices and the U(1) phase factor) and
SU(3) x SU(3) (the group consists of elements which are direct products of matrices of two different SU(3)'s."

My question is: You need the g's and h's to commute. I can see how SU(2) and U(1) elements can commute. I don't see how an element of SU(3) commutes with
another SU(3) element?
 
Physics news on Phys.org
foobar said:
"Given any two groups G={g1,..} H= {h1,h2,...}
if the g's commute with the h's
What he means is if they commute in the group we're about to form.

This statement, as written, doesn't make sense: if all we have is a group G and a group H, then we don't have a way to multiply an element of G with an element of H. But in the process of building a new group, we have lots of freedom to choose how such a multiplication might make sense.


I don't see how an element of SU(3) commutes with
another SU(3) element?
In particular, the issue here is that the elements of the different 'copies' of SU(3) commute, simply by the definition of the product group. If I paint one copy red and another copy blue, then we can have both
{\color{red} x y} \neq {\color{red} y x}
and
{\color{red} x} {\color{blue} y} = {\color{blue} y} {\color{red} x}
because the product is defined differently for elements of the same color and of opposite colors.


An isomorphic way to define GxH is as the group whose elements are ordered pairs (g, h) where g is in G and h is in H, and whose multiplication is performed pointwise.

i.e. (g,h)(g',h') = (gg',hh')

We can then identify each element g of G with its image (g,1) in GxH. Similarly, we can identify h with (1,h). If we do this, note that the g's commute with the h's under this convention:

(g, 1) (1, h) = (1, h) (g, 1)
 
Last edited:
thanks for that.

But still was a bit confused.But found this in a set of lecture notes on group theory( which I quit):

elements of A x B were written (a,b)
can write this as (a,b) = (a,e_B)(e_A,b)=(e_A,b)(a,e_B)=(ae,eb)=(a,b)

shorthand notation for elements of A x B
ab=ba letting (a,e_B) \rightarrow &quot;a&quot; [/itex]<br /> and (e_A,b) \rightarrow &amp;quot;b&amp;quot;
 
##\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

Replies
13
Views
582
Replies
3
Views
3K
Replies
3
Views
447
Replies
14
Views
3K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
4
Views
2K
Back
Top