This is a survey article related to:subgroup metaproperty satisfaction
View other survey articles about subgroup metaproperty satisfaction
- Disproving transitivity: A survey article on methods to prove that a given subgroup property is not transitive.
- Using transitivity to prove subgroup property satisfaction: A survey article discussing how to use the fact that a subgroup property is transitive to establish that certain subgroups have the property.
- All transitive subgroup properties
- All subgroup properties that are not transitive
- 1 Quick discussion on transitivity and subordination
- 2 The basic proof idea: express the subgroup property in a form that makes it obvious
- 3 Properties that are functions of the index, order, or related things
- 4 Complements and piecing them together
- 5 Closure under certain equations/expressions/operations
- 6 Effect of logical operators
- 7 Effect of subgroup property modifiers
Quick discussion on transitivity and subordination
Given a subgroup property , we define the subordination of as the following property: has the property in if there exists an ascending chain of subgroups:
such that each satisfies property in . By definition, any group satisfies the subordination of in itself, since we can take and take a chain of length .
The subordination of any property is a t.i. subgroup property (it is both transitive and identity-true) and a t.i. subgroup property equals its own subordination.
Here are some quick points on the subordination operator:
- The subordination operator is an ascendant operator: If is a subgroup property, is stronger than its subordination.
- The subordination operator is a monotone operator: If are subgroup properties such that is stronger than , then the subordination of is stronger than the subordination of .
- If and are subgroup properties such that is t.i., then the subordination of is stronger than . In fact, the subordination of is the strongest t.i. subgroup property among those weaker than .
The basic proof idea: express the subgroup property in a form that makes it obvious
The idea is to express the subgroup property using a formalism that makes it obvious that it is transitive.
The most typical idea is that of a balanced subgroup property. We discuss the idea for function restriction expressions first, and then discuss some other, more general, variants.
Balanced subgroup properties in the function restriction formalism
Further information: Balanced subgroup property (function restriction formalism), balanced implies transitive
Suppose and are properties of functions from a group to itself. The property with function restriction expression is defined as follows: satisfies in if every function from to itself satisfying restricts to a function from to itself satisfying . (A bunch of examples is available at the function restriction formalism chart).
A balanced subgroup property with respect to the function restriction formalism is a subgroup property having an expression where both the left and right sides are equal. Such an expression is termed a balanced expression. For instance:
- The property of being a characteristic subgroup is a balanced subgroup property, because it can be expressed as:
- The property of being a central factor is a balanced subgroup property, because it can be expressed as:
Inner automorphism Inner automorphism
- The property of being a fully characteristic subgroup is a balanced subgroup property, because it can be expressed as:
The easy but important fact is that any balanced subgroup property is transitive. In fact, for properties that have function restriction expressions, being t.i. (transitive and identity-true) is equivalent to being balanced, something that follows from either the left tightness theorem or the right tightness theorem. Note that a transitive subgroup property may have another function restriction expression that is not balanced; however, either left tightening or right tightening yields a balanced expression.
The idea of balance in other formalisms
For any formalism that involves restricting/extending functions, relations, or other constructs, the properties having balanced expressions are transitive. Here are some examples:
- Function extension expressions: A function extension expression defines a property as follows: has the property in if every function on satisfying property on can be extended to a function on satisfying property on . A balanced expression is where , and such properties are t.i.. Examples include:
- Subgroup intersection restriction expressions: Suppose and are two subgroup properties. The subgroup property with subgroup intersection restriction expression is defined as follows: a subgroup of a group has this property if whenever satisfies property in , satisfies property in . Again, if , the subgroup property we get is transitive.
- Large subgroup is a subgroup whose intersection with every nontrivial subgroup is nontrivial. Further information: largeness is transitive
- Normality-large subgroup is a subgroup whose intersection with every nontrivial normal subgroup is nontrivial. Note that this has a balanced expression, because since normality satisfies transfer condition, the intersection is nontrivial and normal in the subgroup. Further information: Normality-largeness is transitive
- Subgroup intersection extension expressions: Suppose and are two subgroup property. The subgroup property with subgroup intersection extension expression is defined as follows: a subgroup of a group has this property if whenever satisfies property in , there exists a subgroup of such that , with satisfying in . Again, if , the property is t.i.. Examples include:
- Equivalence relation expressions: Suppose are rules that specify, for every group, an equivalence relation on it. PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]
Index and its multiplicativity
If is a multiplicatively closed collection of cardinals, and we define a subgroup property as saying that a subgroup has property if and only if its index is in , then is transitive. This follows from the fact that index is multiplicative. Some examples:
- Subgroup of finite index: A subgroup of finite index in a subgroup of finite index again has finite index.
- Subgroup of odd index
- Hall subgroup: A Hall subgroup of a Hall subgroup is again a Hall subgroup. A Hall subgroup is a subgroup whose order and index are relatively prime. The reasoning behind this is a little more complicated, but it essentially follows from multiplicativity of the index. Further information: Hall satisfies transitivity
Complements and piecing them together
Factors in a particular kind of product
If a certain internal product notion is associative, the property of being one of the subgroups featuring in that product is transitive. Here are some examples:
- Direct factor: This follows from the fact that direct product is associative. Further information: Direct factor is transitive
- Retract: This follows from the fact that semidirect products are associative in a weak sense. Further information: Retract is transitive
- Base of a wreath product: This follows from the fact that wreath product is associative, again in a weak sense. Further information: Base of a wreath product is transitive
- Free factor: Further information: Free factor is transitive
- Regular retract: Further information: Regular retract is transitive
- Central factor: Further information: Central factor is transitive
Complements to quotient-transitive properties are transitive
Suppose is a subgroup property stronger than normality, that is also a quotient-transitive subgroup property. In other words, if are such that satisfies in and satisfies in , then satisfies in .
Consider the following property : has property if and only if has a normal complement in satisfying property . Then, is a transitive subgroup property.
Closure under certain equations/expressions/operations
This is a generalization of the notion of balance with respect to restriction/extension formalisms. Here, we require the subgroup to be closed under some operations, or to admit solutions to certain equations. The crucial point is that we can iterate on the closure condition to prove transitivity.
A verbal subgroup is defined by a collection of words, and is defined as the subgroup generated by all elements of the group that equal that word when evaluated at some elements of the group. For instance, the commutator subgroup of a group is a verbal subgroup with the word being . All members of the derived series as well as of the lower central series are verbal subgroup.
First, we note that we can expand the collection of words to all products involving the words and their inverses, so there exists an enlarged collection of words so that every subgroup element equals the value of one or more of the words at some suitable element of the group. For instance, in the commutator subgroup example, we expand to include all products of finite length of commutators. Now, if we have a verbal subgroup (with word collection ) of a verbal subgroup (with word collection ) of a group , we can take as the new collection of words the following: we substitute for every possible letter in the collection of words for in , the words in . This ability to substitute words into letters establishes transitivity.
Other examplesPLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]
Effect of logical operators
Further information: Transitivity is conjunction-closed
Another interesting case where we may easily be able to prove transitivity is where the given property is the conjunction (AND) of two existing properties. If both properties are transitive, then their conjunction is also transitive. Note that in some cases, one of the properties may actually be a group property evaluated on the subgroup as an abstract group. In this case, the other property being transitive is sufficient.
In some cases, one of the properties may be transitive and the other one may fail to be transitive; however, the transitive property may provide the right additional conditions that force transitivity of the conjunction. This may happen because the conjunction is stronger than the left transiter or the right transiter of the second property. Here are some examples:
- Conjugacy-closed normal subgroup: This is the conjunction of conjugacy-closed subgroup (transitive) and normal subgroup (not transitive). However, if and is conjugacy-closed normal in , then it is clear that being normal in implies that is normal in .
- Simple normal subgroup: Here, the condition of being simple, which is a group property, forces the conjunction to be transitive, even though normality is not transitive.
- Direct factor: This is the conjunction of retract (transitive) and normal subgroup (not transitive).
- Normal Hall subgroup: This is the conjunction of normal subgroup (not transitive) and Hall subgroup (transitive).
The disjunction (OR) of transitive subgroup properties is not necessarily transitive. To see this, suppose and are both transitive subgroup properties. Suppose are groups such that satisfies or in and satisfies or in . It is not necessary that satisfies or in . This is because it may be the case that satisfies but not in and satisfies but not in , and we can then conclude nothing about in .
Effect of subgroup property modifiers
Modifiers that create transitive properties by definition
In some cases, the way a subgroup property is defined already makes it clearly a t.i. subgroup property, and hence, transitive. There are three idempotent operators that take any subgroup property and output a t.i. subgroup property:
Transfer condition operator
If is a transitive subgroup property, so is . Here are some examples: