Introduction

In the previous lesson, we saw that algebraic geometry studies the geometry of common zeros of polynomial equations.

If we have a polynomial ring

$$k[x_1,\ldots,x_n]$$

over an algebraically closed field

$$k,$$

and a collection of polynomials

$$S\subseteq k[x_1,\ldots,x_n],$$

then we define the common zero set as

$$Z(S)={(a_1,\ldots,a_n)\in k^n:f(a_1,\ldots,a_n)=0\text{ for every }f\in S}.$$

This set

$$Z(S)$$

is the basic geometric object of algebraic geometry.

In this lesson, we go deeper. We explain how these zero sets become the closed sets of a topology, why this topology is called the Zariski topology, and why ideals naturally replace arbitrary collections of polynomials.

---

1. From Polynomial Equations to Algebraic Sets

Let

$$k$$

be an algebraically closed field.

Think of

$$k^n$$

not as a vector space, but as an affine space.

That means we are not focusing on vector addition, scalar multiplication, origins, or axes. Instead, we think of

$$k^n$$

as a space of points.

This space is called affine n-space and is denoted

$$\mathbb A_k^n.$$

A subset

$$V\subseteq k^n$$

is called an algebraic set if there exists some collection of polynomials

$$S\subseteq k[x_1,\ldots,x_n]$$

such that

$$V=Z(S).$$

So an algebraic set is simply a common zero locus of polynomials.

---

2. Examples of Algebraic Sets

Example 1: A Line

Let

$$f(x,y)=x+y-1.$$

Then

$$Z(f)={(x,y)\in k^2:x+y-1=0}.$$

This is a line in affine 2-space.

---

Example 2: A Parabola

Let

$$f(x,y)=y-x^2.$$

Then

$$Z(f)={(x,y)\in k^2:y=x^2}.$$

This is a parabola.

---

Example 3: Intersection of Two Curves

Let

$$f_1(x,y)=x^2+y^2-1$$

and

$$f_2(x,y)=y.$$

Then

$$Z(f_1,f_2)={(x,y)\in k^2:x^2+y^2=1,;y=0}.$$

This is the intersection of the circle with the x-axis.

---

3. The Zariski Topology

The lecturer now introduces one of the most important ideas in algebraic geometry:

Declare algebraic sets to be closed sets.

This gives a topology on

$$k^n.$$

This topology is called the Zariski topology.

So the closed sets in the Zariski topology are precisely the sets of the form

$$Z(S)$$

where

$$S\subseteq k[x_1,\ldots,x_n].$$

This is very different from ordinary Euclidean topology. In ordinary geometry, closed sets are often defined using limits and distances. In algebraic geometry, closed sets are defined using polynomial equations.

---

4. Why These Sets Really Define a Topology

To define a topology using closed sets, we need four properties:

1. The whole space must be closed.
2. The empty set must be closed.
3. A finite union of closed sets must be closed.
4. An arbitrary intersection of closed sets must be closed.

The lecturer proves that algebraic sets satisfy all four.

---

Property 1: The Whole Space Is Closed

Consider the zero polynomial

$$0\in k[x_1,\ldots,x_n].$$

The zero polynomial vanishes at every point.

Therefore

$$Z(0)=k^n.$$

So the whole space is closed.

---

Property 2: The Empty Set Is Closed

Consider the constant polynomial

$$1\in k[x_1,\ldots,x_n].$$

The polynomial

$$1$$

never vanishes.

Therefore

$$Z(1)=\emptyset.$$

More generally,

$$Z(k[x_1,\ldots,x_n])=\emptyset,$$

because the whole ring contains

$$1.$$

So the empty set is closed.

---

Property 3: Finite Unions Are Closed

Suppose

$$S_1,\ldots,S_m\subseteq k[x_1,\ldots,x_n].$$

Then

$$Z(S_1)\cup\cdots\cup Z(S_m)=Z(S_1S_2\cdots S_m).$$

Here

$$S_1S_2\cdots S_m$$

means the set of all products

$$f_1f_2\cdots f_m$$

where

$$f_i\in S_i.$$

Why does this work?

A point lies in

$$Z(S_1)\cup\cdots\cup Z(S_m)$$

if it lies in at least one of the zero sets.

That means all polynomials in at least one of the sets

$$S_i$$

vanish at that point.

Therefore every product

$$f_1f_2\cdots f_m$$

vanishes there, because at least one factor is zero.

So finite unions of algebraic sets are algebraic.

---

Property 4: Arbitrary Intersections Are Closed

Suppose we have a collection of subsets

$$S_\alpha\subseteq k[x_1,\ldots,x_n].$$

Then

$$\bigcap_\alpha Z(S_\alpha)=Z\left(\bigcup_\alpha S_\alpha\right).$$

This means:

A point lies in every

$$Z(S_\alpha)$$

exactly when every polynomial in every

$$S_\alpha$$

vanishes at that point.

That is exactly the same as saying the point lies in the zero set of the union of all the polynomials.

So arbitrary intersections of algebraic sets are algebraic.

---

5. The Definition of Affine Space

Now we can define affine n-space properly.

Affine n-space over

$$k$$

is

$$\mathbb A_k^n=k^n$$

equipped with the Zariski topology.

So

$$\mathbb A_k^n$$

is not just the set

$$k^n.$$

It is the set

$$k^n$$

together with a special topology whose closed sets are common zero loci of polynomial equations.

---

6. Polynomial Functions Are Continuous

Every polynomial

$$f\in k[x_1,\ldots,x_n]$$

defines a function

$$f:\mathbb A_k^n\to\mathbb A_k^1$$

by evaluation:

$$f(a_1,\ldots,a_n)=\text{the value obtained by substituting }x_i=a_i.$$

The lecturer points out that these polynomial functions are continuous in the Zariski topology.

Why?

Because the inverse image of a closed set is again closed.

For example, if we take the point

$$0\in\mathbb A_k^1,$$

then

$$f^{-1}(0)=Z(f),$$

which is closed by definition.

This confirms the intuition behind the Zariski topology.

We declared zero loci of polynomials to be closed, and then the polynomial functions themselves become continuous.

---

7. Why Ideals Enter Algebraic Geometry

So far, we have started with arbitrary subsets

$$S\subseteq k[x_1,\ldots,x_n].$$

But from the algebraic point of view, arbitrary subsets are not very natural.

In algebra, we prefer structured objects.

For groups, the natural subobjects are subgroups.

For vector spaces, the natural subobjects are subspaces.

For rings, the most important subobjects are ideals.

Therefore, instead of studying arbitrary subsets of the polynomial ring, we want to study ideals.

---

8. The Ideal Generated by a Set

Given a subset

$$S\subseteq k[x_1,\ldots,x_n],$$

we define

$$(S)$$

to be the ideal generated by

$$S.$$

This is the smallest ideal containing

$$S.$$

Equivalently,

$$(S)=\bigcap_{S\subseteq J}J,$$

where the intersection is taken over all ideals

$$J$$

containing

$$S.$$

More concretely,

$$(S)$$

consists of all finite combinations

$$g_1f_1+\cdots+g_mf_m,$$

where

$$f_i\in S$$

and

$$g_i\in k[x_1,\ldots,x_n].$$

So elements of

$$(S)$$

are polynomial combinations of elements of

$$S.$$

---

9. Passing From a Set to Its Ideal Does Not Change the Zero Set

This is a key point.

The lecturer explains that

$$Z(S)=Z((S)).$$

Why?

If a point vanishes on every polynomial in

$$S,$$

then it also vanishes on every polynomial combination of elements of

$$S.$$

For example, if

$$f_1(a)=0,\ldots,f_m(a)=0,$$

then

$$g_1(a)f_1(a)+\cdots+g_m(a)f_m(a)=0.$$

So every point in

$$Z(S)$$

also lies in

$$Z((S)).$$

Conversely, since

$$S\subseteq(S),$$

every point that vanishes on all of

$$(S)$$

must vanish on all of

$$S.$$

Therefore

$$Z(S)=Z((S)).$$

This means we lose nothing by replacing a collection of polynomials with the ideal it generates.

That is why algebraic geometry naturally studies ideals in polynomial rings.

---

10. The Algebra-Geometry Dictionary Becomes Clearer

We now have a more refined bridge:

Geometric side	Algebraic side
Affine space $$\mathbb A_k^n$$	Polynomial ring $$k[x_1,\ldots,x_n]$$
Closed subsets	Ideals
Algebraic sets	Zero loci of ideals
Geometry of solutions	Commutative algebra of ideals

Instead of saying:

Study zero sets of arbitrary collections of polynomials,

we can say:

Study zero sets of ideals in polynomial rings.

This is much cleaner.

---

11. Hilbert Basis Theorem

The lecturer now introduces another foundational theorem.

A ring

$$R$$

is called Noetherian if every ideal of

$$R$$

is finitely generated.

This means that for every ideal

$$I\subseteq R,$$

there exist finitely many elements

$$f_1,\ldots,f_m\in R$$

such that

$$I=(f_1,\ldots,f_m).$$

Hilbert’s Basis Theorem says:

If $$R$$ is Noetherian, then $$R[x]$$ is Noetherian.

More generally:

If $$R$$ is Noetherian, then $$R[x_1,\ldots,x_n]$$ is Noetherian.

Since every field is Noetherian, it follows that

$$k[x_1,\ldots,x_n]$$

is Noetherian.

Therefore every ideal in

$$k[x_1,\ldots,x_n]$$

is finitely generated.

---

12. Why This Matters Geometrically

This has a powerful geometric meaning.

Even if we begin with infinitely many polynomials

$$S\subseteq k[x_1,\ldots,x_n],$$

the ideal they generate is finitely generated:

$$(S)=(f_1,\ldots,f_m).$$

Therefore

$$Z(S)=Z((S))=Z(f_1,\ldots,f_m).$$

So every algebraic set can be described using finitely many polynomial equations.

This is extremely important.

It means algebraic geometry is not usually about solving infinitely many unrelated equations.

Even if infinitely many equations appear at first, finitely many of them generate all the algebraic information needed for the same zero set.

---

13. Why This Helps Computation

Because ideals are finitely generated, algebraic geometry becomes computationally accessible.

This is one reason computer algebra systems can do algebraic geometry.

Examples include:

• Macaulay2
• Singular
• CoCoA
• SageMath

These systems perform computations with polynomial rings, ideals, Gröbner bases, syzygies, dimensions, intersections, eliminations, and other algebraic structures.

The geometric meaning comes from translating those algebraic computations back into statements about solution sets.

This is the power of the algebra-geometry dictionary.

---

14. The Role of Hilbert’s Nullstellensatz

Hilbert’s Basis Theorem tells us:

Ideals in polynomial rings over fields are finitely generated.

Hilbert’s Nullstellensatz tells us:

Over algebraically closed fields, ideals and zero sets are deeply connected.

Together, these theorems give the foundation of classical affine algebraic geometry.

Hilbert’s Nullstellensatz ensures that if the ideal generated by our polynomials is not the whole ring, then the zero set is nonempty.

In simple language:

If the equations are not algebraically contradictory, then they have a common solution over an algebraically closed field.

The algebraic obstruction to having a solution is that the ideal contains

$$1.$$

If

$$1\in(S),$$

then there exist polynomials

$$g_1,\ldots,g_m$$

and

$$f_1,\ldots,f_m\in S$$

such that

$$g_1f_1+\cdots+g_mf_m=1.$$

If a common zero existed, substituting it into this equation would give

$$0=1,$$

which is impossible.

So no common zero can exist.

The Nullstellensatz says that, over an algebraically closed field, this is the only obstruction.

---

15. The Main Message of the Lecture

This lecture builds the first serious structure of algebraic geometry.

The main ideas are:

1. Algebraic sets are common zero loci of polynomials.
2. Algebraic sets become the closed sets of the Zariski topology.
3. Affine space is $$k^n$$ with the Zariski topology.
4. Polynomial functions are continuous in this topology.
5. Arbitrary polynomial collections can be replaced by the ideals they generate.
6. The zero set does not change when we pass from $$S$$ to $$(S).$$
7. Hilbert’s Basis Theorem guarantees that ideals in polynomial rings over fields are finitely generated.
8. Therefore every algebraic set is defined by finitely many equations.
9. Hilbert’s Nullstellensatz guarantees that algebraic consistency corresponds to geometric existence.

This is where algebraic geometry truly begins.

The geometric world is now:

$$\mathbb A_k^n$$

with closed sets given by polynomial equations.

The algebraic world is:

$$k[x_1,\ldots,x_n]$$

with ideals describing those equations.

The bridge between them is the map:

$$I\mapsto Z(I).$$

This bridge is the heart of affine algebraic geometry.

---

References

1. Robin Hartshorne, Algebraic Geometry, Springer, 1977.
2. David Cox, John Little, and Donal O’Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Springer, 4th edition, 2015.
3. Miles Reid, Undergraduate Algebraic Geometry, Cambridge University Press, 1988.
4. David Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, Springer, 1995.
5. Atiyah and Macdonald, Introduction to Commutative Algebra, Addison-Wesley, 1969.
6. Igor Shafarevich, Basic Algebraic Geometry 1: Varieties in Projective Space, Springer, 3rd edition, 2013.
7. R. Y. Sharp, Steps in Commutative Algebra, Cambridge University Press, 2nd edition, 2000.
8. Daniel R. Grayson and Michael E. Stillman, Macaulay2, a software system for research in algebraic geometry.
9. Wolfram Decker, Gert-Martin Greuel, Gerhard Pfister, and Hans Schönemann, Singular: A Computer Algebra System for Polynomial Computations.
10. John Abbott, Anna M. Bigatti, and Lorenzo Robbiano, CoCoA: A System for Doing Computations in Commutative Algebra.