Solution to Exercise 1b
First, a correction: We should have said that f
JI(X)
is of minimal xn-degree subject
to the condition that f
(g1..., gr),
the extension of J = I
K[x1,..., xn-1]
to K[x1,..., xn].
To see the solution, consider F
I(X),
and suppose that F
(g1..., gr).
In K[x1,..., xn]
[1/hd], the highest degree coefficient
of xn in f is invertible,
so that we can do long division:
Solution to Exercise 1c There are two cases to consider. The notation is as in part b.
Solution to Exercise 1d
Since U is locally closed in An,
we have U = ![]()
V, where V is open in An.
We set X =
and Z = X - U. We define Y
An-1 to be the closure of
(X).
By the result of part c.,
(X)
contains a dense open subset U0
Y.
As in previous parts of this exercise, there are two cases to consider.
In either case, the conclusion will follow if it is true that the restriction
of
, considered as a
regular map
: Z ->
Y is not dominant. Indeed, this statement implies that
(Z)
W, where W is a proper closed subset of Y. It follows
from this that
We assume, to the contrary, that
:
Z -> Y is dominant, and show that this leads to a contradiction.
It is given that
: X
-> Y and
: Z
-> Y are both generically finite to one, and are both dominant. So,
we can apply the result of part b. to the ideals I(X) and I(Z).
We obtain generating sets:
in K[x1,..., xn], where deg xn (r) < deg xn (f). Since f has minimal positive xn-degree, we conclude that:
Method 2 (for proving that
:
Z -> Y is not dominant in case 2.) The method described here
is a more standard technique in commutative algebra. We will show
that if Z0 is an irreducible
component of Z which is contained in an irreducible component
X0 of X, then
(Z0)
is not dense in
(X0).
Thus, we may assume that X and Z
are irreducible.
We assume that
:
Z -> Y is dominant, and show that this leads to a contradiction.
Since I(Z)
I(X) and the inclusion is proper, we can consider I0
:= I(Z)/I(Z) as a nonzero prime ideal
in A(X). Since
:
Z -> Y is dominant, I0
A(X)
= (0). Now, A(X) is generated, as a ring
extension of A(Y), by the additive coset of xn.
We know that xn satisfies
a polynomial relation with coefficients in A(Y). Let
a
A(Y)
be the highest coefficient. After adjoining 1/a,
we may assume that xn
is integral. Specifically, xn
is integral over A(Y)[1/a]. Since xn
generates the ring extension, we conclude that A(X)[1/a]
is an integral extension of A(Y)[1/a],
and hence finitely generated as a module over A(Y)[1/a].
It follows that A(X)[1/a] is finitely generated
as a module over A(Y)[1/a]. Therefore,
every element of A(X)[1/a] is integral
over A(Y)[1/a]. Now, let g
be a nonzero element of I0,
and consider a relation of integral dependence, of minimal degree:
gm + c1gm-1
+ . . . + cm-1g
+ cm = 0.
Then, we must have cm
0; otherwise we could cancel a factor and obtain a relation of lower
degree. Now, we can re-write the relation of integral dependence
as follows:
This implies that cm
I(Z)
K[x1,...,
xn-1]
= (0), which is a contradiction. We conclude that
:
Z -> Y is not dominant.
Method 3 (for proving that
:
Z -> Y is not dominant in case 2.) In this case, we'll consider
the dimensions of X and Z, and the
dimensions of the fibers of the restrictions of
to X and Z respectively. (The "legality"
of this approach will be discussed below.) As in the previous method,
we just need to consider the case where X is irreducible.
(There seems to be no compelling reason to assume that Z
is irreducible, however.) Since Z is a proper
closed subset of X, we have dim(Z) <
dim(X). Because we are in "case 2", the restriction of
is a generically finite-to-one map
:
X -> Y. Therefore dim(Y) = dim(X).
On the other hand, we will certainly have dim(
(Z))
dim(Z) < dim(X). (Literally we should speak about the dimension
of the closure of
(Z)
. . . ) Since dim(
(Z))
< dim(Y), we conclude that
:
Z -> Y is certainly not dominant!!
Remark. Since we didn't study dimension until somewhat after this exercise was assigned, there could be some question about whether it as really appropriate to use that method in this situation. To be absolutely sure that we haven't engaged in circular reasoning we would have to review our proofs of the results about dimension to see that no version of this result is used here. I haven't actually done that, but it certainly is known to be possible to prove those results without referring to the result of Exercise 1d. For example, see Chapter I, sections 7 and 8 of Mumford's "red notes".
Back to the exercises.
Solution to Exercise 2a
As in the hint, we proceed by induction on n - m. The
case n - m = 1 is immediate from Exercise 1a.
The most effective way to handle the inductive step is to consider
as a composition An
-> Am+1 -> Am.
Let
1:
An -> Am+1
and
2:
Am+1 -> Am
be the two "intermediate" projections. We define Z
to be the closure of
1(X)
in Am+1, and
we recall that Y is the closure of
(X)
in Am.
By the inductive hypothesis,
1(X)
contains a dense open subset U
Z. Using standard facts from topology, we check that
(X),
2(Z)
, and
2(U)
all have the same closure in Am+1.
By the result of Exercise 1d,
2(U)
contains a dense open subset of its closure. Hence
(X)
contains a dense open subset of Y.
Back to the exercises.
Solution to Exercise 2b
We may assume that X
Am. Let
=
be the graph of
.
Then,
is a closed subset of Am
An = Am+n,
and
(X)
=
(
),
where
: Am+n
-> An is the linear
projection. Therefore, the result follows from Exercise 2a.
Back to the exercises.
Solution to Exercise 2c
Let Y be the closure of
(X)
in Pn. Let
{U0, ..., Un}
be the standard affine open covering of Pn.
Without loss of generality, we may assume that U0
Y
is a dense open subset of Y. Let V
be an affine open subset of
-1(U0)which
is dense in X. Let
:
V -> An be the
restriction of
,
where An is identified
with U0. By the result
of Exercise 2b.,
(V)
=
(V) contains
a dense open subset of its closure in An,
and hence a dense open subset of its closure in Pn.
By standard facts from topology,
(
)
is contained in the closure of
(V).
Since V
X
,
it follows that
(X)
contains a dense open subset of its closure, as claimed.
Back
to the exercises.
Comments and inquiries to: roberts@math.umn.edu
Back to my homepage: http://www.math.umn.edu/~roberts