# Morava K-theories for dummies?

Professor Urs Würgler passed away one year ago, and his wife engraved his tombstone with "the formula he was the most proud of" :

$B(n)_*(X)\cong P(n)_*(K(n))\square_{\Sigma_n}K(n)_*(X)$

However she doesn't understand it, and she asked me if I can. I can't. But I discovered it is very close to the one in Theorem 3.1 p. 121 of

Urs Würgler "Morava K-theories - a survey" 2006, in Lecture Notes in Mathematics Vol. 1474 DOI:10.1007/BFb0084741

So I tried to understand the wikipedia page on Morava K-theory but it is way above my level (PhD in dynamics and control)

Can anybody try to explain what the formula is about in plain english, or it is definitely too abstract to express in human language ?

• Do you know the names or meaning of any of the symbols? It seems like B and P are natural objects and the formula expresses a nice relation between B and P and K. It might also serve to ask how it is used, or what results it helps prove. I don't see understanding this without becoming a student of K-theory. Gerhard "Also Not A K-Theory Student" Paseman, 2016.11.21. – Gerhard Paseman Nov 21 '16 at 20:38
• Here $B(n)$ and $K(n)$ are homology theories, and the formula is saying that we can compute the $B(n)$-homology of $X$ in terms of the $K(n)$-homology of $X$ (which is a relatively simple invariant, since every $K(n)_*$-module is free). On intuitive terms this is saying that $K(n)$-homology is giving the missing information needed to get from height $n-1$ to height $n$ in the chromatic tower. I don't think I'd be able to explain why it is an important result without describing all of chromatic homotopy theory. – Denis Nardin Nov 21 '16 at 20:59
• The formula is Theorem 3.1 in <a href="download.springer.com/static/pdf/972/…*~hmac=58068dc9fbd8c20239e212b048c1b96ee14d069a1ca5d274553651077477676b">Morava K-theories: a survey</a>. (I am aware that this does not answer the question.) – ThiKu Nov 22 '16 at 7:06
• thanks @DenisNardin . I think your comment should be an answer. By the way the wikipedia article on en.wikipedia.org/wiki/Chromatic_homotopy_theory is a stub in case you'd like to improve it. – Dr. Goulu Nov 22 '16 at 7:57
• @DenisNardin : is "height n in the chromatic tower" the same as the "chromatic level" in ncatlab.org/nlab/show/chromatic+homotopy+theory ? Then I think I begin to have an idea or what it is about. Thanks ! – Dr. Goulu Nov 22 '16 at 8:47

This is a result in algebraic topology, where we study the structure of topological spaces $X$. One early way to do this is to calculate a thing called $H_*(X)$, the ordinary homology of $X$. Later people discovered various "extraordinary homologies", which give more precise information. There are very many different extraordinary homologies, including those called $P(n)_*(X)$, $B(n)_*(X)$ and $K(n)_*(X)$. Of these, $P(0)$ (also called $BP$, or Brown-Peterson homology) is the most powerful, but it is often very hard to calculate. At the other end of the scale, $K(0)$ is the weakest and easiest to calculate. In general $K(n)$ is reasonably easy. Roughly speaking, the information in $P(n+1)$ is the information in $P(n)$ minus the information in $K(n)$, so all the $P(n)$'s are often hard to calculate.
From the definitions, the obvious guess would be that $B(n)$ is only a little easier than $P(n)$. However, this turns out to be wrong: $B(n)$ contains exactly the same information as $K(n)$ (and so is much easier than $P(n)$). If you know $K(n)_*(X)$ then Würgler's theorem allows you to calculate $B(n)_*(X)$, and a different but easier theorem lets you go in the opposite direction.