MATH 2810 Algebraic Geometry Homework 1 and Some Practice Problems
MATH 2810 Algebraic Geometry Homework 1 and Some Practice Problems
Do problems 1–10.
Problem 1: Show that the zero set of a non-zero polynomial in C[x, y] does
not have interior points (with respect to the usual Euclidean topology on
C2 ). (The same statement holds with similar proof in all dimensions.)
Problem 2:
(a) Show that the Zariski topology on A2 is not the product topology on
A1 × A1 . (Hint: Consider the diagonal.)
(b) Show that every non-empty Zariski open set is dense in An (in Zariski
topology).
1
Problem 7: Let k be a field of characteristic 6= 2. Decompose the algebraic
set X ⊂ A3 defined by the equations x2 +y 2 +z 2 = 0 and x2 −y 2 −z 2 +1 = 0,
into irreducible components.
polynomial. Let v(f ) denote the highest exponent of f with respect to <,
that is:
v(f ) = max{α | cα 6= 0} ∈ Zn≥0 .
Let L be a finite dimensional vector subspace of polynomials. Show that
dimk (L) is equal to the number of elements in the set v(L \ {0}) ⊂ Zn≥0 ,
that is the number of highest exponents appearing in any f ∈ L.
2
the matrix of partial derivatives. Show that if φ is an automorphism, i.e.,
φ is a bijection and φ−1 is also a morphism, then Jφ(x) is a nonzero con-
stant function. (The famous Jacobian conjecture claims that the opposite
is also true.) Give an example of an automorphism of An which is not linear.
Problem 14: Show that in Zariski topology the affine space An is compact
(i.e. every open cover has a finite subcover).
(b) Find generators for the ideal I of C. Show that it can be generated
by n − 1 elements (i.e. C is a local complete intersection).
Problem 16: Show that a variety V in Cn is bounded (in the usual metric
on Cn ) if and only if it is a finite set. Use this to show that the set U (n)
2
of n × n unitary matrices is not an algebraic variety of Cn = M (n, C), the
affine space of all n × n complex matrices. On the other hand, show that
2
U (n) is an algebraic subvariety of R2n = M (2n, R), the affine space of all
2n × 2n real matrices.