2024-10-01
Theorem (Evaluation criterion for separatedness)
Let
has at most
If we can take a limit, it is unique.
Proof
Suppose that there are two completions
Because
Definition (Proper)
We say that
Examples 1
- Closed and finite morphisms are proper.
- Proper morphisms are stable under base change and composition.
- (In the problem sheets) In the following commutative diagram, if
is proper and is separated
then this implies that
Analogue: Compact topological space mapping into a Hausdorff topological space, then the image is compact.
Theorem (Evaluative criterion for properness)
Let
where
If
is locally Noetherian, then every finite-type map is quasi-separated.
Combination of evaluative criterion for universal closedness and properness: universal closedness gives existence and properness gives uniqueness.
Proposition (Fundamental theorem of elimination theory)
Let
Proof
By definition of projective, we know that there exists a closed immersion
Because closed immersions are proper (they are finite-type, separated, and universally closed), it suffices to show that
is a fibre diagram. Hence, it suffices to show that
The
A point
This is done in the problem sheets.
Called the “Fundamental theorem of elimination theory”.
Chow’s Lemma
If
Proj
Definition (Graded ring)
is a ring. are -modules.- We have maps
( -linear) such that makes an -algebra.
The irrelevant ideal is defined to be
We say that
Can change out the grading to be
-graded or in general by some commutative monoid.
Examples 2
and . We can give the different degrees.- Given
and , we can set , i.e., . is Noetherian if and only if is Noetherian and is a finitely-generated -algebra.- Definition (Reese algebra). Let
be a ring and an ideal. Then we define the Reese algebra of to be the graded ring . - Let
be a ring and an -module. We consider the symmetric algebra (this is , where is the tensor algebra). For an -algebra , we haveIt is the left adjoint to the forgetful functor . For example. we have (each indeterminate corresponds to a basis element of ). The adjunction also gives us a way to compute the symmetric algebra. First, we choose a presentationSince is the cokernel of , we can think of this as a coequaliser diagram
where
We can calculate the coequaliser here: it’s the quotient by the difference. We have
Therefore
- We want to calculate
for the ideal . We have a presentation
Since
This calculation can be extended to polynomials in any number of variables.
7. How do we calculate the Reese algebra? We have a surjection
and the bottom row
If
i.e., we have an isomorphism
In the case that
if and only if