Greek-letter elements in the stable homotopy of spheres
Anchor (Master): Ravenel 2004 (the Green Book) Ch. 5 (Greek-letter construction, chromatic resolution) and Ch. 4 ($BP_*BP$); Miller-Ravenel-Wilson 1977 (Ann. of Math. 106, 469-516); Smith 1970/Toda 1971 ($V(1)$ and the $\beta$-family); Adams 1966 *On the groups J(X) IV*; Hill-Hopkins-Ravenel 2016 *On the nonexistence of elements of Kervaire invariant one* (Ann. of Math. 184) for $\theta_j$
Intuition Beginner
The homotopy groups of spheres are among the hardest objects in mathematics to compute. Each one is a finite abelian group (away from a single copy of the integers), and the list of these groups looks, at first glance, like noise: no obvious pattern, numbers jumping around with no rhythm. The Greek-letter elements are the discovery that hidden inside this noise are clean, infinite, repeating families — and each family carries a Greek-letter name.
The first family is called the alpha family. Its members are spaced out by a fixed period, and they were the first sign that the chaos was organised. The second family, the beta family, sits one level deeper and repeats with a longer period. The third, the gamma family, is deeper still. Each new Greek letter records a new layer of periodicity that was invisible at the layers above it.
The picture to hold onto is a stack of transparent sheets, one per layer. The alpha sheet shows one repeating pattern. Lay the beta sheet on top and a second, slower pattern appears. The gamma sheet adds a third. Each layer is indexed by a whole number called the chromatic height, and the Greek letters march in step with that number: alpha at height one, beta at height two, gamma at height three.
Visual Beginner
Picture the integers along a horizontal line — these label the dimension of a homotopy group of spheres. Above the line, draw small marks wherever a known family member lands. The alpha marks appear at a steady spacing. The beta marks appear at a wider, slower spacing. The gamma marks are rarer still. Each family is a colour-coded comb, and the combs interleave without colliding.
The point of the picture is that each comb is generated by a single rule. Once you know the period of the alpha comb, every alpha mark is determined. The beta comb has its own period, the gamma comb its own. The whole infinite supply of family members comes from a finite recipe applied over and over, one recipe per height.
Worked example Beginner
Here is the alpha family at a small odd prime, say , described without machinery.
Step 1. Fix the prime . We only track the part of each homotopy group that is a power of in size; the rest is handled prime by prime in the same way.
Step 2. The alpha family produces one element in each dimension of the form minus , that is, in dimensions at this prime. So there is an alpha element in dimension , another in dimension , and so on up the ladder.
Step 3. The size of each alpha element is controlled by a counting rule. At the prime , the element in dimension has order raised to a power that grows slowly with — it ticks up by one each time passes a multiple of . So most alpha elements have order exactly , but every third one is larger.
Step 4. Read off the first few. In dimension the alpha element has order . In dimension it has order . In dimension it has order , because here and the counting rule ticks up. The pattern continues forever, one element per rung.
What this tells us: a single arithmetic rule, tied to ordinary number theory, predicts an infinite list of elements in the homotopy of spheres. The alpha family is the simplest such list, and the deeper Greek letters refine the same idea.
Check your understanding Beginner
Formal definition Intermediate+
Fix a prime and work -locally throughout. The input is the Adams-Novikov spectral sequence 03.12.38, whose -page is , computed over the Hopf algebroid of the Brown-Peterson spectrum 03.13.05. Recall with , and the invariant prime ideals , each a sub-comodule of .
Definition (chromatic comodules). For each set
$$
N^n = BP_*/I_n, \qquad M^n = v_n^{-1} N^n = v_n^{-1}\bigl(BP_*/I_n\bigr),
$$
with and . The short exact sequences of -comodules
$$
0 \to N^n \to M^n \to N^{n+1} \to 0
$$
splice into the chromatic resolution 03.13.06, whose derived spectral sequence (the chromatic spectral sequence) has and converges to .
Definition (Greek-letter map). Each short exact sequence above induces a connecting homomorphism $$ \delta_n : \mathrm{Ext}^{s}{BPBP}(BP_, M^n) \longrightarrow \mathrm{Ext}^{s+1}{BPBP}(BP_, N^{n+1}), $$ and composing the successive connecting maps gives the -th Greek-letter map $$ \widetilde{\delta}^{(n)} : \mathrm{Ext}^{0}{BPBP}(BP_, M^n) \longrightarrow \mathrm{Ext}^{n}{BPBP}(BP_, BP_*). $$ The source consists of the -towers: -comodule primitives in , which are spanned by classes of the form subject to invariance. The images are the Greek-letter elements of height .
Definition (the named families). Writing the Greek letter for the height:
- -family (): , where is the largest power of for which is a primitive of .
- -family (): , with .
- -family (): .
A Greek-letter element is a permanent cycle if it survives the Adams-Novikov differentials to define a non-zero class in .
Counterexamples to common slips
- Not every -tower class is a primitive: the divisibility datum is constrained by the comodule structure of , and a careless numerator like at may fail invariance. The bookkeeping of which fractions are allowed is the technical heart of Miller-Ravenel-Wilson.
- A Greek-letter element can be non-zero on the -page yet die before homotopy. Survival is a separate question from existence in ; the -family survives entirely (image of ), but higher families lose members to differentials.
- The element is , not with empty denominator: the denominator is forced because alone is not a primitive of .
- Greek-letter elements live in the Adams-Novikov , that is , not in the classical Adams . The two spectral sequences detect overlapping but distinct families.
Key theorem with proof Intermediate+
Theorem (Miller-Ravenel-Wilson; -family and the image of ). Fix a prime . The -family $$ \alpha_{t/j} = \widetilde{\delta}^{(1)}\bigl(v_1^{t}/p^{j}\bigr) \in \mathrm{Ext}^1_{BP_BP}(BP_, BP_*) $$ is a complete set of generators of above filtration zero, all of whose members are permanent cycles, and the resulting subgroup of $\pi_\mathbb{S}{(p)}pJ\alpha{t/j}2t(p-1) - 1p^jp^jpt \cdot ppp = 2$).*
Proof. The source is computed directly. By the Hopf-algebroid structure of , the comodule has primitives spanned by the classes with bounded by the invariance condition. The Morava-stabiliser computation of Miller-Ravenel-Wilson identifies this as a sum of cyclic groups , one for each , where for odd and for ; here is the -adic valuation.
Applying the single connecting map of the chromatic short exact sequence followed by of realises as an isomorphism onto the subgroup of of positive stem. This is the chromatic computation of the first line of the Adams-Novikov .
Survival to homotopy is the theorem of Adams [Adams 1966]. The -homomorphism has image whose -primary part, in dimension , is cyclic of order equal to the denominator of (von Staudt-Clausen). Adams proved every such class is detected, and the Adams conjecture (Quillen, Sullivan) shows the image of is a direct summand. Matching dimensions and orders against the computation identifies the -family with class by class, and since consists of permanent cycles, so does the -family.
Bridge. This theorem builds toward the whole chromatic philosophy and appears again in every higher Greek-letter family. The foundational reason the -family is computable is exactly that height one is governed by -periodicity, and -periodicity is the same phenomenon that -theory and the image of detect — this is the central insight that the chromatic filtration generalises height by height. Putting these together, the connecting map that produces is dual to the chromatic short exact sequences, and the same connecting-map machinery, iterated times, generalises to produce the - and -families at heights two and three. The bridge is that the Bernoulli denominators controlling are the height-one shadow of the deeper number-theoretic data — Eisenstein series and modular forms — that govern -periodicity, so the -family is the first visible rung of a ladder that the periodicity theorem [03.12.41-area] climbs through all heights.
Exercises Intermediate+
Advanced results Master
Theorem (chromatic computation of ; Miller-Ravenel-Wilson 1977). For every prime , the positive-stem part of $\mathrm{Ext}^1_{BP_BP}(BP_, BP_)\alphap\mathbb{Z}/p^{j(t)}t \geq 1j(t) = 1 + \nu_p(t)ppJ$.*
This is the height-one base case of the chromatic program. The identification with ties the homotopy of spheres to the arithmetic of Bernoulli numbers and to algebraic -theory 03.08.11, because the denominators of are exactly the orders of the -theoretic -classes.
Theorem (-family at ). For the elements for are non-zero in $\mathrm{Ext}^2_{BP_BP}(BP_, BP_)v_2\pi_*\mathbb{S}_{(p)}\beta_12p^2 - 2p - 2$.*
The proof of survival uses the Smith-Toda spectrum and its -self-map, as in Exercise 6. At and the -family is more delicate: either fails to be a ring spectrum or fails to admit the self-map, and only part of the family survives. The general with larger denominators fill out the rest of subject to the Miller-Ravenel-Wilson divisibility constraints.
Theorem (-family at ). For the -family gives non-zero -periodic classes in $\mathrm{Ext}^3_{BP_BP}(BP_, BP_)\pi_*\mathbb{S}_{(p)}$ (Ravenel-Wilson).*
The -family is the deepest classically constructed family. Its survival analysis requires the Smith-Toda spectrum and a -self-map, which exist only for sufficiently large . The pattern of Smith-Toda spectra realises successive quotients , and the existence of becomes harder as grows — a manifestation of the same obstruction theory the periodicity theorem [03.12.41-area] organises.
Theorem (general height- family). The -th Greek-letter map $\widetilde{\delta}^{(n)}: \mathrm{Ext}^0(M^n) \to \mathrm{Ext}^n(BP_)n\alpha^{(n)}_{t/\ldots}nv_nM^nE_1^{n,s} = \mathrm{Ext}^s(M^n)E_2$-page.*
The uniform construction is the structural payoff: every line of the Adams-Novikov is, in principle, the image of a -tower under an iterated connecting map. The names are the cases ; beyond gamma the families are written or with double-indexed Greek letters, and explicit computation becomes formidable.
Theorem (Kervaire-invariant non-existence; Hill-Hopkins-Ravenel 2016). The Kervaire-invariant elements , the -primary -family-adjacent classes detected by , do not exist for . Classes exist for ; the case (dimension ) is the sole remaining unsettled dimension.
This is the headline modern result downstream of the Greek-letter circle of ideas: a periodicity argument, run on a carefully built -periodic equivariant spectrum, kills an entire would-be infinite family. It demonstrates that the question of which Greek-letter and Greek-letter-adjacent classes survive is genuinely hard and genuinely deep.
Synthesis. The Greek-letter construction is the central insight that the apparent randomness of the stable stems is organised, height by height, by the chromatic filtration, and putting these together gives the structural picture the Green Book is built around. The foundational reason the families exist is exactly that the chromatic resolution splices short exact sequences whose iterated connecting maps carry -towers from up to ; this is dual to the -localisation tower on the topological side. The -family generalises the image of , the -family generalises that to -periodicity through the Smith-Toda spectra, and the bridge is the recognition that survival to homotopy is governed by the same -self-map periodicity that the Hopkins-Smith periodicity theorem [03.12.41-area] makes precise. The whole edifice — chromatic resolution, Greek-letter maps, Smith-Toda spectra, periodicity, and the Kervaire-invariant resolution — is one connected story: the homotopy of spheres is a sum of periodic pieces, one per chromatic height, and the Greek letters are their names.
Full proof set Master
Proposition (degree of the height- Greek-letter element). Let be a -tower primitive. Then its image $\widetilde{\delta}^{(n)}(x) \in \mathrm{Ext}^n_{BP_BP}(BP_, BP_)$ lies in stem* $$ \bigl| \widetilde{\delta}^{(n)}(x) \bigr| = 2t(p^n - 1) - 2\sum_{k=1}^{n-1} i_k (p^k - 1) - n, $$ where the internal degree of the numerator is , each in the denominator subtracts , and the connecting homomorphisms each lower total degree by one.
Proof. The total degree of a class in is measured by the stem , where is the internal degree and the homological degree; the stem is what records the homotopy dimension.
First compute the internal degree of the representing fraction . The Brown-Peterson generators have 03.13.05. The numerator contributes . Each denominator factor contributes , since dividing lowers internal degree; the factor has degree zero and contributes nothing. So the internal degree of is
$$
\deg_{\mathrm{int}}(x) = 2t(p^n - 1) - 2\sum_{k=1}^{n-1} i_k(p^k - 1).
$$
The class sits in , so at this stage the stem equals the internal degree.
Now apply . A connecting homomorphism of a short exact sequence of comodules preserves internal degree and raises homological degree by one. Raising homological degree by one while fixing internal degree lowers the stem by one. Iterating times lowers the stem by while keeping the internal degree fixed at . Therefore $$ \bigl|\widetilde{\delta}^{(n)}(x)\bigr| = \deg_{\mathrm{int}}(x) - n = 2t(p^n - 1) - 2\sum_{k=1}^{n-1} i_k(p^k - 1) - n, $$ as claimed.
Corollary (). Taking , , gives the stem of : $$ |\beta_1| = 2(p^2 - 1) - 2(p - 1) - 2 = 2p^2 - 2p - 2, $$ recovering at and at , consistent with Exercise 2.
Proof. Substitute , into the proposition. The sum . The internal degree is , and subtracting gives . Evaluating: gives ; gives .
Connections Master
The chromatic spectral sequence
03.13.06is the engine that produces every Greek-letter family: its -page supplies the -towers, and its connecting differentials are the Greek-letter maps that send those towers into the Adams-Novikov . Without the chromatic resolution there is no construction; this unit is the catalogue of what that machine outputs at each height.The Brown-Peterson spectrum and its Hopf algebroid
03.13.05provide the coefficient data: the generators with set every degree computed here, and the right-unit formula governs which fractions are comodule primitives. The divisibility bookkeeping of Miller-Ravenel-Wilson is entirely a computation inside .The image of
03.08.11is the height-one Greek-letter family made concrete: the -family equals class by class, tying the homotopy of spheres to Bernoulli-number denominators and to algebraic -theory. This is the one Greek-letter family that was understood long before the chromatic language existed.The Adams-Novikov spectral sequence
03.12.38is the ambient -page in which all Greek-letter elements live; survival to homotopy is a question about its differentials. The lateral comparison with the classical Adams spectral sequence — where the Kervaire classes are detected by — shows the same families seen through two filtrations.
Historical & philosophical context Master
The Greek-letter notation was introduced by Miller, Ravenel, and Wilson in their 1977 Annals paper [Miller-Ravenel-Wilson 1977], which crystallised a decade of work on periodic phenomena in stable homotopy. The -family had a longer prehistory: it is the image of the -homomorphism, computed by Adams in his 1966 series of papers [Adams 1966], where the link to Bernoulli numbers and the denominators of first appeared. The -family emerged from Smith's and Toda's construction of the spectra around 1970 [Smith 1970], realising the quotients and their self-maps. What Miller-Ravenel-Wilson added was the organising principle: a single chromatic resolution whose iterated connecting maps produce every family uniformly, one Greek letter per height, transforming a collection of ad hoc constructions into a systematic theory.
Philosophically, the Greek-letter program embodies a shift from computation to structure. Before the chromatic viewpoint, the homotopy groups of spheres were a table of numbers to be extended dimension by dimension. After it, the table became a superposition of periodic layers, each with its own arithmetic — -theory and Bernoulli numbers at height one, modular forms and elliptic curves at height two. Ravenel's Green Book [Ravenel 2004] is the canonical synthesis. The culmination of this structural turn is the Hill-Hopkins-Ravenel resolution of the Kervaire invariant problem [Hill-Hopkins-Ravenel 2016]: a periodicity argument, descended from the same circle of ideas, settling a fifty-year-old geometric question about framed manifolds by showing that an entire would-be family of homotopy elements simply does not exist.
Bibliography Master
@article{MillerRavenelWilson1977,
author = {Miller, Haynes R. and Ravenel, Douglas C. and Wilson, W. Stephen},
title = {Periodic phenomena in the {Adams}-{Novikov} spectral sequence},
journal = {Annals of Mathematics},
volume = {106},
number = {3},
pages = {469--516},
year = {1977},
}
@book{Ravenel2004,
author = {Ravenel, Douglas C.},
title = {Complex Cobordism and Stable Homotopy Groups of Spheres},
edition = {2nd},
publisher = {AMS Chelsea Publishing},
year = {2004},
note = {The Green Book; Ch. 4 (BP and BP_*BP), Ch. 5 (chromatic spectral sequence, Greek-letter elements)},
}
@article{Adams1966,
author = {Adams, J. F.},
title = {On the groups {$J(X)$}, {IV}},
journal = {Topology},
volume = {5},
pages = {21--71},
year = {1966},
}
@article{Smith1970,
author = {Smith, Larry},
title = {On realizing complex bordism modules: applications to the stable homotopy of spheres},
journal = {American Journal of Mathematics},
volume = {92},
pages = {793--856},
year = {1970},
}
@article{HillHopkinsRavenel2016,
author = {Hill, Michael A. and Hopkins, Michael J. and Ravenel, Douglas C.},
title = {On the nonexistence of elements of {Kervaire} invariant one},
journal = {Annals of Mathematics},
volume = {184},
number = {1},
pages = {1--262},
year = {2016},
}