True. The sign of a permutation is a group homomorphism , as follows, for example, from the multiplicative determinant of permutation matrices. Its kernel of a group homomorphism is the alternating group
A transposition maps to , so this homomorphism is onto.
A group homomorphism satisfies for every . Its kernel of a group homomorphism is . The homomorphism equation gives by cancellation, and . Therefore contains the identity and is closed under multiplication and inverses, so it is a subgroup.
For and ,
Thus conjugation carries into itself, and applying the inverse conjugation gives equality: is a normal subgroup. If , conjugation cannot send to the identity because it is injective. Consequently
This proves directly the normal subgroup of order two is central principle for kernels, including the kernel facts needed below.
Write the Heisenberg group element as . Matrix multiplication and inversion give
All matrices have determinant one. They contain , are closed under multiplication and inverses, and inherit associativity from matrix multiplication; hence they form a subgroup of .
Two such matrices commute precisely when . Requiring this for every forces . Consequently
The map is a surjective group homomorphism to the additive group , with kernel of a group homomorphism . Equivalently, it gives the explicit quotient group isomorphism
It is well-defined because multiplying by a central element changes only . It is injective because equal imply that the quotient of the two matrices is central, and surjectivity follows by taking . This also proves the needed instance of the first isomorphism theorem directly.
A torsion-free divisible Abelian group is naturally a vector space over the rational numbers: for and , define as the unique with . Divisibility supplies existence and torsion-freeness supplies uniqueness.
In the usual group first-order language , a model of the universal part of DAG is a torsion-free group which is Abelian. If the language instead uses only , a substructure can be merely a torsion-free cancellative commutative monoid. Handle this convention by first taking its Grothendieck group : its elements are formal differences , with
The cancellative commutative monoid condition makes injective. If , then , and torsion-freeness gives ; hence is a torsion-free abelian group. In the full group language simply take .
For form its rational divisible hull
Concretely its elements are fractions with , where if . The canonical embedding of into is injective, and is nontrivial, divisible, Abelian and torsion-free, so it satisfies DAG.
Let be any structure embedding into a model of DAG. Extend it first to formal differences if necessary. Its unique extension to the rational divisible hull sends to the unique element with . This is a group homomorphism fixing the given copy of . It is injective: an element mapped to zero has , hence . Thus every embedding into a DAG model factors through .
The zero case must be treated separately: its rational divisible hull is zero and does not satisfy DAG. Instead choose . Given any nontrivial DAG model , choose ; the map embeds into over zero. Therefore DAG has algebraically prime models, including over the trivial base.
Here a divisor is a modulus of a number field, rather than an arbitrary real-weighted divisor. Write
where is a nonzero integral ideal, the finite multiplicities are nonnegative integers, and is a set of real Archimedean places. The multiplicity of a place in a modulus is at the finite place corresponding to , is at a real place in , and is at every other infinite place. In particular complex places have multiplicity .
Let be the group of nonzero fractional ideals prime to . Put
Let consist of the principal ideals with . The generalized ideal class group is the ray class group
Let be the unit group, let be the group of ray units, and define the residue and signature group of a modulus
The first factor is omitted when . There is a group homomorphism recording the unit's finite residues and its signs. Its kernel is .
Let consist of all principal fractional ideals prime to , and put . The two short exact sequences are
and
For the first short exact sequence, weak approximation for number fields realizes every choice of finite unit residues and real signs by some prime to . Send that data to the class of in . Changing without changing its residues and signs multiplies it by an element of , so the map is well-defined. Its kernel consists exactly of data arising from units: if with , then . This gives . For the second short exact sequence, forget the ray conditions. Its kernel is , and weak approximation for number fields gives a representative prime to for every ideal class. These are the two parts of the ray class exact sequence.
For , the ring of integers of a quadratic field is . The finite modulus is trivial and both real places occur, so is the narrow ideal class group and . The two field embeddings send to and . The given unit is positive at both places, since ; the unit is negative at both. Thus the unit signature map has image
The given ideal class group has order . The second short exact sequence therefore gives
To determine the group structure, retain the ideal that generates the ordinary ideal class group. We have : all generators , and lie in , while
puts in . Since is totally positive, in the narrow ideal class group. Its image in the ordinary ideal class group is nontrivial, so has order exactly .
The class of the principal ideal is a nontrivial element of . Its two signs are , and multiplying by a unit can only reverse both signs or neither, so no generator of this ideal is totally positive. Its square is , which does have a totally positive generator. Thus is another element of order , distinct from because its ordinary ideal class is trivial. These two elements are independent and generate all four classes. Consequently
The nontrivial ordinary ideal class already has a lift of order , so the extension in the second short exact sequence splits; it cannot be cyclic of order .
Label the distinct roots . Define by . Composition respects this rule, so it is a group homomorphism. If its image permutation is the identity, fixes all the roots; they generate , so is the identity. Thus is injective.
For , label the roots . The splitting field is and its nontrivial automorphism swaps precisely roots . Hence .
For , Eisenstein criterion gives irreducibility. The real root generates a degree-three real field. Adjoining a primitive cube root of unity gives a further extension of degree two, since it is nonreal and satisfies . Thus its splitting field has degree . In characteristic zero this is a Galois extension, so its Galois group has order . The injection into is therefore an isomorphism.
A one-dimensional continuous group representation is a continuous group homomorphism . Its image is compact. If some differed from one, its positive or negative powers would be unbounded, so the image lies in . Lift to a continuous real argument with . Then is a continuous integer multiple of and vanishes at , hence is always zero. The continuous Cauchy functional equation gives . Periodicity forces , so . Consequently ; conversely every such map is a continuous one-dimensional group representation.
No such finite group exists. Cayley theorem embeds every finite group of order into : the left-regular group action sends to the permutation , and this is faithful because the image of the identity element is .
To make every image permutation even, let , with support disjoint from the first letters. For , let for an even permutation and for an odd permutation, and set
The sign homomorphism gives , and commutes with all permutations of the first letters. Thus is a group homomorphism. It is injective by restriction to those letters, and its sign is . Consequently
This is the alternating-group embedding of a finite group.
Every permutation is a product of transpositions, since a cycle can be written
with rightmost factors acting first. Define the sign of a permutation to be for a product of transpositions. To prove that it is well defined without assuming parity, let be the permutation matrix specified by . Then , and a transposition exchanges two columns of the identity, so its determinant is . Any decomposition into transpositions therefore has
The left-hand side depends only on , proving well-definedness. Multiplicativity of the determinant now gives the sign homomorphism:
For the first requested group embedding, use the faithful four-point action of GL2 over F2: label the four vectors in and let an invertible matrix act on them by multiplication. Composition of these actions gives a group homomorphism . If a matrix fixes every vector, it fixes both standard basis vectors and is the identity, so the action is faithful. The matrix
fixes and and exchanges with . Its image is a single transposition, hence . The composite sign map is nontrivial.
For the second group embedding, simply take
The preceding multiplication formula proves the group homomorphism property, and forces for every , proving injectivity.
The Möbius group consists of all Möbius transformations of the Riemann sphere , with operation function composition. A nonzero-determinant matrix represents the map . If , its pole maps to and maps to ; if , the map is affine and fixes . Nonzero scalar multiples of represent the same transformation.
Define by this action for . Substitution of fractional-linear expressions shows , so is a group homomorphism. Any invertible matrix can be rescaled into the special linear group: choose with , which is possible because every nonzero complex number has a square root. This does not change the transformation, proving surjectivity. A transformation represented by is the identity only if fixing , and forces and . The determinant-one condition then gives . Thus
For the fixed-point claim, a nonidentity Möbius transformation has at least one fixed point of a Möbius transformation: when the finite fixed points solve a quadratic, and when infinity is fixed. A quadratic shows there can be no more than two distinct fixed points unless the transformation is the identity. Suppose there is exactly one. Conjugate it to infinity by a Möbius transformation. The resulting map has form , since it fixes infinity. If it also has the finite fixed point , a contradiction. Hence it is with . Its th power is , never the identity for . Conjugation preserves order, so a nonidentity finite-order Möbius transformation has exactly two fixed points.
Now let be a finite abelian subgroup of the Möbius group. First suppose it contains an element of order greater than two. Conjugate the two fixed points of to and , so , with a root of unity of order greater than two. Every element commuting with permutes its fixed-point set, because . A Möbius transformation preserving each of is ; one exchanging them is . In the second case and , so commuting would force , impossible. Thus all elements of are scalings. A finite subgroup of a field multiplicative group is cyclic; here one can see this directly by choosing the least common multiple of all element orders and observing that the scalars lie among the th roots of unity, a cyclic group. Hence is cyclic.
Otherwise every nonidentity element of has order two. If is nontrivial, choose and conjugate it to . The action of on has image of order at most two. Its kernel consists of scalings , and the order-two condition forces , so the kernel has at most two elements. Hence . Orders one and two give cyclic groups; order four with all nonidentity elements involutions gives , generated by any two distinct nonidentity elements. Both possibilities occur: scalings by roots of unity give every finite cyclic group, and gives the Klein four group. The classification is
A permutation representation is a group homomorphism , equivalently a group action on a set . The left regular action takes and . Each such map is a bijection, and . If is the identity, evaluating at the identity element gives . Thus the representation is faithful. Numbering the elements of identifies with the symmetric group , proving Cayley theorem:
For a nonabelian simple group, compose this faithful representation with the sign of a permutation homomorphism . Its kernel is a normal subgroup of , hence either trivial or all of . A trivial kernel would embed in a group of order two, contradicting noncommutativity. Therefore every represented element is even, and the same representation embeds in the alternating group .
Finally let act on the two cosets of its normal subgroup . An even permutation fixes both cosets, whereas an odd permutation exchanges them. This gives with kernel ; explicitly, send even permutations to the identity and odd permutations to .
The free product is obtained by taking disjoint copies of the elements of the two groups as generators and imposing precisely their internal multiplication relations. Equivalently, if with disjoint , then
A nontrivial free product has both factors different from the trivial group.
The normal form theorem for a free product says that every element has a unique expression
where the empty expression represents the identity. The are called syllables in a free product. Thus nonempty alternating products cannot be the identity, and the natural maps of the factors into the free product are injective.
For existence, multiply adjacent syllables from the same factor and delete identity syllables until the word alternates. Each change uses a defining relation and decreases the number of syllables. To establish uniqueness without assuming that these reductions are confluent, let be the set of alternating nonidentity syllable sequences, including the empty sequence. For , define a permutation of by prepending , multiplying into the first syllable if it belongs to , and deleting it if that product is the identity; for , do nothing.
The multiplication law inside gives for , and . This can be checked at the first syllable: if a product deletes it, the next syllable belongs to the other factor and is treated as a new first syllable. Hence the defining relations give a group action of on . An alternating word sends the empty sequence to its own syllable sequence. Two such words representing the same group element induce the same permutation, and therefore have identical sequences. This proves the normal form theorem for a free product.
The universal property of a free product states that, for group homomorphisms , there is a unique group homomorphism extending both. Explicitly,
The internal multiplication relations are respected because each is a group homomorphism, so this assignment descends from words to the presented group. Alternatively, multiplication of two normal forms is concatenation followed by precisely those internal relations, which do not change its value in . Uniqueness holds because the two factors generate the free product.
Substitution sends the defining relation to
Thus the assignment respects the relator and extends to a group homomorphism .
The base free product for the group encoding of a modular machine is
The letters generate the first factor, and generates the second. Let be the kernel of the group homomorphism that kills . Then
is a free group with this displayed free basis of a group. Indeed every word in can be rewritten as a product of such conjugates followed by an element of , so they generate the kernel. A freely reduced product of these conjugates is nontrivial by the normal form theorem for a free product: after combining adjacent occurrences of the same conjugate, different successive indices give a nonzero intervening -syllable. Thus there is no relation among the proposed basis elements.
For clarity, a modular machine of modulus has at most one instruction for each residue pair , with and . Its right and left transitions are respectively
Its halting set at a designated terminal configuration consists of the nonnegative pairs whose forward computation reaches , including itself. These formulas explain the exponents in the associated-subgroup maps below.
The auxiliary Higman group has no nontrivial finite quotients of a group. One can use this permitted property directly, but there is a short verification. In any finite quotient, let be the order of the image of . Since conjugation sends to its square, must be odd. If some , choose the least prime number dividing any . It is odd. Conjugation by the preceding generator gives
The multiplicative order of modulo is therefore a divisor of . It is greater than one and divides by the Fermat little theorem, so it has a prime divisor smaller than . That prime also divides , contradicting the choice of . Hence every and the quotient is trivial.
Given any finitely presented group , form , and apply part (a) to the word . This word is nontrivial by the normal form theorem for a free product, so the output contains by the embedding already proved.
To check its finite quotients, let be any group homomorphism to a finite group. The image of the copy of is trivial by the preceding property. The identifications make all trivial. Thus the equations give, in the image,
Since , this forces for all generators of , including . The defining word then has trivial image, so as well. Every generator of has trivial image. Therefore
This uses the concrete construction of part (a), not an assumption that arbitrary quotients preserve an embedding of .
Let be the orientation-preserving hyperbolic triangle group, acting on the hyperbolic plane with presentation
Its quotient is a topological sphere with three cone points of order seven. Define the surjective group homomorphism
The stated order conditions make this well defined, and the generation hypothesis makes it surjective. Set . Every finite-order element of a hyperbolic triangle group is conjugate to a power of a cone-point generator. None of its nontrivial such powers lies in , since all three images have order seven. Therefore is torsion free, and is a closed oriented hyperbolic surface carrying an isometric action of .
The orbifold Euler characteristic of the base is
The covering degree is , so and has genus . The subgroups have order . Point stabilizers for the action are trivial or cyclic of order seven. Since seven does not divide , each acts freely. Thus
are smooth closed hyperbolic surfaces, and
Equivalently, each is a seven-sheeted orbifold cover of the base with three branch values, and the Riemann-Hurwitz formula gives the same genus.
Gassmann equivalence means that meet each conjugacy class of in the same number of elements. To prove isospectrality directly, let be a Laplacian eigenfunction space on , viewed as a representation of . Pullback identifies with its -invariant subspace. Averaging over is the projection onto this subspace, and hence
The character of a representation in this sum is constant on conjugacy classes. The sums are equal by Gassmann equivalence, so the eigenvalues and their multiplicities agree. This is the mechanism of the Sunada theorem. The constructed genus-three hyperbolic surfaces are isospectral.
Nonconjugacy of in does not prove nonisometry. For example, an isometry of outside the given subgroup might conjugate to and descend to an isometry of the quotients. More generally, an isometry between the quotients lifts to an isometry of conjugating the two groups ; there is no requirement that this lift come from an element of . Additional symmetries of the three-cone-point construction are a possible source of this coincidence.
One can prevent this by modifying the common metric, while keeping the action isometric. Here is a geometric way to make that step precise. On the regular part of the base orbifold , choose a sufficiently small smooth conformal rescaling of a Riemannian metric of its metric whose local geometry distinguishes base points and local directions. One may use a generic smooth conformal factor with separate curvature features on a countable collection of small disks. Let these disks approach the cone points, with amplitudes decaying sufficiently rapidly that the lifted conformal factor and all its derivatives vanish at their centres. This gives smooth metrics on the covering surface, without retaining an open homogeneous region near a cone point. The purpose is to ensure that a local isometry in the regular part covering a quotient is the identity on the base: the curvature features identify its base point and local frame. Pull the metric back to and then descend it to both . The only points with the cone-point rotational symmetry in their metric germs are the lifts of the cone points; the perturbation removes such symmetries in the regular part. Any quotient isometry must therefore preserve this finite distinguished set.
If the perturbed quotients were isometric, their local maps on the dense regular part would preserve the projection to . They would therefore give equivalent connected covers of the punctured base; the correspondence between connected covering spaces and subgroups would conjugate to inside . Applying would conjugate inside , contrary to hypothesis. Thus the perturbed quotients are nonisometric. The same averaging argument still proves isospectrality, because it requires a common -invariant Riemannian metric, not constant curvature. The genus remains three.
This last step produces nonisometric isospectral metrics of variable curvature on genus-three surfaces. An oriented metric defines a Riemann surface through its conformal structure; using a conformal perturbation even preserves the original conformal structures. If “Riemann surface” means specifically its canonical curvature metric, the last step should instead be described as producing Riemannian surfaces. The orbifold has no hyperbolic deformation parameters: uniformizing the perturbed metrics does not preserve their Laplace-Beltrami operator spectra, and cannot be used to claim nonisometric hyperbolic examples from this argument.
Define the length of a formal tensor expression recursively by
The canonical strict monoidal functor sends to , sends every associator and unitor to an identity braid, and sends to the block braiding . The pentagon and triangle become identity equations; the braiding axioms become the corresponding block-braid equations. Thus the assignment respects the defining relations, and
on the nose. It is a braided monoidal functor with identity comparison maps.
To prove that is an equivalence of categories, choose a standard parenthesization of copies of , with . On , define the image of by canonically exposing the th and st factors, applying there, and restoring the chosen parentheses. The monoidal coherence theorem makes this independent of the structural rebracketing. Crossings on disjoint pairs commute by the tensor interchange law. The adjacent braid group relations follows from the hexagon laws and naturality of the braiding, as in the Yang–Baxter calculation below. Hence these assignments give group homomorphisms and a functor .
Equip with the canonical rebracketing maps . Their monoidal functor axioms follow from the monoidal coherence theorem; the block-braiding compatibility follows by iterating the two hexagon laws. Therefore is a strong monoidal functor compatible with the braiding.
We have , including its comparison maps. For every formal expression , there is a canonical structural isomorphism
obtained by rebracketing and inserting the units appearing in . These maps form a natural isomorphism . To check naturality, it suffices to check the generating morphisms: for associators and unitors it is exactly monoidal coherence; for it follows from the hexagon expansion into the elementary crossings defining . Composition and tensor product then preserve the equation. The same structural coherence shows that is monoidal.
Thus has a specified quasi-inverse and is the required equivalence:
Only ordinary monoidal coherence, together with the defining braiding axioms, has been used; a separate braided coherence theorem is unnecessary.