This is the third in a series of posts on the Steenrod algebra.
We’ll need to determine the structure of the dual Steenrod algebra described earlier. To do so, let’s start by defining certain generators
in it. For
, we let
be the dual element to
, with respect to the Serre-Cartan basis. In other words,
evaluates to
on the element
, but evaluates to zero on
when
is any admissible sequence.
We want to prove:
Theorem 4 (Milnor)
is the polynomial ring
.
In this post, I’ll describe the proof of Milnor’s theorem, and then give the computation of the comultiplication map on (which one should expect to be nontrivial, given that the dual product map on the Steenrod algebra is complicated). As a result, this post will be somewhat lightly computational (certainly more so than usual for this blog). After this, I’m hoping to get to applications of these computations to more theoretical material.
Proof of Milnor’s theorem
For a sequence , we let
. To prove the theorem, we will consider how the products
act on the Cartan-Serre basis elements
(for
admissible, it is a theorem of Serre that these form a basis for the Steenrod algebra). Although the
were dual elements to certain
, the products
are not dual to simple elements in the same way. Nonetheless, we will see that one gets an upper-triangular matrix with ones on the diagonal, from which the result will follow.
Let’s start by determining how exactly an element acts on an element of the Steenrod algebra. We know how it acts on
for
an admissible sequence, but we’ll also need to know how it acts without the admissibility hypothesis. We will need the following alternative description of the functional
:
Lemma 5 Consider
and identify all its higher cohomologies with
in the unique way. Let
be a generator; then
can be described by
Here lives in some cohomology of
, which we identify with
. So, to evaluate
on some element
of the Steenrod algebra (of the appropriate degree), we make
act on the nonzero element of
, and determine whether we get zero or not.
Proof: In fact, the claim is the following. If is an admissible sequence, then
unless
for some
, in which case we just get
. This is pretty easy to see by induction. Namely, we have to use the fact that the total squaring operation
is a homomorphism, and it sends
. More generally,
because
is a homomorphism and commutes with squaring. So, if we’re starting with
, and want to apply a product of Steenrod operations and get something nonzero at the end, the only way we can do that is if the sequence of Steenrod operations looks like
(possibly with zeros interpersed). But for an admissible sequence, the only possibility is the one listed.
We’ve in fact shown something a bit stronger. Namely, we have seen:
Corollary 6 If
is any sequence (not necessarily admissible), then
unless
is the sequence
with zeros interspersed.
This is now clear, because we know that acts by evaluating the Steenrod operation on
, and because we have seen how things of the form
act on
in the preceding proof.
With this in mind, we can prove Milnor’s theorem. Namely, we’re going to need to show that as ranges over all sequences of nonnegative integers (well, finite sequences), the terms
form a basis for the dual Steenrod algebra. To do this, we’ll need to know how the elements
act on the admissible elements
in the Steenrod algebra. We want to show that the
at least approximate a dual basis.
To do this, we’ll need a pairing between the ‘s and
‘s; here recall that
ranges over admissible sequences, while
ranges over sequences of nonnegative integers. Thus, we define the map
which sends an admissible sequence
to
. One easily sees that
establishes a bijection between sequences of nonnegative integers, all but finitely whose elements are zero, and admissible sequences of nonnegative integers.
With this notation, we have:
Lemma 7 (The basic computation) For any sequences
, if
, then
. If
, then
.
I haven’t yet told you what the ordering means. The ordering is a lexicographic order from the right. We can do this, since the sequences terminate after finitely many terms. But it is a little funny that , for instance. However, it is a perfectly good order, which is preserved under addition, for instance. Note also that in this lemma, we haven’t assumed
admissible. In fact, for the proof of Milnor’s theorem, we will only need need the case
admissible, but for the lemma itself, this result will be useful.
So let’s prove the lemma. When is the zero sequence, there is nothing to prove. Let’s verify what happens when
is the sequence
where the unique
is in the
th place. In this case, the corresponding
is the sequence
.
The first statement, that if then
, is part of the definition. The second statement requires a tiny bit more work. Namely, if
, then there must be less than
terms, as the
th term must be zero. But we know that
on any sequence
with fewer than
terms is zero, by the previous corollary. So we’re done in this case.
Now we need to do this in general. Here we can use induction. Namely, let’s consider the sequence , and pick the last nonzero term. That is, we write
where
is the sequence
where the
is in, say, the
th place. We will assume that the result is true for
and
(and for anything replacing
that is appropriate).
Then , and if
and
are the multiplication and comultiplications, we have
In other words, we have to write out . But this is easy; it’s
by the explicit description of the comultiplication on the Steenrod algebra
.
So we need to evaluate the pairing
Now, we’re assuming . Thus either
or
. If we have strict inequality in either case, then we get zero by the inductive hypothesis. If we have equality in both cases, then we get
by the inductive hypothesis again. This proves the lemma.
With this lemma, we want to prove Milnor’s theorem. This is now linear algebra, since the lexicographic order is a total ordering. We have seen that the , expressed in terms of the dual basis of the
, are given by a triangular matrix with ones on the diagonal. Thus the
have to form a basis of
.
The comultiplication on
Finally, we want to work out the comultiplication on the dual Steenrod algebra . Here, we will again use the real projective space
to help in the calculations. Namely, let’s recall the following. If
is any space, then there is an action map
Each element induces an endomorphism of
. If all the homology groups of
are finite-dimensional, then we can dualize and obtain maps
for each
. This gives a map
One can check that this is a coalgebra homomorphism. That is, since the homology groups form a coalgebra, and is (as a Hopf algebra), the previous assertion makes sense. This is mostly an exercise in chasing some diagrams and keeping straight exactly what the distinguishing property the codiagonal map of
had (and the fact that the coalgebra structure in homology is dual to the algebra structure in homology); I’ll refer the reader to Milnor’s paper or Mosher-Tangora’s book on cohomology operations for details.
Anyway, dualizing again, we get a map
where the tensor product is completed because infinite sums may occur. As the dual to a coalgebra homomorphism, this is an algebra homomorphism. If one unwinds the definitions, this is what the map does. The map
sends a cohomology class
to an element
. This element has the following property. If you want to evaluate a Steenrod operation on
, you can just plug it into this element, and pair it with the relevant elements in
.
In particular, we find the following.
Proposition 8 If
is the generator of
, then
.
This comes from how the Steenrod operations can act on , as we saw earlier.
Now we need another property of . Namely, if we apply
twice, we get a map
. But we could also apply
and then the comultiplication map on
. That is, we have a diagram
This is commutative. Again, this is another assertion that one has to check using some diagram-chasing, but it is essentially linear algebra. The dual assertion is simply that the action of on the homology is an algebra action.
OK, now the point is that if we keep track of this diagram, and use the map , we can completely determine the effect of the comultiplication homomorphism on
just by using what we know about
. Indeed, we know that
(for
as before, in
) is
. Now we can apply
to this. Note that we know
because is a homomorphism. Consequently, we get
But this is also equal to
Now we just have to compare terms of in the above two terms, and equate them. We find:
Proposition 9 (Coalgebra structure) The coalgebra map on
is given by
This was all a bit computational, but ultimately the Steenrod algebra turns out to be huge. Namely, as I want to explain in a later post, given any appropriate spectrum , representing a homology theory
, and given any spectra
, there is a spectral sequence that gives information about at least the
-part of homotopy classes of maps
. (
-part is not defined; I mean something like 2-torsion when
is an Eilenberg-MacLane spectrum mod 2.) To get this, though, we’ll need the structure of
as comodules over
, which is somehow approximately “dual” to the space of cohomology operations. In the important case where
is the mod 2 Eilenberg-MacLane spectrum, we’ll get information about, say, the 2-component of stable homotopy groups once we know how the dual Steenrod algebra coacts on homology. And these are precisely the relevant computations, to do that.
Leave a Reply