A group is a nonempty set with a closed binary operation that is associative, has an identity element, and gives every element an inverse element. A subgroup is a subset that is itself a group under the inherited operation. The left coset of represented by is ; right cosets are defined analogously. Left cosets partition a finite group, and is a bijection from to . Therefore , proving Lagrange's theorem and the required divisibility.
For the given matrices, put and . Since , the generators commute; , , and the generated elements are
They are distinct, and , with exponents reduced modulo four and two. The Cayley table is
The table proves closure and identifies as the identity. The inverse element of is , and associativity follows from matrix multiplication. Thus this is the direct product of cyclic groups of orders four and two, an abelian group of order eight.
Its subgroups are exactly
To see the list is complete, Lagrange's theorem leaves orders one, two, four and eight. There are exactly three elements of order two, giving the three order-two subgroups. An order-four subgroup containing an element of order four must be one of the two cyclic groups displayed; without such an element it must be the four-element set of elements whose squares are . This is the enumeration in subgroups of C4 times C2.
For example choose . A complete set of cosets is . Since is Abelian, the left and right cosets coincide.
Observe that , and . Thus , while , and . The multiplication table, with the left factor labeling the row, is
It proves closure of the set. Associativity is inherited from matrix multiplication, is the identity element, and every element is its own inverse element. Therefore this set is a group. The table is symmetric, so it is an Abelian group; its three nonidentity elements have order two, identifying it as the Klein four-group .
Let be the set of torsion elements of the given Abelian group. It contains the identity element, which has order one. If have orders , set . Commutativity permits powers of the product to split:
Hence has finite order, dividing , and lies in . The nonempty set therefore satisfies the subgroup test and is a subgroup:
This is the torsion subgroup. The proof uses commutativity exactly when rearranging the factors in ; one cannot use that step in an arbitrary noncommutative group. The subgroup need not itself be a finite set.
The hypothesis implies for every , including the identity, so . For arbitrary , their product also equals its own inverse. The inverse-of-a-product rule therefore gives
Thus is an abelian group. Finiteness is not needed for this implication; it holds for every group in which each element squares to the identity.
By Lagrange's theorem, the possible values of the order of a group element are
These are possibilities across groups of order eight; they need not all occur in one group.
If every element has order at most two, every element equals its own inverse. Thus for any ,
so is an abelian group. Choose , and then . The four elements are distinct and form a subgroup : commutativity and prove closure and inverses. Choose . The elements of and are disjoint, since would imply . These two four-element sets therefore exhaust .
Every element consequently has a unique expression , with . The map from triples to these products is bijective and respects multiplication by addition of exponents modulo two. Hence
a direct product of groups and an elementary abelian group.
The sum of two odd integers plus one is odd, so the operation is closed. Both associations of a triple give , proving associativity. Its identity element is , and the inverse element of is , also odd, since . Thus it is an abelian group.
More explicitly, shifted addition on odd integers is ordinary integer addition in different coordinates:
This bijection is a group isomorphism to .
The requested two-dimensional irreducible representation does not exist for the Vierergruppe. The Klein four-group is an abelian group in which every nonidentity element has order two. Its complex irreducible representations are all one-dimensional. The same holds over the real numbers here: the commuting representing involutions are simultaneously diagonalizable with real eigenvalues , so every two-dimensional representation has an invariant line. Each genuine irreducible character satisfies , and hence has Frobenius-Schur indicator .
The printed notation suggests a different possible interpretation, which must not be conflated with the Klein four-group. For the cyclic group of order four, a real two-dimensional irreducible representation is generated by
Its character on is , giving . Over the complex numbers this representation splits into two conjugate one-dimensional characters, so it is not a two-dimensional complex irreducible representation. These alternatives explain what can be computed without silently changing the printed group or the ground field.
The symmetric group is generated by transpositions, each of order two. A group homomorphism to must map every transposition to zero, because the only target element annihilated by two is zero. Hence the map to is necessarily trivial.
For , the 3-cycles map to zero because their order divides three. All transpositions are conjugate group elements, and a map to an abelian group takes conjugate elements to the same value. That common value is either zero or one. Both choices work: they give the trivial map and the sign homomorphism, with an odd permutation sent to and an even permutation sent to .
Use the vector-space axioms: addition is an abelian group operation with identity zero; ; ; ; and , with . Group inverses may be expressed by , so no extra inverse symbol is needed.
Add the dimension-unbounded scheme
Over a finite field, a finite-dimensional space has finitely many Elements, while every infinite-dimensional space is infinite. Hence this scheme axiomatizes exactly the infinite underlying vector spaces requested. In this finite-field case the vector-space axiom list itself is finite; the infinitude of the additional dimension scheme is substantive.
Yes. As an Abelian group, the reals are a nontrivial torsion-free divisible group, equivalently a vector space over the rationals. Rational scalar multiplication is uniquely definable by equations such as , so adding those operations is a definitional expansion.
In this language, quantifier elimination for torsion-free divisible Abelian groups reduces formulas to Boolean combinations of rational linear equations. Over finitely many parameters, a complete one-variable type either fixes a value in their linear span or excludes every value in that span. The first kind is realized in the span itself; the second is realized by any real number outside it. That span is countable, while the reals are uncountable. Thus every such type is realized and the additive real group is an omega-saturated model.
For finite tuples, the same argument successively supplies any required finite number of new rationally linearly independent elements. The order and multiplication of the real field are absent from this language, so they cannot impose additional type conditions.
An integral basis is a -basis of the ring of integers ; its elements also form a -basis of .
To prove existence, first multiply the elements of a rational basis by suitable nonzero integers to obtain an integral rational basis . Put . The trace pairing is nondegenerate in characteristic zero, and the matrix has integer entries and nonzero determinant . If is integral, all are integers, so . The adjugate formula gives . Consequently
A subgroup of a free abelian group is free, and these inclusions force rank . A -basis of is therefore an integral basis.
Now put and . The polynomial is irreducible by Eisenstein at any prime dividing the squarefree , except for , where is Eisenstein at . Thus and . Every has the unique form with . The nontrivial -automorphism sends to , so an integral has integral conjugate . Relative trace and norm of integral elements are integral in . Applying them to and taking the trace of gives
The power basis has discriminant
Indeed, the resultant of and is ; the discriminant sign factor is . By the discriminant-index formula for an integral lattice, a prime dividing must divide .
No odd prime can divide this index. The Eisenstein equation gives , while has nonintegral field norm for and : its -adic norm valuation is . If were integral, multiplication by first forces ; subtracting and multiplying by forces . Continuing forces all coefficients divisible by . This excludes an index element of order .
To exclude , any index element of order two would be represented by an integral
with integers not all even. Here and . The integrality of forces
Since , the first congruence implies have the same parity. If both were odd, the second would require , impossible. Hence are even. The second congruence then forces to have the same parity, while the first forces even. Thus are even too, a contradiction. Therefore the index is one and
For the last request, let and take . It satisfies , and hence
This monic integer polynomial proves integrality. Its coordinates in the rational power basis have halves, so . Also with a nonzero coefficient in ; if were in that quadratic field, then would be too, contradicting degree four. Thus it meets both exclusions.
An integral basis is a -basis of the ring of integers ; it consists of algebraic integers and is also a -basis of .
The lattice has finite index . Choose a prime . The finite abelian group has an element of order , represented by . Thus
If all were divisible by , cancellation in the characteristic-zero field would put in , a contradiction. The discriminant-index formula for an integral lattice gives
where is an integer. Hence , and the required integral element is .
A solvable group has a finite subnormal series from the identity to the group with abelian group factors. An equivalent definition uses the derived series: set and ; the series must reach the identity. For completeness, an abelian-factor series forces successive derived subgroups into its successive terms, while a terminating derived series itself supplies such a series.
If , induction gives : every commutator of elements of is also a commutator in . Thus termination for implies termination for , proving that every subgroup of a solvable group is solvable.
In , use
The Klein four-group is invariant under conjugation in ; the other normality assertions follow from the alternating group being the kernel of the sign map. The quotient group factors are , all abelian. Hence is solvable.
For the last example take . Its subgroup is nontrivial, proper and normal, so the product is not a simple group. Projection onto is surjective, and every quotient of a solvable group is solvable, because a homomorphism carries each derived subgroup onto the derived subgroup of its image. But the nonabelian simple group has : its derived subgroup is nontrivial and normal. Thus the product is not solvable either. One standard justification of the simplicity used here is that the nonidentity conjugacy class sizes of are ; no proper nontrivial union with the identity has size dividing , as a normal subgroup would require by Lagrange's theorem for finite groups.
A composition series is a finite chain
whose inclusions are strict and whose quotients are simple. These quotients are the composition factors. The normal subgroup condition is relative to the next member, rather than necessarily to all of .
Induct on the order of a finite group. The trivial group has the empty composition series. Otherwise choose a maximal normal subgroup , which exists because there are finitely many subgroups. The subgroup correspondence theorem identifies normal subgroups of with normal subgroups of containing , so maximality makes a simple group. By induction has a composition series; appending gives one for .
For example, the nonabelian symmetric group has
with composition factors and , both abelian.
Write and set . The order of is , so . Every subgroup of an abelian group is a normal subgroup. The quotient group is generated by and has order , hence is and is a simple group. By the subgroup correspondence theorem, there is no proper normal subgroup strictly between and . Therefore is a maximal normal subgroup with the required quotient group.
Plünnecke inequality Created 2026-10-06 Updated 2026-10-07
For nonempty finite subsets of an abelian group, implies that some nonempty satisfies this bound simultaneously for every integer , with . The Petridis minimal-growth lemma proves this by choosing to minimize . The Ruzsa triangle inequality then gives the Plünnecke-Ruzsa inequality .
For a finite nonempty subset of an abelian group with doubling constant at most , the Plünnecke-Ruzsa inequality gives . Applying the Ruzsa covering lemma to using gives for and . Thus , and counting multiplicities in the finite set proves the displayed polynomial bound. For fixed , it is eventually at most for every .
Preadditive category Created 2026-10-06 Updated 2026-10-07
A category is preadditive if every hom-set is an abelian group and composition is additive in each variable. Zero morphisms and differences of parallel morphisms are therefore defined. A zero object or finite biproducts need not exist; these are extra requirements in an additive category.
Prime-degree sphere map forces primary torsion Created 2026-10-05 Updated 2026-10-06
If has prime degree and is a closed connected oriented -manifold, every integral homology group of in degrees strictly between zero and is a finite -primary abelian group. Consequently one power of annihilates all these groups. The proof combines Poincare duality over each field , , with the universal coefficient theorem for homology and finite generation.
Principal-unit group of a mixed-characteristic local field Created 2026-10-03 Updated 2026-10-14
If is finite of degree , then as a topological abelian group
where is the finite group of all roots of unity in whose orders are prime powers dividing a power of .