Write the finite abelian group additively. A character of a finite abelian group is a group homomorphism . We first prove that there are exactly such characters of a finite abelian group, without assuming a structure theorem.
Use extension of a character across a cyclic quotient. Given a subgroup and , let be the least positive integer with . The subgroup has cosets of . If is a character of a finite abelian group on , choose any of the roots and define
This is well-defined: two representations differ by an integer multiple of , and the root equation exactly cancels that difference. It is a character of a finite abelian group, and every extension arises from one of the choices of . Build a chain from the trivial subgroup to by adjoining elements. The character of a finite abelian group count multiplies by the same factor as the subgroup order at every step, so .
For a nontrivial character of a finite abelian group , choose with . Translating the group sum shows
so the sum is zero. Applied to , this proves
The orthogonal nonzero characters of a finite abelian group therefore form a basis of all complex functions on , a vector space of dimension .
With the unnormalized Fourier coefficients , expansion in that basis gives the Fourier inversion on a finite group
Under a normalized forward-transform convention the prefactor would instead be one. Thus the unspecified constant is determined by the convention, and the inversion itself follows directly from character of a finite abelian group counting and orthogonality.
Let be rotation through about , and let be rotation through about . These generate the order-six dihedral group with relations
namely . We specify its order explicitly because dihedral notation has two conventions. It is a proper finite subgroup of the full axial rotation group.
To see that it is sufficient, write a general matrix in blocks . Commutation with forces , since a nontrivial planar -degree rotation fixes no nonzero planar vector. Its planar part is , with nonzero sine, so must commute with and has the form . Commutation with again kills . Hence this six-element subgroup has precisely the required invariant tensors.
It is also smallest by order. Groups of orders are cyclic: a nonidentity element has order dividing the prime group order by Lagrange theorem. For a cyclic rotation subgroup, the nonzero antisymmetric tensor representing cross product with its rotation-axis direction is invariant, so it cannot force the symmetric form above. The trivial subgroup plainly imposes no constraint. A group of order four is either cyclic or has three nonidentity elements of order two; in the latter case they commute, since and also equals . Commuting distinct half-turns in three dimensions have perpendicular axes: conjugation by one half-turn must preserve the other's axis, and a distinct preserved axis lies in its perpendicular plane. In the specified axial group, their three axes are consequently and two perpendicular horizontal directions. In coordinates along them every diagonal matrix is invariant, including one with unequal horizontal entries. Such a group again does not force the required form.
Thus the smallest subgroup has six elements, generated by the axial -degree rotation and one horizontal half-turn. It is the smallest axial rotation group forcing second-rank transverse isotropy; conjugating the horizontal axis gives equally valid choices.
Choose a positive common denominator so that and with nonzero integers . Put . Every element of the generated subgroup has the form , so it lies in . Conversely, Bezout identity gives integers with , so belongs to the generated subgroup. Consequently
This map is a bijective additive group homomorphism. It is the two-generator instance of a finitely generated subgroup of the rational additive group being an infinite cyclic group.
For the real example, take and . The group homomorphism from onto the generated subgroup is injective because is an irrational number. Thus this subgroup is isomorphic to . More directly, if a single real number generated it, then and for integers , giving , a contradiction. The choice generates a noncyclic additive subgroup.
The Möbius transformations are bijections, so they preserve which coordinates of a triple are equal. Conversely, part (i) implies transitivity within each equality pattern. For a pattern with fewer than three distinct entries, extend the chosen distinct points to a triple before applying part (i); this works also for , when the projective line has exactly three points. There are therefore five orbits of a group action.
We first count . Its first column can be any nonzero vector, giving choices. The second must be outside the first column's one-dimensional span, giving choices. Hence
For the all-equal pattern take . Its stabilizer subgroup consists of upper triangular matrices
of order . Its group orbit has order .
The three exactly-two-equal patterns have representatives , and . Each stabilizer subgroup fixes and individually, so it is the diagonal subgroup of order . Each group orbit has order ; their repeated-coordinate positions keep these three orbits distinct.
For the all-distinct pattern use . Its stabilizer subgroup is the scalar subgroup of order , and the group orbit has order . Stabilizers of arbitrary triples are conjugates of the displayed representative stabilizers. In summary the equality-pattern orbits of projective triples have
The sizes add to , and each orbit size times its stabilizer order is , as in the orbit-stabilizer theorem.
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 .
The set is the ideal quotient . It contains zero. If , then , since is an subgroup. If and , then because is an ideal. Thus is an ideal.
Write and . Because , each has the form . Then , so , and . Conversely by the definition of . Therefore
so is a principal ideal. This argument uses only the commutative ring convention, not cancellation or an integral domain hypothesis.
The central matrices act identically on the complex upper half-plane, so the effective group is . Away from points with nontrivial effective stabilizer, properly discontinuous action supplies ordinary quotient-disc charts. At a fixed point , the coordinate identifies the stabilizer action with a rotation; its invariant coordinate is , where is the effective stabilizer order. These charts give the quotient its Riemann surface structure.
The elliptic stabilizers of the modular group occur only in the orbits of and . They have effective orders two and three. Consequently the analytic ramification indices of the map from the half-plane are
The stabilizers in have orders four and six, but the central factor does not double these indices.
All rational boundary points, including infinity, lie in one cusp of a modular group: a primitive column can be completed to a determinant-one integral matrix taking infinity to . The stabilizer of infinity is generated effectively by , and the coordinate identifies its high horodisc quotient with a punctured disc. Adding fills that disc. This constructs the compactified modular curve from the extended half-plane; it does not use the ordinary subspace topology on the rational boundary.
For compactness use the standard fundamental domain of the modular group. Its part below a fixed height is compact, since its imaginary part is at least . The part above , modulo translation and with the modular cusp added, is a closed disc in the -coordinate. Their images cover the quotient, so it is compact. The same argument with finitely many translates proves compactness for every finite-index subgroup.
Reduction modulo maps onto , of order . The image of is the upper unipotent subgroup of order . Thus its index in is , and, since for , its effective index is
Every element of has trace congruent to two. An effective elliptic element of order two or three has trace zero or in a lift, so neither is possible for . Hence .
Represent a modular cusp by a primitive column , modulo sign. Its reduction is a nonzero vector in modulo sign, and the unipotent subgroup acts by . For , the nonzero values of give orbits. For , varies freely and modulo sign gives another orbits. Thus there are modular cusps. The reduction classification is sufficient as well as necessary: completing two primitive columns to determinant-one matrices and adjusting the second columns by a translation makes congruent columns related by .
More explicitly, if a determinant-one matrix has first column , conjugating gives
Its least allowable cusp width in is one for and otherwise. Both types therefore number , with cusp widths one and ; their cusp width sum is . There are no sign-twisted modular cusp periods here, because trace two cannot be congruent to minus two for these primes. Substitution gives
These are the prime Gamma 1 cusp counts and widths.