VIII. Compression as Grammar
What survives compression is structure.
When you compress an image, you don't keep every pixel. You keep the patterns —
the edges, the gradients, the repeated motifs. The grammar, not the raw data.
A good compression algorithm is like a good ornamental system: it finds the seed
from which the whole can be regenerated.
In 8 dimensions, there's a structure called the E₈ lattice. It's the densest
possible packing of spheres in 8D space — proven optimal by Maryna Viazovska in 2016.
When you compress information to this lattice, you're using the best possible
grammar for 8-dimensional space. No other arrangement is more efficient.
Like the 17 wallpaper groups,
this is not a choice.
It's a theorem.
The lattice is infinite — infinitely many points, infinitely precise.
But when you encode a point, you use only as many "levels" as you need.
Coarse approximation, then refinement, then finer refinement.
Each level is a reflection in the infinity mirror, each one smaller than the last.