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

Extensible automorphisms problem

From Groupprops

Jump to: navigation, search

This article describes an open problem in the following area of/related to group theory: group theory

Contents

Statement

Suppose α is a group property. The extensible automorphisms problem for α is the problem of determining all the group property-conditionally extensible automorphisms with respect to property α. An automorphism σ of a group G satisfying α is extensible conditional to α if for any group H containing G and satisfying α, σ extends to an automorphism σ' of H.

Variants involve:


The three main formulations and their resolutions for different group properties

Extensible, pushforwardable, and quotient-pullbackable automorphisms

Suppose α is a group property, G a group satisfying α, and σ an automorphism of G. We say that σ is:

An inner automorphism of a group satisfies all these properties.

Known results

Note that since extensible implies pushforwardable for any property, a yes for extensible implies a yes for pushforwardable.

Group property Extensible equals inner? Pushforwardable equals inner? Quotient-pullbackable equals inner?
any group yes yes yes
finite group yes yes yes
group of prime power order (fixed prime) yes yes yes
solvable group yes yes yes
periodic group yes yes yes
p-group yes yes yes
finite solvable group yes yes yes
pi-group yes yes yes
finite pi-group yes yes yes
abelian group no (see abelian-extensible automorphism) no no (see abelian-quotient-pullbackable automorphism)
finite abelian group no (e.g., inverse map) no no (e.g., inverse map)
group of nilpotency class two  ?  ?  ?

Variations with conditions on subgroup embeddings

Replacing automorphisms by other kinds of maps

Extensible automorphisms problem on subvarieties of the variety of groups

Further information: Variety-extensible automorphisms problem, Quasivariety-extensible automorphisms problem

Let \mathcal{V} be a variety of algebras and A be an algebra in \mathcal{V}. An automorphism σ of A is termed \mathcal{V}-extensible, or variety-extensible for the variety \mathcal{V}, if for any algebra B in \mathcal{V} containing A as a subalgebra, σ extends to an automorphism σ' of B.

We can thus try to characterize the \mathcal{V}-extensible automorphisms for various subvarieties \mathcal{V} of the variety of groups. Further, we do not need to restrict ourselves to varieties, and can instead look at the automorphisms extensible for particlar quasivarieties.

Also, there are analogous notions of pushforwardability and quotient-pullbackability for automorphisms and endomorphisms for any subvariety of the variety of groups.

Here are some particular problems:

Some cases that have been completely resolved:

Extensible automorphisms problems involving order conditions on the group

Interpretations

Destroying outer automorphisms

Further information: Destroying outer automorphisms

The extensible automorphisms problem, and its many variants, are based on the theme that the only automorphisms of a group that survive passing to bigger groups are the inner ones. In other words, outer automorphisms can be destroyed by passing to bigger groups.

A related result is the NPC theorem: it states that any normal subgroup can be realized as a characteristic subgroup inside some bigger group.

Universal algebra and model theory

Further information: Interpretation of the extensible automorphisms problem using universal algebra and model theory

The extensible automorphisms problem, and specifically, the associated fact that extensible automorphisms are inner, can be interpreted as a statement about the nature of the variety of groups in terms of universal algebra, or of the theory of groups in terms of model theory/first-order logic. In these interpretations, we note that inner automorphisms are the only ones given by a formula that is guaranteed to hold for all groups.

Use of representation-theoretic techniques

Further information: Using group actions and representations to solve the extensible automorphisms problem, Conjugacy class-representation duality

Both the use of linear representation theory to prove that finite-extensible automorphisms are class-preserving and the use of group actions to prove that extensible automorphisms are subgroup-conjugating share some common features. While the latter is mostly a straightforward application of the fundamental theorem of group actions that establishes a direct correspondence between subgroups and transitive group actions, the latter uses a more subtle conjugacy class-representation duality that allows one to relate linear representations with conjugacy classes.

Facts about Extensible automorphisms problemRDF feed
Page classConjecture or open problem  +
Personal tools
Namespaces
Variants
Actions
Navigation
lookup
Credits
Toolbox
request/feedback
subject wikis