# Chapter 5. Arithmetic Geometry and Modern Directions

## Polynomial Equations and Geometry

Arithmetic geometry studies solutions of polynomial equations by combining algebra, geometry, and number theory. Its basic objects are spaces defined by polynomial equations. These spaces are called varieties.

Let $k$ be a field, such as $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{C}$, or a finite field $\mathbb{F}_p$. The affine $n$-space over $k$ is

$$
\mathbb{A}^n(k)=k^n.
$$

Its points are ordered $n$-tuples

$$
(a_1,\ldots,a_n),
$$

where each $a_i\in k$. A polynomial

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

defines a subset of $\mathbb{A}^n(k)$ by the equation

$$
f(a_1,\ldots,a_n)=0.
$$

More generally, a collection of polynomials $S\subseteq k[x_1,\ldots,x_n]$ defines the set

$$
V(S)=\{a\in k^n : f(a)=0 \text{ for every } f\in S\}.
$$

This is the affine algebraic set cut out by $S$.

## Affine Varieties

An affine variety is, roughly, a geometric object defined by polynomial equations in affine space. For example,

$$
x^2+y^2=1
$$

defines a circle over $\mathbb{R}$, while

$$
y^2=x^3-x
$$

defines an affine plane curve. Over $\mathbb{Q}$, the same equation asks for rational solutions. Over $\mathbb{F}_p$, it asks for solutions modulo $p$.

Thus the same polynomial equation has different arithmetic meanings over different fields.

The algebra attached to an affine algebraic set $X=V(S)$ is its coordinate ring:

$$
k[X]=k[x_1,\ldots,x_n]/I(X),
$$

where

$$
I(X)=\{f\in k[x_1,\ldots,x_n]: f(a)=0 \text{ for all } a\in X\}.
$$

The coordinate ring records polynomial functions on $X$. Geometry is reflected in algebra: points correspond to evaluation maps, subvarieties correspond to ideals, and geometric operations often become operations on rings.

This algebra-geometry dictionary is one of the central ideas of algebraic geometry.

## Irreducibility

A variety is called irreducible if it cannot be written as a union of two proper algebraic subsets. This means that the object has one algebraic piece.

For example, the equation

$$
xy=0
$$

defines the union of the two coordinate axes in $\mathbb{A}^2$. It is reducible because

$$
V(xy)=V(x)\cup V(y).
$$

By contrast, the parabola

$$
y=x^2
$$

is irreducible over any field.

Algebraically, irreducibility corresponds to primality. An affine algebraic set $X$ is irreducible when its defining ideal is prime. In that case, the coordinate ring $k[X]$ is an integral domain.

## Projective Space

Affine space is useful, but it has a defect: some geometric phenomena disappear at infinity. Projective geometry fixes this by adding points at infinity.

The projective $n$-space over $k$, denoted

$$
\mathbb{P}^n(k),
$$

is the set of equivalence classes of nonzero tuples

$$
(a_0,\ldots,a_n)\in k^{n+1}\setminus\{0\},
$$

where

$$
(a_0,\ldots,a_n)\sim(\lambda a_0,\ldots,\lambda a_n)
$$

for every nonzero $\lambda\in k^\times$.

A point of projective space is written

$$
[a_0:\cdots:a_n].
$$

The colon notation reminds us that only ratios matter. For example,

$$
[1:2:3]=[2:4:6].
$$

## Projective Varieties

Because projective coordinates are defined only up to scaling, ordinary polynomial equations must be replaced by homogeneous polynomial equations. A polynomial $F(x_0,\ldots,x_n)$ is homogeneous of degree $d$ if every term has total degree $d$. For example,

$$
x_0^2+x_1^2-x_2^2
$$

is homogeneous of degree $2$.

A homogeneous polynomial has the property that

$$
F(\lambda x_0,\ldots,\lambda x_n)=\lambda^dF(x_0,\ldots,x_n).
$$

Therefore the condition $F=0$ is well-defined on projective points.

A projective variety is a subset of $\mathbb{P}^n(k)$ defined by homogeneous polynomial equations. For example,

$$
X^2+Y^2=Z^2
$$

defines a projective conic in $\mathbb{P}^2$. On the affine chart $Z\neq 0$, we may set

$$
x=\frac{X}{Z},\qquad y=\frac{Y}{Z},
$$

and obtain the affine equation

$$
x^2+y^2=1.
$$

The projective equation also includes points with $Z=0$, which are the points at infinity.

## Arithmetic Meaning

In number theory, the field $k$ is often not algebraically closed. This makes the set of $k$-rational points subtle. If $X$ is a variety over $\mathbb{Q}$, then

$$
X(\mathbb{Q})
$$

denotes its rational points. These are solutions whose coordinates lie in $\mathbb{Q}$.

For example, the equation

$$
x^2+y^2=1
$$

has many rational points, such as

$$
(1,0),\qquad (0,1),\qquad \left(\frac{3}{5},\frac{4}{5}\right).
$$

But other equations may have no rational solutions, even if they have real or complex solutions.

Arithmetic geometry asks questions such as:

Does $X(\mathbb{Q})$ contain any points?

Is $X(\mathbb{Q})$ finite or infinite?

Can we describe all rational points?

How do the solutions change modulo primes?

These questions connect polynomial equations with prime numbers, modular arithmetic, Galois theory, and analysis.

## Why Projective Varieties Matter

Projective varieties are better behaved than affine varieties in many structural arguments. They are the algebraic analogue of compact spaces. In projective space, intersections behave more regularly, curves have points at infinity, and many finiteness theorems take their natural form.

For example, two distinct lines in the affine plane may be parallel and fail to meet. In the projective plane, they meet at a point at infinity. This removes an artificial exception and gives a cleaner geometry.

Modern number theory often studies projective varieties over fields such as $\mathbb{Q}$, number fields, finite fields, and $p$-adic fields. Elliptic curves, modular curves, Shimura varieties, and many higher-dimensional objects are naturally projective or closely related to projective geometry.

Affine and projective varieties therefore form the first geometric language of arithmetic geometry. They turn systems of polynomial equations into spaces, and they allow number-theoretic questions to be studied by geometric methods.

