***All problems in this lecture are due 01/20 at 23:59***
***No lecture on 01/16***
By now you should have a reasonably good feeling for subalgebras. Unfortunately, this is only half the battle. Let and
be algebras, and let
be an algebra homomorphism. Since
and
are vector spaces, and since
is a linear transformation,
is a subspace of
and
is a subspace of
Since
is not just a linear map but an algebra homomorphism, one hopes that its kernel and image will have additional structure.
Problem 5.1. Prove that is a subalgebra of
It is not necessarily true that is a subalgebra of
, because it is not necessarily true that
However, the other subalgebra properties, namely closure under conjugation and closure under multiplication, do hold for
In fact,
is not just closed under multiplication – it has the stronger property that
for any
and any
This observation leads to the consideration of subspaces of
which have this absorption property.
Definition 5.1. A subspace of
is said to be an ideal if it is closed under conjugation and absorbs multiplication, in the sense that
and
lie in
for any
and all
Subalgebras of are smaller algebras embedded in
They inherit the algebra structure of
under restriction. Ideals on the other hand are special subspaces of
which can be used to produce smaller algebras by collapsing rather than restricting. More precisely, since an ideal
in
is a subspace we can form the quotient vector space
whose points are translations of
The zero vector in the quotient space is and linear combinations are defined by
The linear transformation
defined by has kernel
so by the rank-nullity theorem
The fact that is not just a subspace but an ideal allows us to go further and put an algebra structure on
by defining conjugation as
and multiplication as
Problem 5.2. Check that really is an algebra.
We conclude that in our quest to understand the structure of a given algebra , we have to understand not just its subalgebras but also its ideals. Thankfully, in many ways ideals are simpler and easier to understand than subalgebras. For example, recall that we have decided to view the set of all subalgebras of
as a poset under inclusion, making it an induced subposet of the lattice of subspaces of
, but not an induced sublattice: the max of two subalgebras of
is not just the span of their union, but the algebra generated by their union. Concerning the poset of ideals of
, this is an induced sublattice of the lattice of all subspaces without needing any additional constructions.
Problem 5.3. Given two ideals in
, show that
As we saw in Lecture 4, we have a correspondence between partitions of and subalgebras of
. The combinatorial objects which parameterize ideals of
are simpler — they are just subsets of
. Given a subset
we define a corresponding ideal in
by
Thus is the set of all functions in
which vanish on every point of
Hence, we call
the vanishing ideal of
Problem 5.4. Prove that really is an ideal in
Moreover, show that for subsets
of
we have
A nice feature of vanishing ideals in is that they are coordinate spaces relative to the elementary basis
Problem 5.5. Show that elementary functions form a basis of
Moreover, show that the quotient algebra
is isomorphic to the function algebra
We can now view as an order-preserving function from the lattice of subsets of
to the lattice of ideals of
.
Problem 5.6. Show that the mapping is injective.
With the above problems solved, we will have an isomorphism between the lattice of subsets of and the lattice of ideals of
once we show surjectivity.
Theorem 5.2. The mapping is surjective.
Proof: Given an arbitrary ideal of
we need to construct a corresponding point set
such that
A natural candidate is the variety defined by
, which by definition is the set
all points in at which every function
vanishes. By construction, we have
and we need to show that the reverse inclusion also holds
Let In order to show
it is sufficient to show that
for all
This is because we know that the set
is a basis of
So, fix a point
Since
is the variety cut out by
there must exist a function
which does not vanish at
, else
would be a point of
Furthermore, we can assume WLOG that
We do not have any information about the values of the function
at any other points. However, multiplying
by the elementary function
produces something very simple, namely
Since
and
is an ideal, we have
The above proof showed that for any subset we have
This is a very simple finite set version of Hilbert’s Nullstellensatz, a basic theorem of algebraic geometry on vanishing sets of polynomial ideals which will be discussed in Math 202C.