I would like to determine the automorphism group of the projective unitary group $G=PU(N)=PSU(N)$ and $G=SO(N)$. We also knew that $$ 0 \to \text{Inn}(G) \to \text{Aut}(G) \to \text{Out}(G) \to 0. $$
For $G=PU(2)=PSU(2)$, we have:
- $\text{Inn}(PU(2)) = PU(2)$,
- $\text{Out}(PU(2)) = 0$,
- And so $\text{Aut}(PU(2))=PU(2)$.
For $N > 2$, we have:
- the center $\text{Z}(PU(N)) =0$,
- $\text{Inn}(PU(N)) = PU(N)$,
I am not quite sure that $\text{Out}(PU(N)) =0 $, $\mathbb Z_2$, or others? $\text{Out}(PU(N))=?$
I am not quite sure that $\text{Aut}(PU(N))= PU(N) $, or others ? $\text{Aut}(PU(N))= ?$
For example, $PU(4)=PSU(4)=SU(4)/\mathbb{Z}_4=Spin(6)/\mathbb{Z}_4=SO(6)/\mathbb{Z}_2,$ what will be $\text{Out}(PU(4))=?$ and $\text{Aut}(PU(4))=?$
I think that $\text{Out}(SO(N))=\left\{\begin{array}{l} 0, \text{ if $N$ is odd} \\ \mathbb{Z}_2, \text{ if $N$ is even} \end{array}\right. ?$
I suspect that $\text{Aut}(SO(N))= \left\{\begin{array}{l} SO(N), \text{ if $N$ is odd} \\ O(N), \text{ if $N$ is even} \end{array}\right. $ ?
Would you be able to answer these? Thank you.
Explicit answers need to be included in order to get accepted and get the bounty.
@annie, since you like to get to the bottom of the answer, simply use the relation $$ 0 \to \text{Inn}(G) \to \text{Aut}(G) \to \text{Out}(G) \to 0. $$ and the fact about jdc share, and also: https://math.stackexchange.com/a/59919/79069
We can get: $\text{Inn}(SO(N))=SO(N). $
$\text{Out}(SO(N))=\left\{\begin{array}{l} 0, \text{ if $N$ is odd} \\ \mathbb{Z}_2, \text{ if $N$ is even} \end{array}\right. $
There is an exception that $\text{Out}(SO(8))=S_3.$
$\text{Aut}(SO(N))= \left\{\begin{array}{l} SO(N), \text{ if $N$ is odd} \\ O(N), \text{ if $N$ is even} \end{array}\right. $
$\text{Inn}(PU(N))=PU(N). $
$\text{Out}(PU(N))=\left\{\begin{array}{l} 0, \text{ if $N$ is odd} \\ \mathbb{Z}_2, \text{ if $N$ is even} \end{array}\right. $
$\text{Aut}(PU(N))= \left\{\begin{array}{l} PU(N), \text{ if $N$ is odd} \\ PU(N) \rtimes \mathbb{Z}_2, \text{ if $N$ is even} \end{array}\right. $
I hope this completely solve your puzzle.