FZ implies finite derived subgroup: Difference between revisions

From Groupprops
mNo edit summary
 
(7 intermediate revisions by one other user not shown)
Line 1: Line 1:
[[Category: Derived subgroups]]
{{group property implication|
{{group property implication|
stronger = FZ-group|
stronger = FZ-group|
Line 13: Line 14:
===Symbolic statement===
===Symbolic statement===


Let <math>G</math> be a [[group]] such that <math>Inn(G) = G/Z(G)</math> is finite. Then, <math>G' = [G,G]</math> is also finite. In fact, if <math>|G/Z(G)| = n</math>, then <math>G'</math> has size at most <math>n^{2n^3}</math>.
Let <math>G</math> be a [[group]] such that <math>\operatorname{Inn}(G) = G/Z(G)</math> is finite. Then, <math>G' = [G,G]</math> is also finite. In fact, if <math>|G/Z(G)| = n</math>, then <math>G'</math> has size at most <math>n^{2n^3}</math>.


===Property-theoretic statement===
===Variety-theoretic statement===


The group property of being a [[FZ-group]] (viz having a finite inner automorphism group) implies the group property of being [[commutator-finite group|commutator-finite]] viz having a finite [[commutator subgroup]].
The variety of [[abelian group]]s is a [[fact about::Schur-Baer variety;1| ]][[Schur-Baer variety]].


===Variety-theoretic statement===
==Related facts==
 
===Other facts about related group properties===
 
* [[Finitely many commutators implies finite derived subgroup]]: If the number of elements in a group that can be written as [[commutator]]s is finite, then the [[derived subgroup]] is finite. Note that this fact is proved ''using'' the Schur-Baer theorem, hence it cannot be used to simplify the proof of the Schur-Baer theorem given below.
* [[Finitely generated and FC implies FZ]]
 
===Alternative formulation===
 
* [[Exterior square of finite group is finite]]
 
==Facts used==


The variety of [[abelian group]]s is a [[fact about::Schur-Baer variety;1| ]][[Schur-Baer variety]].
# [[uses::Exterior square of finite group is finite]]
# [[uses::Commutator map is homomorphism from exterior square to derived subgroup of central extension]] (and this homomorphism is surjective by definition)


==Proof==
==Proof==
===Proof using the alternate formulation===
'''Given''': A group <math>G</math> such that <math>\operatorname{Inn}(G)</math> is finite.
'''To prove''': <math>G'</math> is finite and its order is bounded in terms of the order of <math>\operatorname{Inn}(G)</math>.
'''Proof''':
{| class="sortable" border="1"
! Fact no. !! Assertion/construction !! Facts used !! Given data used !! Previous steps used !! Explanation
|-
| 1 || There is a surjective homomorphism <math>\operatorname{Inn}(G) \wedge \operatorname{Inn}(G) \to G'</math> (here, <math>\operatorname{Inn}(G) \wedge \operatorname{Inn}(G)</math> denotes the [[exterior square]] of <math>\operatorname{Inn}(G)</math>). || Fact (2) || || || <math>G</math> can be viewed as a central extension with quotient group <math>\operatorname{Inn}(G)</math> (i.e., there is a short exact sequence <math>0 \to Z(G) \to G \to \operatorname{Inn}(G) \to 1</math>) and we can then apply Fact (2).
|-
| 2 || The group <matH>\operatorname{Inn}(G) \wedge \operatorname{Inn}(G)</math> is finite. || Fact (1) || <math>\operatorname{Inn}(G)</math> is finite. || || fact-given combination direct.
|-
| 3 || The group <math>G'</math> is finite and its order is bounded in terms of the order of <math>\operatorname{Inn}(G)</math>. || The image of a finite group under a homomorphism is finite. || || Steps (1), (2) || Fact-given direct. Note that the order being bounded follows from the fact that it is boudned by the order of <matH>\operatorname{Inn}(G) \wedge \operatorname{Inn}(G)</math>. Since there are only finitely many isomorphism types of <math>\operatorname{Inn}(G)</math> for a given order <math>n</math>, we can take the maximum over all these of the orders of their exterior squares, thereby getting a finite bound, in terms of <math>n</math>, on the orders of these. Explicit versions of the bound on the size in Fact (1) allow explicit bounds here.
|}
===Direct proof outline===


The proof involves two steps:
The proof involves two steps:
Line 29: Line 62:
* Showing that the number of distinct commutators is at most <math>n^2</math>: This follows from the fact that the commutator <math>[x,y]</math> depends only on the quotients of <math>x</math> and <math>y</math> modulo <math>Z(G)</math>, and thus there are <math>n^2</math> possibilities.
* Showing that the number of distinct commutators is at most <math>n^2</math>: This follows from the fact that the commutator <math>[x,y]</math> depends only on the quotients of <math>x</math> and <math>y</math> modulo <math>Z(G)</math>, and thus there are <math>n^2</math> possibilities.
* Showing that for any element in the commutator subgroup, there is a minimal word for that element with each commutator occuring at most <math>n</math> times: This shows that any element of the commutator subgroup has a word in terms of the commutators, of length at most <math>n^3</math>, and this completes the proof.
* Showing that for any element in the commutator subgroup, there is a minimal word for that element with each commutator occuring at most <math>n</math> times: This shows that any element of the commutator subgroup has a word in terms of the commutators, of length at most <math>n^3</math>, and this completes the proof.
==Converses==
The direct converse of the Schur-Baer theorem is false, but there are the following partial converses:
* For any [[commutator set-finite group]] (group with only finitely many commutators), the quotient by the second term of its [[upper central series]], is a [[finite group]]; moreover, the order of this quotient is bounded from above by a function of the size of the set of commutators.
* Any [[finitely generated group]] which also has finitely many commutators,  is a [[FZ-group]] (viz., its [[inner automorphism group]] is finite). Moreover, the size of the inner automorphism group is bounded by a function of the size of a generating set, and the number of commutators.

Latest revision as of 22:55, 25 October 2023

This article gives the statement and possibly, proof, of an implication relation between two group properties. That is, it states that every group satisfying the first group property (i.e., FZ-group) must also satisfy the second group property (i.e., group with finite derived subgroup)
View all group property implications | View all group property non-implications
Get more facts about FZ-group|Get more facts about group with finite derived subgroup

This result was proved by Schur and is sometimes termed the Schur-Baer theorem.

Statement

Verbal statement

If the inner automorphism group (viz the quotient by the center) of a group is finite, so is the derived subgroup. In fact, there is an explicit bound on the size of the commutator subgroup as a function of the size of the inner automorphism group.

Symbolic statement

Let G be a group such that Inn(G)=G/Z(G) is finite. Then, G=[G,G] is also finite. In fact, if |G/Z(G)|=n, then G has size at most n2n3.

Variety-theoretic statement

The variety of abelian groups is a Schur-Baer variety.

Related facts

Other facts about related group properties

Alternative formulation

Facts used

  1. Exterior square of finite group is finite
  2. Commutator map is homomorphism from exterior square to derived subgroup of central extension (and this homomorphism is surjective by definition)

Proof

Proof using the alternate formulation

Given: A group G such that Inn(G) is finite.

To prove: G is finite and its order is bounded in terms of the order of Inn(G).

Proof:

Fact no. Assertion/construction Facts used Given data used Previous steps used Explanation
1 There is a surjective homomorphism Inn(G)Inn(G)G (here, Inn(G)Inn(G) denotes the exterior square of Inn(G)). Fact (2) G can be viewed as a central extension with quotient group Inn(G) (i.e., there is a short exact sequence 0Z(G)GInn(G)1) and we can then apply Fact (2).
2 The group Inn(G)Inn(G) is finite. Fact (1) Inn(G) is finite. fact-given combination direct.
3 The group G is finite and its order is bounded in terms of the order of Inn(G). The image of a finite group under a homomorphism is finite. Steps (1), (2) Fact-given direct. Note that the order being bounded follows from the fact that it is boudned by the order of Inn(G)Inn(G). Since there are only finitely many isomorphism types of Inn(G) for a given order n, we can take the maximum over all these of the orders of their exterior squares, thereby getting a finite bound, in terms of n, on the orders of these. Explicit versions of the bound on the size in Fact (1) allow explicit bounds here.

Direct proof outline

The proof involves two steps:

  • Showing that the number of distinct commutators is at most n2: This follows from the fact that the commutator [x,y] depends only on the quotients of x and y modulo Z(G), and thus there are n2 possibilities.
  • Showing that for any element in the commutator subgroup, there is a minimal word for that element with each commutator occuring at most n times: This shows that any element of the commutator subgroup has a word in terms of the commutators, of length at most n3, and this completes the proof.