On the E2-term of the bo-Adams spectral sequence
Agnes Beaudry, Mark Behrens, Prasit Bhattacharya, Dominic Culver,, Zhouli Xu

TL;DR
This paper introduces a new computational method for analyzing the v_1-torsion part of the bo-Adams spectral sequence, enabling calculations beyond the 40-stem that surpass previous computer limitations.
Contribution
A novel approach utilizing Steenrod algebra cohomology to compute the v_1-torsion contribution to the E_2-term in the bo-Adams spectral sequence.
Findings
Successfully computed the bo-Adams spectral sequence beyond the 40-stem.
Demonstrated the method's effectiveness in handling complex torsion components.
Extended understanding of the spectral sequence's structure in higher stems.
Abstract
The E_1-term of the (2-local) bo-based Adams spectral sequence for the sphere spectrum decomposes into a direct sum of a v_1-periodic part, and a v_1-torsion part. Lellmann and Mahowald completely computed the d_1-differential on the v_1-periodic part, and the corresponding contribution to the E_2-term. The v_1-torsion part is harder to handle, but with the aid of a computer it was computed through the 20-stem by Davis. Such computer computations are limited by the exponential growth of v_1-torsion in the E_1-term. In this paper, we introduce a new method for computing the contribution of the v_1-torsion part to the E_2-term, whose input is the cohomology of the Steenrod algebra. We demonstrate the efficacy of our technique by computing the bo-Adams spectral sequence beyond the 40-stem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On the -term of the -Adams spectral sequence
A. Beaudry
University of Colorado Boulder
,
M. Behrens
University of Notre Dame
,
P. Bhattacharya
University of Virginia
,
D. Culver
University of Illinois Urbana-Champaign
and
Z. Xu
Massachusetts Institute of Technology
Abstract.
The -term of the (-local) -based Adams spectral sequence for the sphere spectrum decomposes into a direct sum of a -periodic part, and a -torsion part. Lellmann and Mahowald completely computed the -differential on the -periodic part, and the corresponding contribution to the -term. The -torsion part is harder to handle, but with the aid of a computer it was computed through the -stem by Davis. Such computer computations are limited by the exponential growth of -torsion in the -term. In this paper, we introduce a new method for computing the contribution of the -torsion part to the -term, whose input is the cohomology of the Steenrod algebra. We demonstrate the efficacy of our technique by computing the -Adams spectral sequence beyond the -stem.
This material is based upon work supported by the National Science Foundation under Grant No. DMS-1050466/1611786 and DMS-1612020/1725563
Contents
- 1 Introduction
- 2 The -term of the -ASS
- 3 The weight spectral sequence
- 4 The algebraic -resolution
- 5 -periodicity
- 6 Comparison with
- 7 The agathokakological spectral sequence
- 8 Computation of the algebraic -resolution
- 9 Computation of the topological -resolution
1. Introduction
Let denote the (-local) real -theory spectrum, and let denote its connective cover. The -based Adams spectral sequence (ASS) for the sphere takes the form:
[TABLE]
Here, denotes the cofiber of the unit
[TABLE]
and denotes the stable homotopy groups of spheres.
Many researchers have studied aspects of the -ASS, most notably Mahowald in his paper [Mah81], where this spectral sequence is used to prove the -primary -periodic telescope conjecture. However, a systematic study of this spectral sequence as a tool to perform low-dimensional computations of the stable homotopy groups of spheres was not undertaken until [LM87] and [Dav87]. Early on, the structure of the -term was known [Mah81], [Mil75]. Namely, there is a splitting
[TABLE]
where is the th integral Brown-Gitler spectrum [CDGM88]. This splitting iterates to yield a splitting
[TABLE]
where each index satisfies . The homotopy type of the wedge summands in the above splitting were also determined in [Mah81], [Mil75]: for a multi-index , there is an equivalence
[TABLE]
where is a certain Adams cover of or (see Section 2), and is the Eilenberg-MacLane spectrum associated to a graded -vector space .
There is a corresponding decomposition
[TABLE]
The subspaces
[TABLE]
are closed under the -differential. Following [LM87], [Dav87], we define to be the quotient complex
[TABLE]
so that
[TABLE]
resulting in a long exact sequence
[TABLE]
Historically, most of the applications of the -ASS have rested on analyzing while bounding the effects of . In fact, a complete computation of was accomplished in [LM87]. By contrast, the complex , and its cohomology, have proven to be the major obstacle to using the -ASS to perform low-dimensional computations. Carlsson computed explicitly in [Car80], but the result is rather unwieldy. Davis [Dav87] used computer computations to compute , and its cohomology, through the range . He observed there that a rapid exponential growth in the dimension of severely limits this approach. Furthermore, Davis’s approach does not include a method for computing the map in (1.1). In essence, resembles the cobar complex for the Steenrod algebra (but seemingly without a good conceptual description), and as such, is too large for extensive computer computations.
Motivated by this disparity of computability, we shall refer to elements of with non-trivial image in as good, and we shall refer to non-zero elements of which are in the image of the map from as evil. The purpose of this paper is to present a method of computing the evil part of . This involves (1) computing , and (2) understanding the long exact sequence (1.1).
The basic idea is to use an algebraic analog of the -resolution (called the Mahowald spectral sequence in [Mil81]), studied by Davis, Mahowald, Miller and others, which we will refer to as the -MSS. The -MSS is a spectral sequence of the form
[TABLE]
Analogous to the topological decomposition, there is a decomposition
[TABLE]
and thus a long exact sequence
[TABLE]
The key observation (implicit in [Dav87]) is:
Observation 1.3**.**
The terms are zero unless , and there is an isomorphism of cochain complexes:
[TABLE]
and therefore an isomorphism
[TABLE]
In fact, the map turns out to be computable in terms of the map . In short, a complete understanding of the evil part of can be extracted from a complete understanding of the evil part of .
Our methods rest on the idea that the groups are easily understood (through a range) by computer computations using minimal resolutions [Bru93]. Furthermore, analogous to the topological situation, the groups can be completely computed. One can then deduce and from the existence of the -MSS, using knowledge of , provided one has a means of determining which elements of are detected by good classes and which are detected by evil classes in the -MSS.
We shall say a non-trivial class is evil if there exists an evil class in the -MSS which detects it; otherwise we shall say is good. Our main theorem establishes a precise relationship between being good, and being -periodic (Lemma 7.7 and Theorem 7.12):
Theorem** (Dichotomy Principle).**
Suppose is a non-trivial class in .
- (1)
If is -torsion, it is evil. 2. (2)
If lies above the 1/3 line (), then it is good and -periodic. 3. (3)
Suppose is -periodic. There is an for which is defined and lies above the -line. Suppose has -filtration . The class is good if and only if
[TABLE]
Our technique of using knowledge of and to deduce via the notions of good and evil is encoded more fluently in a refinement of the -MSS we develop, called the agathokakological spectral sequence
[TABLE]
The indexing in this spectral sequence is non-standard, but is set up in such a manner that good and evil classes actually live in distinct tri-degrees.
Mahowald’s proof of the -periodic telescope conjecture [Mah81] rested on two fundamental theorems: the Bounded Torsion Theorem, and the Vanishing Line Theorem. We note that our perspective on the -ASS -term organically produces these results (Corollary 3.7 and Theorem 7.16).
We demonstrate the efficacy of our technique by computing the -ASS through the -stem. The previous computations of [LM87] and [Dav87] only run through the -stem. In principle, our method could be employed to compute the -ASS through a larger range, but it quickly becomes apparent that as a function of the stem, increasingly large portions of are detected by evil classes in the -ASS, and beyond our range it appears that the -ASS is not much more effective than the classical ASS.
Besides being an attempt to streamline and extend previous work on the -ASS, this paper represents a developmental platform for methods the authors hope to employ to study the -resolution (extending the program of [BOSS]).
It should be noted that González’s work on the odd primary -resolution [Gon00] suggests an interesting alternative to the methodology of this paper. Namely, González shows that the analog of the complex for the Adams cover of the sphere spectrum is isomorphic to a cobar complex for a relative group. A similar observation carries over to the -primary case. It would be an interesting project to attempt to compute these relative Ext groups with some variant of the May spectral sequence or a minimal resolution technique.
Organization of the paper
The paper is organized as follows. In Section 2 we review the structure of the -page of the -ASS, together with the good component of the -differential. In Section 3 we describe the Lellmann-Mahowald weight spectral sequence, a spectral sequence for computing . In Section 4, we describe the algebraic resolution (the -MSS), and compute the corresponding weight spectral sequence converging to . In Section 5, we review the notion of -periodicity in , define the -periodic -resolution, and discuss its convergence. In Section 6, we discuss the -MSS for . The Ext groups of are identical to those of away from the [math]-stem, but the -periodic behavior of the former is much more manageable. In Section 7, we define the agathokakological spectral sequence (AKSS) and prove the Dichotomy Principle. We also introduce a topological analog of the AKSS, which refines the -ASS. In Section 8, we use the results of the previous section, together with knowledge of , to completely compute the algebraic -resolution through a large range. The information this affords us about , and the connecting homomorphism , is then used to compute the -ASS through the same range in Section 9.
Conventions
In the remainder of this paper everything is implicitly localized at the .
Homology will always be implicitly taken with coefficients. We let denote the -primary Steenrod algebra, and its dual. For a sub-Hopf algebra , we will use to denote its dual, and we will use to denote the dual of the Hopf-algebra quotient . We let denote the conjugate of the element . We shall sometimes use the abbreviation
[TABLE]
For any connective (-local) finite type spectrum , we let denote its th Adams cover, so that
[TABLE]
is a minimal Adams resolution of . The associated classical Adams spectral sequence (ASS) will be denoted
[TABLE]
For a non-zero element , we let
[TABLE]
denote the class in which detects it. Cycles in the -page of the ASS will be automatically regarded as representing elements of the -page. Thus, given an element , the expression
[TABLE]
means that detects in the ASS. For a general ring spectrum , we let denote the -based Adams spectral sequence for .
For a non-negative integer , we let denote the sum of the digits of its base expansion. For a multi-index
[TABLE]
we define
[TABLE]
Acknowledgments
The authors thank the referee for their valuable suggestions and comments, and John Rognes for pointing out an error in the statement of a computation.
2. The -term of the -ASS
Let denote the th integral Brown-Gitler spectrum (see, for example, [CDGM88]). The integral Brown-Gitler spectra are a sequence of finite complexes whose colimit is the integral Eilenberg-Maclane spectrum:
[TABLE]
The image of their homology in
[TABLE]
is the -subcomodule spanned by monomials of weight , where
[TABLE]
Theorem 2.1** (Mahowald [Mah81], Milgram [Mil75]).**
We have
[TABLE]
where each term of the multi-index satisfies and
[TABLE]
Mahowald and Milgram also determined the homotopy type of the wedge summands above.
Theorem 2.2** (Mahowald [Mah81], Milgram [Mil75]).**
There are equivalences
[TABLE]
where
[TABLE]
and is a graded -vector space of finite type.
As indicated in the introduction, we will define
[TABLE]
The subspace is a subcomplex with respect to the differential [LM87], and we endow with the structure of the quotient complex. The direct sum decomposition
[TABLE]
results in a decomposition of elements into good and evil components:
[TABLE]
We shall refer to the differential, restricted to , as . The induced differential on will be denoted .
Since the spectra are Adams covers, it is useful to understand , and the associated differential in the complex , in terms of the Adams spectral sequence for . To this end, we will denote elements of using notation for an element of . We denote the generators of using notation
[TABLE]
where , is the formal expression
[TABLE]
(here detects the Bott element in ) and . For example, in the case of , generators of are labeled in Figure 2.1.
With respect to this notation, up to terms of higher Adams filtration, the differential in the complex is determined by the following theorem.
Theorem 2.3** (Mahowald [Mah81], Lellmann-Mahowald [LM87]).**
The differential in the complex is determined modulo elements of higher Adams filtration by the formula
[TABLE]
and the fact that the differential is and -linear. (In the above formula, we are saying that for each multi-index , the -component of the differential is detected by the indicated element in the Adams spectral sequence for .)
Remark 2.4**.**
Lellmann and Mahowald actually compute the differential more precisely (i.e., not up to ambiguity of higher Adams filtration) but our presentation in Theorem 2.3 is precise enough to contain all of the relevant features of this differential.
We present a new proof of Theorem 2.3 which we think is much simpler than the approach of [LM87] (based on Adams operations and numerical polynomials).
Proof of Theorem 2.3.
Consider the zig-zag of complexes:
[TABLE]
(where denotes the normalized cobar complex for — with inverted) induced by the zig-zag of ring spectra
[TABLE]
Since the map is an injection in internal degrees , it will suffice to lift the image of to the localized cobar complex for , and verify the formula for the differential there. Define
[TABLE]
this primitive element detects in the Adams-Novikov spectral sequence. Let denote the generator of . Under the zig-zag
[TABLE]
we have
[TABLE]
This follows from [BOSS, Sec. 3.4] (where is instead denoted “”), together with the fact that (since has Adams filtration 1). It follows that we have
[TABLE]
Observe that in the Hopf algebroid we have the formulas:
[TABLE]
By the binomial theorem, together with the fact that
[TABLE]
we have
[TABLE]
We deduce
[TABLE]
The result follows. ∎
3. The weight spectral sequence
In order to compute , Lellmann and Mahowald [LM87] introduced a weight spectral sequence. This section is a summary of their work. Endow with a decreasing filtration by weight (), where we define
[TABLE]
We see from Theorem 2.3 that does not decrease weight. There is a resulting spectral sequence
[TABLE]
with differentials
[TABLE]
From Theorem 2.3, we see that is given (modulo terms of higher Adams filtration) by
[TABLE]
Even with this explicit differential, the calculation of is not immediate.
To this end, paraphrasing [LM87], we will introduce an Adams filtration spectral sequence to compute . We will be able to compute directly, but the computation of will be clarified by the use a lexographical filtration spectral sequence (technically speaking, this spectral sequence is indexed on a totally ordered set). The situation is summarized by the following:
[TABLE]
The Adams filtration spectral sequence
Endow with a decreasing filtration by Adams filtration (AF), where we define
[TABLE]
There is a resulting Adams filtration spectral sequence with
[TABLE]
with differentials
[TABLE]
Proposition 3.2** (Lellman-Mahowald [LM87]).**
An additive basis for is given by elements
[TABLE]
indexed by , detected by where
[TABLE]
Here, the elements run through a basis of .
Proof.
By (3.1),
[TABLE]
The essential observation is that if then
[TABLE]
if and only if and have dyadic expansions with ’s in complementary places. Consider the subcomplex of spanned by the terms . There is an isomorphism
[TABLE]
(the normalized cobar complex for the primitively generated exterior algebra ) given by
[TABLE]
Here, for expressed dyadically as
[TABLE]
(with ), the element denotes the element
[TABLE]
We deduce
[TABLE]
(where is represented by the cocycle in the cobar complex). The structure of follows from the fact that for
[TABLE]
and
[TABLE]
with and
[TABLE]
we have
[TABLE]
∎
Remark 3.4**.**
Our naming of the polynomial generators of may seem bizarre, and differs from [LM87], where these generators are named . Our reason for this different indexing is that in our notation, will correspond to the element of the same name in the classical Adams spectral sequence for the sphere.
The lexigraphical filtration spectral sequence
In order to compute , we observe that from (3.1) we have
[TABLE]
The Adams filtration spectral sequence, like all the spectral sequences we are employing, is multiplicative, and hence
[TABLE]
For the purposes of analyzing the resulting cohomology, it is useful to order the monomials
[TABLE]
by left lexigraphical ordering on the sequence
[TABLE]
In this filtration, we have
[TABLE]
if , or and , or and and , etc.
We will call the resulting filtration (indexed by the ordinal ) lexigraphical filtration (LF). The filtration is multiplicative, and the differential increases lexigraphical filtration. Amusingly, one way to organize the resulting cohomology is via the -indexed spectral sequence based on this filtration (c.f. [Hu99], [Mat]):
[TABLE]
The differentials in this spectral sequence (which for expediency of notation we do not index) are
[TABLE]
Proposition 3.6** (Lellman-Mahowald [LM87], [Mah81]).**
The Adams filtration spectral sequence term has a basis given by elements
[TABLE]
and
[TABLE]
where runs through a basis of
[TABLE]
and runs through a basis of
[TABLE]
Proof.
The proof amounts to analyzing the result of running the differentials of (3.5) in order of increasing lexigraphical filtration. This analysis is simplified by the fact that the differentials in the lexigraphical filtration spectral sequence send monomials to monomials.
Equation (3.5) implies that
[TABLE]
As nothing can hit these classes, these provide the first part of the basis. Note that for
[TABLE]
and therefore for we have
[TABLE]
It follows that
[TABLE]
Therefore the differentials
[TABLE]
are all non-trivial. The only elements not hit by the differentials above are of the form
[TABLE]
with and . The remaining possible differentials
[TABLE]
(with odd) are all zero since their targets are already killed by the shorter differentials
[TABLE]
∎
We have at this point deduced Mahowald’s “Bounded Torsion Theorem” [Mah81]:
Corollary 3.7**.**
For and , we have
[TABLE]
Because what remains in (with the exception of the classes ) is concentrated in Adams filtration 0, there are no further differentials in the Adams filtration spectral sequence, and we deduce the following corollary.
Corollary 3.8**.**
We have
[TABLE]
and is essentially given by Proposition 3.6.
The higher differentials in the weight spectral sequence
We now compute the remaining differentials in the weight spectral sequence. By 2.3, these are given by
[TABLE]
(provided the source and target persist to ).
Proposition 3.10** (Lellmann-Mahowald [LM87]).**
The remaining differentials in the weight spectral sequence are given by
[TABLE]
Proof.
The first formula follows from (3.9) and the fact that
[TABLE]
The second formula follows from the fact that, for , the classes
[TABLE]
die in the lexigraphical filtration spectral sequence for . Thus the only possible non-trivial differentials coming from (3.9) are
[TABLE]
for such that the dyadic expansion of has a in the th place. The first of these is . ∎
In [LM87], Lellmann and Mahowald proceed to deduce a closed form computation for . We give our own description of this cohomology, based on the algebraic good complex , in Corollary 4.9.
4. The algebraic -resolution
We now construct and analyze an algebraic parallel to the -ASS studied so far, the -Mahowald spectral sequence (-MSS).
Construction of the -MSS
Taking homology of the cofiber sequence
[TABLE]
we get a short exact sequence
[TABLE]
of -comodules, and hence short exact sequences
[TABLE]
Piecing together the associated long exact sequences of -groups, and using the change of rings isomorphisms
[TABLE]
we get an associated “algebraic -resolution”
[TABLE]
This gives a spectral sequence (the -Mahowald spectral sequence)
[TABLE]
with differentials
[TABLE]
The -term of the -MSS
Let denote the th integral Brown-Gitler comodule, the -comodule obtained by taking homology of the th integral Brown-Gitler spectrum
[TABLE]
The motivation behind Theorem 2.1 is that there is a splitting of -comodules:
[TABLE]
where with each and
[TABLE]
The -groups of these comodules are given by
[TABLE]
where the graded -vector space has cohomological degree zero:
[TABLE]
Thus the evil subcomplex with
[TABLE]
is a subcomplex of . We will define to be the quotient complex, where
[TABLE]
Analogous to Section 2, we will denote elements of using notation for an element of using notation
[TABLE]
where is the formal expression
[TABLE]
The following proposition is an immediate consequence of Theorem 2.3.
Proposition 4.3**.**
The differential in the complex is given by the formula
[TABLE]
and the fact that the differential is and -linear.
The algebraic weight spectral sequence
Analogous to the weight spectral sequence of Section 3, we can set up an algebraic weight spectral sequence to compute . Just as in the topological case, we endow with a decreasing filtration by weight (), where we define
[TABLE]
Proposition 4.3 implies that does not decrease weight. There is a resulting spectral sequence
[TABLE]
with differentials
[TABLE]
From Proposition 4.3, we see that is given by
[TABLE]
Note that this is precisely the formula for of Section 3 (see (3.3)). Therefore, the same proof for Proposition 3.6 yields the following:
Proposition 4.5**.**
An additive basis for is given by elements
[TABLE]
indexed by , detected by where
[TABLE]
Here, the elements run through a basis of .
By Proposition 4.3, the remaining differentials in the algebraic weight spectral sequence are given by
[TABLE]
when the source and target persist to .
Lemma 4.6**.**
The non-trivial differentials in the algebraic weight spectral sequence are given by
[TABLE]
where .
Proof.
The differentials
[TABLE]
never get a chance to run, because the sources of these potential differentials are targets of the shorter differentials:
[TABLE]
To describe , we need some notation. Consider the “-pattern”:
We shall use to denote the sub-pattern where we only include every th tower, and truncate these -towers to have length . For example, is given by:
whereas is given by:
We also need to consider an analog of these patterns for . Let denote the following pattern:
Finally, we let denote the “th Adams cover” of the pattern . The pattern is:
With regard to these patterns, is described by the following theorem.
Theorem 4.7**.**
The groups have a basis given by
[TABLE]
where
[TABLE]
and runs through a basis of
[TABLE]
Remark 4.8**.**
We note for the reader’s convenience that
[TABLE]
Proof.
Proposition 4.5 gives a basis of as where runs through a basis of
[TABLE]
Lemma 4.6 implies that if
[TABLE]
with , then only every -tower in these patterns persist to . Moreover, these -towers are truncated by differentials emanating from the classes
[TABLE]
Assuming is even, ( odd is a similar separate case) and letting
[TABLE]
we compute the height of the -towers to be
[TABLE]
By Proposition 3.10, the differentials in the algebraic weight spectral sequence (in -filtration ) are simply a restriction of the differentials in the topological weight spectral sequence. We can thus read off from for . The resulting description of these cohomology groups is given below.
Corollary 4.9**.**
The cohomolology of the topological good complex is given in degrees [math] and by:
[TABLE]
In degrees , these cohomology groups are given by the subspace
[TABLE]
generated by elements of the form
[TABLE]
for as in Theorem 4.7.
In particular, we can derive a vanishing line for .
Corollary 4.10**.**
We have
[TABLE]
for .
Proof.
By Corollary 4.9, the lowest where a class
[TABLE]
can contribute to is
[TABLE]
where
[TABLE]
Since
[TABLE]
and , we deduce that such a class must satisfy
[TABLE]
∎
5. -periodicity
In Section 4, we established that there is a long exact sequence
[TABLE]
which assembles out of good and evil classes. Furthermore, we computed the good component in its entirety (Theorem 4.7). Since the spectral sequence converges to , it stands to reason that if we know through a range, we should be able to deduce the evil component . As summarized in the introduction, this is predicated on actually having a means of determining which elements of are detected by good and evil classes. The Dichotomy Principle (Theorem 7.12) will relate this to -periodicity. We review the definition and properties of -periodic Ext groups in this section.
-periodic Ext groups
Our approach to -periodic Ext follows that of [MS87], [DM88], which is based on the Adams periodicity theorem [Ada66]. Let be an -comodule. For , Adams produced elements
[TABLE]
which are appropriately compatible under the maps
[TABLE]
For any -comodule , we can form the localized Ext groups
[TABLE]
We then define
[TABLE]
For certain , the inverse system in (5.2) stabilizes for large for fixed bidegrees . When this is the case, the localized Ext groups are manageable.
One class of comodules for which this is true are those whose duals are -free. Indeed, as pointed out by [DM88], Adams proves:
Theorem 5.3** (Adams [Ada66]).**
Suppose that is a connective -comodule whose dual is free over , and suppose .
- (1)
For , the map
[TABLE]
is an isomorphism. 2. (2)
For and , the map
[TABLE]
is an isomorphism.
In other words, is -periodic above the line of slope through the origin. Further, there is a sequence of lines of slope above which agrees with . We deduce that above the line of slope , every element of is -periodic for some which depends on which “band” of slope it lies in. The typical picture one draws of this (and indeed a similar picture appears in [DM88]) is:
In the figure above, the Ext groups in the region are all trivial. In the region , for the Ext groups are -periodic, and isomorphic to the corresponding -groups. The corresponding -periodic Ext groups take the form:
Here the periodic Ext groups in the region are obtained by interpolating back the values of the Ext groups of the region . In particular, the values of stabilize in the region for .
The comodule is not free over , but is. The following remark establishes an explicit relationship between their Ext groups.
Remark 5.4**.**
The short exact sequence
[TABLE]
induces a long exact sequence of Ext groups. Since by change of rings we have
[TABLE]
the connecting homomorphism
[TABLE]
is an isomorphism for .
The short exact sequence (5.5) is the homology of the cofiber sequence
[TABLE]
Proposition 5.6**.**
**
- (1)
For , there are well defined homomorphisms (compatible as varies)
[TABLE]
For these homomorphisms are isomorphisms. 2. (2)
The maps
[TABLE]
are isomorphisms for .
Proof.
Statement (1) follows from the isomorphism of Remark 5.4 by applying Theorem 5.3 to the comodule , which is free over . Statement (2) follows from the fact that in degrees less than , the map
[TABLE]
is an isomorphism. ∎
Remark 5.7**.**
The line of Proposition 5.6 can be upgraded to a line of slope (see [Rav86, Thm 3.4.6]).
Proposition 5.6 allows to define by interpolating -periodic families backwards across the slope line. 111There is one exception: the -tower in is -periodic, with “infinite period”.
Corollary 5.8**.**
For fixed , the map
[TABLE]
is an isomorphism for .
The -periodic -MSS
Davis and Mahowald [DM88] considered a -periodic version of the -MSS:
[TABLE]
They use the stabilization of in fixed bidegrees to prove the convergence of this spectral sequence for comodules which are free over . Corollary 5.8 implies that the Davis-Mahowald convergence argument also applies to the case where .
Lemma 5.9**.**
The maps
[TABLE]
are isomorphisms.
Proof.
The evil subcomplex
[TABLE]
is -torsion, so we have an isomorphism
[TABLE]
and hence an isomorphism
[TABLE]
6. Comparison with
We would like to leverage the results of Section 5 to relate -periodicity in to being “good” in a precise manner. However, as we saw in Section 5, the groups
[TABLE]
have much better behaved -periodic phenomena. For instance, there is a sequence of lines of slope 1/2 above which the Ext groups are entirely -periodic and simultaneously isomorphic to the corresponding groups, where is well defined.
While and have essentially the same Ext groups (see Remark 5.4), their respective -MSS’s differ. In this section, we give a complete dictionary between these two -MSS’s. This will allow us to transport results on -periodicity from to . There is an added bonus: since the two -MSS’s are different, we will be able to deduce hidden extensions or differentials in one from non-hidden extensions or differentials of different length in the other.
Given any -comodule , we can consider the associated -MSS
[TABLE]
Suppose that the map
[TABLE]
is injective for . Then we will define to be the kernel of the above map for . Just as in the case of , the evil subgroup is a subcomplex with respect to , and we define the good complex
[TABLE]
to be the quotient complex. Then there is a long exact sequence
[TABLE]
The following lemma is an algebraic analog of the “generalized connecting homomorphism theorem” [Rav86, Thm 2.3.4], and its proof is identical to the topological case.
Lemma 6.2** (Connecting Homomorphism Lemma).**
Associated to the short exact sequence
[TABLE]
we have a sequence of spectral sequences
[TABLE]
The top and bottom rows are long exact sequences. The map induces a map of spectral sequences, converging to .
The -MSS for
We now study the spectral sequence
[TABLE]
The next lemma computes the “good” part of the -term.
Lemma 6.3**.**
We have
[TABLE]
where .
Proof.
By change of rings, we have
[TABLE]
The latter is computed using Margolis homology. Using the fact that in
[TABLE]
we have
[TABLE]
we deduce that the Margolis homology is given by
[TABLE]
Identifying the first factor of with , we have
[TABLE]
Just as in Section 4, we will use the notation
[TABLE]
to denote a generic element of . From the map of good complexes
[TABLE]
(and the fact that is -linear), we find the formula for is identical to that of Proposition 4.3. Let
[TABLE]
denote the associated algebraic weight spectral sequence. Just as in Proposition 4.5, we have
[TABLE]
Just as in Lemma 4.6, the non-trivial differentials in the algebraic weight spectral sequence are given by
[TABLE]
We deduce
[TABLE]
Proposition 6.4**.**
The -MSS for collapses at .
Proof.
With the exception of , all of the good classes are targets and sources of -differentials. Since changes -degree for , and the evil classes are concentrated in , we deduce that
[TABLE]
The result follows. ∎
The structure of
In this subsection, we will describe the -term in terms of . We shall find that while these -terms are different, their relationship admits a complete description.
The primary tool in this analysis is the long exact sequence
[TABLE]
These long exact sequences decompose into a direct sum of long exact sequences
[TABLE]
using the decomposition
[TABLE]
induced by the splitting (4.1).
We first examine the behavior of the good classes. A useful schematic is depicted below.
In the figure above, there are two kinds of good classes in : those which are parts of -towers, and those which are -torsion. We shall refer to the former as -good (marked with solid dots in the above figure) and the latter as -good (so that there is a basis of consisting of -good, -good, and evil classes). The good part of was computed in the last subsection, as depicted in the middle chart above. The righthand chart is then deduced by the long exact sequence. We see that in , the -towers get turned upside down (we will call these classes -good as well), while the -good classes get transported by the boundary homomorphism (which we also call -good).
The extension
[TABLE]
in the figure above is of special importance. One way of deducing it is to observe that associated to the cofiber sequence
[TABLE]
there is a sequence of -localized Adams spectral sequences
[TABLE]
(where is the first monochromatic layer). The localized spectral sequences converge as indicated because of the following lemma.
Lemma 6.8**.**
Inverting the Bott element in the cofiber sequence (6.7) yields the cofiber sequence
[TABLE]
Proof.
The computations earlier in this section specialize to show that the Adams spectral sequence
[TABLE]
collapses to give
[TABLE]
with . Inverting the Bott element , we get
[TABLE]
The map
[TABLE]
is easily computed on the level of the -localized Adams -terms, and is seen to be a rational isomorphism. The result follows. ∎
The extension (6.6) follows from:
- •
is a suspension of ,
- •
the Brown-Comenetz dual is the Gross-Hopkins dual ,
- •
the Gross-Hopkins dual of is well known to be a suspension of (see, for example, [HS14, Cor.9.1]).
With the language introduced in the discussion above, we have (for , , or ) decompositions
[TABLE]
into -good, -good, and evil components. Note that for each of these we have
[TABLE]
(and for we have ). The complete structure of these components is summarized in the following proposition.
Proposition 6.9**.**
There are short exact sequences
[TABLE]
and isomorphisms
[TABLE]
Thus, for every -good tower
[TABLE]
generated by there is a corresponding truncated -good tower
[TABLE]
Furthermore, in we have
[TABLE]
Proof.
This proposition mostly follows from the preceding discussion, using the long exact sequence (6.5) and Lemma 6.3. In particular, the second short exact sequence follows from the fact that the map induces an inclusion
[TABLE]
The map vanishes on for for dimensional reasons, and thus the latter must be in the image of . However, can map classes in to evil classes in , and in fact must do so in an injective fashion, because there are no non-trivial classes in for to map into . The -relation follows from the Gross-Hopkins duality argument discussed above. ∎
To state the structure of more clearly, we remark that the Ext groups
[TABLE]
take the following form (-torsion classes ommitted):
Corollary 6.10**.**
There are decompositions
[TABLE]
where
[TABLE]
The structure of
We now turn to understanding the -page of the -MSS for . We shall let
[TABLE]
denote the image under of the element of the same name in . Since induces a map of spectral sequences, we get the same formula for on the classes above as in (the formula from 4.3). The formula for on all of follows from the fact that it is and -linear. We use a weight spectral sequence:
[TABLE]
The computation of is just as in Proposition 4.5:
Proposition 6.11**.**
An additive basis for is given by elements
[TABLE]
indexed by , detected by where
[TABLE]
Here, the elements run through a basis of .
The remaining differentials in the weight spectral sequence are induced by the map from the weight spectral sequence for (the -good classes in are all permanent cycles):
[TABLE]
The figure below illustrates the relationship between the weight spectral sequences (and consequently the corresponding -terms) for , , and .
We see that there is a bijective correspondence between the truncated -towers that comprise the -good classes in and , with the notable feature that their respective -filtrations differ by while their -degrees are identical. Similarly, there is a bijective correspondence between the -good classes in each of these -terms, but with identical -filtrations and -degrees which differ by (except for -good classes in , for which there is no corresponding class in ). In the notation of Figure 6.1 above, we have
[TABLE]
while
[TABLE]
(with lying in higher filtration), and also we have
[TABLE]
while
[TABLE]
(with lying in higher filtration). The map used in Figure 6.1 is one of the two connecting homomorphisms associated to long exact sequences associated to the short exact sequences of Proposition 6.9:
[TABLE]
A complete description of in terms of is provided by the following proposition.
Proposition 6.13**.**
The maps , induce isomorphisms
[TABLE]
Here, the groups are determined by
[TABLE]
The connecting homomorphism in the long exact sequence (6.1) is determined for by the commutative diagram
[TABLE]
and for by the commutative diagram
[TABLE]
Proof.
The isomorphisms in the first part of the proposition follow from Proposition 6.9 and the fact that we have (Proposition 6.4)
[TABLE]
The identification of simply follows from the fact that for we have
[TABLE]
The diagram computing for follows from the fact that for such there is a diagram of short exact sequences of chain complexes
[TABLE]
(note there is no sign in the commutativity of the resulting diagram of connecting homomorphisms because we are working in characteristic 2). The proof of the commutativity of the diagram computing for will be deferred to the next subsection (Case (1) of Theorem 6.14, ). ∎
Higher differentials and hidden extensions in the -MSS for .
We have so far established a dictionary between classes in the -MSS’s for and :
[TABLE]
We will now extend this dictionary to all of the higher differentials. For the purpose of the statement of the next theorem, a non-trivial class will be regarded as -good if and only if .
Theorem 6.14**.**
Suppose that and are classes in the -MSS for .
- (1)
If is -good and not -good, then
[TABLE] 2. (2)
If both and are -good, we have
[TABLE] 3. (3)
If is not -good and is -good, we have
[TABLE] 4. (4)
If neither nor are -good, we have
[TABLE]
Proof.
This theorem is proven using a combination of the Connecting Homomorphism Lemma (CHL) (Lemma 6.2) and an adaptation of the Geometric Boundary Theorem (GBT) [Beh12, Lem. A.4.1] to our algebraic setting — the -MSS’s associated to the short exact sequence of -modules:
[TABLE]
In general, the GBT has a great deal of potential ambiguity. However, in our case much of it goes away as the -MSS for collapses at , where it is virtually acyclic (Proposition 6.4).
Suppose first that is -good, so . Suppose there is a non-trivial differential
[TABLE]
and (i.e. is either -good or evil). Then we apply Case (2) of the GBT to (6.15) deduce that there is a differential
[TABLE]
This establishes:
(1) If is -good and not -good, then
[TABLE]
Suppose however that the class of (6.15) is not -good. Then it follows from the CHL that we have
[TABLE]
This implies
(2’) If both and are -good, we have
[TABLE]
Furthermore, we deduce
(2.5) If is an -good permanent cycle, then is a permanent cycle.
Suppose now that is a non-trivial class which is not -good, so . By (6.1), we deduce that there is a so that . Then there is a non-trivial differential (Proposition 6.4)
[TABLE]
We apply the GBT to this differential. Note that by the definition of the connecting homomorphism , there is a representative for in (which we abusively also call ) so that
[TABLE]
Case (2) of the GBT then implies that if there is a non-trivial differential
[TABLE]
with -good, then there is a differential
[TABLE]
Thus we have shown
(3’) If is not -good and is -good, we have
[TABLE]
Suppose however that of (6.16) is not -good. Then we are in Case (3) of the GBT, and we have
[TABLE]
We have shown
(4’) If and are not -good, we have
[TABLE]
Finally, suppose that is a permanent cycle. Then Cases (4)-(5) of the GBT imply that is a permanent cycle. Thus we have shown
(4.5) If is a permanent cycle which is not -good, then is a permanent cycle.
Suppose inductively that we have established (2), (3), (4) for all . Since we have also established (1), we have then established our dictionary between differentials in the -MSS for for and corresponding differentials in the -MSS for . The differentials on the right-hand side of (2’), (3’), and (4’) could in principle be trivial, but only if their targets were hit by non-trivial shorter differentials in the -MSS for . This would violate our inductive hypothesis. We conclude inductively that the differentials on the right-hand side of (2’), (3’), and (4’) are actually non-trivial. This, combined with (2.5) and (4.5), upgrades these statements to (2), (3), and (4) of the theorem. ∎
7. The agathokakological spectral sequence
At the end of the day we would like to deduce the evil classes (in a range) directly from the known quantities and . This is somewhat confusing, as the relationship of these three quantities occurs through the combination of a spectral sequence (the -MSS) and a long exact sequence (1.2). To mitigate this complication, we introduce a variant of the -MSS, called the agathokakological spectral sequence (AKSS), which combines the three quantities directly:
[TABLE]
(The indexing of this spectral sequence is unorthodox, and will be explained.)
The construction of the spectral sequence
For convenience, fix a splitting of the short exact sequence
[TABLE]
Recall that with respect to this splitting, we can decompose elements as
[TABLE]
with and . While (7.1) does not split as a short exact sequence of chain complexes, it does introduce a micrograding on the filtration -layer of the -MSS. We will regard the evil subcomplex as being in filtration , where is regarded as being infinitesimal. The new grading is on the ordered set
[TABLE]
A total ordering is defined by
[TABLE]
The result is a spectral sequence indexed on (see [Mat]) which we call the agathokakological spectral sequence (AKSS):
[TABLE]
with
[TABLE]
The pages are indexed on the totally ordered set
[TABLE]
with
[TABLE]
The differentials take the form
[TABLE]
Given an element , we will define
[TABLE]
If , we will refer to the element as good, and if , we refer to as evil. The -differential
[TABLE]
is given by
[TABLE]
We therefore have
[TABLE]
The only nonzero -differentials are of the form
[TABLE]
for which we have
[TABLE]
where is the connecting homomorphism of (1.2). We therefore have
[TABLE]
Thankfully, as the differentials in the -MSS decrease by , and the evil classes are concentrated in , the only other potentially non-trivial differentials () in the AKSS are of the form:
[TABLE]
in which case they are determined by
[TABLE]
The behavior of the differentials in the AKSS is summarized by the following lemma.
Lemma 7.2**.**
In the agathokakological spectral sequence, given a non-trivial differential
[TABLE]
for and , there are three possibilities:
- (1)
* and are both evil, , ,* 2. (2)
* and are both good, , ,* 3. (3)
* is good and is evil, , .*
In other words, evil can never triumph over good.
The reader might wonder why the authors elected to index the AKSS on rather than, say, half integers. The reason is that since the map of (7.1) is a map of algebras, gets the structure of an ideal, and the multiplicative structure of the -MSS descends to a multiplicative structure on the AKSS.
Specifically, define a monoid structure on determined by the rule , so we have
[TABLE]
Then there is a product map
[TABLE]
The differential is a derivation with respect to this product, provided one interprets that to mean
[TABLE]
if and are both evil.
With respect to this multiplicative structure, the product of good classes is good, and the product of evil classes is evil (which is why we require ). For dimensional reasons, only certain kinds of hidden extensions can occur:
Lemma 7.3**.**
Suppose that there is a hidden extension in the AKSS given by
[TABLE]
in , where , , and detect , , and in the AKSS, respectively, with in . Then either
[TABLE]
or
[TABLE]
Remark 7.4**.**
When , this imposes strict restrictions on . If (for example if when ), cannot be evil, for this would force . Similarly, if (for example, if or ), if is evil, then .
Comparison with
The entire construction of the AKSS goes through without modification when the -comodule is replaced by :
[TABLE]
with
[TABLE]
The analysis of Section 6, in particular Proposition 6.13, comparing the -MSS’s of and refines to give a comparison between the respective AKSS’s.
Theorem 7.5**.**
We have
[TABLE]
Moreover, under this isomorphism, all differentials commute (but potentially changing lengths as the indexing changes dictate).
As this theorem is essentially just a translation of the results of Section 6 into agathokakological indexing, we will not say anything more about the proof. However, the second to last case in the statement of the theorem () does merit clarification. The -good classes in become -good classes in for , but for they become evil classes (in ). A differential from an -good class to an evil class in the AKSS for becomes a differential between the corresponding evil classes in the AKSS for .
The principle of dichotomy
Given a non-trivial class , for or , we will say that is good if it is detected by a good class in the AKSS, and we will say is evil if it is detected by an evil class. We will say is -periodic if its image in is non-trivial, and otherwise we will say that is -torsion. We will now answer the following fundamental question:
How do you determine if a given Ext class is good or evil?
Recall from Theorem 5.3 (in the case of ) and Proposition 5.6 (in the case of ), for every class with , there is an such that
[TABLE]
is defined for all . For these classes, being -periodic is equivalent to requiring
[TABLE]
for all .
For , the only classes in are , and these are all good (and technically are -periodic in the sense that their image in is non-trivial, though they are -periodic of “period ”). For , there are no non-trivial classes in . We may therefore restrict our attention to those classes with .
A naive hope would be: “ is -periodic if and only if is good.” This is not true. However, something approximating it is.
By Proposition 5.6, any class
[TABLE]
with is automatically -periodic. We shall refer to these classes as being above the 1/3 line.
Lemma 7.7**.**
Every class above the -line is good.
Proof.
Since is a subgroup of , and is -connected, it follows that for . The lemma follows from the fact that, in the AKSS, evil classes in detect elements of . ∎
The following is easily checked from the structure of or .
Lemma 7.8**.**
Suppose is either an element of or . Then exists if and only if .
Remark 7.9**.**
Note that among good classes in the AKSS, notions of -periodicity extend to all the pages in the following manner. There are variants of the AKSS for computing and . Thus, we can define as in (7.6) on any page of the AKSS. Moreover is an actual element of , and the AKSS for and are spectral sequences of modules over the AKSS for . Thus multiplication by commutes with differentials in these AKSS’s.
The following observation is crucial — it implies that good classes cannot detect -torsion classes in Ext.
Lemma 7.10**.**
Suppose that and are good classes in the AKSS for or , and suppose that there is a non-trivial differential . Let .
- (1)
If exists then exists. 2. (2)
For all such ,
[TABLE]
Proof.
We use the comparison with the AKSS for computing (respectively ). By Theorem 5.3, this spectral sequence is isomorphic to the AKSS for (respectively ) in a range which includes both and .
Suppose inductively that we have proven the lemma for . We need to prove it for . Since we have
[TABLE]
it follows from Lemma 7.8 that if exists, then exists. Suppose it is not the case that
[TABLE]
Then must support a shorter non-trivial differential
[TABLE]
for . By the inductive hypothesis must be evil (because if it was good we would have ). In particular, since , we have
[TABLE]
Since exists, we have
[TABLE]
Finally, we have
[TABLE]
From all these equations we deduce , a contradiction. ∎
Theorem 7.11**.**
Suppose is a non-trivial class in .
- (1)
If is -torsion, it is evil. 2. (2)
Suppose is -periodic, and let . Suppose is taken large enough so that lies above the -line. Suppose is a class which detects in the AKSS (* is necessarily good). The class is good if and only if*
[TABLE]
Proof.
Suppose is -torsion, but is detected by a good class in the AKSS. Let and suppose that is chosen so that lies above the 1/3-line and is trivial. Then is killed by a good class in the AKSS. Lemma 7.10 then implies that is the target of a differential, which violates the non-triviality of .
Now suppose that is -periodic, detected by an evil class in the AKSS. Again we use the fact that both and lie in a range where the AKSS for is isomorphic to the AKSS for . The AKSS for is a spectral sequence of modules over the AKSS for . Since is evil, we have
[TABLE]
We deduce that multiplication by must increase (hidden extension). Thus
[TABLE]
Suppose that Since we have
[TABLE]
we deduce that . This violates the assumption that is evil, so we deduce that is good.
Suppose that is good, detected by in the AKSS. Then by Lemma 7.10, detects . Then
[TABLE]
∎
Theorem 7.12** (Dichotomy Principle).**
Suppose is a non-trivial class in .
- (1)
If is -torsion, it is evil. 2. (2)
Suppose is -periodic, and let . Suppose is taken large enough so that lies above the -line. Suppose is a class which detects in the AKSS (* is necessarily good). The class is good if and only if*
[TABLE]
Proof.
This theorem follows from Theorem 7.11 using the fact that for , there is an isomorphism
[TABLE]
so we have . Suppose is -torsion (then so is ). By Theorem 7.11, is evil. The map takes -torsion evil classes to evil classes.
Suppose now that is good, with detecting . First suppose that is -good. Then we have
[TABLE]
so
[TABLE]
and so
[TABLE]
The theorem follows from the fact that is good if and only if is good.
Now suppose that is -good, so we have with
[TABLE]
This would seem to pose a problem for ; in this case
[TABLE]
and so is evil by Theorem 7.11. We claim such an is detected by an evil class with
[TABLE]
-good, detecting . Indeed, suppose not. Then is evil. Since
[TABLE]
we have . In the AKSS for , there cannot be a -extension from filtration to filtration . ∎
The topological AKSS
There is a topological analog of the AKSS, which refines the -ASS just as the (algebraic) AKSS constructed in the beginning of this section refines the -MSS.
Fix a splitting of the short exact sequence
[TABLE]
Just as in the algebraic case, we will regard the evil subcomplex as being in filtration . The result is a topological AKSS:
[TABLE]
with differentials
[TABLE]
The -term takes the form
[TABLE]
The -differential
[TABLE]
is given by
[TABLE]
We therefore have
[TABLE]
The only nonzero -differentials are of the form
[TABLE]
for which we have
[TABLE]
where is the connecting homomorphism of (1.1). It turns out all of these differentials can be derived from the algebraic AKSS.
Lemma 7.14**.**
For , the differentials
[TABLE]
are trivial. For , they are determined by the following commutative diagram (see Corollary 4.9).
[TABLE]
Proof.
Topologically, this connecting homomorphism derives from applying to the composite
[TABLE]
The first statement follows from the fact that the only elements in for and have Adams filtration greater than [math], and therefore cannot map topologically to elements of Adams filtration [math]. The second statement follows from the fact that the algebraic connecting homomorphism derives from the ASS edge homomorphism of the composite (7.15):
[TABLE]
∎
The -term of the -ASS is deduced from the short exact sequence
[TABLE]
At this point we can deduce Mahowald’s Vanishing Line Theorem. We only sketch the proof to emphasize the conceptual origin of this vanishing line without getting lost in the details.
Theorem 7.16** (Mahowald [Mah81]).**
There is a so that
[TABLE]
for .
Sketch of proof.
Since has a -vanishing line by Corollary 4.10, it suffices to establish that the cohomology of the evil complex has a -vanishing line. Suppose that is a nontrivial class in . By the Dichotomy Principle (Theorem 7.12), there are three possibilities.
- (1)
detects a -torsion class of in the algebraic AKSS. 2. (2)
detects a -periodic class of , which in the -periodic -MSS, is detected in with . 3. (3)
, for .
Recall (Remark 5.7) that is entirely -periodic above a “periodicity line” of slope (and above this periodicity line the -groups are isomorphic to the -groups). Thus if we are in case (1), we deduce that must lie below this periodicity line. The same inequalities used in the proof of Corollary 4.10 also prove that there is a so that the maps
[TABLE]
are isomorphisms for
[TABLE]
Thus in case (2), we deduce that must lie below this line of slope . In case (3) for , the class is either non-trivial, or is the source or target of a differential in the algebraic AKSS. In the former case, cannot lie above the periodicity line. In the latter case, Lemma 7.10 implies that must lie below both the 1/5 line given by (7.17). ∎
The differentials in the topological AKSS determine and are determined by the differentials in the -ASS, with lengths dictated by whether the sources and targets of the -ASS differentials are good or evil. Unlike the algebraic case, in the topological case there are no dimensional restrictions: in principle good or evil classes can each kill either good or evil classes.
Remark 7.18**.**
There is no Dichotomy Principle in the topological AKSS. Many -torsion elements of are detected by good classes in the -ASS (e.g. ). In fact, Mahowald showed in [Mah81] that a non-trivial class in is -periodic if and only if it has -filtration .
8. Computation of the algebraic -resolution
In this section we will compute the algebraic -resolution, or more specifically, the (algebraic) AKSS, through dimension . We use the known computation of through this range (see, for example, the May spectral sequence computation of [Tan70] or the computer computation of [Bru93],[Bru]), as well as our computation of (Theorem 4.7) to deduce the groups , and the subsequent differentials. Key to this is the determination of which classes of are good and which are evil. This is done with the Dichotomy Prinicple (Theorem 7.12). A prerequisite to applying the Dichotomy Principle is the determination of which elements in in our range are -periodic, and which are -torsion.
To this end we begin this section with an analysis of -periodicity and torsion in our range. We then explicitly write out and apply the Dichotomy Principle to determine which classes in are good and which are evil. We then prove a couple of convenient lemmas which relate the differentials in the AKSS to -multiplication. We then do a stem by stem computation of the AKSS through dimension .
-periodicity and -torsion in low degrees
In order to invoke the Dichotomy Principle to determine which classes in are good and which classes are evil in low degrees, it is necessary to determine which classes in this range are -periodic, and which are -torsion.
Ideally, this would be accomplished by actually having a complete computation of . To date, this has not been done. However, Davis and Mahowald have computed where [DM88]. Note that Andrews [And15] has computed for odd.
Remark 8.1**.**
The best available tool to compute is probably the localized algebraic -resolution
[TABLE]
The only difficulty is that this spectral sequence has many long differentials (as will be demonstrated in our low degree calculations in this section). Nevertheless, it seems plausible that with enough care the spectral sequence (8.2) could be completely computed. The odd primary analog of (8.2) actually collapses, giving a convenient alternative approach to Andrews’ computation of for odd.
In the absence of a complete understanding of , we instead manually identify the kernel of the homomorphism (a.k.a. the -torsion)
[TABLE]
in low degrees. Figure 8.1 shows an Ext chart in low degrees (courtesy of Perry’s Ext software). The chart is broken into regions which indicate for which multiplication by is well-defined (c.f. Proposition 5.6). The circled classes span the -torsion (see the following proposition). The classes decorated with triangles represent the only classes in this range which are -periodic, but evil — this will be explained in the next subsection.
Proposition 8.3**.**
The -torsion in for is spanned by the circled classes in Figure 8.1.
Proof.
This represents a tedious analysis of available Ext data, the highlights of which we summarize here. Basically, one must check that the images of the uncircled classes are linearly independent in , and that the circled classes are -torsion.
The vast majority of the uncircled classes are -periodic. This can be verified by checking that for such classes , the image of the iterated Adams operator is non-trivial, for sufficiently large that lies above the -line. These verifications can be done using Bruner’s tables [Bru93]. In many instances, the process is expedited by simply observing that the corresponding classes map non-trivially to , where everything is -periodic.
The only -periodic classes this technique does not apply to are those in the -towers in , the “broken” -towers in , and the -towers with bottoms in bidegrees and .
In the case of the -towers , the tops of the towers are actually -periodic (by the -operator argument). That implies that the images of the top of the towers in are non-trivial. It must therefore be the case that all of the classes are non-trivial.
In the case of the broken towers in , we employ a bit of a cheat. The idea is that in the localized ASS
[TABLE]
the tops of the broken -towers in dimensions are the targets of differentials on the -towers in dimensions . If differentials of the same length happen in the unlocalized ASS, then the targets of these differentials must be non-trivial under the map of ASS’s:
[TABLE]
We illustrate this principle with an example: we will show the class is -periodic. In the unlocalized ASS, there is a differential
[TABLE]
(where is in degree and in ) and this differential must map to a non-trivial -differential in the localized ASS since we are working in a region where the map
[TABLE]
is an isomorphism. In the localized ASS, this differential interpolates back to a differential
[TABLE]
Since in the unlocalized ASS we have
[TABLE]
we deduce that must map to in , and therefore in we have
[TABLE]
Since is above the 1/3 line, we deduce that is -periodic. Because it is located in the region of where multiplication by is well-defined, we deduce that in fact is -periodic.
In the case of the towers in and , we deduce that they are -periodic as follows. It suffices to show the tops of these towers and are -periodic. We have
[TABLE]
The classes and have already been shown to be -periodic, and we have
[TABLE]
for in and in . Moreover, we are working in a range (c.f. Theorem 5.3 where the composite
[TABLE]
is an isomorphism. Since , and the composite (8.4) is -linear, we deduce that
[TABLE]
Since and lie above the 1/3 line, they are -periodic. It follows that and are both -periodic.
We now explain how to check that the circled classes are -torsion. The classes which are divisible by for can be handled with the following trick, which we illustrate in the case of . Using the fact that is -periodic, we can deduce that
[TABLE]
It follows that for all ,
[TABLE]
Therefore, if is annihilated by , then . It follows that times the classes
[TABLE]
are all zero. So the same is true of their , , and -multiples. The same trick shows that is true for all of the relevant values of .
The remaining cases, such as , , etc. are handled by observing that the only classes which could detect their (or , as appropriate) multiples either (1) have non-trivial products with or which the original class does not have, or (2) map non-trivially to (and the original class maps trivially into this Ext group.) The case of in is somewhat tricky. The only candidate to detect has a non-trivial product with , whereas . The same argument shows the class in is -torsion. ∎
The cohomology of
Throughout this section, by AKSS we refer to the algebraic AKSS. The cohomology groups can be read off from Theorem 4.7. The result, in low degrees, is depicted in Figure 8.3. In this chart, the -axis denotes , and the -axis denotes . The -filtration is encoded by a color given in Figure 8.2. Application of the Dichotomy Principle (Theorem 7.12) gives the following.
Proposition 8.5**.**
The classes in Figure 8.1 which are evil are precisely those classes which are marked with a circle (case (1) of Theorem 7.12) or a triangle (case (2) of Theorem 7.12).
The propagation of good : –periodic differentials
We now begin our stemwise computation of the algebraic AKSS
[TABLE]
The full chart of this spectral sequence in the range we will be considering (starting at the page) is shown in Figure 8.3.
Notation**.**
We name the classes in Figure 8.3 by
[TABLE]
where is the Adams coordinate and is the –filtration. We use the same notation, but add a superscript to denote evil classes, i.e., . We call this the nature of the class. If multiple classes have the same nature, we distinguish them by a subscript , respectively . The subscript denotes that this is the ’th class from the left in our chart with this nature, counting evil and good separately.
We will use the following lemma.
Lemma 8.6**.**
Let and be elements on the -page of the AKSS, which are in the Adams coordinate and . Suppose firstly that and on the -page of the AKSS, and secondly that the element v_{0}^{3}{\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(7,1:1)} annihilates all elements in the Adams coordinates and . Then implies that .
Proof.
We have a differential d_{1}(v_{1}^{4})=v_{0}^{4}{\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(7,1:1)}. Therefore, on the -page of the AKSS, we have the following Massey products with zero indeterminacies:
[TABLE]
[TABLE]
The first condition implies that the Massey products are well-defined. Note that by -linearity, and imply that . The second condition implies that the Massey products have zero indeterminacies. Note that the Adams bidegree of is zero starting from the -page. Therefore, the lemma follows from Leibniz’s rule of Massey products. ∎
Finally, recall from Proposition 5.6 that if, for the Adams coordinates of , we have . This is illustrated in Figure 8.1.
We begin by establishing families of periodic differentials between good classes. By the Dichotomy Principle there can be no evil classes above the 1/3-line. This reduces the possibilities and allows us to make easy arguments. The differentials established in this region can then be “pulled back” using Lemma 7.10. Further, note that Lemma 7.10 implies that the relevant classes must survive long enough for the differentials stated below to occur.
Proposition 8.7**.**
There is a –periodic family of differentials starting with
[TABLE]
and a –periodic family starting with
[TABLE]
Proof.
is zero in degree . Therefore, the class {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,15:3)} cannot survive. This forces the differential d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(39,14:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,15:3)}. By –linearity, this implies that d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(40,15:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(39,16:3)}. The classes {\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(40,15:1)} and {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(39,16:3)} are –periodic on the –term of the AKSS. By Lemma 8.6, this differential is –periodic (and, therefore, –periodic). The classes {\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(39,14:1)} and {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,15:3)} are –periodic on the –term. The reoccurrence of d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(40,15:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(39,16:3)} and –linearity force the reoccurrence of d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(39,14:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,15:3)}. Therefore, from this point on, the , respectively , multiples of these differentials always occur. We apply Lemma 7.10 with and appropriate values of to pull-back these differentials. For example, using , the differential d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(48,19:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(47,20:3)} implies that d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(16,3:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(15,4:3)} and the differential d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(55,22:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(54,23:3)} implies that d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(23,6:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(22,7:3)}. ∎
Proposition 8.8**.**
There is a –periodic family of differentials starting with
[TABLE]
Proof.
Since is zero in degree , we must have d_{2}({\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(72,23:1)})={\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(71,24:3)}. The classes are –periodic, so as in Proposition 8.7, we apply Lemma 8.6 and Lemma 7.10 with and appropriate values of to conclude the result. ∎
Proposition 8.9**.**
There is a –periodic family of differentials starting with
[TABLE]
Proof.
is zero in degree . This forces the differential d_{2}({\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(45,14:3)})={\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(44,15:5)}. Then, –linearity forces the differential d_{2}({\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(46,15:3)})={\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(45,16:5)}. These classes are –periodic so Lemma 8.6 implies the periodicity of the differential. Finally, Lemma 7.10 with allows us to pull back the differentials. ∎
Proposition 8.10**.**
There is a –periodic family of differentials starting with
[TABLE]
Proof.
This is the same argument as in the proof of Proposition 8.9, using the fact that is zero in degree . ∎
Proposition 8.11**.**
There are –periodic families of differentials starting with
[TABLE]
Proof.
is zero in degree . Therefore, {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,14:4)} cannot survive and this forces the differential d_{2}({\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(39,13:2)})={\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,14:4)}. As in Figure 8.4, let x={\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(36,12:4)}, \partial y={\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(37,13:4)}, \partial h_{1}y={\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,14:4)}, \partial w={\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(39,13:2)} and \partial^{\prime}z={\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(39,13:5)} and note that . The differential having been established, part (2) of Theorem 6.14 implies that . By –linearity, . Then part (1) of Theorem 6.14 implies that .
Note that once the –differential is established, the –differential is a direct consequence of Theorem 6.14. By Lemma 8.6, the -differential is –periodic, and hence, we have the same periodicity for the –differential.
Finally, we use Lemma 7.10 with to pull back these differentials. ∎
Proposition 8.12**.**
There are –periodic families of differentials starting with
[TABLE]
Proof.
This is the same argument as in Proposition 8.11, starting with the fact that is zero in degree , which forces the –differential d_{2}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(53,17:4)})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(52,18:6)}. ∎
Proposition 8.13**.**
There are –periodic families of differentials starting with
[TABLE]
Proof.
This is the same argument as above, starting with the fact that is zero in degree , so that d_{2}({\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(79,25:2)})={\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(78,26:4)}. When applying Lemma 7.10, we use . ∎
Proposition 8.14**.**
There are –periodic families of differentials starting with
[TABLE]
Proof.
This is the same argument as in Proposition 8.11, starting with the fact that is zero in degree , which forces the –differential d_{2}({\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(67,21:6)})={\color[rgb]{0.99,0.76,0.0}\definecolor[named]{pgfstrokecolor}{rgb}{0.99,0.76,0.0}(66,22:8)}. ∎
Proposition 8.15**.**
There is a –periodic family of differentials starting with
[TABLE]
Proof.
These classes are –periodic on the –term of the AKSS, but they lie in the –periodic region of . So we proceed with appropriate care.
The fact that is zero in degrees , , and forces differentials
[TABLE]
We are in a range where the AKSS for is isomorphic to that of . Since , this differential is –linear in the AKSS for , and thus, also in that of . Using Lemma 7.10, we can pull back the differentials as claimed. ∎
Proposition 8.16**.**
There is a –periodic family of differentials starting with
[TABLE]
Proof.
This is an argument similar to Proposition 8.15. is zero in degrees , , and . For degree reasons, the only way the AKSS can realize this is if
[TABLE]
Now apply Lemma 7.10 with . ∎
Remark 8.17**.**
We will see that the only differentials between good classes which have not been accounted for in our range are
[TABLE]
The same methods as above using –periodicity would apply, but would require studying in the stems so we have decided to use direct arguments (see Proposition 8.37).
The calm before the storm : Stems 0-32
In the following subsections, we turn to differentials involving evil classes and the few good differentials our previous analysis missed. We make extensive use of Figure 8.1.
Stem 0-14
Proposition 8.18**.**
There are no non-trivial differentials for in the AKSS in the range . In this range, and
[TABLE]
Proof.
From Figure 8.1, all classes in for are detected by good and there is a bijection between and in this range. ∎
Stems 15-21
Proposition 8.19**.**
There are differentials
[TABLE]
Proof.
The only class in in degree and are detected by evil, therefore, {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(16,2:2)} and {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(18,3:2)} cannot survive, forcing these differentials. ∎
Proposition 8.20**.**
There are differentials
[TABLE]
Proof.
It follows from Figure 8.1 that is detected by \color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(21,3:3)^{ev}. All classes in in degree are accounted for and is zero in . Both {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(21,3:3)} and {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(21,4:3)} must die, and the only possibility is for them to kill evil. ∎
Stem 22-25
Proposition 8.21**.**
There are differentials
[TABLE]
Proof.
The first differential follows from the fact that in bidegree . The class is detected by {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(23,4:4)^{ev}}. It follows that all classes of in have been accounted for, and this forces the differential on {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(23,4;3)}. ∎
Proposition 8.22**.**
There are differentials
[TABLE]
Proof.
After taking into account the good differentials and the restrictions imposed by Figure 8.1 all classes in in stem and have been accounted for. These are the only possibilities left. ∎
Stem 26-27
Proposition 8.23**.**
There are no non-trivial differentials , in the AKSS with source or target satisfying . In these stems, and .
Stem 28-32
Proposition 8.24**.**
There are differentials
[TABLE]
Proof.
By Figure 8.1, both and are detected by evil classes {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(30,4:4)^{ev}} and {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(30,5:5)^{ev}} respectively. This implies that {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(30,4:2)} and {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(30,5:2)} do not survive. Taking into account the good differentials already established, this is the only possibility. ∎
Proposition 8.25**.**
* for are detected by {\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(31,s+1:1)}.*
Proof.
By Figure 8.1, is good so must be detected by {\color[rgb]{0,0,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,1}(31,1:1)}. By –linearity, the whole tower consists of permanent cycles. For degree reasons they cannot be targets of differentials and the claim follows. ∎
Proposition 8.26**.**
There are differentials
[TABLE]
Proof.
Since is detected by an evil class, all elements of in degrees have been accounted for, forcing the first differential. Since is detected by evil, {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(32,2:2)} cannot survive. The is the only possibility. ∎
The proliferation of evil: Stems 33-42
The developing phenomena in the remaining stems is that all good classes of low Adams filtration die killing evil classes, and the non-zero elements of are detected by evil.
Stems 33-34
Proposition 8.27**.**
There are differentials
[TABLE]
Proof.
The class {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(33,7:3)} detects and, in , it is not divisible by . Hence, {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(33,6:3)} and {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(33,5:3)} cannot survive and these differentials are the only possibilities. No element of in is detected by a good class. This forces the –differential. ∎
Proposition 8.28**.**
There are differentials
[TABLE]
Proof.
in degrees , and is either zero, or its elements are detected by evil classes. This forces these differentials. ∎
Stems 35-43
Proposition 8.29**.**
The class is detected by {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(37,5:3)}.
Proof.
Both and are detected by good classes, and for , the only possibility is {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(37,6:3)}. Since there cannot be an exotic -extension from {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(37,5:4)} to {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(37,6:3)}, we must have that is detected by {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(37,5:3)}. ∎
Proposition 8.30**.**
There are differentials
[TABLE]
Proof.
in degrees and is zero and the only non-zero element of in is detected by an evil class. For degree reasons, we must have the first three differentials. ∎
Proposition 8.31**.**
For , there are differentials
[TABLE]
Proof.
In these bi-degrees, is zero or detected by evil. For degree reasons, we must have these differentials. ∎
Proposition 8.32**.**
There are differentials
[TABLE]
and, for , differentials
[TABLE]
Proof.
All classes of in the stems and for are detected by evil. No good class can survive. For both families, the ’s and the ’s are the only possibilities. By –linearity, {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(38,4:2)} is a –cycle, hence it cannot kill {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(37,5:4)}. Therefore, we must have the claimed . The is also the only possibility. ∎
Proposition 8.33**.**
There are differentials
[TABLE]
Proof.
The class cannot {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(36,6:6)} survive since the only non-zero element of in is detected by evil. The only other possibility is that d_{2}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(37,5:4)})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(36,6:6)}. However, this would imply that d_{2}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(45,9:4)})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(44,10:6)}, contradicting Proposition 8.14.
For the –differential, by Proposition 8.29, has already been accounted for, hence, {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(37,5:4)} cannot survive. Proposition 8.32 eliminates the only other possibility. ∎
Proposition 8.34**.**
There are differentials
[TABLE]
and, for ,
[TABLE]
Proof.
is zero in and this justifies the first differential. in and is either detected by evil or zero. Hence, the sources of these differentials cannot survive. Taking –filtration into account, this is the only possibility. The other differentials are justified in a similar way. ∎
Proposition 8.35**.**
There are differentials
[TABLE]
Proof.
The only classes in in degree , and are detected by evil. Because of the –filtrations, this forces the three -differentials.
is zero in degree . Hence the source of the cannot survive. The only other possibility is that d_{2}({\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(44,7:5)})={\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(42,7:7)}. However, this differential would be –periodic, and this would contradict the fact that there is a non-zero element in in degree . ∎
Proposition 8.36**.**
There is a differential
[TABLE]
Proof.
In bidegree , the element in , is either detected by {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(38,7:6)} or by {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,7:3)}. Therefore, one of them supports a nontrivial differential that kills an evil class, and the other one survives.
Suppose that {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(38,7:6)} survives in the AKSS. In bidegree , is the only element in . Further, the only non-zero element in in degree is . We are in a region where and hence maps to in the latter. In particular, is -periodic. This class is above the 1/3-line, and the only element in the AKSS left to detect is {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(78,27:6)}. By the Dichotomy Principle, is good and so must be detected by {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(46,11:6)}. Finally, in , v_{1}^{4}{\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(38,7:6)}={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(46,11:6)}, which implies that (with zero indeterminacy). However, since this bidegree is zero in , a contradiction. ∎
Proposition 8.37**.**
There are differentials
[TABLE]
Proof.
The only class in in degree is detected by {\color[rgb]{0.99,0.76,0.0}\definecolor[named]{pgfstrokecolor}{rgb}{0.99,0.76,0.0}(40,8:8)} so by –linearity, {\color[rgb]{0.99,0.76,0.0}\definecolor[named]{pgfstrokecolor}{rgb}{0.99,0.76,0.0}(41,9:8)} is a permanent cycle. However, in degree is zero. Therefore, the class {\color[rgb]{0.99,0.76,0.0}\definecolor[named]{pgfstrokecolor}{rgb}{0.99,0.76,0.0}(41,9:8)} must be hit by a differential. The only possibility is the –differential.
The only class in in degree is detected by evil. Therefore, {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(42,7:2)} must support a differential. If it kills evil, that differential would be a –differential. We have v_{0}{\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(42,7:2)}={\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(42,8:2)}, so such a would imply that d_{6}({\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(42,8:2)})=0, contradicting what we have just shown. The only possibility is this –differential. ∎
9. Computation of the topological -resolution
In this section, we deduce the differentials in the topological -based Adams spectral sequence from known computations of the stable homotopy groups of spheres (see [Isa14] for example). The computation is depicted in Figure 9.1. We find that certain products in , which are nontrivial extensions in the classical Adams spectral sequence, are products in -page of the -based Adams spectral sequence, and so they are not exotic extensions.
Remark 9.1**.**
In the following computation, we will use the fact that the map from to induces a map of spectral sequences
[TABLE]
In particular, if an element is detected in by a class of Adams filtration , then it must be detected in by a class of –filtration .
It is straightforward to see that there are no differentials up to stem 28.
Stems 29-31
Proposition 9.2**.**
The element {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(30,2:2)} survives and detects .
Proof.
The element {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(30,2:2)} maps to in , which detects . Since there are no elements with -filtration lower than {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(30,2:2)}, by Remark 9.1, {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(30,2:2)} survives and detects . ∎
Proposition 9.3**.**
There are differentials d_{2+\epsilon}({\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(30,3:3)})={\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(29,5:5)^{ev}}, d_{2}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(30,4:4)^{ev}})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(29,6:6)^{ev}} and d_{2-\epsilon}({\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(30,5:5)^{ev}})={\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(29,7:7)}.
Proof.
Since , none of the three elements in the 29-stem can survive. This forces these –differentials. ∎
Proposition 9.4**.**
One of {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(31,3:3)^{ev}_{1}} and {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(31,3:3)^{ev}_{2}} supports a differential that kills {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(30,6:6)^{ev}}, the other one survives and detects . Without loss of generality, we adopt the convention that d_{3}({\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(31,3:3)^{ev}_{1}})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(30,6:6)^{ev}}, and {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(31,3:3)^{ev}_{2}} survives and detects .
Proof.
Since , {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(30,6:6)^{ev}} must be hit by a differential. The only possibility is that it be hit by one of {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(31,3:3)^{ev}_{1}} and {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(31,3:3)^{ev}_{2}} by a –differential. The other one must survive and detect , since the Adams filtration of is . ∎
Corollary 9.5**.**
The element {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(31,5:5)^{ev}} survives and detects .
Stems 32-34
Proposition 9.6**.**
The elements {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(32,2:2)^{ev}}, {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(32,4:4)^{ev}}, {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(32,5:5)^{ev}} and {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(33,3:3)^{ev}} survive and detect , , and respectively. One of the elements {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(33,4:4)^{ev}_{1}} and {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(33,4:4)^{ev}_{2}}, say {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(33,4:4)^{ev}_{1}}, survives and detects . (Note that in the classical Adams spectral sequence, detects .)
Proof.
This follows from Remark 9.1. ∎
Proposition 9.7**.**
There is a differential d_{2}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(33,4:4)^{ev}_{2}})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(32,6:6)^{ev}}. One of the elements {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(33,5:5)^{ev}_{1}} and {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(33,5:5)^{ev}_{2}}, say {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(33,5:5)^{ev}_{1}}, supports a differential that kills {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(32,7:7)^{ev}}. That is, d_{2}({\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(33,5:5)^{ev}_{1}})={\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(32,7:7)^{ev}}.
Proof.
Since all classes in are accounted for, this is the only possibility to kill {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(32,6:6)^{ev}} and {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(32,7:7)^{ev}}. ∎
Proposition 9.8**.**
There is a differential d_{3}({\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(34,2:2)^{ev}})={\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(33,5:5)^{ev}_{2}} and {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(33,6:6)^{ev}} survives to detect .
Proof.
Since is detected by {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(34,2:2)^{ev}} and by {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(33,5:5)^{ev}_{2}} in the algebraic spectral sequence, the differential in the classical Adams spectral sequence implies the first claim and {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(33,6:6)^{ev}} is the only class left to detect . ∎
Corollary 9.9**.**
The elements {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(34,3:3)^{ev}}, {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(34,4:4)^{ev}}, {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(34,6:6)^{ev}}, {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(34,7:7)} survive and detect , , , respectively. (Note that it is that detects in the classical Adams spectral sequence.)
Stems 35-36
Proposition 9.10**.**
The element {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(35,5:5)^{ev}} survives and detects . One of the elements {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(35,7:7)^{ev}_{1}} and {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(35,7:7)^{ev}_{2}}, say {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(35,7:7)^{ev}_{1}}, survives and detects .
Proof.
The first claim follows from Remark 9.1. Since is detected by {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(34,7:7)} with -filtration 7, has -filtration at least 7. (Note that has -filtration 0). Therefore, the only possibility is that one of the elements {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(35,7:7)^{ev}_{1}} or {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(35,7:7)^{ev}_{2}} detects . ∎
Proposition 9.11**.**
d_{2}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(36,4:4)^{ev}})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(35,6:6)^{ev}}. One of the elements {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(36,5:5)^{ev}_{1}} and {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(36,5:5)^{ev}_{2}}, say {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(36,5:5)^{ev}_{1}}, supports a differential that kills {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(35,7:7)^{ev}_{2}}. That is, d_{2}({\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(36,5:5)^{ev}_{1}})={\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(35,7:7)^{ev}_{2}}.
Proof.
Since all classes in are accounted for, this is the only possibility to kill {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(35,6:6)^{ev}} and {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(35,7:7)^{ev}_{2}}. ∎
Proposition 9.12**.**
The element {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(37,3:3)^{ev}_{1}} survives and detects .
Proof.
This follows from Remark 9.1. ∎
Proposition 9.13**.**
The element {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(36,6:6)^{ev}_{1}} survives and detects and there are differentials
[TABLE]
Proof.
The element {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(36,6:6)^{ev}_{1}} maps to in . Since is not a boundary in the classical Adams spectral sequence, {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(36,6:6)^{ev}_{1}} is also not a boundary. Therefore, {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(36,6:6)^{ev}_{1}} survives and detects . The other two differentials are the only possibilities left. ∎
Stems 37-38
Proposition 9.14**.**
The elements {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{1}}, {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(38,5:5)^{ev}_{1}} survive and detect , respectively.
Proof.
The elements {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(38,2:2)^{ev}}, {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,3:3)^{ev}} and {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{2}} map to , and in . Since , and support non-trivial differentials in the classical Adams spectral sequence, so do {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(38,2:2)^{ev}}, {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,3:3)^{ev}} and {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{2}} in the -Adams spectral sequence. By Remark 9.1 and filtration reasons, {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{1}} and {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(38,5:5)^{ev}_{1}} survive and detect and respectively. ∎
Proposition 9.15**.**
The element {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(38,6:6)^{ev}} survives and detects .
Proof.
On one hand, has Adams filtration 6, and therefore -Adams filtration at most 6. On the other hand, and have -Adams filtration 1 and 5, therefore has -Adams filtration at least 6. Therefore, has -Adams filtration 6, and the claim then follows from the fact that {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(38,6:6)^{ev}} is the only element left in -Adams filtration 6 in this stem. ∎
Proposition 9.16**.**
d_{3}({\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(38,5:5)^{ev}_{2}})={\color[rgb]{0.11,0.35,0.02}\definecolor[named]{pgfstrokecolor}{rgb}{0.11,0.35,0.02}(37,8:8)^{ev}}.
Proof.
In , all classes have Adams filtration at most 5, and therefore -Adams filtration at most 5. The target element {\color[rgb]{0.11,0.35,0.02}\definecolor[named]{pgfstrokecolor}{rgb}{0.11,0.35,0.02}(37,8:8)^{ev}} has -Adams filtration 8, therefore must be killed. Since {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(38,6:6)^{ev}} survives, by Proposition 9.14, the only possibility left to kill {\color[rgb]{0.11,0.35,0.02}\definecolor[named]{pgfstrokecolor}{rgb}{0.11,0.35,0.02}(37,8:8)^{ev}} is an element in -Adams filtration 5, say {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(38,5:5)^{ev}_{2}}. ∎
Proposition 9.17**.**
d_{2}({\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(39,3:3)^{ev}_{1}})={\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(38,5:5)^{ev}_{3}}.
Proof.
Every class in has already been accounted for, therefore {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(38,5:5)^{ev}_{3}} must either support a differential or get killed. Suppose it is not killed. Then it can only support a differential that kills {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(37,7:7)^{ev}}. It follows that the elements {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(38,2:2)^{ev}}, {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,3:3)^{ev}}, and {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{2}} kill elements in -Adams filtration 6, 5, 4 respectively. This leaves only one element in stem 37. However, , a contradiction. Therefore, we must have d_{2}({\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(39,3:3)^{ev}_{1}})={\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(38,5:5)^{ev}_{3}}. ∎
Proposition 9.18**.**
The elements {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(39,3:3)^{ev}_{2}}, {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(39,4:4)^{ev}}, {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(39,5:5)^{ev}_{1}}, {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(40,4:4)^{ev}_{1}}, {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(40,4:4)^{ev}_{2}} and {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(40,5:5)^{ev}_{1}} survive and detect , , , , and respectively. (Note that , and are detected by , and in the classical Adams spectral sequence respectively).
Proof.
This follows from Remark 9.1. ∎
Proposition 9.19**.**
There is a differential d_{2}({\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(39,5:5)^{ev}_{2}})={\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(38,7:7)^{ev}}.
Proof.
Since all classes in are accounted for, this is the only possibility left. ∎
Proposition 9.20**.**
There is a differential d_{3}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{2}})={\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(37,7:7)^{ev}}.
Proof.
Since {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{2}} maps to in , it must support a or differential. Suppose that d_{2}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{2}})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(37,6:6)^{ev}}. This would force a differential d_{4}({\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,3:3)^{ev}})={\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(37,7:7)^{ev}} since {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(37,7:7)^{ev}} must be hit by a differential and this is the only possibility. (The element {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(38,2:2)^{ev}} cannot support a differential, since its image in supports a differential.) This would imply that {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(37,7:7)^{ev}} maps to . This is a contradiction since {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(37,7:7)^{ev}} maps to in . Therefore, we must have d_{3}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(38,4:4)^{ev}_{2}})={\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(37,7:7)^{ev}}. ∎
Proposition 9.21**.**
There is a differential d_{3}({\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(38,3:3)^{ev}})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(37,6:6)^{ev}}.
Proof.
The element {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(37,6:6)^{ev}} in -Adams filtration 6 must be killed, since all classes in have Adams filtration at most 5. The other possibility to kill it is by a differential: d_{4}({\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(38,2:2)^{ev}})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(37,6:6)^{ev}}. This would imply that {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(37,6:6)^{ev}} maps to in , which is not the case since it maps to the target of an algebraic –differential (see Proposition 8.32). ∎
Proposition 9.22**.**
There is a differential d_{3}({\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(38,2:2)^{ev}})={\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(37,5:5)^{ev}}. The element {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(37,4:4)^{ev}_{2}} survives and detects . (Note that is detected by in the classical Adams spectral sequence.)
Proof.
The other possibility is that is detected by {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(37,5:5)^{ev}}. Since has Adams filtration 5, this implies that the element {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(37,5:5)^{ev}} maps to in , which would contradict Proposition 8.29 and Proposition 8.32. ∎
Stems 39-42
Proposition 9.23**.**
There are differentials
[TABLE]
The elements {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(41,5:5)^{ev}}, {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(40,6:6)^{ev}_{2}}, {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(41,7:7)^{ev}}, {\color[rgb]{0.99,0.76,0.0}\definecolor[named]{pgfstrokecolor}{rgb}{0.99,0.76,0.0}(40,8:8)}, {\color[rgb]{0.99,0.76,0.0}\definecolor[named]{pgfstrokecolor}{rgb}{0.99,0.76,0.0}(41,8:8)^{ev}}, {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(42,6:6)^{ev}}, {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(42,7:7)^{ev}} and {\color[rgb]{0.99,0.76,0.0}\definecolor[named]{pgfstrokecolor}{rgb}{0.99,0.76,0.0}(42,8:8)^{ev}} survive and detect , , , , , , and respectively.
Proof.
This is the only possibility left. ∎
Proposition 9.24**.**
The elements {\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(39,6:6)^{ev}_{1}} and {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(39,7:7)^{ev}} survive and detect and . Further, there is a differential d_{2}({\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(40,4:4)^{ev}_{3}})={\color[rgb]{0.91,0.33,0.5}\definecolor[named]{pgfstrokecolor}{rgb}{0.91,0.33,0.5}(39,6:6)^{ev}_{2}}.
Proof.
On one hand, has Adams filtration 7, and therefore -Adams filtration at most 7. On the other hand, and have -Adams filtration 1 and 6, therefore has -Adams filtration at least 7. That {\color[rgb]{0.55,0.0,0.55}\definecolor[named]{pgfstrokecolor}{rgb}{0.55,0.0,0.55}(39,7:7)^{ev}} detects follows from the fact that this is the only element in -Adams filtration 7. All classes in are accounted for. Therefore, the element {\color[rgb]{0.2,0.8,0.2}\definecolor[named]{pgfstrokecolor}{rgb}{0.2,0.8,0.2}(40,4:4)^{ev}_{3}} must support a differential, and this is the only possibility. ∎
We finish with a few remarks on the -page.
Remark 9.25** (Stems 8-9).**
Recall that is defined to be the unique class with Adams filtration 3. Also recall that we have a relation in :
[TABLE]
In , is detected by {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(9,3:3)}, since is detected by {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(6,2:2)}. It follows from the above relation that is detected by {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(8,2:2)}. Since is detected by {\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}(8,1:1)}, we have that is also detected by {\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}(8,1:1)}. This is interesting since and are detected by different elements in the classical Adams spectral sequence and is not divisible by .
Remark 9.26** (Stem 14).**
Recall that is defined to be the unique class with Adams filtration 4.
The class {\color[rgb]{1,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,0,0}(14,2:2)} detects both and , since both and have Adams filtration 2, and therefore -Adams filtration at most 2. Therefore, {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(14,3:3)} detects .
Remark 9.27** (Stem 22).**
The class {\color[rgb]{1,.5,0}\definecolor[named]{pgfstrokecolor}{rgb}{1,.5,0}(22,3:3)^{ev}} detects both and , since both and have Adams filtration 4, and therefore -Adams filtration at most 4. Therefore, {\color[rgb]{0,1,1}\definecolor[named]{pgfstrokecolor}{rgb}{0,1,1}\pgfsys@color@cmyk@stroke{1}{0}{0}{0}\pgfsys@color@cmyk@fill{1}{0}{0}{0}(22,5:5)^{ev}} detects .
Recall that in , we have a relation:
[TABLE]
which is both a nontrivial -extension from and a nontrivial -extension from . However, in the -Adams spectral sequence, has -Adams filtration 5, while and have -Adams filtration 2 and 3. Therefore, this relation is present in the -page of the -Adams spectral sequence.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ada 66] J. F. Adams, A periodicity theorem in homological algebra , Proc. Cambridge Philos. Soc. 62 (1966), 365–377. MR 0194486
- 2[And 15] Michael Andrews, The v 1 subscript 𝑣 1 v_{1} -periodic part of the Adams spectral sequence at an odd prime , 2015, Thesis (Ph.D.)–Massachusetts Institute of Technology.
- 3[Beh 12] Mark Behrens, The Goodwillie tower and the EHP sequence , Mem. Amer. Math. Soc. 218 (2012), no. 1026, xii+90. MR 2976788
- 4[BOSS] Mark Behrens, Kyle Ormsby, Nathanial Stapleton, and Vesna Stojanoska, On the ring of tmf cooperations at the prime 2 , Preprint.
- 5[Bru] Robert R. Bruner, The cohomology of the mod 2 steenrod algebra .
- 6[Bru 93] by same author, Ext Ext {\rm Ext} in the nineties , Algebraic topology (Oaxtepec, 1991), Contemp. Math., vol. 146, Amer. Math. Soc., Providence, RI, 1993, pp. 71–90. MR 1224908 (94a:55011)
- 7[Car 80] Gunnar Carlsson, On the stable splitting of b o ∧ b o 𝑏 o 𝑏 o b{\rm o}\wedge b{\rm o} and torsion operations in connective K 𝐾 K -theory , Pacific J. Math. 87 (1980), no. 2, 283–297. MR 592736 (81j:55003)
- 8[CDGM 88] Fred R. Cohen, Donald M. Davis, Paul G. Goerss, and Mark E. Mahowald, Integral Brown-Gitler spectra , Proc. Amer. Math. Soc. 103 (1988), no. 4, 1299–1304.
