Skip to content
The Lumenary

Each worksheet prints cleanly on A4 or Letter. Answer keys are on a separate page.

The Lumenary · Research pathways

Stable homotopy theory and generalised cohomology

Name: ______________________

Date: ______________________

You will learn to

  • Explain stabilisation through the Freudenthal suspension theorem, read off stable stems from the table of homotopy groups of spheres, and explain why stable groups are abelian and (in positive degrees) finite
  • Define spectra and generalised cohomology theories, state Brown representability, and give ordinary cohomology, K-theory and cobordism as examples that are not ordinary cohomology with any coefficients
  • Prove that Stiefel–Whitney numbers are cobordism invariants, describe Thom's identification of cobordism with the homotopy of Thom spectra, and use it to decide which real projective spaces bound
  • Describe the J-homomorphism and the Adams spectral sequence, and connect Bernoulli numbers to the stable stems and to exotic spheres
  • Define formal group laws and their height, compute the heights of the additive and multiplicative laws, and outline chromatic homotopy theory, separating established results from open problems
  1. 1.

    By the Freudenthal suspension theorem, πn+k(Sn)→πn+k+1(Sn+1)\pi_{n+k}(S^n) \to \pi_{n+k+1}(S^{n+1}) is an isomorphism when n>k+1n > k + 1. What is the smallest nn for which πn+6(Sn)\pi_{n+6}(S^n) is guaranteed to equal the stable stem π6s\pi_6^s?

  2. 2.

    Why is complex K-theory KU∗KU^* not isomorphic to ordinary cohomology H∗(−;A)H^*(-; A) for any abelian group AA?

    • A.KU−2(pt)≅Z≠0KU^{-2}(\mathrm{pt}) \cong \mathbb{Z} \ne 0, whereas Hn(pt;A)=0H^{n}(\mathrm{pt}; A) = 0 for every n≠0n \ne 0.
    • B.K-theory fails the exactness axiom.
    • C.K-theory has a product and ordinary cohomology does not.
    • D.KU0(X)KU^0(X) is infinite for every non-empty XX, and H0(X;A)H^0(X; A) is finite.
  3. 3.

    In the proof that Stiefel–Whitney numbers of a boundary M=∂WM = \partial W vanish, we wrote wI[M]=⟨i∗wI(W),∂[W,M]⟩=⟨δi∗wI(W),[W,M]⟩=0w_I[M] = \langle i^* w_I(W), \partial[W, M] \rangle = \langle \delta i^* w_I(W), [W, M] \rangle = 0. Which fact justifies the final equality?

    • A.In the long exact sequence of the pair (W,M)(W, M), the composite δ∘i∗\delta \circ i^* of consecutive maps is zero.
    • B.The Whitney sum formula.
    • C.MM is orientable.
    • D.Hn+1(M)=0H^{n+1}(M) = 0 because MM has dimension nn.
  4. 4.

    Which of these closed manifolds are boundaries of compact manifolds? (Choose all that apply.)

    • A.RP3\mathbb{R}P^3
    • B.RP4\mathbb{R}P^4
    • C.RP2×RP2\mathbb{R}P^2 \times \mathbb{R}P^2
    • D.RP2×RP1\mathbb{R}P^2 \times \mathbb{R}P^1
  5. 5.

    The image of the J-homomorphism in π11s\pi_{11}^s is cyclic of order the denominator of B6/12B_6 / 12, where B6=142B_6 = \tfrac{1}{42}. What is this order?

  6. 6.

    Over F3\mathbb{F}_3, what is the 33-series [3]F(x)[3]_F(x) of the multiplicative formal group law F(x,y)=x+y+xyF(x, y) = x + y + xy, and what is its height?

    • A.[3](x)=x3[3](x) = x^3; height 1.
    • B.[3](x)=3x=0[3](x) = 3x = 0; height ∞\infty.
    • C.[3](x)=x9[3](x) = x^9; height 2.
    • D.[3](x)=3x+3x2+x3[3](x) = 3x + 3x^2 + x^3; height 0.
  7. 7.

    Which Lean statement formalises 'the multiplicative formal group law has height 1 at the prime pp' as it is proved in this lesson?

    • A.nSeries mulFGL p (X : (ZMod p)[X]) = X ^ p
    • B.nSeries mulFGL p (X : ℤ[X]) = X ^ p
    • C.nSeries addFGL p (X : (ZMod p)[X]) = X ^ p
    • D.IsFormalGroupLaw (mulFGL (A := ZMod p))
  8. 8.

    By Thom's theorem, dim⁡F2Nn\dim_{\mathbb{F}_2} \mathfrak{N}_n is the number of partitions of nn into parts not of the form 2k−12^k - 1 (that is, avoiding 1,3,7,15,…1, 3, 7, 15, \dots). What is dim⁡N6\dim \mathfrak{N}_6?

  9. 9.

    Write image_of_j(k) returning the denominator of B2k/(4k)B_{2k}/(4k), computing the Bernoulli numbers exactly with fractions.Fraction from the recurrence ∑j=0m(m+1j)Bj=0\sum_{j=0}^{m} \binom{m+1}{j} B_j = 0 (m≥1m \ge 1, B0=1B_0 = 1). Check that it gives 24,240,504,48024, 240, 504, 480 for k=1,2,3,4k = 1, 2, 3, 4.

    Computational — Practice

Code: Apache-2.0 · Content: CC BY-SA 4.0