Take the three-dimensional affine quadric cone
The polynomial is an irreducible polynomial: as a polynomial in over , it is primitive because and are coprime elements of a unique factorization domain, and it is a linear irreducible polynomial over . Gauss lemma for polynomials then applies. Thus is an irreducible variety that is an affine variety, of algebraic dimension by the principal hypersurface dimension lemma in affine space .
The coordinate rings of and are respectively and . Both are affine planes, hence irreducible closed subsets of algebraic dimension . Their intersection is precisely the origin. Therefore
The origin is the singular point of an algebraic variety of this three-dimensional affine quadric cone. The example shows why a smoothness of an algebraic variety hypothesis matters in intersection dimension estimates.
Suppose there were distinct singular points of an algebraic variety . Let be their joining projective line. The homogeneous restriction has degree . At a singular point of an algebraic variety of a plane algebraic curve, the local defining equation has no constant or linear term, so its restriction to any line through that point vanishes to order at least , unless the restriction is identically zero. Therefore a nonzero would have at least four zeros counted with multiplicity, two at and two at , which a degree- homogeneous polynomial on cannot have.
Hence . After choosing coordinates with , this says that every monomial of contains , so divides . That contradicts the irreducible polynomial hypothesis on the cubic. Thus
This elementary version of the Bézout theorem argument works in every characteristic, without assuming that the partial derivatives of the cubic have their characteristic-zero form.
A ring homomorphism is understood to preserve . Start with . Its map on spectra of rings is
Contraction gives a prime ideal, and . Thus is continuous for the Zariski topology. On each principal open subscheme, the structure sheaf map is the ring homomorphism
These maps commute with restrictions, so they define a sheaf morphism . At , with , its stalk map is . The inverse image of the maximal ideal is , so this is a local homomorphism. We have constructed a morphism of locally ringed spaces.
Conversely, let be a morphism of locally ringed spaces. Its map on global sections gives , using and . Fix and put . Compatibility with the stalk maps and the local homomorphism property give
Consequently , so the underlying map is forced. On , the sheaf morphism is forced as well: it extends and sends to a unit, hence agrees with the displayed map by the universal property of localization. The principal open subschemes form a basis, so the entire sheaf morphism is determined. Taking global sections of the construction recovers . The two constructions are inverse, proving the affine-target adjunction for schemes in the affine-source case:
To describe the real affine plane scheme points, write . It is a unique factorization domain of Krull dimension two. Its points are exactly the following prime ideals:
For completeness, any height-one prime ideal contains an irreducible polynomial ; since is already a height-one prime ideal, it must equal . Every remaining nonzero prime ideal has height two and is maximal, by Krull dimension. For a nonreal pair, evaluation generates all of over , so its kernel is maximal. Conversely, each residue field isomorphic to has exactly the two conjugate real-algebra embeddings into , proving the assertion about repetitions.
This describes the topology too: consists of the prime ideals containing , and the closure of a point is . In particular, the closure of is the whole affine plane, while the closure of contains precisely the closed points on , together with itself. The spectrum is much larger than the set . For example, is a height-one point although its curve has no real points. Its structure sheaf has and stalk at .
The induced morphism of schemes
is contraction of prime ideals, with the structure sheaf maps given above. On closed points, it sends to the kernel of real-polynomial evaluation at . A real closed point has one complex point above it; a nonreal closed point has two, interchanged by complex conjugation. The source generic point maps to the target generic point. The source height-one points are generated by irreducible complex polynomials . Their contractions are height-one prime ideals , and is a factor of over . An irreducible real either stays irreducible over or splits into two distinct conjugate irreducible factors. Indeed, complex conjugation acts transitively on its distinct factors, or a proper orbit product would give a real factor of ; every orbit has size at most two. Repeated factors are excluded by separability in characteristic zero. Thus one or two height-one points lie above .
The complexification fibres of a real scheme give a uniform description of all scheme-theoretic fibres, including the nonclosed points, is especially useful. The extension of coordinate rings is
a free -module with basis . At , with residue field , the scheme-theoretic fibre is
If is a square in , the Chinese remainder theorem gives , hence two points. Otherwise it is a quadratic field extension, hence one point. The polynomial has no repeated root in characteristic zero, so all these scheme-theoretic fibres are reduced schemes. This also proves surjectivity. Conjugation acts on each two-point fibre by exchanging its points and fixes each one-point fibre. As a finite morphism, is closed, so its underlying topological space is the quotient by complex conjugation. The fibre formula explains why a real closed point gives one complex point, whereas the generic point gives a single point with residue field .
Let be a finite integral domain. For any , multiplication is injective: implies , hence because there are no zero divisors. An injective map of a finite set to itself is surjective, so for some . Every nonzero element is invertible; therefore a finite integral domain is a field.
For an irreducible polynomial , consider a nonzero class in the quotient ring . Since does not divide , irreducibility gives . The Euclidean algorithm in the polynomial ring gives polynomials with . Modulo , . Thus the quotient by an irreducible polynomial is a field.
For a field with four elements, use
The quadratic has no root in , so is irreducible. Write . Polynomial division shows the elements are , with . Its multiplication table is
For a field with nine elements, use
The values of at are , so the quadratic is irreducible. Every class is uniquely , , with . These nine classes form a finite field; multiplication is , with coefficients modulo three.
For the projective-space complement, assume and choose two distinct closed points . Take the ideal sheaf of two closed points on . The codimension-two extension of regular functions on a normal variety gives
One can see this directly: on every standard affine chart of , a rational function written in lowest terms cannot have a nonconstant denominator, because an irreducible polynomial factor of the denominator would define a pole along a codimension-one hypersurface, and such a hypersurface is not removed by . The extended function is constant because every global regular function on projective space is constant. Now the short exact sequence
sends diagonally into on global sections. Its cokernel is , and the long exact sequence in sheaf cohomology injects that cokernel into . Thus
The assumption is necessary: is already affine and has no such example.
If is an irreducible polynomial, any two roots have the same minimal polynomial. Thus the map carrying to is a field embedding. The extension theorem for field embeddings extends it to an embedding of the splitting field into an algebraic closure. Since is normal, its image is , so it is an element of the Galois group.
Conversely, factor into irreducible factors over . An automorphism preserves the vanishing of each factor, so it cannot send a root of one factor to a root of another. Since there are no repeated roots, different factors have disjoint root sets. Transitivity on all roots therefore forces a single irreducible factor. This proves the equivalence.
Eisenstein's criterion. Let be a nonconstant primitive polynomial. If a prime number satisfies , for , and , then is an irreducible polynomial over .
To prove the Eisenstein criterion, suppose a nontrivial factorization exists over . Gauss lemma for polynomials gives with of positive degree. Their leading coefficients are not divisible by , because their product is . Reduction modulo therefore preserves both degrees, and
Since the only irreducible factor of the right side is , both reduced factors are nonzero monomials of positive degree. Their constant coefficients are consequently divisible by . This would make , a contradiction.
For the requested polynomial, shift the variable by one. The binomial theorem gives
It is monic, all coefficients below the leading one are divisible by , and the constant coefficient is , not divisible by . The Eisenstein criterion proves irreducibility of this shifted polynomial. The substitution is an automorphism of , with inverse , so it preserves nontrivial factorizations. Hence
This is the cyclotomic polynomial for a prime index.
The Weak Hilbert Nullstellensatz states that if is an algebraically closed field, every maximal ideal of is
Equivalently, every proper ideal has a common zero. We prove the more general field statement, the Zariski lemma: a field finitely generated as a -algebra is a finite field extension of .
Write such a field as . Choose a maximal set of algebraically independent elements among these generators and denote the remaining generators by . Each is an algebraic element over , so is a finite field extension. Clearing the denominators in their monic equations, choose a nonzero such that each is an integral element over
Because is a field and , we have . Thus is an integral extension of .
A subring over which a field is integral must itself be a field. Indeed, for , an integral equation for multiplied by expresses as an element of . But if , the ring is not a field: choose an irreducible polynomial which does not divide . There are infinitely many monic irreducible polynomials in , by the usual product-plus-one argument, whereas only finitely many can divide the nonzero . The prime ideal stays proper after inverting , so has no inverse in . Therefore , proving that is a finite field extension, and in particular an algebraic field extension.
Apply the Zariski lemma to the residue field of a maximal ideal. When is an algebraically closed field, this field is itself. The images of then give , proving the Weak Hilbert Nullstellensatz.
For the real Laurent polynomial ring, the same argument applies because it is the finitely generated algebra
Every residue field at a maximal ideal is consequently a finite field extension of , and so is or . Here we use the fundamental theorem of algebra, which makes the algebraic closure of of degree two. The images of must be nonzero since these elements are units. It follows that the answer is
with and defining the same maximal ideal. If both coordinates are real, evaluation has image ; otherwise its image is . Thus every displayed kernel is maximal, and the Zariski lemma shows that this list is exhaustive.
For explicit generating sets of an ideal, there are three cases. For real nonzero ,
If and with ,
If with and , then
The last two quotients are ; the nonzero coordinate condition ensures that the Laurent inverses exist in them. There are no further coincidences in the classification: equal kernels induce an -isomorphism between the evaluation image fields. The only -automorphisms of are the identity and complex conjugation, so the two pairs must agree or be conjugate.
To prove the intersection assertion, fix a prime ideal and an element . The integral domain has nonzero image . Its localization of a ring is nonzero and still a finitely generated algebra over , so it has a maximal ideal . By the Zariski lemma, the field is finite over .
The image of in is a subring containing and is a finite-dimensional -vector space. It is an integral domain, hence a field: multiplication by any nonzero element is an injective linear map of a finite-dimensional vector space and therefore surjective. The kernel of is thus a maximal ideal which avoids , since is invertible in . Its inverse image in is a maximal ideal containing but avoiding . As this works for every ,
This is the Jacobson ring property for this Laurent polynomial ring.
For a nonzero finitely generated module , its set of associated primes is
Here is the annihilator of the element. The Laurent polynomial ring is a Noetherian ring, so the nonempty collection of annihilators of nonzero elements of has a maximal member, say . It is proper because .
If and , then and
Maximality forces , hence . Thus is a prime ideal, proving . This argument in fact only needs that is Noetherian, not the finite generation of .
A proper ideal is -primary when its radical of an ideal is and
Equivalently, and imply ; equivalently, every zero divisor of is nilpotent. These formulations distinguish the actual primary ideal property from the weaker assertion that there is only one minimal prime ideal.
For the final example, set and . Then
Since is an integral domain, is a prime ideal. Moreover and , so . Consequently is the unique minimal prime ideal over .
Nevertheless , while and no power of belongs to . For the first assertion, reduce modulo : the image of is in , and is not a multiple of because is a nonunit in this integral domain. For the second, , so for every . Thus is not a -primary ideal: a unique minimal prime does not imply primary. In , the nonzero class of is killed by , a zero divisor which is not nilpotent.
A suitable version of the Hensel lemma is this: if is a complete discrete valuation ring, , and is a root of with , there is a unique reducing to with . Starting with any lift, Newton iteration over a valued field keeps the derivative a unit and doubles the error valuation, giving convergence. Uniqueness follows by factoring when two roots have the same residue.
The field in the rest of this question is not assumed complete, so that version cannot simply be applied to it. Instead use the stated uniqueness of the extension of an absolute value. Let be any two roots of a polynomial , which is irreducible. The field embedding sending to identifies with . Pulling the latter field's absolute value back gives an extension on , which must coincide with the given one. More generally, for every ,
This proves equal absolute values of algebraic conjugates without assuming separability or a transitive action of a Galois group; repeated roots cause no difficulty.
Every root of the monic has absolute value at most one. Indeed, if , then each lower term satisfies . The ultrametric inequality makes the leading term dominate their sum, contradicting . Thus
All roots lie in the valuation ring , so their residues are defined in the residue field . Let be the monic minimal polynomial of an algebraic element of ; this residue is algebraic because it satisfies the monic . Choose a coefficientwise lift . Then , and the conjugacy argument gives for every . Hence every is a root of .
Reduction of the splitting-field factorization, with multiplicities, gives
Every monic irreducible factor of over has a root among these residues. That root also satisfies , so its minimal polynomial is . Unique factorization therefore proves the pure-power reduction of a monic irreducible polynomial:
This does not assert that is separable or that the reduction is square-free.
Finally, factor the monic over as with distinct monic irreducible polynomials . The same leading-term argument bounds every root of by one. Coefficients of any are elementary symmetric polynomials in some of these roots, so they lie in . By the preceding result each is a power of a single monic irreducible residue polynomial .
Since the prescribed are coprime, every occurs on exactly one side. Assign the entire factor to that side and form the two products. Comparing irreducible-factor multiplicities in the reduction proves the coprime factor lifting from valuation-extension uniqueness:
Empty products are one, covering constant prescribed factors. The construction proves the required factor-lifting form of the Hensel lemma directly from extension uniqueness, without adding completeness as an unstated hypothesis.
Over , the polynomial factors as . Since is not a square modulo , the last factor is an irreducible polynomial. The splitting field is , so . The finite-field Frobenius automorphism fixes and swaps the other two roots.
The polynomial has values at respectively, modulo . Thus has no root and is an irreducible polynomial over . One root generates ; all its Frobenius conjugates are there, so this is its splitting field. Hence , generated by , a 3-cycle on the roots.
Over ,
Both quadratics have discriminant , a nonsquare in , so are irreducible polynomials. Both split in the same quadratic finite field . Consequently . Its generator is the finite-field Frobenius automorphism , acting as a product of two transpositions on the four roots.
Identify a binary word with its coefficient polynomial in . A cyclic code is exactly an ideal of : closure under multiplication by is closure under cyclic shift. Its inverse image in the principal ideal domain has a unique monic generator polynomial of a cyclic code dividing . Put
The cubics have no root in , hence are irreducible polynomials. The eight monic divisors yield all binary cyclic codes of length seven. A code generated by has basis and dimension , with the zero code treated separately.
For the dual of a cyclic code, let . Orthogonality of coefficient vectors to all cyclic shifts gives the generator . Here . Thus the complete pairing, with the respective dimensions, is
These are respectively the whole-space/zero, even-weight/repetition, and two Hamming code/binary simplex code pairs. The reciprocal formula follows because the product of a word polynomial and the reversed polynomial of an orthogonal word has zero coefficients in all cyclic positions; the resulting inclusion has the correct complementary dimension, hence is equality.
Here the coefficient fields are and . A polynomial ring in one variable over a field is a Euclidean domain, hence a principal ideal domain; its nonzero prime ideals are generated by irreducible polynomials. The fundamental theorem of algebra says that all irreducible polynomials over are linear. Combining it with complex conjugation shows that the monic irreducible polynomials over are exactly the linear polynomials and quadratics with no real root. Thus
Every nonzero prime ideal in this list is a maximal ideal; is a prime ideal because is an integral domain. Likewise,
The map is contraction of an ideal along the inclusion. It sends to . For , the contraction of consists of the real polynomials vanishing at . If , the factor theorem gives the ideal . If , a real polynomial vanishing at also vanishes at its complex conjugate , so it is divisible by . Division by this real quadratic gives the converse and hence
Thus each real linear prime ideal has one preimage, each real quadratic prime ideal has the two conjugate preimages and , and has only above it. In particular, is surjective.