Blog Archive

Friday, May 8, 2026

AG studies the zeros of polynomial functions, but what are polynomial functions?

 

Algebraic Geometry Studies Zeros of Polynomial Functions. But What Is a Polynomial Function?

A standard slogan says that algebraic geometry studies zero loci of polynomial functions. But this immediately raises a basic question:

What is a polynomial function?

If we fix one ring R, a polynomial

f(x1,,xn)Z[x1,,xn]

certainly defines a function

RnR

by evaluation. But this is not the right concept. Over a finite field, different polynomials may induce the same set-theoretic function. So a polynomial should not be identified with a function on one fixed set of points.

The correct viewpoint is functorial.

Let

Pn=Z[x1,,xn].

For every commutative ring R, the universal property of the polynomial ring gives a natural bijection

HomCRing(Pn,R)Rn.

Thus affine n-space is better viewed as the functor

hPn:CRingSet,hPn(R)=Hom(Pn,R).

Now suppose we want a polynomial map from affine n-space to affine m-space. Functorially, this should be a natural transformation

ϕ:hPnhPm.

The Yoneda Lemma gives

Nat(hPn,hPm)hPm(Pn)=Hom(Pm,Pn).

So polynomial maps are exactly natural transformations between these functors.

Let us write out the naturality square in the usual style, with the natural transformation vertical. For any ring map

p:PnR,

we have a commutative diagram

hPn(Pn)hPn(p)hPn(R)ϕPnϕRhPm(Pn)hPm(p)hPm(R).

Now let

u=ϕPn(idPn)hPm(Pn)=Hom(Pm,Pn).

Evaluating the diagram at idPn gives

ϕR(p)=hPm(p)(u)=pu.

If we write

Pm=Z[y1,,ym],

then a ring map

u:PmPn

is determined by the images of the generators:

u(yj)=fj(x1,,xn).

Hence a natural transformation

hPnhPm

is exactly the same thing as an m-tuple of polynomials

(f1,,fm).

Under the identification hPn(R)Rn, the induced map is

(a1,,an)(f1(a),,fm(a)).

This is why polynomial functions should be defined as natural transformations.

Now consider a system of equations

f1==fm=0.

It determines a map

u:PmPn,yjfj,

and also the zero map

z:PmPn,yj0.

These induce two natural transformations

hPnhPm.

Their equalizer is the solution functor:

Solf(R)={p:PnRpu=pz}.

Since it is equalizer of representable functor, it is represent by coequalizer.

SolfhPn/(f1,,fm).

This is the basic affine dictionary:

equationsquotient ringssolution functors.

Finally, if we allow an arbitrary set I of variables, we may form

PI=Z[xiiI].

Then

Hom(PI,R)RI,

so everything above still works. Moreover, every commutative ring A admits a presentation

AZ[xiiI]/(fjjJ)

for suitable sets I and J. Hence

hA(R)=Hom(A,R){(ai)RIfj(ai)=0 for all jJ}.

So every affine scheme is a functor of solutions to a system of polynomial equations.

This refines the opening slogan. Algebraic geometry does study zeros of polynomial functions — but polynomial functions are not merely set-theoretic functions on one fixed ring. They are natural transformations between affine-space functors, and affine schemes are precisely the representable solution functors cut out by such maps.

A final Lawvere-theoretic reformulation

There is one last way to summarize the whole discussion.

Let

U:CRingSet

be the forgetful functor. Then affine n-space is simply

An=Un.

The natural transformations

UnUm

are exactly the polynomial maps

AnAm.

Therefore, if we take the category whose objects are

U0,U1,U2,

and whose morphisms are the natural transformations between them, we recover precisely the Lawvere theory of commutative rings.

So the whole point can be compressed into the slogan:

finite affine spaces and polynomial maps=the Lawvere theory of commutative rings.

This is another way to say that the syntax of commutative algebra is encoded in the natural geometry of the functors

AAn.

For more on this structure-versus-semantics viewpoint, see my related post:

Structure–Semantics Adjunction for Tractable Functors

No comments:

Post a Comment

Popular Posts