A polynomial map is a map defined by one or more polynomials. Given a field , a polynomial map is a map
such that for all points
,
for suitable polynomials .
The zero set of
is the set of all solutions of the simultaneous equations
, and is an algebraic
set in
.
It need not be an algebraic variety in the irreducible
convention. For example, the zero set of
is the union of the two coordinate
axes.
An example of polynomial map is the th coordinate map
, defined by
for all
. In the language of set
theory, it is the projection of the Cartesian
product
onto the
th
factor.
Polynomial maps can be defined on any nonempty subset of
. For affine varieties
and
over an algebraically
closed field
, the coordinate ring
consists of the polynomial
functions on
.
Every polynomial map
induces a ring homomorphism
defined by
that fixes the constant
functions. Conversely, every such coefficient-fixing ring
homomorphism
,
called a
-algebra
homomorphism, determines a polynomial map
by
, where the
are the coordinate functions
on
(Milne 2024, pp. 67-68). The condition on constants is essential. For
over
, their coordinate rings
are both
,
but complex conjugation is a ring
homomorphism sending the coordinate class
to
, which is not a point of
.
A polynomial map
is a real-valued polynomial function. Its graph is the plane algebraic curve with
Cartesian equation
.