Talk on extensible automorphisms: Difference between revisions

Revision as of 18:49, 15 September 2008

This is (approximately) the transcript of a talk given by Vipul Naik as part of the Graduate Student Talks for the Research Experiences for Undergraduates (REU) at the University of Chicago, on August 13, 2008

Plan of the talk: An automorphism of a group is termed extensible if it can be extended to an automorphism for every bigger group containing it. All inner automorphisms are clearly extensible. Is the converse true?

The talk is divided in two parts. The first part focuses on the Problem: it lays out definitions of homomorphism, automorphism and inner automorphism, and then examines in excruciating detail the (easy) proof that every inner automorphism is extensible. The second part is focused on a partial solution: it introduces ideas of linear representation theory, and (with a bit of hand-waving) proves a partial converse.

Prerequisites for the talk: A clear understanding of the definition of group. Knowledge of homomorphism, automorphism etc. is helpful but these terms will anyway be defined clearly in the talk. For the second part of the talk, linear representation theory is helpful to know, though you should be able to follow the talk if you're willing to take my word for things.

Transcript of part one of the talk

Vipul: So I'll assume that everybody knows what a group is, and I'll define a homomorphism of groups.

Audience person: Could we skip that?

Vipul: No, it's very important.

Audience person (other): Good.

Chalkboard (1,1):

Def: Homomorphism of groups: Given group $G, H$ a homomorphism from $G$ to $H$ is a map $f : G \to H$ such that:

$f (a b) = f (a) f (b) \forall a, b \in G$

$f (a^{- 1}) = f (a)^{- 1} \forall a \in G$

$f (e) = e$

Vipul: So a homomorphism is a map that preserves the group structure. Group structure has three aspects: the multiplication, the inverse map and the identity element, so the homomorphism must preserve all three.

A homomorphism preserves words. So $f (a b^{2} c d^{- 3}) = f (a) f (b)^{2} f (c) f (d)^{- 3}$ . So, a homomorphism also preserves equations. So if $a b^{2} = c d$ then $f (a) f (b)^{2} = f (c) f (d)$ .

But a homomorphism doesn't preserve inequations. So if $a b \neq c d$ we might still have $f (a) f (b) = f (c) f (d)$ . Basically, that's because the homomorphism may not be injective. So, you cannot pull equations back via homomorphisms.

Now, there's one special example of a homomorphism we've all seen, and that's the inclusion of a subgroup in a group.

Chalkboard (1,1):

Def: Homomorphism of groups: Given group $G, H$ a homomorphism from $G$ to $H$ is a map $f : G \to H$ such that:

$f (a b) = f (a) f (b) \forall a, b \in G$

$f (a^{- 1}) = f (a)^{- 1} \forall a \in G$

$f (e) = e$
The inclusion of a subgroup in a group is an injective homomorphism: If
$G \leq H$
, the inclusion of
$G$
in
$H$
is an injective homomorphism.

So homomorphisms preserve structure, but this preservation of structure is one-way. They could lead to some kind of collapse. So now let's introduce a certain kind of homomorphism that preserves structure two-way:

Chalkboard (1,1):

Def: Homomorphism of groups: Given group $G, H$ a homomorphism from $G$ to $H$ is a map $f : G \to H$ such that:

$f (a b) = f (a) f (b) \forall a, b \in G$

$f (a^{- 1}) = f (a)^{- 1} \forall a \in G$

$f (e) = e$

The inclusion of a subgroup in a group is an injective homomorphism: If $G \leq H$ , the inclusion of $G$ in $H$ is an injective homomorphism.

Definition: Automorphism of a group: An automorphism of a group
$G$
is a bijective homomorphism from
$G$
to
$G$
. The set of automorphisms of a group
$G$
is denoted as
$A u t (G)$
.

So automorphisms preserve structure both ways. They preserve equations, and also inequations. Automorphisms can be thought of as symmetries of a group. I'll get to this view later.

Am I going too fast?

Audience member: No no.

Vipul: So what I'm going to do now is something miraculous, remarkable. You may have seen it before and not realized how wondrous it is.

Chalkboard (2,1):

Definition:Conjugation by an element: Define, for a group $G$ , the operation of conjugation by an element:
$c_{g} (x) = g x g^{- 1}$

This is called conjugating $x$ by $g$ .

Now, I'm thinking of this, not as an operation that takes two variables and gives an answer, but rather, as an operation with one parameter, the conjugating element $g$ , and one variable, the group element $x$ . In other words, for any fixed value of $g$ , I get a map $c_{g}$ from $G$ to $G$ that feeds on $x$ and spits out $g x g^{- 1}$ .

And now for the really remarkable theorem:

Chalkboard (2,1):

Definition:Conjugation by an element: Define, for a group $G$ , the operation of conjugation by an element:
$c_{g} (x) = g x g^{- 1}$
Theorem: For any group $G$ and any element $g \in G$ , the function $c_{g}$ is an automorphism of $G$ .

Notice the any here, that's again important. There are many different kinds of groups, and this results says that whatever group you pick, and whatever element you pick in it, you get an automorphism. So let's do this proof.

Chalkboard (2,1):

Definition:Conjugation by an element: Define, for a group $G$ , the operation of conjugation by an element:
$c_{g} (x) = g x g^{- 1}$
Theorem: For any group $G$ and any element $g \in G$ , the function $c_{g}$ is an automorphism of $G$ .
Proof: We check the three conditions for a homomorphism:

$c_{g} (a) c_{g} (b) = g a g^{- 1} g b g^{- 1} = g a e b g^{- 1} = g a b g^{- 1} = c_{g} (a b)$

Failed to parse (syntax error): {\displaystyle c_g(a^{-1}) = ga^{-1}g^{-1} = (g^{-1})^{-1}a^{-1}g^{-1} = (gag^{-1}_^{-1} = c_g(a)^{-1}}

$c_{g} (e) = g e g^{- 1} = e$

Next, we check that it is bijective. For this, it suffices to show that $c_{(} g^{- 1})$ is a two-sided inverse for $c_{g}$ :

$c_{g^{- 1}} (c_{g} (a)) = g^{- 1} (g a g^{- 1}) g = a$

$c_{g} (c_{g^{- 1}} (a)) = g (g^{- 1} a g) g^{- 1} = a$

Definition: Inner automorphism: An automorphism $σ$ of a group is termed an inner automorphism if there exists $g \in G$ such that $σ = c_{g}$ . The set of inner automorphisms of $G$ is denoted $I n n (G)$ .

So we've already done the hard work. And if you think of it, it's remarkable: the fact that a simple formula is guaranteed to always yield an automorphism. So now let's reap the rewards of this with a cute theorem.

Chalkboard (2,2):

Theorem: If $G \leq H$ , and $σ \in I n n (G)$ , there exists $σ^{'} \in I n n (H)$ such that the restriction of $σ^{'}$ to $G$ is $σ$ .
Proof: Since $σ$ is inner, there exists $g \in G$ , such that $σ = c_{g}$ .
$G \leq H$ , so $g \in H$ .
Define $σ^{'} = c_{g}$ (thought of as an element of $H$ . Clearly, the restriction of $σ^{'}$ to $G$ is $σ$ .

Now, this proof really relied on the fact that inner automorphisms arose from a formula, and that formula is guaranteed to work in $H$ , a totally new group over which we have no control.

So this motivates a definition.

Chalkboard (1,2):

Definition: Extensible automorphism: $σ \in A u t (G)$ is termed extensible if for any group $H$ containing $G$ , there exists $σ^{'} \in A u t (H)$ such that the restriction of $σ^{'} < m a t h > t o < m a t h > G$ is $σ$ .

Now, remember (pointing at Chalkboard (1,1)) that the inclusion of a subgroup is just a special case of a homomorphism. So instead of extending, may be we can talk of pushing forward via a homomorphism:

Chalkboard (1,2):

Definition: Extensible automorphism: $σ \in A u t (G)$ is termed extensible if for any group $H$ containing $G$ , there exists $σ^{'} \in A u t (H)$ such that the restriction of $σ^{'} < m a t h > t o < m a t h > G$ is $σ$ .
Definition: Pushforwardable automorphism: $σ \in A u t (G)$ is termed pushforwardable if for any homomorphism $f : G \to H$ , there exists $σ^{'} \in A u t (H)$ such that $σ^{'} \circ f = f \circ σ$ .

Chalkboard (2,2) (modified dynamically)

Theorem: If $f : G \to H$ is a homomorphism, and $σ \in I n n (G)$ , there exists $σ^{'} \in I n n (H)$ such that the restriction of $σ^{'}$ to $G$ is $σ$ .

So let's prove the analogous theorem for this for inner automorphisms. Let's see how we can modify the previous theorem. We cannot now choose $σ^{'}$ as conjugation by $g$ . Any guesses as to how we should choose $σ^{'}$ ?

Audience member: $f (g)$ ?

Vipul: Any other guesses?

(No guesses)

Vipul: So at least we have unanimity here. So let's complete the proof.

Chalkboard (2,2) (modified dynamically)

Theorem: If $f : G \to H$ is a homomorphism, and $σ \in I n n (G)$ , there exists $σ^{'} \in I n n (H)$ such that $f \circ σ = σ^{'} \circ f$ . Proof: Since $σ$ is inner, there exists $g \in G$ , such that $σ = c_{g}$ .
Define $σ^{'} = c_{f (g)}$ .
Check: $(f \circ σ) (a) = f (σ (a)) = f (c_{g} (a)) = f (g a g^{- 1}) = f (g) f (a) f (g)^{- 1} = c_{f (g)} (f (a)) = (σ^{'} \circ f) (a)$

So this might seem like some silly manipulation, but it goes back to what I said at the beginning. A homomorphism preserves words. The particular form of the word $g a g^{- 1}$ doesn't really matter, what matters for the proof is that there is a word.

There's a rule. A rule that is guaranteed to work. And because we have the rule, we can extend or push forward wherever we want.

So now how about pulling back? There's a little problem here, which is that we may not be able to pull back the element doing the conjugation. So we need to add the surjectivity condition.

Chalkboard (1,2):

Definition: Extensible automorphism: $σ \in A u t (G)$ is termed extensible if for any group $H$ containing $G$ , there exists $σ^{'} \in A u t (H)$ such that the restriction of $σ^{'} < m a t h > t o < m a t h > G$ is $σ$ .
Definition: Pushforwardable automorphism: $σ \in A u t (G)$ is termed pushforwardable if for any homomorphism $f : G \to H$ , there exists $σ^{'} \in A u t (H)$ such that $σ^{'} \circ f = f \circ σ$ .
Definition: Quotient-pullbackable automorphism: $σ \in A u t (G)$ is termed quotient-pullbackable if for any surjective homomorphism $f : K \to G$ there exists $σ^{'} \in A u t (K)$ such that $f \circ σ^{'} = σ^{'} c i r c f$ .

So we prove this essentially by picking an arbitrary inverse image for $g$ under the homomorphism.

Chalkboard (2,2) (modified dynamically)

Theorem: If $f : K \to G$ is a homomorphism, and $σ \in I n n (G)$ , there exists $σ^{'} \in I n n (K)$ such that the restriction of $f \circ σ^{'} = σ \circ f$ .
Proof: Since $σ$ is inner, there exists $g \in G$ , such that $σ = c_{g}$ .
Define $σ^{'} = c_{k}$ where $k \in f^{- 1} (g)$ .
Check: $(f \circ σ^{'}) (a) = f (σ^{'} (a)) = f (c_{k} (a)) = f (k a k^{- 1}) = f (k) f (a) f (k)^{- 1} = c_{f (k)} (f (a)) = c_{g} (f (a)) = (σ \circ f) (a)$

@@ Line 48: / Line 48: @@
 * <math>f(e) = e</math>
 The '''inclusion of a subgroup in a group''' is an injective homomorphism: If <math>G \le H</math>, the inclusion of <math>G</math> in <math>H</math> is an injective homomorphism.<br>
-'''Definition: Automorphism of a group''': An automorphism of a group <math>G</math> is a bijective homomorphism from <math>G</math> to <math>G</math>}}
+'''Definition: Automorphism of a group''': An automorphism of a group <math>G</math> is a bijective homomorphism from <math>G</math> to <math>G</math>. The set of automorphisms of a group <math>G</math> is denoted as <math>\operatorname{Aut}(G)</math>.}}
 So automorphisms preserve structure both ways. They preserve equations, and also inequations. Automorphisms can be thought of as ''symmetries'' of a group. I'll get to this view later.
@@ Line 73: / Line 73: @@
 <math>c_g(x) = gxg^{-1}</math><br>
 '''Theorem''': For ''' ''any'' ''' group <math>G</math> and ''' ''any'' ''' element <math>g \in G</math>, the function <math>c_g</math> is an automorphism of <math>G</math>.
+}}
+Notice the ''' ''any'' ''' here, that's again important. There are many different kinds of groups, and this results says that ''whatever'' group you pick, and ''whatever'' element you pick in it, you get an automorphism. So let's do this proof.
+{{quotation|'''Chalkboard (2,1)''':<br>
+'''Definition:Conjugation by an element''': Define, for a group <math>G</math>, the operation of conjugation by an element:<br>
+<math>c_g(x) = gxg^{-1}</math><br>
+'''Theorem''': For ''' ''any'' ''' group <math>G</math> and ''' ''any'' ''' element <math>g \in G</math>, the function <math>c_g</math> is an automorphism of <math>G</math>.<br>
+'''Proof''': We check the three conditions for a homomorphism:
+* <math>c_g(a)c_g(b) = gag^{-1}gbg^{-1} = gaebg^{-1} = gabg^{-1} = c_g(ab)</math>
+* <math>c_g(a^{-1}) = ga^{-1}g^{-1} = (g^{-1})^{-1}a^{-1}g^{-1} = (gag^{-1}_^{-1} = c_g(a)^{-1}</math>
+* <math>c_g(e) = geg^{-1} = e</math>
+Next, we check that it is bijective. For this, it suffices to show that <math>c_(g^{-1})</math> is a two-sided inverse for <math>c_g</math>:
+* <math>c_{g^{-1}}(c_g(a)) = g^{-1}(gag^{-1})g = a</math>
+* <math>c_g(c_{g^{-1}}(a)) = g(g^{-1}ag)g^{-1} = a</math><br>
+'''Definition: Inner automorphism''': An automorphism <math>\sigma</math> of a group is termed an inner automorphism if there exists <math>g \in G</math> such that <math>\sigma = c_g</math>. The set of inner automorphisms of <math>G</math> is denoted <math>\operatorname{Inn}(G)</math>.
+}}
+So we've already done the hard work. And if you think of it, it's remarkable: the fact that a simple formula is ''guaranteed'' to ''always'' yield an automorphism. So now let's reap the rewards of this with a cute theorem.
+{{quotation|'''Chalkboard (2,2)''':<br>
+'''Theorem''': If <math>G \le H</math>, and <math>\sigma \in \operatorname{Inn}(G)</math>, there exists <math>\sigma' \in \operatorname{Inn}(H)</math> such that the restriction of <math>\sigma'</math> to <math>G</math> is <math>\sigma</math>.<br>
+'''Proof''': Since <math>\sigma</math> is inner, there exists <math>g \in G</math>, such that <math>\sigma = c_g</math>.<br>
+<math>G \le H</math>, so <math>g \in H</math>.<br>
+Define <math>\sigma' = c_g</math> (thought of as an element of <math>H</math>. Clearly, the restriction of <math>\sigma'</math> to <math>G</math> is <math>\sigma</math>.
+}}
+Now, this proof really relied on the fact that inner automorphisms arose from a formula, and that formula is guaranteed to work in <math>H</math>, a totally new group over which we have no control.
+So this motivates a definition.
+{{quotation|'''Chalkboard (1,2)''':<br>
+'''Definition: Extensible automorphism''': <math>\sigma \in \operatorname{Aut}(G)</math> is termed '''extensible''' if for any group <math>H</math> containing <math>G</math>, there exists <math>\sigma' \in \operatorname{Aut}(H)</math> such that the restriction of <math>\sigma'<math> to <math>G</math> is <math>\sigma</math>.
+}}
+Now, remember (''pointing at Chalkboard (1,1)'') that the inclusion of a subgroup is just a special case of a homomorphism. So instead of extending, may be we can talk of pushing forward via a homomorphism:
+{{quotation|'''Chalkboard (1,2)''':<br>
+'''Definition: Extensible automorphism''': <math>\sigma \in \operatorname{Aut}(G)</math> is termed '''extensible''' if for any group <math>H</math> containing <math>G</math>, there exists <math>\sigma' \in \operatorname{Aut}(H)</math> such that the restriction of <math>\sigma'<math> to <math>G</math> is <math>\sigma</math>.<br>
+'''Definition: Pushforwardable automorphism''': <math>\sigma \in \operatorname{Aut}(G)</math> is termed '''pushforwardable''' if for any homomorphism <math>f:G \to H</math>, there exists <math>\sigma' \in \operatorname{Aut}(H)</math> such that <math>\sigma' \circ f = f \circ \sigma</math>.
+}}
+{{quotation|'''Chalkboard (2,2) (modified dynamically)''' <br>
+'''Theorem''': If <math>f:G \to H</math> is a homomorphism, and <math>\sigma \in \operatorname{Inn}(G)</math>, there exists <math>\sigma' \in \operatorname{Inn}(H)</math> such that the restriction of <math>\sigma'</math> to <math>G</math> is <math>\sigma</math>.
+}}
+So let's prove the analogous theorem for this for inner automorphisms. Let's see how we can modify the previous theorem. We cannot now choose <math>\sigma'</math> as conjugation by <math>g</math>. Any guesses as to how we should choose <math>\sigma'</math>?
+''Audience member'': <math>f(g)</math>?
+''Vipul'': Any other guesses?
+(No guesses)
+''Vipul'': So at least we have unanimity here. So let's complete the proof.
+{{quotation|'''Chalkboard (2,2) (modified dynamically)''' <br>
+'''Theorem''': If <math>f:G \to H</math> is a homomorphism, and <math>\sigma \in \operatorname{Inn}(G)</math>, there exists <math>\sigma' \in \operatorname{Inn}(H)</math> such that <math>f \circ \sigma = \sigma' \circ f</math>.
+'''Proof''': Since <math>\sigma</math> is inner, there exists <math>g \in G</math>, such that <math>\sigma = c_g</math>.<br>
+Define <math>\sigma' = c_{f(g)}</math>.<br>
+Check: <math>(f \circ \sigma) (a) = f(\sigma(a)) = f(c_g(a)) = f(gag^{-1}) = f(g)f(a)f(g)^{-1} = c_{f(g)}(f(a)) = (\sigma' \circ f)(a)</math>
+}}
+So this might seem like some silly manipulation, but it goes back to what I said at the beginning. A homomorphism preserves ''words''. The particular form of the word <math>gag^{-1}</math> doesn't really matter, what matters for the proof is that there is a word.
+There's a '''rule'''. A rule that is guaranteed to work. And because we have the rule, we can extend or push forward wherever we want.
+So now how about pulling back? There's a little problem here, which is that we may not be able to pull back the element doing the conjugation. So we need to add the surjectivity condition.
+{{quotation|'''Chalkboard (1,2)''':<br>
+'''Definition: Extensible automorphism''': <math>\sigma \in \operatorname{Aut}(G)</math> is termed '''extensible''' if for any group <math>H</math> containing <math>G</math>, there exists <math>\sigma' \in \operatorname{Aut}(H)</math> such that the restriction of <math>\sigma'<math> to <math>G</math> is <math>\sigma</math>.<br>
+'''Definition: Pushforwardable automorphism''': <math>\sigma \in \operatorname{Aut}(G)</math> is termed '''pushforwardable''' if for any homomorphism <math>f:G \to H</math>, there exists <math>\sigma' \in \operatorname{Aut}(H)</math> such that <math>\sigma' \circ f = f \circ \sigma</math>.<br>
+'''Definition: Quotient-pullbackable automorphism''': <math>\sigma \in \operatorname{Aut}(G)</math> is termed '''quotient-pullbackable''' if for any surjective homomorphism <math>f:K \to G</math> there exists <math>\sigma' \in \operatorname{Aut}(K)</math> such that <math>f \circ \sigma' = \sigma 'circ f</math>.
+}}
+So we prove this essentially by picking an arbitrary inverse image for <math>g</math> under the homomorphism.
+{{quotation|'''Chalkboard (2,2) (modified dynamically)''' <br>
+'''Theorem''': If <math>f:K \to G</math> is a homomorphism, and <math>\sigma \in \operatorname{Inn}(G)</math>, there exists <math>\sigma' \in \operatorname{Inn}(K)</math> such that the restriction of <math>f \circ \sigma' = \sigma \circ f</math>.<br>
+'''Proof''': Since <math>\sigma</math> is inner, there exists <math>g \in G</math>, such that <math>\sigma = c_g</math>.<br>
+Define <math>\sigma' = c_k</math> where <math>k \in f^{-1}(g)</math>.<br>
+Check: <math>(f \circ \sigma') (a) = f(\sigma'(a)) = f(c_k(a)) = f(kak^{-1}) = f(k)f(a)f(k)^{-1} = c_{f(k)}(f(a)) = c_g(f(a)) = (\sigma \circ f)(a)</math>
 }}