A Smith normal form of an matrix over a principal ideal domain is a diagonal matrix
where and . It is guaranteed to exist for every matrix over a principal ideal domain. The entries are determined up to multiplication by units; over they are conventionally chosen positive.
Put and let . The ideal is a height-one prime ideal, because and . It therefore defines a prime Weil divisor .
Localizing at eliminates , giving
a unique factorization domain. The Nagata theorem for divisor class groups says that is generated by the height-one primes containing . Since
the only such prime is , and hence generates. At the generic point of , is a unit in a ring and , so the order of vanishing is three:
Thus .
This relation has exact order three. Indeed, if a principal divisor were supported on , its defining rational function would be a unit on . The units of are precisely with and , whose divisors are . Consequently
generated by . This is the case of the Divisor class group of an A-type surface singularity.
Cover by
These sets cover because a point of has . On , the relation shows that has local equation ; on , the relation gives local equation ; and on its local equation is . Thus is a Cartier divisor.
For the line bundle associated to a divisor , choose local frames
The transition functions are
on the corresponding overlaps. Every displayed ratio is a unit in a ring in the corresponding ring of regular functions, and the Čech cocycle condition follows immediately.
An element of the p-adic integers is a unit in a ring exactly when its reduction modulo is nonzero. More explicitly, if , its inverses modulo are unique and compatible, so they define with . The converse follows by reducing modulo . Part ii therefore proves that topologically generates the additive group if and only if is a p-adic unit.
Consider the symmetric Laurent polynomial
It satisfies , so the Alexander polynomial realization theorem gives a knot with . The polynomial is not a unit of , whereas
A morphism of schemes is proper when it is a finite type morphism, a separated morphism, and a universally closed morphism. The valuative criterion for properness says, under the usual finite-type and Noetherian hypotheses, that is proper exactly when every commutative square
with a discrete valuation ring and has a unique diagonal lift .
For , a -point is with not all zero. If is a uniformizer, multiply all coordinates by one power of so that . The resulting coordinates lie in and at least one is a unit, so they define an -point extending the given -point. If two extensions exist, on a chart where one coordinate is a unit their affine coordinate ratios agree in and therefore in the integral domain ; hence the extensions agree. This verifies existence and uniqueness directly.
Polynomial division Created 2026-09-24 Updated 2026-10-18
Polynomial division separates a polynomial into a multiple of a chosen divisor and a smaller polynomial remainder. Given over a field , with , there are unique polynomials satisfying
Here is the polynomial quotient. The bound concerns polynomial degree, rather than the sizes of the coefficients.[ref]
For an original example over the rational numbers, take
Polynomial long division first cancels by subtracting :
Subtracting one more copy of cancels :
Thus
The final polynomial remainder has polynomial degree one, below the divisor's polynomial degree two. Multiplying out the last identity checks every coefficient, including the constant term .
Figure 1.
Polynomial long division cancels the cubic and quadratic terms in two steps, recording and
. Details.
The polynomial degree bound makes this decomposition useful: it replaces a potentially long polynomial with a short polynomial remainder whenever multiples of can be discarded. At any root of a polynomial of , those multiples vanish under polynomial evaluation. Repeated polynomial division also drives the Euclidean algorithm for finding a greatest common divisor of polynomials.
The coefficient setting matters. Over a commutative ring, the same existence and uniqueness hold when the divisor's leading coefficient is a unit in a ring. A monic polynomial therefore works over the integers, even though they do not form a field; monic polynomial division over a ring explains why zero divisors cause no difficulty in that case.[ref]
A nonzero divisor alone is insufficient over the integers. Dividing by with an integer polynomial quotient and a constant polynomial remainder would require for an integer , which is impossible. Over the rational numbers the division instead gives
The obstruction is the nonunit leading coefficient . This example separates existence from uniqueness: over an integral domain, the polynomial degree argument still makes any admissible pair unique, if it exists.
For a formal group law over any commutative ring , the invariant differential of a formal group law satisfies . Its coefficient is a unit in a ring, so . If , this means . When , the integer Bézout's identity implies , even if is a zero divisor. Put those coefficients into and the exponents divisible by into .
Principal fractional ideal Created 2026-10-06 Updated 2026-10-14
A principal fractional ideal of an integral domain with fraction field is for a nonzero . Its generators differ by a unit in a ring in . For a number field, taking and quotienting nonzero fractional ideals by principal fractional ideals gives the ideal class group; requiring congruences and signs of the generators instead gives a ray class group.
Ramification index of a morphism of curves Created 2026-10-05 Updated 2026-10-14
For a nonconstant morphism between nonsingular curves and a local target uniformizer at the image of , the index is the order of vanishing of its pullback. Changing multiplies it by a local unit in a ring and does not change that order. This is a valuation definition and remains meaningful for inseparable morphisms.