KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesAffine Varieties and Polynomial Zero SetsEngineering · Engineering MathematicsLesson 4/8← PrevNext →
GuidePublished 14 Aug 202610 min readBy KEVOSaffinevarietiespolynomialzero
On this page

Ask about this page

KEVOS AIAffine Varieties and Polynomial Zero Sets

KEVOS knowledge first · trusted web sources when needed

Engineering · Mathematics · Advanced Algebra Handbook

Affine Varieties and Polynomial Zero Sets

Commutative algebra studies ideals, prime structure, factorisation, localisation, algebraic dependence and dimension. It is most reliable when global questions are reduced to ideal-theoretic or local statements and then reassembled. This page consolidates the relevant material from the supplied algebra source into a stand-alone handbook chapter.

Learning pathCommutative Algebra
LevelAdvanced
FormatHandbook guide
Read time11 min

Executive summary

This chapter develops affine varieties and polynomial zero sets as part of a connected advanced-algebra learning sequence. The emphasis is on definitions, hypotheses, structural results and repeatable methods rather than historical narrative.

The source material is theorem-rich. Accordingly, the handbook presentation separates vocabulary from results and then adds a verification workflow so that each statement can be applied safely. Mathematical examples in the source are treated as examples, not as universal rules.

Use this page when

You need to refresh the governing definitions, select an applicable theorem, check a proof step, or connect this topic to neighbouring ideas in abstract algebra.

DefinitionsResultsMethodsChecks

Problem-solving workflow

Identify the ring, its units and its relevant ideals.
Check finiteness or chain conditions before using finite-generation arguments.
Use prime or maximal ideals to convert multiplicative questions into quotient-domain or quotient-field questions.
Localise when the property can be tested near a prime or maximal ideal.
Track integrality, dimension or ideal factorisation with the exact hypotheses stated.
Return from local or quotient data to the original ring only through a justified correspondence.

Core definitions

Definition
If f (X) ∈k[X] define its polynomial function f ♭: kn →k by evaluation: If (a1, . . . , an) ∈kn, then f ♭: (a1, . . . , an) ↦f (a1, . . . , an). The next proposition generalizes Corollary 3.28 from one variable to several variables.
Definition
If F is a subset of k[X] = k[x1, . . . , xn], then the variety 11,12 defined by F is Var(F) = {a ∈kn : f (a) = 0 for every f (X) ∈F}; thus, Var(F) consists of all those a ∈kn which are zeros of every f (X) ∈F.
Definition
If A ⊆kn, define its coordinate ring k[A] to be the commutative ring k[A] = { f ♭|A : f (X) ∈k[X]} under pointwise operations [recall that f ♭: kn →k is the polynomial function arising from f (X)]. The polynomial f (x1, . . . , xn) = xi ∈k[X], when regarded as a polynomial function, is defined by xi : (a1, . . . , an) ↦ai; that is, xi picks out the ith coordinate of a point in kn. The reason for the name coordinate ring is that if a ∈V , then (x1(a), . . . , xn(a)) describes a. There is an obvious ring homomorphism res: k[X] →k[A], given by f (X) ↦f ♭|A, and the kernel of this restriction map is an ideal in k[X]. We will assume, from now on, that all fields k are infinite, and so we will drop the notation f ♭.
Definition
If I is an ideal in a commutative ring R, then its radical, denoted by √ I, is √ I = {r ∈R : rm ∈I for some integer m ≥1}. An ideal I is called a radical ideal 14 if √ I = I. For example, every prime ideal P is a radical ideal, for if f n ∈P, then f ∈P. Here is an example of an ideal that is not radical. Let b ∈k and let I = ((x −b)2). Now I is not a radical ideal, for (x −b)2 ∈I while x −b /∈I.
Definition
A decomposition V = V1 ∪· · · ∪Vm is an irredundant union if no Vi can be omitted; that is, for all i, V ̸= V1 ∪· · · ∪ Vi ∪· · · ∪Vm.
Definition
An ideal Q in a commutative ring R is primary if it is a proper ideal and if ab ∈Q (where a, b ∈R) and b /∈Q, then an ∈Q for some n ≥1. It is clear that every prime ideal is primary. Moreover, in Z, the ideal (pe), where p is prime and e ≥2, is a primary ideal that is not a prime ideal. Example 6.114 shows that this example is misleading: There are primary ideals that are not powers of prime ideals; there are powers of prime ideals which are not primary ideals.
Definition
A primary decomposition I = Q1 ∩. . . ∩Qr is normal if it is irredundant and if all the prime ideals Pi = √Qi are distinct.
Definition
A prime ideal P is minimal over an ideal I if I ⊆P and there is no prime ideal P′ with I ⊆P′ ⊊P.

Principal results and structural facts

Key result
Let k be an infinite field and let k[X] = k[x1, . . . , xn]. If f (X), g(X) ∈ k[X] satisfy f ♭= g♭, then f (x1, . . . , xn) = g(x1, . . . , xn).
Key result
Let k be a field, and let F and G be subsets of k[X]. (i) If F ⊆G ⊆k[X], then Var(G) ⊆Var(F). (ii) If F ⊆k[X] and I = (F) is the ideal generated by F, then Var(F) = Var(I).
Key result
If A ⊆kn, then there is an isomorphism k[X]/ Id(A) ∼= k[A], where k[A] is the coordinate ring of A.
Key result
If an ideal I = Id(A) for some A ⊆kn, then it is a radical ideal. Hence, the coordinate ring k[A] has no nonzero nilpotent elements.
Key result
Let k be a field and let ϕ : k[X] →k be a surjective ring homomorphism which fixes k pointwise. If J = ker ϕ, then Var(J) ̸= ∅.
Key result
Let k be an (uncountable) algebraically closed field. If I is an ideal in k[X], then Id(Var(I)) = √ I. Thus, f vanishes on Var(I) if and only if f m ∈I for some m ≥1.
Key result
(i) If V1 and V2 are varieties and Id(V1) = Id(V2), then V1 = V2. (ii) Let k be an (uncountable) algebraically closed field. If I1 and I2 are radical ideals and Var(I1) = Var(I2), then I1 = I2.
Key result
Every variety V in kn is a union of finitely many irreducible subvarieties: V = V1 ∪V2 ∪· · · ∪Vm.
Key result
Every variety V is an irredundant union of irreducible subvarieties V = V1 ∪· · · ∪Vm; moreover, the irreducible subvarieties Vi are uniquely determined by V .
Key result
If Q is a primary ideal, then its radical P = √Q is a prime ideal. Moreover, if Q is primary, then ab ∈Q and a /∈Q implies b ∈P.
Key result
Let Q be an ideal in a commutative ring R. Then Q is a primary ideal if and only if, for each a ∈R, the map aR/Q : R/Q →R/Q, given by r + Q ↦ar + Q, is either an injection or is nilpotent [(aR/Q)n = 0 for some n ≥1].
Key result
If R is a commutative ACC rings, then every proper ideal I in R has a primary decomposition.
Key result
If P is a prime ideal and Q1, . . . , Qn are P-primary ideals, then Q1 ∩· · · ∩Qn is also a P-primary ideal.
Key result
Let I be an ideal in a ACC rings R. (i) Any two normal primary decompositions of I have the same set of isolated prime ideals, and so the isolated prime ideals are uniquely determined by I. (ii) I has only finitely many minimal prime ideals. (iii) A ACC rings has only finitely many minimal prime ideals.

Source-grounded examples

Worked source example
(i) If k is algebraically closed, then Proposition 6.90 says that if f (X) ∈k[X] is not constant, then Var( f (X)) ̸= ∅. (ii) Here are some varieties defined by two equations: Var(x, y) = {(a, b) ∈k2 : x = 0 and y = 0} = {(0, 0)} and Var(xy) = x-axis ∪y-axis. (iii) Here is an example in higher-dimensional space. Let A be an m×n matrix with entries in k. A system of m equations in n unknowns, AX = B, where B is an n × 1 column matrix, defines a variety, Var(AX = B), which is a subset of kn. Of course, AX = B is really shorthand for a set of m linear equations in n variables, and Var(AX = B) is usually called the solution set of the system AX = B; when this system is homogeneous, that is, when B = 0, then Var(AX = 0) is a subspace of kn, called the solution space of the system. ◀ The next result shows that, as far as varieties are concerned, we may just as well assume that the subsets F of k[X] are ideals of k[X]. 11There is some disagreement about the usage of this term. Some call this an affine variety, in contrast to the analogous projective variety. Some insist that varieties should be irreducible, which we will define later in this section. 12The term variety arose as a translation by E. Boi, L.
Worked source example
(i) Let R = Z, let (n) be a nonzero proper ideal, and let n = pe1 1 · · · pet t be the prime factorization. Then (n) = (pe1 1 ) ∩· · · ∩(pet t ) is an irredundant primary decomposition. (ii) Let R = k[x, y], where k is a field. Define Q1 = (x) and Q2 = (x, y)2. Note that Q1 is prime, and hence Q1 is P1-primary for P1 = Q1. Also, P2 = (x, y) is a maximal ideal, and so Q2 = P2 2 is P2-primary, by Proposition 6.113. Define I = Q1 ∩Q2. This primary decompostion of I is irredundant. The associated primes of I are thus {P1, P2}. ◀ There is a second uniqueness result that describes a normalized primary decomposition, but we precede it by a lemma.

How to reason with these results

Most advanced-algebra problems become manageable when the representation is separated from the invariant structure. Begin with the definition, then decide whether the problem is asking for an elementwise calculation, a statement about a morphism, or a classification up to isomorphism. That choice determines the correct proof language.

When a theorem gives a structural conclusion, do not jump directly to the conclusion. Write the hypotheses next to the object you are studying and check them one by one. If a hypothesis fails, either strengthen the object, pass to a quotient or localisation where the theorem applies, or use a more elementary argument.

For computational work, record each transformation together with the equivalence relation it preserves. In algebra, row operations, similarity, quotienting, localisation and isomorphism preserve different kinds of information. A calculation is useful only when the preserved structure matches the question.

Common failure modes

Failure modeControl
Confusing prime and maximal ideals.Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Assuming localisation preserves every property automatically.Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Using finite-generation conclusions without a chain condition.Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Treating radicals, integral closure or dimension as elementwise notions only.Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Assuming geometric statements over arbitrary fields without checking the field hypotheses.Return to the definition or theorem hypotheses and verify the missing condition before continuing.

Verification checklist

  • The ambient set, ring, field, group, module or category has been stated.
  • Every operation and map used is well-defined in that setting.
  • The hypotheses of each structural result have been checked before use.
  • Representatives, coordinates or generators have not been confused with the underlying object.
  • Existence and uniqueness have been separated where both matter.
  • The final result has been checked against the original defining relation or universal property.

Quick questions

What should I identify first in a problem about affine varieties and polynomial zero sets?

Start with the ambient algebraic structure, its operation or maps, and the exact hypotheses. Most incorrect solutions begin by using a familiar rule that is not valid in the stated structure.

How should definitions be used in proofs?

Expand the definition at the point where it becomes useful. Definitions are not background prose; they are the conditions that determine what must be proved and which implications are available.

When is a structural theorem safer than direct calculation?

Use a structural theorem when its hypotheses are satisfied and the calculation would otherwise depend on arbitrary coordinates, representatives or generators. The theorem usually identifies an invariant that survives those choices.

How can a final answer be checked?

Substitute the result back into the defining relation, verify any required closure or map property, and check edge cases such as zero, the identity, the empty object or degenerate quotients where relevant.

Connections within the handbook

PreviousMaximality Methods, Algebraic Dependence and Transcendence NextMultivariable Division and Polynomial Ideal Reduction Bases

Source basis: supplied advanced algebra reference. Source-identifying authorship, publisher information, acknowledgements and biographical material are intentionally omitted. Mathematical terminology and results are retained in handbook form.

Continue learning

Maximality Methods, Algebraic Dependence and TranscendenceGuide · Engineering MathematicsNEXT LESSON →Multivariable Division and Polynomial Ideal Reduction BasesGuide · Engineering MathematicsUnique Factorisation and Ascending Chain ConditionsGuide · Engineering MathematicsLocalisation, Local Rings and Local–Global MethodsGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®