How to show SU(n) is a normal subgroup of U(n)

vertices
Messages
62
Reaction score
0
Hi

I'd like to show that SU(n) is a normal subgroup of U(n).

Here are my thoughts:

1)The kernel of of homomorphism is a normal subgroup.

2)So if we consider a mapping F: G-> G'=det(G)

3)Then all elements of G which are SU(n), map to the the identity of G', therefore SU(n) is a normal subgroup of GL(n,C).

Firstly, is this correct?

Also, a very stupid question, but can I ask whether my musings constitute a formal 'proof'? I mean, would I need to show prove statements (1) and (2) (ie. show it obeys the homom. property) or can I just say that I've assumed that they are for the purposes of the proof at hand?

Thanks.
 
Physics news on Phys.org
vertices said:
Hi

I'd like to show that SU(n) is a normal subgroup of U(n).

Here are my thoughts:

1)The kernel of of homomorphism is a normal subgroup.

2)So if we consider a mapping F: G-> G'=det(G)

3)Then all elements of G which are SU(n), map to the the identity of G', therefore SU(n) is a normal subgroup of GL(n,C).

Firstly, is this correct?

Also, a very stupid question, but can I ask whether my musings constitute a formal 'proof'? I mean, would I need to show prove statements (1) and (2) (ie. show it obeys the homom. property) or can I just say that I've assumed that they are for the purposes of the proof at hand?

Thanks.

you are correct - formal proofs can assume other known theorems - it is a matter of how much your reader needs to see and how much he already knows.
 
wofsy said:
you are correct - formal proofs can assume other known theorems - it is a matter of how much your reader needs to see and how much he already knows.

thanks wofsy... I should have given a bit of context.

I'm going to sit an exam on introductory group theory, lie algebras and representations very soon... I feel a bit unsure when I see "prove that" questions (my excuse, if you can call it that, is that my background isn't in mathematics but I am doing a masters in one and I don't know many of the things I am expected to know...)
 
vertices said:
thanks wofsy... I should have given a bit of context.

I'm going to sit an exam on introductory group theory, lie algebras and representations very soon... I feel a bit unsure when I see "prove that" questions (my excuse, if you can call it that, is that my background isn't in mathematics but I am doing a masters in one and I don't know many of the things I am expected to know...)

I would say that theorems in your book or theorems proved in class you can refer to without proof. But the best way to know is to ask you teacher.
 
##\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