Universal Kernel

Troisième partie · En montant la tourChapitre 12

Où se rencontrent les deux parents

Where the two parents meet

Read from the draft of 2 October 2026

a shortest vector:one of the 21 half-turnsa report: an observer vector(28 pairs of the next length)corners: the signs ofan orthonormal frame;its 24 rotations arethe report groupclock = cubeaxis = half-turnreport = diagonalmeeting: product ±√−7one step outthe lift’s tree: + a space of vectors (sl2 over F7)Mumford’s tree: + a doublet over F7 (spinors, 2π ↦ −1)Sym2: doublet → vectors; Weil: doublet → 4 ⊕ Klein’s 3
Plate 12.1The neighbour MpM_p of Klein’s lattice through a point pp: its stabilizer turns the cube ±u1±u2±u3\pm u_1\pm u_2\pm u_3, whose three four-fold axes are the half-turns about vectors of norm 2 and whose four diagonals are vectors of norm 3, antiflags.
  1. 12.1
  2. 12.2
  3. 12.3
  4. 12.4
  5. 12.5
  6. 12.6
  7. 12.7
  8. 12.8
  9. 12.9
  10. 12.10

The group of order 168 has two arithmetic parents at 7, which share the projective line over F₇ and not its completion. What do they share beyond the finite line, and what separates them?

The group of order 168 has two arithmetic parents at 7. One is the group of the congruence link complement, SL⁡(2,Z[ω])\SL(2,\Z[\omega]) with ω\omega a primitive cube root of unity, defined over Q(−3)\Q(\sqrt{-3}) and Lorentzian at its real place. The other is Mumford’s, defined over E=Q(−7)E=\Q(\sqrt{-7}) and compact at its real place. Each reduces at a prime above 7 onto the group of order 168 acting on P1(F7)\Proj^1(\F_7), and each has a tree at 7 whose link at a vertex is that line. They share the line and not its completion.

Throughout, OE=Z[α]\mathcal O_E=\Z[\alpha] with α=(−1+−7)/2\alpha=(-1+\sqrt{-7})/2, hh is Mumford’s Hermitian form, and L∞L_\infty is Klein’s lattice with its group G0≅PSL⁡(2,7)G_0\cong\PSL(2,7). Its vertex in the building Δ2\Delta_2 of PGL⁡3(Q2)\PGL_3(\Q_2) is v0v_0, its vertex in Mumford’s tree T7T_7 is Λ∞\Lambda_\infty, and Λ0=OL\Lambda_0=\mathcal O_L is the neighbouring vertex of the second type.

The chapter finds the finite geometry of the first part among the short vectors of Klein’s lattice and its neighbours, where both lives of the group meet. One step beyond the link the two trees part: the layer of one is the symmetric square of the layer of the other, and the object of the points of the Fano plane is carried along one tree in exactly one way and along the other in none. The parents can then be joined only by a fiber product, and the octonion table, carried with its signs around the loops of the scale tree, is followed first by one map and then observer by observer.

The central result · The object of the points on the two trees

Write X7X_7 for the object of size 7 with stabilizer S4aS_4^a, the points of the Fano plane together with its lines, and X7′X_7' for the object with stabilizer S4bS_4^b. Both are rigid, and the outer automorphism of the group exchanges them. Place at each vertex of a tree at 7 an incarnation of X7X_7 on its link, and carry it across each step.

(1) On the tree of the link complement every mixed square twists the incarnation by an element of PSL⁡(2,7)\PSL(2,7). The twisted incarnation is again one of X7X_7, and since X7X_7 is rigid it is joined to the untwisted one by exactly one seam. So the seam system exists and is unique, and its gauge group N(S4a)/S4aN(S_4^a)/S_4^a is trivial.

(2) On Mumford’s tree the central element of Sp(N)\mathrm{Sp}(N) twists the incarnation at the next vertex by an involution outside PSL⁡(2,7)\PSL(2,7). Conjugation by such an element carries the seven groups S4aS_4^a onto the seven groups S4bS_4^b, and the octonion table x+{0,1,3}x+\{0,1,3\} onto its mirror x+{0,4,6}x+\{0,4,6\}. So the twisted incarnation is one of X7′X_7', no seam joins it to the untwisted one, and there is no seam system of X7X_7 over Mumford’s tree.

(3) Along Mumford’s building, at a vertex of the type of Λ0\Lambda_0, every element acts on the link through PSL⁡(2,7)\PSL(2,7), so the incarnation is carried. Along a slice through Klein vertices every move from one Klein vertex to another at distance two acts improperly: the groups S4aS_4^a of the second are the groups S4bS_4^b of the first, and, labelled by the Singer cycle, one carries the table and the other its mirror.

Proof

(1) The mixed squares on the link complement’s tree act by even permutations, and a rigid object has exactly one seam between any two of its incarnations. (2) The mixed squares on Mumford’s tree contain the central element, which acts on the link of each neighbour as an involution of PGL⁡(2,7)\PGL(2,7) outside PSL⁡(2,7)\PSL(2,7). That an improper element exchanges the two classes of S4S_4 is classical and was checked, and the exchange of the table and its mirror agrees with the Weil representation’s. (3) Every move between Klein vertices is odd, while the group acts on the link of Λ0\Lambda_0 through PSL⁡(2,7)\PSL(2,7).

Status

Every result of the chapter is proved by hand or computed exactly. The dictionary at Klein’s lattice, the doublet and its symmetric square, the mixed squares, the residual of a holonomy, the two transports and the clock-keeping transport were computed in exact arithmetic over Q(−7)\Q(\sqrt{-7}), Q(ω)\Q(\omega) and the integral octonions. The lemma on arrows, the density of the link complement’s group at every scale, the absence of a glue across scales, the meeting condition and the absence of a quotient of order two are proved by hand. Two items were found only after their computation was set up: the third part of the lemma on the residual, and the simple connectivity of the Coxeter graph with its heptagons as faces.

Two expectations failed and are kept: neighbours in the Coxeter graph are orthogonal in Klein’s lattice only modulo −7\sqrt{-7}, and the two transported tables share the Cayley form of left type, not the one built from the triple cross product. Klein’s lattice and its group are classical (Elkies after Gross, Allcock and Kato, Nebe), as are Goursat’s lemma, Serre’s theorem on the congruence subgroup problem, the theory of trees, the Iwahori–Bruhat decomposition and Weil’s representation. The dictionary at Klein’s lattice and the seam systems on the two trees were not found in the sources consulted. Its physical reading is the volume’s, in Chapter XVIII.

Le réseau de Klein chez ses voisinsKlein’s lattice at its neighbours

a shortest vector:one of the 21 half-turnsa report: an observer vector(28 pairs of the next length)corners: the signs ofan orthonormal frame;its 24 rotations arethe report groupclock = cubeaxis = half-turnreport = diagonalmeeting: product ±√−7one step outthe lift’s tree: + a space of vectors (sl2 over F7)Mumford’s tree: + a doublet over F7 (spinors, 2π ↦ −1)Sym2: doublet → vectors; Weil: doublet → 4 ⊕ Klein’s 3
Plate 12.1The neighbour MpM_p of Klein’s lattice through a point pp: its stabilizer turns the cube ±u1±u2±u3\pm u_1\pm u_2\pm u_3, whose three four-fold axes are the half-turns about vectors of norm 2 and whose four diagonals are vectors of norm 3, antiflags.

Read the Fano plane as P(L∞/αL∞)\Proj(L_\infty/\alpha L_\infty), the link of v0v_0 in the building at 2. For a point pp let MpM_p be the neighbour of L∞L_\infty at (α)(\alpha) through pp. It is a standard lattice, with an orthonormal basis u1,u2,u3u_1,u_2,u_3, and the stabilizer of pp, a group S4S_4, turns it as the rotations of the cube with vertices ±u1±u2±u3\pm u_1\pm u_2\pm u_3.

The cube’s axes and diagonals are vectors of Klein’s lattice. Each αˉuk\bar\alpha u_k has norm 2, and its reflection is the half-turn about uku_k; read modulo (α)(\alpha) that half-turn is a transvection of the Fano plane, and modulo −7\sqrt{-7} a half-turn of the conic. The four diagonals have norm 3 and are antiflags, and the pair of conic points of an antiflag is the pair its elements of order three fix. So the flags are the pairs of vectors of norm 2, the antiflags the pairs of vectors of norm 3, and both lives of the group of order 168 are visible at one vertex.

Theorem(Klein’s lattice at its neighbours) computed

(1) MpM_p has an orthonormal basis u1,u2,u3u_1,u_2,u_3. The stabilizer of pp in G0G_0, a group S4S_4, preserves MpM_p and acts on it as the 24 signed permutation matrices of determinant one, the rotation group of the cube with vertices ±u1±u2±u3\pm u_1\pm u_2\pm u_3.

(2) For each kk the vector v=αˉukv=\bar\alpha u_k lies in L∞L_\infty and has norm 2, and sv(x)=−x+h(x,v)vs_v(x)=-x+h(x,v)v is the half-turn x↦−x+2h(x,uk)ukx\mapsto-x+2h(x,u_k)u_k about uku_k. The flag of vv is (p,ℓ)(p,\ell) with ℓ\ell a line through pp, and (p,k)↦±v(p,k)\mapsto\pm v is a bijection from the 21 flags onto the 21 pairs of vectors of norm 2. Modulo (α)(\alpha), svs_v is the transvection with centre pp and axis ℓ\ell: it fixes the points of ℓ\ell and moves every other point aa to a+pa+p. Modulo −7\sqrt{-7} it is the half-turn about the interior point vˉ\bar v of the conic.

(3) The four diagonals d=u1±u2±u3d=u_1\pm u_2\pm u_3 lie in L∞L_\infty and have norm 3. They are the antiflags (p,L)(p,L) with L=(d mod αˉ)⊥L=(d\bmod\bar\alpha)^\perp. Their pairs of points on the conic are disjoint and cover it, and S4S_4 moves the eight points of the conic as the rotations move the vertices of the cube.

(4) The eight points of the conic are the eight neighbours of L∞L_\infty in T7T_7. One of them is Λ0\Lambda_0, with stabilizer F21=⟨ζ, ζ↦ζ2⟩F_{21}=\langle\zeta,\ \zeta\mapsto\zeta^2\rangle, and the antiflags whose pairs contain it lie one through each point of the plane. Labelling the points by x∈Z/7x\in\Z/7 along the Singer cycle ζ\zeta, the lines are the translates x+{0,1,3}x+\{0,1,3\}, and ζ↦ζ2\zeta\mapsto\zeta^2 acts as x↦2xx\mapsto2x.

(5) For antiflags w,w′w,w', ∣h(w,w′)∣2\lvert h(w,w')\rvert^2 is 7,4,2,1 at distance 1,2,3,4 in the Coxeter graph. Neighbours have h(w,w′)=±−7h(w,w')=\pm\sqrt{-7}: they are orthogonal modulo −7\sqrt{-7}, not in L∞L_\infty. The involution of G0G_0 fixing two neighbours (p,L)(p,L) and (q,M)(q,M) is svs_v with flag (p+q,{p,q,p+q})(p+q,\{p,q,p+q\}), and vv is orthogonal to both.

Proof

By direct computation in exact arithmetic over EE. The neighbours MpM_p are standard, and an orthonormal basis was found with the 24 stabilizing elements written in it. The half-turn about uku_k is an isometry of MpM_p of determinant one, so it is an involution of G0G_0; its fixed line is that of uku_k, and among the minimal vectors of L∞L_\infty exactly ±αˉuk\pm\bar\alpha u_k lie on it. Modulo (α)(\alpha), sv(x)≡x+h(x,v)vs_v(x)\equiv x+h(x,v)v, and h(⋅,v)h(\cdot,v) reduces to the functional of the line of vv, so svs_v is the transvection x↦x+f(x)px\mapsto x+f(x)p. Membership was tested for all 28 diagonals, the neighbours at 7 were computed as the sublattices of the second type of colength one, and all 378 pairs of antiflags were classified by Coxeter distance.

Les demi-tours des facesFace half-turns

01∞z ↦ z + 1parabolicat 1parabolicat 0icomposite:z ↦ −1/z,half-turn about i
Plate 12.2The ideal face (0,1,∞)(0,1,\infty) in the upper half-plane: the parabolic elements at its three cusps compose to z↦−1/zz\mapsto-1/z, a half-turn about ii that exchanges the base pair {0,∞}\{0,\infty\}.

The faces of the congruence link complement meet this dictionary through their holonomy. A face FF is an ideal triangle of the tessellation; take it with a base pair x={a,b}x=\{a,b\} of its cusps and third cusp cc, and let σ(F,x)∈PSL⁡(2,7)\sigma(F,x)\in\PSL(2,7) be the reduction modulo p\mathfrak p of the product of the three parabolic elements fixing the cusps of FF, taken around FF from xx. It is the half-turn that Gauss and Bonnet give a triangle of area π\pi.

At the face {0,1,∞}\{0,1,\infty\} with base pair {0,∞}\{0,\infty\} the half-turn is z↦−1/zz\mapsto-1/z. It exchanges 0 and ∞\infty and sends 1 to −1=6-1=6, the harmonic conjugate of 1 with respect to {0,∞}\{0,\infty\}. The pair {1,6}\{1,6\} is a neighbour of {0,∞}\{0,\infty\} in the Coxeter graph, and z↦−1/zz\mapsto-1/z is the involution of that edge: in Klein’s lattice, the reflection in a vector of norm 2 orthogonal to both antiflags.

Proposition(Face half-turns are Coxeter meetings) proved

(1) PSL⁡(2,7)\PSL(2,7) acts simply transitively on the 168 pairs (face, base pair), and σ\sigma is PGL⁡(2,7)\PGL(2,7)-covariant; at ({0,1,∞},{0,∞})(\{0,1,\infty\},\{0,\infty\}) it is z↦−1/zz\mapsto-1/z. (2) σ(F,x)\sigma(F,x) is the unique involution of PSL⁡(2,7)\PSL(2,7) that exchanges aa and bb and sends cc to its harmonic conjugate c′c' with respect to {a,b}\{a,b\}. (3) y={c,c′}y=\{c,c'\} is a neighbour of xx in the Coxeter graph, and σ(F,x)\sigma(F,x) is the involution of that edge. In Klein’s lattice it is svs_v with vv orthogonal to the antiflags wxw_x and wyw_y, and the flag of vv is (p+q,{p,q,p+q})(p+q,\{p,q,p+q\}), where pp and qq are the points of the antiflags xx and yy. (4) Each edge of the Coxeter graph arises from 4 pairs (face, base pair), and each of the 21 involutions from 8.

Proof

(1) The tessellation and the parabolic elements are PGL⁡(2,7)\PGL(2,7)-covariant, so σ\sigma is equivariant; exchanging the two base points changes the PSL⁡\PSL-orbit of an ordered triple, since z↦1/zz\mapsto1/z has non-square determinant. (2) At the base pair the involutions exchanging 0 and ∞\infty are z↦k/zz\mapsto k/z with kk a non-square, and k/1=−1k/1=-1 forces k=−1k=-1; the property is PGL⁡(2,7)\PGL(2,7)-covariant. (3) Harmonicity is symmetric, so the two pairs are disjoint harmonic pairs, which is an edge of the Coxeter graph; the involution is that of the dictionary’s part (5), and all 168 pairs were checked exactly. (4) 168/42=4168/42=4 and 42/21=242/21=2.

Un doublet et son carré symétriqueA doublet and its symmetric square

∞+10+21+32+23+64+15+16+6∞0123456the link complement’s treekernel 𝔰𝔩2(𝔽7), order 343 = 73X = (1 2; 1 −1): children of c move byqX(c) = 2 + 2c + 6c2 at a finite cMumford’s treekernel of order 98 = 2 · 72second layer O ≅ N = 𝔽72, a doublet𝔰𝔩2(𝔽7) ≅ Sym2 N
Plate 12.3Two balls of radius two at 7. On the link complement’s tree the kernel sl2(F7)\mathfrak{sl}_2(\F_7), of order 737^3, moves the seven children of each neighbour by a translation, and the eight translations are the values of one binary quadratic form; on Mumford’s tree the kernel, of order 2⋅722\cdot7^2, carries the doublet O≅NO\cong N.

Both parents have a tree at 7 whose link at a vertex is P1(F7)\Proj^1(\F_7). One step beyond the link they differ, and the difference is classical. On Mumford’s tree let N=Λ0∨/Λ0N=\Lambda_0^\vee/\Lambda_0 with its alternating form, let RR be the group that Γ1\Gamma_1 induces on the ball of radius two about Λ0\Lambda_0, and let OO be the Sylow 7-subgroup of the kernel of RR on the link. On the tree of the link complement the kernel on the ball of radius two is the kernel of SL⁡(2,Z/49)→SL⁡(2,7)\SL(2,\Z/49)\to\SL(2,7), the elements I+7XI+7X with XX of trace zero over F7\F_7: it has order 737^3, against 2⋅722\cdot7^2 on Mumford’s.

So the second layer of the one tree is the symmetric square of the second layer of the other. Read at −7\sqrt{-7}, Klein’s lattice is the first layer at its own vertex, and it is the second layer of the other parent’s tree. Weil’s construction turns the doublet NN into a quartet together with Klein’s three-dimensional representation.

Theorem(A doublet and its symmetric square) computed

(1) R/O≅Sp(N)=SL⁡(2,7)R/O\cong\mathrm{Sp}(N)=\SL(2,7), and O≅NO\cong N as modules for it: the intertwiners O→NO\to N form one line, and they are invertible. The centre −1-1 acts trivially on the link of Λ0\Lambda_0, by −1-1 on OO, and on the link of each neighbour of Λ0\Lambda_0 as an involution of PGL⁡(2,7)\PGL(2,7) outside PSL⁡(2,7)\PSL(2,7), fixing Λ0\Lambda_0 and one other point.

(2) The kernel of the action of the group of the congruence link complement on the ball of radius two of its tree is sl2(F7)\mathfrak{sl}_2(\F_7) with the adjoint action, and sl2(F7)≅Sym2(V)\mathfrak{sl}_2(\F_7)\cong\mathrm{Sym}^2(V) for the natural module VV. Identifying the two copies of SL⁡(2,7)\SL(2,7) so that the unique seam between the two links is equivariant, V≅NV\cong N: the second layer of the one tree is the symmetric square of the second layer of the other.

(3) The Weil representation of Sp(N)\mathrm{Sp}(N) on the functions on a line of NN is the sum of the even quartet, on which −1-1 acts as −1-1, and the odd triplet, on which −1-1 acts trivially and whose character is that of Klein’s representation on L∞⊗CL_\infty\otimes\C.

(4) (L∞/−7L∞, h)(L_\infty/\sqrt{-7}L_\infty,\,h) is isometric to (sl2(F7), cdet⁡)(\mathfrak{sl}_2(\F_7),\,c\det) for some c∈F7×c\in\F_7^\times, by a map that is equivariant up to an automorphism of PSL⁡(2,7)\PSL(2,7) and unique up to scalars. Its isotropic, interior and exterior points are the nilpotent, non-split and split lines.

Proof

(1) and (2) come from the balls of radius two, with the six intertwiners from the conjugation action on OO to the action on NN computed, all invertible. The map Sym2V→sl(V)\mathrm{Sym}^2V\to\mathfrak{sl}(V), vw↦ω(v,⋅)w+ω(w,⋅)vvw\mapsto\omega(v,\cdot)w+\omega(w,\cdot)v, is SL⁡(V)\SL(V)-equivariant and injective in odd characteristic, between spaces of dimension three, and a PSL⁡(2,7)\PSL(2,7)-equivariant bijection between two copies of P1(F7)\Proj^1(\F_7) is induced by a linear isomorphism of the planes, unique up to scalars. (3) is Weil’s, with the characters recomputed independently. (4) PGL⁡(2,7)\PGL(2,7) acts faithfully on sl2(F7)\mathfrak{sl}_2(\F_7) preserving det⁡\det, and the special orthogonal group of a nondegenerate ternary form over F7\F_7 has order 336, so it is PGL⁡(2,7)\PGL(2,7); all such forms are similar, so an isometry up to scale exists, and irreducibility makes it unique up to scalars.

L’objet des points sur les deux arbresThe object of the points on the two trees

∞0123456∞0123456z ↦ z + 1z ↦ −zthe link complement’s treeseven translations: C7, even, in PSL(2, 7)X7 carried: exactly one seamMumford’s treeD14: with z ↦ −z, odd, outside PSL(2, 7)the seven S4a go to the seven S4bX7 becomes X7′: no seam
Plate 12.4One neighbour’s link, its parent at ∞\infty: on the link complement’s tree the mixed squares are the translations z↦z+tz\mapsto z+t, inside PSL⁡(2,7)\PSL(2,7); on Mumford’s tree they include z↦−zz\mapsto-z, an involution outside it, which carries the seven groups S4aS_4^a onto the seven groups S4bS_4^b.

For a vertex xx of one of the trees, its link Lk(x)\mathrm{Lk}(x) is an incarnation of P1(F7)\Proj^1(\F_7). Let KxK_x be the elements of the vertex group of xx that act trivially on it. For a step x→yx\to y the mixed-square group M(x→y)M(x\to y) is the image of KxK_x on Lk(y)\mathrm{Lk}(y): the holonomy of a square made of a loop at xx that xx cannot see, followed by the step.

That is the whole difference between the trees, and the chapter’s theorem follows from it. On the one tree every mixed square stays inside PSL⁡(2,7)\PSL(2,7), so the rigid object X7X_7 is carried in exactly one way; on the other an improper involution carries X7X_7 to X7′X_7', and no seam joins them. Parity is properness: two Klein vertices v0v_0 and xv0xv_0 have the same parity exactly when xx acts properly, and when they differ an element of order seven acting on the link by a given Möbius map has trace α\alpha on one Klein lattice and αˉ\bar\alpha on the other. The two vertices carry Klein’s representation and its conjugate.

Theorem(Mixed squares) computed

(1) On Mumford’s tree, the kernel of Γ1\Gamma_1 on the link of Λ0\Lambda_0, of order 98, acts on the link of each neighbour through a dihedral group of order 14: seven translations and seven involutions outside PSL⁡(2,7)\PSL(2,7). The central element of Sp(N)\mathrm{Sp}(N) is one of the involutions.

(2) On the tree of the congruence link complement, the kernel of PSL⁡(2,Z/49)\PSL(2,\Z/49) on the link acts on the new neighbours of each neighbour through a cyclic group of order 7, by even permutations.

Proof

By direct computation on the balls of radius two.

Le parent jointThe joint parent

completions differradius-two balls: 57 624 = 168 · 73 against 16 464 = 168 · 2 · 72reduce at (3 + ω)reduce at √−7the lift’s groupSL(2, Z[ω])real place: the Lorentz grouptree at 7: even mapsMumford’s groupover Q(√−7)real place: compactbuilding at 2: Fano linkstree at 7: odd maps as wellthe finite sky: eight pointswith the group of order 168
Plate 12.5The two parents and their common quotient, the group of order 168 on the eight points of P1(F7)\Proj^1(\F_7): each reduces onto it at a prime above 7, a lattice that joins them is the fiber product over it, and above the finite line they part.

Write O=Z[ω]\mathcal O=\Z[\omega], p=(3+ω)\mathfrak p=(3+\omega) and pˉ\bar{\mathfrak p} for the two primes above 7, and ΓS=SL⁡(2,O[1/p])\Gamma_S=\SL(2,\mathcal O[1/\mathfrak p]) for the group of the link complement with its prime inverted, which acts on H3\mathbb H^3 and on the tree TpT_{\mathfrak p} of SL⁡(2,Q7)\SL(2,\Q_7). For a vertex tt let ρt\rho_t be the action of its stabilizer on the plane whose eight lines are Lk(t)\mathrm{Lk}(t), and ϖ~ ⁣:Γ1→SL⁡(2,7)\tilde\varpi\colon\Gamma_1\to\SL(2,7) Mumford’s reduction at −7\sqrt{-7}.

By Goursat’s lemma a subgroup of Γ1×ΓS\Gamma_1\times\Gamma_S that projects onto both factors is the fiber product over a common quotient, so the parents are joined only that way. The fiber products are non-cocompact lattices of index 336, modulo scalars, in PGL⁡3(Q2)×SL⁡(2,C)\PGL_3(\Q_2)\times\SL(2,\C) and in PGL⁡3(Q2)×SL⁡(2,C)×SL⁡(2,Q7)\PGL_3(\Q_2)\times\SL(2,\C)\times\SL(2,\Q_7), and they are reducible: by Margulis’s arithmeticity theorem an irreducible lattice there would come from one absolutely almost simple group, of one Dynkin type, while PGL⁡3\PGL_3 has type A2A_2 and SL⁡2\SL_2 type A1A_1. An amalgam over F21F_{21} is not available, since F21F_{21} is not a finite subgroup of PSL⁡(2,C)\PSL(2,\C). By Serre’s solution of the congruence subgroup problem every homomorphism of ΓS\Gamma_S onto PSL⁡(2,7)\PSL(2,7) is reduction modulo pˉ\bar{\mathfrak p} followed by an automorphism.

At one scale the attachment is forced. Fix tt and an isomorphism ι\iota of the two copies of SL⁡(2,7)\SL(2,7) keeping the class of S4aS_4^a, and let Γ(t)\Gamma^{(t)} be the pairs (γ,δ)(\gamma,\delta) with ιϖ~(γ)=ρt(δ)\iota\tilde\varpi(\gamma)=\rho_t(\delta). It has index 336; the two incarnations of X7X_7 are joined by exactly one equivariant seam, a seam system over Δ2×H3\Delta_2\times\mathbb H^3 with trivial gauge group; the other class of ι\iota exchanges the classes of S4S_4; and Γ(t)\Gamma^{(t)} is the stabilizer of tt in no subgroup of finite index. The one lattice that joins the parents across scales, Γ1×SL⁡(2,7)ΓS\Gamma_1\times_{\SL(2,7)}\Gamma_S, attaches Mumford’s finite line to the line at pˉ\bar{\mathfrak p}, which does not move with the scale.

Theorem(No glue across scales) proved

Let Γ\Gamma be a subgroup of finite index in Γ1×ΓS\Gamma_1\times\Gamma_S. For every vertex tt of TpT_{\mathfrak p}, the elements (1,δ)∈Γ(1,\delta)\in\Gamma with δ(t)=t\delta(t)=t fix every vertex (v,t)(v,t), act trivially on X7X_7 through Γ1\Gamma_1, and induce all of SL⁡(2,7)\SL(2,7) on Lk(t)\mathrm{Lk}(t). Consequently no vertex (v,t)(v,t) admits a Γ(v,t)\Gamma_{(v,t)}-equivariant bijection between the incarnation of X7X_7 through ϖ~\tilde\varpi and the incarnation of X7X_7 on Lk(t)\mathrm{Lk}(t), nor a nonzero equivariant map between the even Weil representations through ϖ~\tilde\varpi and through ρt\rho_t. The same holds for every nontrivial irreducible representation, and for any group in place of Γ1\Gamma_1.

Proof

Every subgroup NN of finite index in ΓS\Gamma_S is dense in SL⁡(2,Q7)\SL(2,\Q_7). It contains u(k O[1/p])u(k\,\mathcal O[1/\mathfrak p]) for some k=7amk=7^am with 7∤m7\nmid m; since π=3+ω\pi=3+\omega is a unit of O[1/p]\mathcal O[1/\mathfrak p] and 7=ππˉ7=\pi\bar\pi, k O[1/p]=πˉam O[1/p]k\,\mathcal O[1/\mathfrak p]=\bar\pi^am\,\mathcal O[1/\mathfrak p] with πˉam\bar\pi^am a unit of Z7\Z_7, which is dense in Q7\Q_7. So the closure of NN contains the upper and lower unipotent groups, which generate SL⁡(2,Q7)\SL(2,\Q_7), and ρt(N∩ΓS(t))=SL⁡(2,7)\rho_t(N\cap\Gamma_S(t))=\SL(2,7) for every tt.

Take N={δ:(1,δ)∈Γ}N=\{\delta:(1,\delta)\in\Gamma\}. An equivariant bijection ff would satisfy f=ρt(δ)∘ff=\rho_t(\delta)\circ f for all these δ\delta, so PSL⁡(2,7)\PSL(2,7) would fix every point. The image of an equivariant map of representations is a subspace fixed by an irreducible nontrivial representation of SL⁡(2,7)\SL(2,7), hence 0. Only the factor ΓS\Gamma_S was used.

Flèches et boucles sur l’arbre des échellesArrows and loops on the scale tree

t0t∞e0a parent at every vertexevery edge chosen by an endone edge, e0, chosen by bothevery path of parents ends on e0one edge in eightat distance 2 from t0: 56 toward e0,392 away; 56u2/(1 − 49u2)
Plate 12.6The scale tree round the edge e0=(t0,t∞)e_0=(t_0,t_\infty), its eight-valent vertices to distance two, each with an arrow to its parent: t0t_0 and t∞t_\infty choose each other, every path of parents ends on e0e_0, and at every vertex one of the eight edges points toward it.

A choice of one parent at each vertex is the remaining datum of a seam system along a tree, and the lemma says what such choices look like. No choice is invariant under a group that fixes no vertex, edge or end; in particular none is invariant under either parent.

Now carry the octonion table around the loops of ΓS\Gamma_S at the base vertex t0t_0 of the scale tree TpT_{\mathfrak p}. Fix the edge e0=(t0,t∞)e_0=(t_0,t_\infty), whose stabilizer is the Iwahori subgroup ΓI\Gamma_I, root the parents at e0e_0, and choose frames in which every parent sits at ∞\infty. The holonomy h(γ,t0)∈PSL⁡(2,7)h(\gamma,t_0)\in\PSL(2,7) of a loop acts on the seven points of the Fano plane through the double life read in Klein’s lattice, with the point a∗=Λ0a^*=\Lambda_0 at ∞\infty in every frame, and the signed relabellings of the table exex+1=ex+3e_xe_{x+1}=e_{x+3}, a group 23⋅L3(2)2^3{\cdot}L_3(2) of order 1344, realize each collineation in eight ways.

One loop in eight is carried by a relabelling that reverses no unit: exactly those with γ(t∞)\gamma(t_\infty) the parent of γt0\gamma t_0. The condition depends only on the coset γΓI\gamma\Gamma_I; in the decomposition of ΓS\Gamma_S by the infinite dihedral group of s0s_0 and s1s_1 it holds exactly when the reduced word ends in s1s_1, and at distance 2k2k the oriented edges reached number 8⋅72k−18\cdot7^{2k-1} toward e0e_0 and 8⋅72k8\cdot7^{2k} not, with generating function 56u2/(1−49u2)56u^2/(1-49u^2) for the first. The best relabellings for the other loops reverse exactly two units. The residual is not a class function, since diag(π−1,π)\mathrm{diag}(\pi^{-1},\pi) and diag(π,π−1)\mathrm{diag}(\pi,\pi^{-1}) are conjugate with residuals 2 and 0, so the signed table defines no homomorphism on the loop group and no twist of Ihara’s zeta function.

Lemma(Arrows on a tree) proved

Let every vertex of a locally finite infinite tree choose one neighbour, its parent, so that every edge is chosen by at least one of its endpoints. Then either exactly one edge is chosen by both of its endpoints, and every path of parents ends by oscillating on that edge, or no edge is, and all paths of parents run to one common end. The symmetries of the choice fix that edge, or that end.

Proof

Two edges chosen from both ends cannot occur: on the geodesic between them the inner vertices are one fewer than the edges, and the outer endpoints choose their partners off the geodesic, so some edge of the geodesic would be chosen by nobody. Along the geodesic between two vertices no inner vertex chooses both of its geodesic neighbours, so the choices point inward to one vertex of the geodesic, and the two paths of parents meet there and continue together. The rest follows.

Le résidu et les deux transportsThe residual and the two transports

0132645±Ag(1)a broken holonomyg = (0 1 2 5)(3 4), residual 2three best relabellings reverse {1, 3}, {4, 5}, {2, 6}each pair completes a line through c0 = 0the spin transport: Ag(1) = ±e1, and 1 = g(c0)residual 0 on 21 (x ↦ ax + b), 2 on 147of 128 realizations: 2 keep J0, 8 the product, 0 both
Plate 12.7The table’s plane in its cyclic labelling and one broken collineation gg: its three best relabellings each reverse the two other points of a line through c0=0c_0=0, and none reverses 0; the spin transport AgA_g sends the unit to ±ec1\pm e_{c_1}, c1=g(0)c_1=g(0).

Call a holonomy misaligned, or broken, when it moves a∗a^*, and let gg be its collineation. Two ways of carrying the table across a broken loop present themselves. There is an orthogonal map AgA_g of O\Oct, unique up to sign, with AgLexAg−1=Leg(x)A_gL_{e_x}A_g^{-1}=L_{e_{g(x)}} for every xx; it commutes with the complex structure J0=LuJ_0=L_u, u=(e0+⋯+e6)/7u=(e_0+\dots+e_6)/\sqrt7, and it is an automorphism of O\Oct, up to sign, exactly when the holonomy fixes a∗a^*. Every relabelling over gg is ±AgLex1⋯Lexk\pm A_gL_{e_{x_1}}\cdots L_{e_{x_k}} over the units it reverses, and of the 128 realizations of gg in Spin(7)\mathrm{Spin}(7) exactly two keep J0J_0, namely ±Ag\pm A_g, exactly eight keep the product, the relabellings, and none keeps both.

The table AgA_g carries across the loop has the same metric, the same J0J_0 and the same Cayley form of left type, and a different associative 3-form. Its unit is Ag(1)=±ec1A_g(1)=\pm e_{c_1} with c1=g(c0)c_1=g(c_0), and the two tables share exactly the SU(3)\mathrm{SU}(3) that fixes ec1e_{c_1}. Everything else at one scale agrees for the two: the Coxeter meetings, the Fano orientation up to the signs of the units, the face half-turns, the products of the units of each of the 70 four-sets of P1(F7)\Proj^1(\F_7), J0J_0 and the Cayley form of left type. Only the unit tells the two transports apart.

Lemma(The residual of a holonomy) computed

The residual r(h)r(h) of a holonomy hh is the least number of units exe_x sent to −eg(x)-e_{g(x)} by a relabelling over it. (1) One of the eight relabellings over hh reverses no unit exactly when h(a∗)=a∗h(a^*)=a^*, so r(h)=0r(h)=0 on the Borel subgroup B(a∗)B(a^*), of order 21. (2) r(h)=2r(h)=2 on the other 147 elements of PSL⁡(2,7)\PSL(2,7). (3) For h(a∗)≠a∗h(a^*)\neq a^*, let c0c_0 be the point of the antiflag whose pair is {a∗,h−1(a∗)}\{a^*,h^{-1}(a^*)\}. Exactly three relabellings over hh reverse two units. They reverse the two other points on the three lines through c0c_0, one line each, and none reverses c0c_0.

Proof

(1) The collineations with a relabelling of all positive signs form F21={x↦ax+b:a∈{1,2,4}}F_{21}=\{x\mapsto ax+b:a\in\{1,2,4\}\}, the image of B(∞)B(\infty). (2) If b,b′∈B(a∗)b,b'\in B(a^*) have positive relabellings UbU_b and Ub′U_{b'}, then R↦UbRUb′R\mapsto U_bRU_{b'} is a bijection from the relabellings over hh to those over bhb′bhb' that keeps the number of reversed units; so rr is constant on the two Bruhat cells of PSL⁡(2,7)\PSL(2,7), and its value on the big cell was computed. (3) Computed for all 147 elements.

La charge, observateur par observateurCharge, observer by observer

01326453 single maps|S| = 2: reversing {1, 3}2 · 2 · 5 = 20 of 42 broken01326454 single maps|S| = 4: reversing {0, 1, 2, 4}2 · 4 · 3 = 24 of 42 broken01326451 single map|S| = 6: reversing {1, 2, 3, 4, 5, 6}2 · 6 · 1 = 12 of 42 broken
Plate 12.8The seven clocks, each pair joined by two of the 42 meetings: the eight single maps over a broken holonomy reverse two, four or six clocks, and break the 20, 24 or 12 meetings that cross between reversed and kept clocks.

Each of the twenty-eight antiflags of the Coxeter graph carries its own copy of the table, and copies are compared only along the graph’s edges, the meetings. Write c(o)=pc(o)=p for the clock of o=(p,L)o=(p,L). Over a collineation gg a per-observer transport is a choice of relabellings RoR_o over gg, one at each observer, with clock signs given by Roec(o)=soeg c(o)R_oe_{c(o)}=s_oe_{g\,c(o)}. It keeps the clocks when every so=+1s_o=+1, and it is a single map when every RoR_o is the same.

A single map cannot satisfy the meetings. Every pair of distinct clocks is joined by exactly two meetings and no meeting joins equal clocks, so a single map that reverses a set SS of clocks fails exactly the 2∣S∣(7−∣S∣)2|S|(7-|S|) meetings that join SS to its complement: 20 for the three single maps of residual two, 24 for four, 12 for one.

Nor can a loop reverse a pattern. With its 24 heptagons as faces the Coxeter graph has H1=0H_1=0 and is simply connected, so a comparison system trivial around every heptagon is trivial around every closed path; for one broken loop the flat Z/2\Z/2 data form Z/2\Z/2, a reversal of every observer together. And Hom⁡(SL⁡(2,O),Z/2)=Hom⁡(ΓS,Z/2)=0\operatorname{Hom}(\SL(2,\mathcal O),\Z/2)=\operatorname{Hom}(\Gamma_S,\Z/2)=0, since O\mathcal O is Euclidean and conjugation by diag(ω2,ω)\mathrm{diag}(\omega^2,\omega) multiplies the entry of an elementary matrix by ω\omega. Over the stabilizer S3S_3 of an observer the extension 23⋅L3(2)2^3{\cdot}L_3(2) splits by clock-keeping lifts, which form an honest action of the 168 collineations on the 28 copies.

Theorem(Charge is kept observer by observer) computed

Let hh be a broken holonomy and gg its collineation, and let Col(c)\mathrm{Col}(c) be the 96 relabellings fixing ece_c. (1) At every observer exactly four of the eight relabellings over gg keep its clock, and any two of them differ by an element of Col(g c(o))\mathrm{Col}(g\,c(o)). (2) Every clock-keeping choice satisfies all 42 meetings; one takes for RoR_o a relabelling of residual two whose reversed pair avoids c(o)c(o), which exists at every observer. (3) The transformed comparisons are colour-gauge equivalent to the flat class on all 84 arcs. (4) For every observer the holonomy T(go→o) RoT(go\to o)\,R_o lies in Col(c(o))\mathrm{Col}(c(o)). (5) In every observer’s frame, the SU(3)\mathrm{SU}(3) at the target clock restores J0J_0.

Proof

Along a meeting (o,o′)(o,o') the transformed comparison sends eg c(o)e_{g\,c(o)} to soso′ eg c(o′)s_os_{o'}\,e_{g\,c(o')}, so the meeting condition holds exactly when soso′=+1s_os_{o'}=+1: the clock signs form a Z/2\Z/2-cocycle on the Coxeter graph, which is connected, so they are constant. The relabellings over gg form a coset of the eight sign changes, and keeping c(o)c(o) fixes the sign at g c(o)g\,c(o); a relabelling of residual two keeps every clock but the two it reverses. All parts were computed on the 147 broken holonomies, on random colour-gauge representatives, and for twenty random clock-keeping choices per holonomy.

Les échelles partagent des observateursThe scales share observers

Plate 12.9One frame’s meeting graph with one of its 24 heptagons in gold: with the heptagons as faces each frame is simply connected, and across two frames the 882 five-cycles fill the 48 loops that the frames’ heptagons leave.

Neighbouring frames of the scale tree are not separate cells. Take the root t0t_0 and its child vv in direction 0. A site of the two-frame truncation is one of the 21 pairs {d,e}\{d,e\} with d,e≠0d,e\ne0 at the root, one of the 21 pairs of vv‘s own line, or one of 49 mixed sites (u,d)(u,d), seen at t0t_0 as {0,d}\{0,d\} and at vv as {u,∞v}\{u,\infty_v\}. In P1(Z/49)\Proj^1(\Z/49), with a residue disk the seven points over one point of P1(F7)\Proj^1(\F_7), a fine pair {7s,7s′}\{7s,7s'\} and a coarse pair {7u,d}\{7u,d\} with dd outside the disk are harmonic, to the precision the disk allows, exactly when u=(s+s′)/2u=(s+s')/2; the coarse pairs over a disk join the two stars by a complete bipartite graph K7,7K_{7,7}.

On one frame the harmonic-pair graph is the Coxeter graph, with spectrum 31 28 (2−1)6 (−1)7 (−2−1)63^1\,2^8\,(\sqrt2-1)^6\,(-1)^7\,(-\sqrt2-1)^6. For the operator HH on the sites with one block of unit size per meeting, the comparison’s block, tr⁡Hk\operatorname{tr}H^k does not depend on the comparisons for k≤4k\le4, and tr⁡H5=60(882−W5)\operatorname{tr}H^5=60(882-W_5) with W5W_5 the sum over the five-cycles of 1−13Re⁡tr⁡h1-\tfrac13\operatorname{Re}\operatorname{tr}h, whose least nonzero value over relabellings is 24.

Refining the observers copies loops and subdivides none. Each of a frame’s eight stars has seven members, pairwise at distance three, and its 21 three-paths carry the cycle space of K7K_7 isomorphically onto the frame’s, 15→1515\to15; with a weight ww on the five-cycles, minimizing a quadratic form over a frame’s children induces 7w Pcycle7w\,P_{\mathrm{cycle}} on the star connection, whatever the children’s own form, and the result is reached after one level. Refining each meeting to level two gives 1372 sites and 14406 meetings, every heptagon lifting to exactly 777^7 heptagons of full length, so the coarse coefficient is 777^7 times the fine one.

Theorem(Closed paths across scales) computed

The two-frame truncation has 91 sites and 336 meetings. (1) It has no triangles. Its 882 four-cycles lie inside one frame, through two sites over one observer, and their holonomy is the identity for every frame-dependent link. (2) It has exactly 882 five-cycles, all crossing scales, 441 with three meetings at each frame. With the frames flat, all 882 have trivial holonomy exactly when the cross-scale identifications are constant.

With each frame’s lifted heptagons and four-cycles as faces, each frame’s part has H1=0H_1=0 and the two-frame complex has H1≅Z48H_1\cong\Z^{48}, without torsion. Adding the 882 five-cycles gives H1=0H_1=0, and the complex is then simply connected, by van Kampen over the 49 mixed sites and the connectedness of the 7×77\times7 rook’s graph. So across one edge a flat comparison system is unique up to colour gauge once the five-cycles are flat.

Les positions et les cadresPositions and frames

0123456∞
Plate 12.10The six records of T0T_0, whose cusps ∞,0,1,1+ω\infty,0,1,1+\omega reduce to ∞,0,1,5\infty,0,1,5: the six pairs they name, no two of them meeting in the Coxeter graph, at six distinct clocks.

Let Λ=Herm2(Z[ω])\Lambda=\mathrm{Herm}_2(\Z[\omega]) with the form det⁡\det, and let Γ=SL⁡(2,Z[ω])\Gamma=\SL(2,\Z[\omega]) act by X↦gXg†X\mapsto gXg^\dagger. The ideal tetrahedron T0T_0 with cusps ∞,0,1,1+ω\infty,0,1,1+\omega has reports Na=kaka†N_a=k_ak_a^\dagger, for k∞=(1,0)k_\infty=(1,0), k0=(0,1)k_0=(0,1), k1=(1,1)k_1=(1,1) and k1+ω=(1+ω,1)k_{1+\omega}=(1+\omega,1), and six records Tx=Na+NbT_x=N_a+N_b, one for each pair x={a,b}x=\{a,b\} of its cusps. The reports form a Z\Z-basis of Λ\Lambda; the records have det⁡Tx=1\det T_x=1 and span the even part Λeven\Lambda_{\mathrm{even}}, of index 2. Against D=∑aNaD=\sum_aN_a, of determinant 6, every record has ⟨Tx,D⟩/6=3/2\langle T_x,D\rangle/\sqrt6=\sqrt{3/2}, and the parts Sx=Tx−12DS_x=T_x-\tfrac12D satisfy ⟨Sx,Sx⟩=−12\langle S_x,S_x\rangle=-\tfrac12, Sxc=−SxS_{x^c}=-S_x and ⟨Sx,Sy⟩=0\langle S_x,S_y\rangle=0 otherwise.

No mesh on Λ\Lambda is covariant. Every nonzero X∈ΛX\in\Lambda has an infinite Γ\Gamma-orbit, so no locally finite bond set is invariant under translations and Γ\Gamma, and the stabilizer of a finite spanning bond set is finite and fixes a future timelike vector; for the reports of T0T_0 it is the binary tetrahedral group 2T2T. Its orbits on the 28 pairs have sizes 4,6,6,12, so no map from Λeven\Lambda_{\mathrm{even}} to the pairs is both translation-invariant and 2T2T-equivariant. The positions do subdivide: bΛevenb\Lambda_{\mathrm{even}} has index b4b^4, a coarse bond bTxbT_x is a sum of bb records in exactly one way, and a coarse rhombus is tiled by b2b^2 fine ones. The 33 smallest loops at a site, 15 rhombi, 12 matching squares and 6 zig-zag squares, span the cycle space; and since the Coxeter graph has girth 7, any map of the bonds to meetings pulls the meetings’ comparisons back to a connection flat on every smallest loop.

Proposition(Records name observers) computed

(1) Every record T=gg†T=gg^\dagger, g∈Γg\in\Gamma, is a sum of two primitive null vectors of Λ\Lambda in exactly one way. (2) Their cusps reduce modulo p\mathfrak p to two distinct points of P1(F7)\Proj^1(\F_7), so TT names a pair o(T)o(T). The map satisfies o(gTg†)=gˉ⋅o(T)o(gTg^\dagger)=\bar g\cdot o(T), is constant on Γ(p)\Gamma(\mathfrak p)-classes, and is onto the 28 pairs. (3) The records form 336/12=28336/12=28 classes modulo Γ(p)\Gamma(\mathfrak p), and oo is a bijection from them onto the pairs: a pair is a class of records, an edge of the tessellation, the geodesic of H3\mathbb H^3 joining two cusps. (4) The six records of T0T_0 name six pairwise non-meeting pairs, whose clocks are six distinct ones of the seven.

Proof

(1) I=ξξ†+ηη†I=\xi\xi^\dagger+\eta\eta^\dagger makes (ξ η)(\xi\ \eta) unitary with entries in Z[ω]\Z[\omega], hence monomial, and X↦g−1Xg−†X\mapsto g^{-1}Xg^{-\dagger} carries decompositions of TT to those of II. (2) det⁡(ξ,η)\det(\xi,\eta) is a unit, so it stays nonzero modulo p\mathfrak p, and reduction is a ring homomorphism. (3) The stabilizer of II has 12 elements and injects into SL⁡(2,7)\SL(2,7), since 7∤127\nmid12. Surjectivity in (2) and item (4) were computed.

Beyond the finite line the parents share one vertex, Klein’s lattice, where the first part’s finite geometry is the geometry of short vectors and neighbours. One step out they part, and the seam theory of the two trees tells them apart: the points of the Fano plane are carried along the link complement’s tree in one way and along Mumford’s in none. Across scales nothing keeps the line attached, at one scale the attachment is forced, and the table with its signs is carried observer by observer with no reversal anywhere.

Each parent carries a flip, the sign change of −3\sqrt{-3} and of −7\sqrt{-7}. What each flip is seen by, and what survives both, is the next chapter.