Groupprops, The Group Properties Wiki (pre-alpha)
Take a short survey about Math Resources on the Internet.

From Groupprops

This article gives the statement and possibly, proof, of an implication relation between two automorphism properties. That is, it states that every automorphism satisfying the first automorphism property (i.e., extensible automorphism) must also satisfy the second automorphism property (i.e., permutation-extensible automorphism)
View all automorphism property implications | View all automorphism property non-implications |Get help on looking up automorphism property implications/non-implications
Get more facts about extensible automorphism| Get more facts about permutation-extensible automorphism

Contents 1 Statement 2 Definitions used 2.1 Extensible automorphism 2.2 Permutation-extensible automorphism 3 Related facts 3.1 Applications 4 Facts used 5 Proof

Statement

Any extensible automorphism of a group is a permutation-extensible automorphism.

Definitions used

Extensible automorphism

Further information: Extensible automorphism

An automorphism σ of a group G is termed extensible if, for any embedding of G in a bigger group H, there exists an automorphism σ' of H such that the restriction of σ' to G equals σ.

Permutation-extensible automorphism

Further information: Permutation-extensible automorphism

An automorphism σ of a group G is termed permutation-extensible if, for any embedding of G in a symmetric group , there exists an element such that if σ' = c_h is conjugation by h, the restriction of σ' to G is σ. In other words, σ extends to an inner automorphism of .

Related facts

Applications

• Extensible implies subgroup-conjugating
• Extensible implies normal
• Extensible automorphism-invariant equals normal

Facts used

1. Symmetric groups on finite sets are complete: For n a natural number other than 2 or 6, the symmetric group on n elements is a complete group. In particular, every automorphism of it is inner.
2. Symmetric groups on infinite sets are complete: The symmetric group on any infinite set is a complete group. In particular, every automorphism of it is inner.

Proof

Given: A group G, an extensible automorphism σ of G. A set S with an embedding .

To prove: σ extends to an inner automorphism of .

Proof: We consider the following cases:

• S is infinite: By assumption, σ extends to an automorphism of . By fact (2), this automorphism must be inner. Hence, σ extends to an inner automorphism of .
• S is finite, and its cardinality is different from 2 or 6: By assumption, σ extends to an automorphism of . By fact (2), this automorphism must be inner. Hence, σ extends to an inner automorphism of .
• S is finite with cardinality 2: By assumption, σ extends to an automorphism of . But there's only one automorphism of the symmetric group on a two-element set: the identity automorphism. This is clearly inner, so we are done.
• S is finite with cardinality 6: We consider two cases.
  • There is an element such that every element of G fixes s: In this case, G is a subgroup of the subgroup , which is the symmetric group on a set of size five. Since σ is extensible, it extends to an automorphism of , and by fact (1), this automorphism must be inner. This inner automorphism can further be extended to an inner automorphism of , by using the same permutation.
  • There is no element of S fixed by all elements of G: Let with G acting on x₀ trivially. Thus, G acts on T, with . T is a set of size seven. Since σ is extensible, it extends to an automorphism of , and by fact (1), this automorphism must be inner. Suppose is a permutation giving this inner automorphism. Then, since G fixes x₀, hGh ^{− 1} fixes hx₀. Since hGh ^{− 1} = σ(G) = G, we get that G fixes hx₀. Since no element of S is fixed by the whole of G, hx₀ = x₀. Thus, the permutation h restricts to a permutation on the subset S, and this inner automorphism gives the required inner automorphism extending σ to .