Integral Octonions (Part 6)

## Integral Octonions (Part 6)

#### John Baez

You can add and subtract integers. You can multiply them. You can also think about them geometrically, as a lattice in the real line.

The same is true for the Gaussian integers in the complex plane:

or, for that matter, the Eisenstein integers:

Things get even more interesting for the quaternions and octonions. There are various different concepts of 'integer' for these number systems, but I'm especially interested in the so-called 'Cayley integral octonions', because they're the most exotic and mysterious of the lot.

When it comes to their additive and geometrical aspects, the Cayley integers look just like the $$\mathrm{E}_8$$ lattice in an 8-dimensional Euclidean vector space, rescaled so that the shortest nonzero vectors have length 1. In Parts 3, 4 and 5 of this series we studied these aspects in loving detail. Now I'd like to finally get around to discussing the multiplicative structure of the Cayley integers.

First, let's remember how to multiply octonions!

The octonions are an 8-dimensional real vector space with a basis given by 1 and seven square roots of -1 called $$e_1, \dots, e_7$$. Multiplying anything by 1 does the obvious thing. Squaring a square root of -1 does the obvious thing. So all we need to know is how to multiply two different guys $$e_i$$ and $$e_j$$. And for this, you can just draw a little chart:

This is a picture of the Fano plane, a projective plane with 7 points and 7 lines, where we count the circle containing $$e_1,e_2,e_4$$ as an honorary 'line'. Each line contains 3 points, and each of these triples is equipped with a cyclic order as indicated by the arrows. The rule is that if $$e_i, e_j, e_k$$ are cyclically ordered in this way, we define

$$e_i e_j = e_k = -e_j e_i$$

So, for example, $$e_4$$ times $$e_6$$ is $$e_3$$, but $$e_2$$ times $$e_7$$ is $$-e_1$$.

If you think it's hard to remember this chart, you're wrong!

First of all, it doesn't matter what names we give to the 7 points. We could name them after the 7 dwarves in the Disney version of Snow White if we wanted — though we'd probably get sued for copyright infringement. The only reason this particular numbering scheme is nice is that with this scheme we get

$$e_i e_j = e_k \quad \implies \quad e_{i+1} e_{j+1} = e_{k+1}$$

where we work mod 7, and

$$e_i e_j = e_k \quad \implies \quad e_{2i} e_{2j} = e_{2k}$$

where doubling the indices mod 7 rotates the picture a third of a turn. But these cute facts only come in handy if you spend a lot of time multiplying octonions. Since I try to work at a higher level of abstraction whenever possible, I rarely need them.

Second of all, it doesn't matter whether all your little arrows go counterclockwise or clockwise, as long as your consistent.

Third of all, it doesn't whether your little arrows point from the corners of the equilateral triangle to the midpoints of the opposite sides, or vice versa.

Puzzle 1. Prove that if we reverse the arrows on the lines connecting the corners of the equilateral triangle to the midpoints of the opposite sides, we get a new multiplication that is isomorphic to the old one.

So, there's not as much arbitrary baloney to remember as you might think! Anyone can remember how to multiply octonions, and I'm surprised they're not taught in elementary school right after category theory.

Various lattices in the octonions present themselves as possible octonionic analogues of the integers, but the best candidate is the least obvious. Let's run through them all, following the book by Conway and Smith.

Starting with the most obvious, the Gravesian integers are octonions of the form

$$a = a_0 + \sum_{i=1}^7 a_i e_i$$

where all the coefficients $$a_i$$ are integers. The Kleinian integers are octonions where the $$a_i$$ are either all integers or all half-integers. Both these are lattices closed under multiplication, but they're not the densest possible lattices with this property.

To get a denser lattice, first pick a line in the chart above. Then, take all integral linear combinations of

• Gravesian integers,
• octonions of the form $$\frac{1}{2}(\pm 1 \pm e_i \pm e_j \pm e_k)$$ where $$e_i$$, $$e_j$$ and $$e_k$$ lie on this line, and
• octonions of the form $$\frac{1}{2}( \pm e_p \pm e_q \pm e_r \pm e_s)$$ where $$e_p, e_q, e_r, e_s$$ all lie off this line.

Conway and Smith call the resulting lattice the double Hurwitzian integers. Actually we get 7 isomorphic copies of the double Hurwitzian integers this way, one for each line. It's easy to see that any one of these — hence all of them — are closed under multiplication.

But we can do better! We can get even denser lattices that are closed under multiplication!

One obvious guess is to take the union of all 7 copies of the double Hurwitzian integers. This gives a collection of octonions called the Kirmse integers. It's a copy of our beloved $$\mathrm{E}_8$$ lattice: the densest possible lattice packing of balls in 8 dimension, where each ball touches 240 others!

Be careful: in earlier posts, we used at a version of the $$\mathrm{E}_8$$ lattice where the shortest vectors had length $$\sqrt{2}$$. Now it's been rescaled so they're unit vectors. It's also been rotated in some sneaky way. But apart from that, it's still our friend $$\mathrm{E}_8$$.

To see a hint of why this is true, let's count the lattice vectors of norm one:

• First, we have $$\pm e_i$$ for $$i=0, \dots ,7$$. There are $$2 \times 8 = 16$$ vectors of this form.
• Second, we have $$\frac{1}{2}(\pm 1 \pm e_i \pm e_j \pm e_k)$$ where $$e_i$$, $$e_j$$ and $$e_k$$ all lie on some line in the Fano plane. There are $$2^4 \times 7 = 112$$ of these.
• Third, we have $$\frac{1}{2}( \pm e_p \pm e_q \pm e_r \pm e_s)$$ where $$e_p, e_q, e_r, e_s$$ all lie off some line. There are $$2^4 \times 7 = 112$$ of these.

So, we indeed get a total of $$16 + 112 + 112 = 240$$.

Puzzle 2. Show the Kirmse integers are not closed under multiplication!

Curiously, I had just been thinking about this back in 2003 when I got Conway and Smith's book in my mail. After checking a couple of cases, I'd jumped to the conclusion that this set of octonions is closed under multiplication. I was shocked to read that it is not. But I was comforted to hear that I was not the first to make this mistake! According to Coxeter, a fellow named Johannes Kirmse published this erroneous claim, and the term 'Kirmse integers' is just a way of needling this poor guy for the rest of time.

To fix Kirmse's mistake, we need to perform a curious trick. Pick a number $$j$$ from 1 to 7. Then, take all the Kirmse integers

$$a = a_0 + \sum_{i=1}^7 a_i e_i$$

and switch the coefficients $$a_0$$ and $$a_j$$. The resulting lattice is just a reflected version of the Kirmse integers, so it's still a copy of $$\mathrm{E}_8$$. But bizarrely, it's now closed under multiplication!

We call this lattice the Cayley integers. But since this trick involved an arbitrary choice, there are 7 different copies of the Cayley integers containing the Gravesian integers. And this is as good as it gets: each one is maximal among lattices closed under multiplication!

Using the Cayley integers, we can define 'integral forms' of many algebraic gadgets related to the octonions. We get a lot of interesting stuff. Some of it is related to the Leech lattice! So, I hope that someday we'll get a good connection between the octonions and monstrous moonshine.

There's a lot more to say, but I think I'll stop here, with a big puzzle I don't know the answer to:

Puzzle 3. Find a deeper explanation of the Cayley integers, perhaps by avoiding the arbitrary choice, or describing an interesting algebraic structure that involves all 7 choices.

Also, a few smaller puzzles:

Puzzle 4. Let $$\mathbf{O}_i$$ where $$i = 1,\dots 7,$$ be the seven different kinds of Cayley integers. Show that the intersection $$\mathbf{O}_1 \cap \cdots \cap \mathbf{O}_7$$ is precisely the set of Kleinian integers.

Puzzle 5. Let $$\mathbf{O}_i \mathbf{O}_j$$ be the set of all products $$x y$$ where $$x \in \mathbf{O}_i$$ and $$y \in \mathbf{O}_j$$. Show that if $$i \ne j$$, then $$\mathbf{O}_i \mathbf{O}_j \nsubseteq \mathbf{O}_k$$ for all $$k = 1, \dots, 7$$.

Puzzle 6. Show that if $$i \ne j$$, the set $$\mathbf{O}_i \mathbf{O}_j$$ is not a lattice.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 2, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8449165225028992, "perplexity": 385.73047065318474}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-13/segments/1490218190134.25/warc/CC-MAIN-20170322212950-00004-ip-10-233-31-227.ec2.internal.warc.gz"}