Pulling back the factors of automorphy in the Appell–Humbert theorem by , where , pulls back both the Hermitian form and the semicharacter of a complex lattice. Thus the explicit answer is
Writing makes the second formula completely explicit:
The second equality is an equality of signs, obtained by reducing the exponents modulo . The Hermitian form follows from . Its integer parameter equals the norm of the Gaussian integer, agreeing with the degree of this nonzero isogeny of elliptic curves. The formulas also include , when the pulled-back line bundle is trivial.
Let be a Euclidean domain and a nonzero ideal. Choose minimizing the Euclidean size. For any , Euclidean division gives , where either or has smaller size than . But , so minimality forces . Consequently . The zero ideal is , proving that every Euclidean domain is a principal ideal domain.
A commutative ring is Noetherian if every ideal is finitely generated; equivalently, every ascending chain of ideals stabilizes. To see the equivalence, the union of an ascending chain is an ideal. Finitely many generators for that union already belong to one member of the chain, after which the chain is constant. Conversely, an ideal which is not finitely generated permits successive choices outside the ideals generated by previous choices, producing a strictly ascending chain.
Every principal ideal domain is therefore Noetherian. The given Euclidean domain property of the Gaussian integers yields
First compute the Mordell-Weil group rank by two-isogeny descent. Here
The two-isogeny formula gives . If , then , and
is an isomorphism over . Its -coordinate multiplier is a square in .
Use the two-torsion square-class homomorphism
For any prime ideal of the Gaussian integers, if , then is a unit and ; if , the term has strictly smallest valuation and . Hence every valuation of is even. Since the Gaussian integers form a principal ideal domain, dividing by a square leaves a unit. Their units are , whose square classes are because and is not a square in . For the latter assertion, with would imply and , hence , impossible for rational . Thus
Both classes occur, at and . This is the unit square-class bound for two-isogeny descent.
Define on similarly, with . Since multiplies nonexceptional -coordinates by a square, and preserves the exceptional classes as well, its image is also . The standard kernel identities in two-isogeny descent are
Here is the dual isogeny and . These identities can be checked directly from the formulas: , and conversely a square -coordinate lets the quadratic equation for a preimage be solved using the curve equation. For example, if , the equation for is , whose discriminant is ; the -coordinate then follows from the dual formula. The exceptional points satisfy the same completed square-class criterion.
The two-isogeny index formula over a number field keeps track of a small kernel factor:
In this case , where , and because . Thus , and the index is . There is only one nonzero rational 2-torsion point on : the other two would require , and has the same nonsquare class as . The Mordell-Weil theorem now gives
so .
It remains to identify all torsion, rather than merely the rank. The elliptic-curve discriminant is , so the primes and have good reduction, with residue characteristics three and five. By the supplied point-count information their reduction groups have orders that are powers of two. The reduction of torsion points on an elliptic curve is injective on prime-to-residue-characteristic torsion. Every odd-primary torsion subgroup therefore injects into a group of two-power order at at least one of these two primes, and must be zero. All torsion is two-primary.
Finally, if a point had order four, its double would be . The elliptic-curve addition formula gives
For the denominator is nonzero, so , impossible in . A point of higher two-power order would have a multiple of order four, so it too is excluded. Thus the only torsion points are . Together with rank zero,
The polynomial satisfies the Eisenstein criterion at the prime two: every nonleading coefficient is divisible by two, and the constant coefficient is not divisible by four. Thus it is irreducible over and is the minimal polynomial of every one of its roots. Part (a) gives
But
In the quotient, the two nonzero classes of and multiply to zero. They are nonzero because their nonzero representative degrees are less than five. The quotient is not an integral domain, so is not a prime ideal.
For ring homomorphisms preserving the identity, an image of in the Gaussian integers would satisfy . The minimal polynomial of over would then be , of degree five. This is impossible because has degree at most two. Thus there is no unital homomorphism . If homomorphisms are instead allowed not to preserve the identity, the zero map exists; every nonzero homomorphism into this integral domain is unital, because the image of one is a nonzero idempotent and hence one.
Write the Gaussian integer , with , and set . Complex conjugation preserves , because . Choose a nonzero . Then is a positive integer in . It cannot be one because is a proper prime ideal. Factoring into rational primes and applying primality repeatedly gives a prime .
The element satisfies the monic polynomial . Evaluation induces a ring homomorphism that is a surjection
The source has elements by part (b), so
If , use instead and get at most elements. Moreover is an integral domain, so its finiteness makes it a field. This proves the finite residue-field theorem for Gaussian integer orders without incorrectly assuming that every Gaussian integer order is a principal ideal domain.
No. In the Gaussian integers, choose
Indeed, substituting gives , so is a prime ideal and its contraction is . Put . Modulo , becomes in , so . Therefore
We show that is not an integral element over , using a direct reduction argument. Write , viewed inside . There is a ring homomorphism
which reduces rational coefficients modulo . It is well defined because denominators in are not divisible by , and in . In particular, and .
If satisfied a monic equation over , say
multiplication by would give an equality in :
Applying gives in , a contradiction. Consequently
This exhibits why localization of an integral extension at a prime need not be integral. Localizing both rings by the same multiplicative subset preserves an integral extension, but inverts additional elements, including , whose image at the other prime ideal is zero. The original extension is integral because satisfies the monic equation : the subalgebra generated by finitely many integral elements property applies to .
The three answers, in the given order, are no, yes, yes.
For , consider the ideal . Its members have even constant coefficient, so and the ideal is proper. If , then divides the constant , forcing to be constant by additivity of polynomial degree in this integral domain. Since also divides , it must divide the coefficient , giving . That would make the whole ring, a contradiction. Thus is not a principal ideal domain, and part (a) shows it cannot be a Euclidean domain. This is the nonprincipal ideal generated by a prime and an indeterminate obstruction.
Evaluation at gives the ring isomorphism
Indeed, division by the monic polynomial leaves a unique remainder , and its value is zero only when both integer coefficients vanish. Thus the quotient maps bijectively, with operations preserved, onto the Gaussian integers. These form a Euclidean domain for the Gaussian integer norm , a standard Euclidean example allowed in this part. Geometrically, rounding the real and imaginary coordinates gives a quotient error with squared modulus at most .
Finally,
via . Every polynomial over occurs. The kernel consists exactly of polynomials whose -independent part has even coefficients: write to see that this is precisely . Hence the induced quotient map is a bijective ring homomorphism. Its target is a Euclidean domain with Euclidean function : a polynomial ring over a field is Euclidean by the division algorithm in part (a).
Regard as a matrix over the rational numbers. Part (a)(ii), with , gives its characteristic polynomial . Therefore, writing for the imaginary unit,
The matrix is not zero: otherwise would have noninteger diagonal entries. It consequently has rank of a matrix one over the fraction field of the Gaussian integers.
By part (b)(i), is a euclidean domain, hence a principal ideal domain, so apply Smith normal form. There exist such that
Indeed, invertible multiplication preserves rank of a matrix, so exactly one diagonal entry is nonzero. For , multiplication on the right gives . Since is an invertible matrix,
The Smith normal form supplies a kernel basis lemma ensures that the null vector is a column of an invertible matrix over ; an arbitrary nonzero solution over would not itself establish that requirement.
Over a principal ideal domain , an -by- matrix is in Smith normal form if all entries off the main diagonal vanish and its nonzero diagonal entries occur first and satisfy
All remaining diagonal entries are zero. The zero matrix is allowed, with . For an arbitrary matrix , the Smith normal form theorem gives invertible matrices and with
where the right side is interpreted as a rectangular diagonal matrix when necessary. The are determined up to multiplication by units. Positivity can be required over , but is not a condition over the Gaussian integers.
The Gaussian integers form an integral domain, since they are a subring of the complex numbers. Use the Gaussian integer norm
which is a positive integer for nonzero and satisfies .
For with , write . Choose integers with and , put , and set . Then
Thus division with remainder has either or a strictly smaller Gaussian integer norm. This proves that is a euclidean function and
Primary Gaussian integer Created 2026-10-14 Updated 2026-10-20
An odd Gaussian integer is primary when it satisfies the displayed congruence. The four units have distinct images in , a group of order four; hence every odd ideal has a unique primary generator. Indeed and .
Ring of integers Created 2026-10-14 Updated 2026-10-25
The ring of integers of a number field is
It is the integral closure of in . Its additive group is a free abelian group of rank , so an integral basis writes every element uniquely as with . Its field of fractions is .[ref]
For , this gives ; for , it gives . The Gaussian integers give the corresponding example inside . The ring of integers is determined by the field, and need not equal for a chosen algebraic integer generator: in , the larger ring contains with index two.
This is the setting for divisibility, global units, and prime ideal factorization. A ring of integers is a Dedekind domain, so every nonzero proper ideal factors uniquely into nonzero prime ideals, even when unique factorization of elements fails.[ref]
A rank-two period lattice stable under multiplication by is, up to nonzero complex scaling, . Choose a shortest nonzero period . Every complex number lies within of a Gaussian integer, so for any , subtraction of a suitable leaves a shorter period and hence zero. This proves .
Similarly, stability under a primitive cube root gives . The triangular lattice has covering radius , so the same shortest-period argument applies. Stability under a primitive sixth root is equivalent, since . These facts identify complex tori with automorphisms fixing their origin of orders four and three or six, respectively.
Unit square-class bound for two-isogeny descent Created 2026-10-06 Updated 2026-10-07
Suppose the ring of integers of a number field is a principal ideal domain, are integral, and is a unit. On every nonzero -coordinate has even valuation at every finite prime: positive valuation gives , and negative valuation gives . Thus the two-torsion square-class homomorphism takes values among unit square classes. For the Gaussian integers, their unit group modulo squares has two elements, represented by . This can reduce a two-isogeny descent to a very small calculation even though the field contains no ordering.