A subgroup is a normal subgroup of if for every . Define multiplication on its left cosets by
To check that this is well-defined, replace by with . Then
because normality gives . Thus the product depends only on the two cosets. Associativity follows from that of , the identity is , and the inverse of is . These are all the group axioms, so is a group under coset multiplication. The natural projection is a surjective group homomorphism with kernel .
Take and its normal subgroup , where . Normality follows either from the sign of a permutation or directly from conjugation sending to or . The quotient group has order two, and provides a section because and is its nonidentity coset.
However, the map from the direct product of groups is not a group homomorphism. In its domain commutes with , whereas their images and do not commute: . This is a split group extension giving a genuine semidirect product instead of a direct product. The pair supplies the required split but non-direct example.
For the general bijectivity assertion, let be the quotient projection and assume is the identity. Given , put and . Then , so and . This proves surjectivity of . If , applying gives , after which cancellation gives . Thus
This section normal form for a split group extension does not require finiteness. The obstruction to its being a homomorphism is the nontrivial conjugation action of the section on .
Use additive notation and take , . Its quotient group is . A group homomorphism from sends its generator to an element annihilated by , so the image must be either or . Both project to the identity coset , and neither can project to the nonidentity generator of . Therefore this quotient projection has no homomorphic section. It is a nonsplit group extension, despite both and being nontrivial finite groups.
Unless a coefficient group is displayed, use integral singular cohomology. The standard CW complex structure on infinite-dimensional real projective space has one cell in each nonnegative dimension. Its cellular chain complex has boundary for positive even and for odd . The cellular cohomology differential is therefore zero for even and multiplication by two for odd . Consequently
More generally, for an abelian group , the positive odd groups are and the positive even groups are . In particular in every nonnegative degree.
For the required Bockstein homomorphism, use the short exact sequence
Here ; for all three coefficient groups are zero. Since singular chains are free abelian groups, applying cochains gives a short exact sequence of cochain complexes. Its connecting homomorphism defines and its long exact sequence is precisely the required one, with the other maps induced by and .
Explicitly, represent a class by a cocycle and choose a lift . Since , there is a unique cochain with . Injectivity of and show . Define
Changing the lift by changes by the coboundary . Changing the representative by a coboundary can be lifted by a coboundary as well and leaves the resulting class unchanged. Thus this is a well-defined group homomorphism, and the standard cochain lifting argument gives exactness.
Compute the Bockstein homomorphism on infinite-dimensional real projective space using its cellular cohomology complex. A generator with coefficients is represented by in degree , lifted to . Its coboundary is for even and for odd . Dividing via gives
Thus the odd-degree maps are isomorphisms. The comparison between cellular cohomology and singular cohomology is natural with respect to coefficient maps, so this computes the same connecting homomorphism constructed above.
We use two precise facts about the formal group of an elliptic curve. At a prime of good reduction, its kernel of reduction of an elliptic curve is identified by the uniformizer with the group . For odd this group is torsion-free. To see the second fact, the integral invariant differential of a formal group law has the form , with . Integrating constructs the formal logarithm
It is a group homomorphism to the additive group. For and ,
when is odd. Hence the series converges and , so it is injective. The target has no nonzero torsion. Therefore reduction is injective on the entire rational torsion subgroup at an odd prime of good reduction, including its -primary part.
For the present elliptic curve, , so every odd is a prime of good reduction. If , the Legendre symbol of is . The values and cancel in the sum of the Legendre symbols of , yielding
The rational torsion subgroup injects into each of these groups, so it is finite and its order divides every such .
For any odd prime , the Dirichlet theorem on primes in arithmetic progressions supplies infinitely many with and . Discard the finitely many dividing . Since , it cannot divide . Similarly choose , again avoiding ; then , so .
There are already four rational 2-torsion points,
which are distinct because a squarefree integer is nonzero. Thus
Its order is four. In fact the argument works for every nonzero integer ; squarefreeness is not needed for this torsion conclusion.
Work in characteristic different from two, as in the number-field application below. Nonsingularity is equivalent to . The chord through and has slope . Using in the elliptic-curve addition formula gives
These formulas hold for ; addition interchanges and .
It follows that and . The relation is
For a direct verification, observe that
Therefore the two-isogeny formula is
The target elliptic curve is nonsingular because its corresponding coefficient product is . The rational map of projective varieties extends over the exceptional points to a morphism of smooth projective algebraic curves; at both and its affine coordinates tend to infinity, giving the displayed values. A nonconstant morphism between elliptic curves sending to is a group homomorphism, so this is an isogeny of elliptic curves.
One can also see the quotient directly: translation by leaves invariant. The equation makes the source function field a degree-two extension of the target function field; its nontrivial automorphism is translation by . Equivalently, the degree of an isogeny from its x-coordinate map is two. The kernel of an isogeny is precisely . Thus is a separable isogeny of degree two.
Construct the free product from the empty word and all finite alternating words , whose syllables in a free product are nonidentity elements of tagged copies of , with adjacent syllables from different factors. Multiply by concatenating, multiplying adjacent elements in the same factor, and deleting identities until the word is reduced. The normal form theorem for a free product gives a unique result; reducing three concatenated words gives the same result under either parenthesization, so multiplication is associative. The empty word is the identity, and the inverse reverses the word and inverts each syllable. Each factor embeds as words of length one.
The universal property of a free product says that for every group and group homomorphisms there is a unique group homomorphism extending both. Explicitly, send a reduced word to the product of its syllable images; reduction preserves this product. This gives existence, while generation by the two factors gives uniqueness.
A standard form of Klein's combination theorem, or the ping-pong lemma, is the following. Let nontrivial subgroups of the homeomorphisms of a topological space have disjoint nonempty subsets with
Assume also that at least one factor has at least three elements. Then the generated subgroup is . The cardinality hypothesis cannot simply be omitted: the same involution swapping two disjoint sets would otherwise provide a counterexample with both factors equal to .
Here is the ping-pong lemma proof. A reduced word of odd length begins and ends in the same factor, so repeated application of the displayed inclusions sends the other factor's domain into that factor's domain. Disjointness shows that the word is not the identity. For an even reduced word, relabel the factors so that , and invert the word if necessary to make it begin with and end in . Choose . The conjugate reduces to an odd-length word beginning with and ending with , both in , so it is nontrivial. Thus no nonempty reduced word lies in the kernel of the natural group homomorphism , proving the theorem.
For an explicit example, let be the one-dimensional Real projective space, and take the Möbius transformations
For every nonzero integer , sends into , while sends into . Indeed when , and . Both transformations have infinite order. Hence the ping-pong lemma gives , a free product of two nontrivial finitely presented groups.
A finitely presented group admits a group presentation with both and finite; it is the quotient of the free group on by the normal closure of . If
with disjoint generator sets, then
Maps from this group presentation to any group are exactly pairs of maps from and , so the universal property of a free product proves the formula.
For a group homomorphism , choose a word representing for each . The presentation of a semidirect product is
The presentation maps onto the specified semidirect product. Conversely, its conjugation relations allow any word to be written as a word from followed by one from . The natural maps from the two factors to the presented group satisfy the full action relation, because conjugation agrees with first on generators and hence on all elements. They define the reverse group homomorphism . The two maps are inverse on every generator, proving the group isomorphism. There are finitely many cross-relations, so the result is again a finitely presented group.
Apply this to the specified permutation action. The presentation is
Eliminate and . The last cross-relation becomes , already implied by . Thus
Both factors are nontrivial finitely presented groups, as required.
The map of coset sets
is well defined and surjective, because the group homomorphism is surjective. Therefore
No normality assumption on is required.
A soluble group, also called a solvable group, has a terminating derived series:
For a subgroup , induction gives , so subgroups of soluble groups are soluble. For a surjective group homomorphism , , so quotients of soluble groups are soluble. Finally, in a group extension , suppose and . Then and . Soluble groups are closed under subgroups, quotients and group extensions.
A virtually soluble group contains a soluble group as a finite-index subgroup. The finite-index facts proved in parts (i)–(iii) imply closure under subgroups and quotients: intersect a finite-index soluble subgroup with the chosen subgroup, or take its image under the quotient map.
For group extensions, no finite-generation hypothesis may be inserted. We first establish the finite-index characteristic soluble subgroup lemma. If is a virtually soluble group, the kernel of its action on the cosets of a finite-index soluble subgroup is a soluble normal subgroup of finite index. Among soluble normal subgroups containing , choose with maximal , possible because is finite. If is any soluble normal subgroup of , then is soluble: it is an extension of by . Maximality forces . Thus is the unique largest soluble normal subgroup of , making it a characteristic subgroup, and it has finite index.
Now suppose has both and virtually soluble. Replace by the preimage of a finite-index soluble subgroup of . The subgroup just constructed is characteristic in and therefore normal in . In , the subgroup is a finite normal subgroup, and is a soluble group. The centralizer has finite index in , since conjugation gives a map with finite image. Its intersection with is the center of a group , an abelian group, while its quotient by embeds in the soluble group . Thus is a soluble group. Its preimage in is an extension by , so it too is soluble and has finite index in . Virtually soluble groups are closed under group extensions.
For the final example take the restricted direct sum of groups
where is the nonabelian simple group of even permutations on five letters. Every finite collection of elements lies in a product of finitely many finite factors, so is a locally finite group and hence a torsion group. It cannot contain a nonabelian free group, which is a torsion-free group.
To show that is not a virtually soluble group, let be any finite-index subgroup and let be the kernel of the finite coset action. Each coordinate maps either injectively or trivially into the finite quotient , by Simplicity of the alternating group A5. The nontrivial images of distinct factors commute, and each has trivial centre, so any of them generate a direct product of groups of order . Only finitely many such images can occur in a finite quotient. Therefore , and hence , contains a whole coordinate copy of , which is not soluble: its nontrivial commutator subgroup is normal and therefore equals . No finite-index subgroup of is soluble.
Let . The group action by left multiplication on gives a group homomorphism . Its kernel is the normal core of a subgroup,
The containment follows by looking at the stabilizer of the coset , and finite index follows from the finite image in .
The Higman group is
It is visibly a finitely presented group. To prove infinitude, first form
It is the amalgamated free product of and , identifying their infinite cyclic subgroups generated by . Each factor is an HNN extension of an infinite cyclic group, so its base and stable letter both have infinite order. No nonzero power of belongs to in the first factor, by the map to sending to one and to zero. In the second factor, no nonzero power of belongs to : the stable-letter map forces a hypothetical equality to have , and the base has infinite order. The normal form theorem for an amalgamated free product therefore shows that is a rank-two free group.
Similarly,
contains as a rank-two free group. Identifying these two free subgroups yields
The normal form theorem for an amalgamated free product embeds in . In particular, contains a free group of rank two and is infinite.
The finite quotients of cyclic squaring presentations argument now rules out every nontrivial finite quotient of . In a finite image, a relation forces the order of to be odd, since conjugate elements have the same order. If any generator has nontrivial image, let be the least prime number dividing the order of any of the four generator images, and choose whose order is divisible by . Its predecessor conjugates it to its square. If is the order of , iterating conjugation gives . Hence the multiplicative order of modulo divides . It is greater than one and divides , so it has a prime factor smaller than , which also divides . This contradicts the minimal choice of . Thus all four generator images are trivial. has no nontrivial finite quotient, and the normal-core argument above implies that has no proper finite-index subgroup.
For the final argument, Conjugation preserves the order of an element. Thus if one nonidentity element has finite order , every nonidentity element has that same order, and . Moreover is prime: if a prime factor properly divides , then is nonidentity but has the smaller order .
When , the element is nonidentity, so choose with . The conjugator is not the identity, since , and therefore . Induction gives , and at this yields
But Fermat's little theorem, with the odd prime , gives , contradicting that divisibility.
For , is not in the nonidentity conjugacy class, so the required conjugator cannot be chosen. Instead, a group in which every element has square one is an abelian group: also equals . In an abelian group every conjugacy class is a singleton, so one nonidentity class permits only one nonidentity element, giving a group of order two. This contradicts infinitude. Consequently the infinite group in question is a .
Both displayed matrices have determinant one and integer entries, so the generated group lies in . For any nonidentity matrix , some entry of is a nonzero integer . Choose a prime number not dividing . The reduction modulo a prime in an integral matrix group gives a group homomorphism
to a finite group in which is nonidentity. No determination of the abstract subgroup generated by the two matrices is needed.
A residually finite group has the property that every survives under a group homomorphism to some finite group. Equivalently, the intersection of its finite-index normal subgroups is trivial. A Hopfian group is a group for which every surjective endomorphism is an automorphism.
Suppose is generated by elements. A group homomorphism is determined by the images of these generators, so there are at most such maps. Every subgroup of index gives a transitive coset group action on an -element set, and the subgroup is the stabilizer of a point in that action. There are at most point stabilizers per action. The finite-index subgroup count for a finitely generated group therefore gives
Now let be a surjective endomorphism. For any fixed , inverse image under preserves the index of a normal subgroup. It is also an injective function on the finite set of normal subgroups of index : if , surjectivity gives . It is therefore a permutation of that finite set. Given any finite-index normal subgroup , there is another such subgroup with , so . If is a residually finite group, intersecting all these gives . Hence is an automorphism. Every finitely generated group that is a residually finite group is a Hopfian group.
A useful residual finiteness of semidirect products theorem is: if is a finitely generated group, then
More generally, the forward construction only requires that have a separating family of finite-index normal subgroups invariant under the action, and that be a residually finite group. Necessity follows by restricting finite separating maps to the embedded subgroups and .
For sufficiency, first consider with : projection to and then a suitable finite quotient separates it. If and , choose a finite-index normal subgroup with . Because is finitely generated, it has only finitely many subgroups of index at most . Their intersection is a finite-index characteristic subgroup of , is contained in , and is invariant under every automorphism in the action. The quotient is finite. Let be the induced action. The map
is a group homomorphism to a finite group and separates . This proves the theorem and the more general invariant-subgroup criterion. The finite-generation condition is used to produce the characteristic subgroup , not assumed for .
Let be a normal subgroup and let be the quotient group homomorphism. By the first part, for involutions , so the quotient group is generated by , whose squares are the identity. If both images are nonidentity, they are involutions and the second part applies. If only one image is nonidentity, it generates ; choose it twice. Both images cannot be trivial because the quotient group is nontrivial. Hence every nontrivial quotient is dihedral in the stated extended convention. This is the nontrivial-quotient closure of two-involution groups.
True. The determinant gives a group homomorphism
For an orthogonal matrix, implies , and a reflection has determinant , so the target has order two and the map is onto. Its kernel of a group homomorphism is exactly
This is the defining special orthogonal group inside the orthogonal group.