Universal Kernel

gauge

What does a seam system become once an alignment is chosen at every incarnation?

A choice of alignments, one for each incarnation of a seam system over a graph; it turns the seams into link variables in NG(H)/HN_G(H)/H, so that a seam system is a lattice gauge connection and its monodromy is holonomy.

0123456∞the 12 neighbours of {0, ∞}0123456∞a star triangle, a 2-cell{∞, 0} → {∞, 1}: z ↦ z + 1{∞, 1} → {∞, 2}: z ↦ z + 1{∞, 2} → {∞, 0}: z ↦ z + 5holonomy: the identity0123456∞a triangle that is no 2-cell{∞, 0} → {0, 1}: z ↦ z/(z + 1){0, 1} → {∞, 1}: z ↦ (2z + 6)/z{∞, 1} → {∞, 0}: z ↦ z + 6holonomy: z ↦ −1/z
Plate 2.8The complex of stars at the pair {0,∞}\{0,\infty\}: the twelve pairs sharing a point with it are its neighbours. Around a star triangle the transports close up; around the triangle {∞,0},{0,1},{1,∞}\{\infty,0\},\{0,1\},\{1,\infty\} the holonomy is z↦−1/zz\mapsto-1/z, which exchanges ∞\infty and 0.
Theorem(Seam systems are lattice gauge connections)

Let G\mathcal G be a connected graph, each edge taken with both orientations, eˉ\bar e the reverse of ee. A seam system over G\mathcal G for an object XX assigns an incarnation YvY_v to each vertex and a seam se ⁣:Yv→Yws_e\colon Y_v\to Y_w to each oriented edge ee from vv to ww, with seˉ=se−1s_{\bar e}=s_e^{-1}. Let A=Aut⁡G(X)≅NG(H)/HA=\Aut_G(X)\cong N_G(H)/H.

(a) A choice of alignments φv ⁣:X→Yv\varphi_v\colon X\to Y_v, one per vertex, a gauge, turns the system into link variables Ue=φw−1seφv∈AU_e=\varphi_w^{-1}s_e\varphi_v\in A, with Ueˉ=Ue−1U_{\bar e}=U_e^{-1}. Another gauge φv′=φvav\varphi_v'=\varphi_va_v replaces UeU_e by aw−1Ueava_w^{-1}U_ea_v, a gauge transformation, and every family (Ue)(U_e) with Ueˉ=Ue−1U_{\bar e}=U_e^{-1} arises from a seam system.

(b) The monodromy of a cycle (e1,…,em)(e_1,\dots,e_m) at vv is φv(Uem⋯Ue1)φv−1\varphi_v(U_{e_m}\cdots U_{e_1})\varphi_v^{-1}, the holonomy read through the alignment at vv. Its conjugacy class in AA does not depend on the gauge, so every class function of the holonomy, such as χ(Uem⋯Ue1)\chi(U_{e_m}\cdots U_{e_1}) for a character χ\chi of AA, a Wilson loop, is gauge invariant; if AA is abelian the holonomy itself is.

(c) The system is coherent if and only if every holonomy is trivial, if and only if it is gauge equivalent to the system with all Ue=1U_e=1.

(d) If G\mathcal G is the 1-skeleton of a 2-complex K\mathcal K, the holonomy around every 2-cell is trivial (the connection is flat) if and only if holonomy defines a homomorphism π1(K,v)→A\pi_1(\mathcal K,v)\to A; the system is then coherent if and only if this homomorphism is trivial.

(e) For fixed incarnations, the gauge classes of seam systems over G\mathcal G correspond to the homomorphisms π1(G,v)→A\pi_1(\mathcal G,v)\to A up to conjugation in AA.

Proof

(a) UeU_e is a GG-automorphism of XX, and φw′−1seφv′=aw−1Ueav\varphi_w'^{-1}s_e\varphi_v'=a_w^{-1}U_ea_v; given (Ue)(U_e), put se=φwUeφv−1s_e=\varphi_wU_e\varphi_v^{-1}. (b) The monodromy telescopes to φvUem⋯Ue1φv−1\varphi_vU_{e_m}\cdots U_{e_1}\varphi_v^{-1}, and a change of gauge conjugates the product by ava_v. (c) A connected system is coherent exactly when its seams are induced by one choice of alignments. (d) π1(K,v)\pi_1(\mathcal K,v) is the quotient of the free group π1(G,v)\pi_1(\mathcal G,v) by the normal subgroup generated by the boundaries of the 2-cells. (e) In the gauge with Ue=1U_e=1 along a spanning tree, the remaining link variables are the images of free generators of π1(G,v)\pi_1(\mathcal G,v), and the residual gauge freedom is one ava_v, acting by conjugation.

None of this is new: it is the dictionary between local systems on a graph and representations of its fundamental group, in the language of lattice gauge theory. What seam theory supplies is the gauge group, NG(H)/HN_G(H)/H, and the examples. The two natural seams between the flexes and their tangents form a cycle of length two whose holonomy is τ\tau, of order 3 in A≅C3A\cong C_3; since AA is abelian, τ\tau itself is gauge invariant.

Proposition(A connection on the complex of stars) computed

Call two of the 28 pairs of points of P1(F7)\Proj^1(\F_7) adjacent when they share a point: the Johnson graph J(8,2)J(8,2), with 168 edges. Its 280 triangles of pairs through a common point are the 2-cells of a 2-complex K\mathcal K, the complex of stars. In the Weil representation of SL⁡(2,7)\SL(2,7), read through the octonions, there is a family of algebras su(3)\mathfrak{su}(3), one over each pair. Along the edge from {c,d}\{c,d\} to {c,e}\{c,e\}, transport by the odd lift uu of the unique element of order 7 fixing cc with d↦ed\mapsto e.

(a) Conjugation by uu carries the algebra over {c,d}\{c,d\} onto the algebra over {c,e}\{c,e\}, so the transports form a seam system for the family. (b) Around every 2-cell the transports compose to the identity: the connection is flat. (c) In a gauge along a spanning tree every link variable lies in the stabilizer KK, of order 12, of the base pair, and the holonomy group is all of KK; around a triangle {a,b},{b,c},{c,a}\{a,b\},\{b,c\},\{c,a\}, which is not a 2-cell, the holonomy exchanges aa and bb. (d) Every holonomy element acts on the algebra over the base pair by an inner automorphism, and −I-I acts trivially, so the holonomy acts on su(3)\mathfrak{su}(3) through a group of order 6. (e) The Wilson loops of the traces on R8\R^8 and on su(3)\mathfrak{su}(3) take the values (8,8)(8,8), (−8,8)(-8,8), (2,−1)(2,-1), (0,0)(0,0), (−2,−1)(-2,-1) on holonomy elements of orders 1, 2, 3, 4, 6.

The complex of stars has free fundamental group of rank 21, that of the complete graph on the eight points; a loop is a closed walk on the eight points, and its holonomy exchanges the two points of the base pair exactly when the walk has odd length. Around a triangle the holonomy is the involution exchanging aa with bb and cc with its harmonic conjugate with respect to aa and bb; around a 4-cycle its multiplier is the square of the cross-ratio of the two diagonals.

Proposition(The corner law)

For a closed walk (a0,…,ak−1)(a_0,\dots,a_{k-1}) traced by a loop of K\mathcal K at {a0,a1}\{a_0,a_1\}, choose nonzero vectors a^i∈F72\hat a_i\in\F_7^2 on the points aia_i and put κi=[a^i,a^i−1]/[a^i,a^i+1]\kappa_i=[\hat a_i,\hat a_{i-1}]/[\hat a_i,\hat a_{i+1}], the corner factors, with indices modulo kk. Let h∈SL⁡(2,7)h\in\SL(2,7) be the holonomy, and PoddP_{\mathrm{odd}}, PevenP_{\mathrm{even}} the products of the κi\kappa_i, 1≤i≤k1\le i\le k, over odd and even ii. If kk is even, ha^0=Podda^0h\hat a_0=P_{\mathrm{odd}}\hat a_0 and ha^1=Pevena^1h\hat a_1=P_{\mathrm{even}}\hat a_1; if kk is odd, ha^0=Podda^1h\hat a_0=P_{\mathrm{odd}}\hat a_1, ha^1=Pevena^0h\hat a_1=P_{\mathrm{even}}\hat a_0 and h2=−Ih^2=-I. For k=4k=4 the eigenvalue on a^0\hat a_0 is the cross-ratio (a0,a2;a1,a3)(a_0,a_2;a_1,a_3) itself.

Proof

The transport at the corner aia_i is unipotent, so it fixes a^i\hat a_i and preserves the bracket; it sends a^i−1\hat a_{i-1} to κia^i+1\kappa_i\hat a_{i+1}, since [a^i,ua^i−1]=[a^i,a^i−1][\hat a_i,u\hat a_{i-1}]=[\hat a_i,\hat a_{i-1}]. The image of a^0\hat a_0 moves at the odd corners and that of a^1\hat a_1 at the even ones, each collecting its factors. For odd kk, PoddPeven=∏iκi=(−1)k=−1P_{\mathrm{odd}}P_{\mathrm{even}}=\prod_i\kappa_i=(-1)^k=-1, since every bracket of the walk occurs once in a numerator, reversed, and once in a denominator. The law was also checked by machine on 36072 closed walks; a law guessed before the computation, a product of cross-ratios over the odd corners, fails at k=6k=6.

Theorem(Inner holonomy is forced) computed

A holonomy element fixing the base pair acts on the algebra over it by an inner automorphism when it commutes with left multiplication by e0e_0 on the complement of span(1,e0)\mathrm{span}(1,e_0), and by an outer one, complex conjugation followed by an inner automorphism, when it anticommutes. An element of PGL⁡(2,7)\PGL(2,7) is proper if it lies in PSL⁡(2,7)\PSL(2,7) and improper otherwise.

(a) An element of PGL⁡(2,7)\PGL(2,7) carries the family of algebras to itself if and only if it is proper; an improper one carries the algebra over the base pair to an algebra outside the family. (b) On the stabilizer of the base pair in PGL⁡(2,7)\PGL(2,7), the six proper elements are inner, and the six improper ones neither commute nor anticommute. (c) So every connection on a graph on the 28 pairs whose transports come from PGL⁡(2,7)\PGL(2,7) and carry the family has inner holonomy. (d) Of the twelve PSL⁡(2,7)\PSL(2,7)-equivariant connections on J(8,2)J(8,2) with transports in PGL⁡(2,7)\PGL(2,7), six are proper on every edge and carry the family with inner holonomy, among them the connection on the complex of stars; six are improper and do not carry it, among them the reflection connection, whose holonomy is improper exactly around the loops of odd length. (e) The connection on the Coxeter graph given by the bracket rule is proper and has inner holonomy.

The prediction made before the computation, that improper transports would give outer holonomy around odd loops, failed, and the alternative registered with it holds. The improper elements carry the family to a second family, that of the mirror table, the octonion table relabelled by y↦−yy\mapsto-y; at each pair the unique seam between the two families is conjugation by the harmonic reflection of the pair, one of the 28 polarities of the Fano plane, and an improper connection is a proper one followed by that seam. The table is one point of a circle of products AzA_z, ∣z∣=1|z|=1, each with its own family of algebras, and the improper elements act on the circle by a reflection exchanging the table and its mirror. Its fixed points lie at the phase of the prime over 2, z=±λˉ/∣λ∣z=\pm\bar\lambda/|\lambda| with λ=(1+−7)/2\lambda=(1+\sqrt{-7})/2, and the two families there are invariant under all of PGL⁡(2,7)\PGL(2,7), an improper element fixing a pair acting on the algebra over it by an outer automorphism. But the sixteen vectors of the Weil representation multiply among themselves only at the table and its mirror: integrality forces the two families apart, and with them inner holonomy.

Theorem(The loops of the scale tree) computed

The group ΓS=SL⁡(2,Z[ω][1/p])\Gamma_S=\SL(2,\Z[\omega][1/\mathfrak p]) carries the base vertex t0t_0 of the tree TpT_{\mathfrak p} at 7, the scale tree, to other vertices and back, and the octonion table with its signs is carried along. Fix the edge e0=(t0,t∞)e_0=(t_0,t_\infty), whose stabilizer is the Iwahori subgroup ΓI\Gamma_I of the matrices of SL⁡(2,Z[ω])\SL(2,\Z[\omega]) with lower left entry in p\mathfrak p; choose one parent for each vertex, rooted at e0e_0, and frames in which every parent sits at ∞\infty. The holonomy h(γ,v)∈PSL⁡(2,7)h(\gamma,v)\in\PSL(2,7) of γ\gamma at vv acts, through the double life read in Klein’s lattice and with the table’s light direction a∗a^* at ∞\infty, on the seven points of the Fano plane, and the signed relabellings of the table exex+1=ex+3e_xe_{x+1}=e_{x+3}, which form a group 23⋅L3(2)2^3{\cdot}L_3(2) of order 1344, realize each collineation in eight ways. The residual r(h)r(h) is the least number of units exe_x sent to −eg(x)-e_{g(x)} by a relabelling over hh: it is 0 on the Borel subgroup fixing a∗a^*, of order 21, and 2 on the other 147 elements, and when it is 2 exactly three relabellings reverse two units, each the two other points of one of the three lines through a point c0c_0, and none reverses c0c_0.

(1) A loop γ∈ΓS\gamma\in\Gamma_S at t0t_0 is realized by a relabelling that reverses no unit if and only if γ(t∞)\gamma(t_\infty) is the parent of γt0\gamma t_0, equivalently h(γ,t0)(∞)=∞h(\gamma,t_0)(\infty)=\infty; otherwise every relabelling that realizes it reverses at least two units, and the best reverse exactly two. (2) The condition depends only on the coset γΓI\gamma\Gamma_I and is unchanged by ΓI\Gamma_I on the left. In the decomposition of ΓS\Gamma_S into double cosets ΓIwΓI\Gamma_Iw\Gamma_I by the infinite dihedral group generated by s0s_0, fixing t0t_0, and s1s_1, fixing t∞t_\infty, it holds exactly when the reduced word of ww ends in s1s_1. (3) For every loop γ0\gamma_0, the 168 loops γ0δ\gamma_0\delta, with δ\delta running over SL⁡(2,Z[ω])\SL(2,\Z[\omega]) modulo the kernel of its action on the link of t0t_0, have 168 distinct holonomies, 21 of residual 0 and 147 of residual 2. At distance 2k2k the oriented edges reached split into 8⋅72k−18\cdot7^{2k-1} that point toward e0e_0 and 8⋅72k8\cdot7^{2k} that do not. (4) The proportion one in eight is the same for every such choice of parents and every base vertex.

So the edge stabilizer ΓI\Gamma_I is the largest subgroup on which the signed table is carried by relabellings without reversals.

Proof

The collineations with a relabelling of all positive signs form F21F_{21}, the stabilizer of a∗a^*; composing with such relabellings on both sides preserves the number of reversed units, so rr is constant on the two Bruhat cells, and its value on the big cell was computed. (1) In every frame the parent sits at ∞\infty, and so does a∗a^*; the loop carries the parent to the parent exactly when hh fixes ∞\infty. (2) ΓI\Gamma_I fixes e0e_0 and preserves the choice of parents; the double cosets are indexed by the affine Weyl group, since ΓS\Gamma_S is dense in SL⁡(2,Q7)\SL(2,\Q_7) and ΓI\Gamma_I is the stabilizer of e0e_0. (3) The cocycle identity h(γ0δ,t0)=h(γ0,t0)h(δ,t0)h(\gamma_0\delta,t_0)=h(\gamma_0,t_0)h(\delta,t_0); each of the 8⋅72k−18\cdot7^{2k-1} vertices at distance 2k2k has eight outgoing edges, one of them toward e0e_0. Checked by exact computation in Q(ω)\Q(\omega) on representative loops, on random multiples of them by ΓI\Gamma_I and on five full families γ0δ\gamma_0\delta.

Proposition(No class function) computed

ΓS\Gamma_S has infinitely many primitive hyperbolic conjugacy classes of each translation length, and with π=3+ω\pi=3+\omega the elements diag(π−1,π)\mathrm{diag}(\pi^{-1},\pi) and diag(π,π−1)\mathrm{diag}(\pi,\pi^{-1}) are conjugate in SL⁡(2,Z[ω])\SL(2,\Z[\omega]) while their residuals at t0t_0 are 2 and 0. So the residual is not a function of the conjugacy class, the signed table defines no homomorphism on the loop group, and there is no twist of Ihara’s zeta function by it on any quotient of the scale tree.

The route through Ihara’s zeta function and its Artin–Ihara twists is closed twice: ΓS\Gamma_S is not a tree lattice, and the signed table gives no class function. A third obstruction is internal: the relabelling group 23⋅L3(2)2^3{\cdot}L_3(2) is a non-split extension, and every relabelling over a collineation of order four has order eight, so PSL⁡(2,7)\PSL(2,7) does not act on the signs at all.

Proof

The elements (π−1+n−110)\left(\begin{smallmatrix}\pi^{-1}+n&-1\\1&0\end{smallmatrix}\right), n∈Zn\in\Z, have traces of valuation −1-1 at p\mathfrak p, which forces translation length 2, and the traces are distinct. The two diagonal elements are conjugate by (0−110)\left(\begin{smallmatrix}0&-1\\1&0\end{smallmatrix}\right), and the residuals were computed.

Theorem(Two ways to carry the table across a broken loop) computed

Let u=(e0+⋯+e6)/7u=(e_0+\dots+e_6)/\sqrt7 and J0=LuJ_0=L_u, a complex structure on O\Oct that splits O⊗C\Oct\otimes\C into two quartets. G2G_2 is the stabilizer of a unit spinor in Spin(7)\mathrm{Spin}(7), and the stabilizer of uu is SU(3)u\mathrm{SU}(3)_u in G2G_2 and SU(4)u\mathrm{SU}(4)_u in Spin(7)\mathrm{Spin}(7), whose chiral spinors are the two quartets. Call a holonomy misaligned when it moves the table’s light direction a∗a^*, and let gg be its collineation, one of the 147 outside F21F_{21}. Then no relabelling RR over gg preserves J0J_0 or reverses it: ⟨u,R(u)⟩\langle u,R(u)\rangle is 37\tfrac37 for the three relabellings of residual 2, −17-\tfrac17 for four and −57-\tfrac57 for one.

(1) 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 J0J_0, and it is an automorphism of O\Oct, up to sign, exactly when hh fixes a∗a^*; the maps ±Ag\pm A_g form a copy of SL⁡(2,7)\SL(2,7). (2) Every relabelling over gg is ±AgLex1⋯Lexk\pm A_gL_{e_{x_1}}\cdots L_{e_{x_k}}, where x1<⋯<xkx_1<\dots<x_k are the units it reverses. (3) Of the 128 realizations of gg in Spin(7)\mathrm{Spin}(7), exactly 2 preserve J0J_0, namely ±Ag\pm A_g, exactly 8 preserve the product, the relabellings, and none preserves both unless hh fixes a∗a^*.

Proof

(1) The LexL_{e_x} generate an irreducible Clifford module on O≅R8\Oct\cong\R^8, so an intertwiner is unique up to scalar; existence was computed for all 168 collineations, and J0=∑xLex/7J_0=\sum_xL_{e_x}/\sqrt7 is carried to itself. From A(exy)=eg(x)A(y)A(e_xy)=e_{g(x)}A(y), ±A\pm A is an automorphism exactly when A(1)=±1A(1)=\pm1. (2) Ag−1RA_g^{-1}R and the Clifford product over the reversed units both conjugate each LexL_{e_x} to ±Lex\pm L_{e_x} with the same signs, so by Schur’s lemma they agree up to a scalar. (3) A realization preserving J0J_0 fixes uu and so reverses no unit; one preserving the product lies in G2G_2; both together put gg in F21F_{21}. Computed.

Theorem(What sees the running) computed

For a misaligned holonomy let TT be the table exex+1=ex+3e_xe_{x+1}=e_{x+3} with its light direction and T′=Ag⋅TT'=A_g\cdot T the table that AgA_g carries across the loop. The unit of T′T' is Ag(1)=±ec1A_g(1)=\pm e_{c_1}, where c1=g(c0)c_1=g(c_0) is the point of the antiflag whose pair is {a∗,h(a∗)}\{a^*,h(a^*)\}. TT and T′T' have the same metric, the same J0J_0 and the same Cayley form of left type, the 4-form preserved by the spin group that the products LexLeyL_{e_x}L_{e_y} generate; their associative 3-forms differ, and their common derivations form su(3)c1\mathfrak{su}(3)_{c_1}.

(1) The following agree for TT and T′T': the edges of the Coxeter graph and their involutions; the Fano orientation on the labels, modulo sign changes of the units; the assignment of points read from each table’s own tour; the face half-turns; for each of the 70 four-sets of P1(F7)\Proj^1(\F_7), whether the product of its four units is real and otherwise which point its imaginary unit names; J0J_0; and the Cayley form of left type. (2) The unit moves from the line of 1 to the line of ec1e_{c_1}, and the plane span{1,ec}\mathrm{span}\{1,e_c\} is a unital subalgebra of T′T' only for c=c1c=c_1, where T′T' exchanges the roles of the unit and ec1e_{c_1}. (3) The planes carried by the maps AgA_g from the seven pairs through a∗a^* form a family that every AgA_g carries to itself, and it agrees with the planes span{1,ec}\mathrm{span}\{1,e_c\} exactly on those seven.

So at one scale only the table’s unit tells the two transports apart. An expectation registered before the computation, that the two tables share the Cayley form built from the triple cross product, failed: that form is preserved by the spin group of right multiplications, and the form of left type, identified afterwards, is the shared one.

Proof

Each object in (1) is built from the projective line, the labels, J0J_0 and the left spin structure by constructions covariant under AgA_g, which realizes hh on the line and gg on the labels; computed for all 147. A common automorphism of TT and T′T' fixes 1 and ±ec1\pm e_{c_1}, so it lies in G2∩Stab(ec1)=SU(3)c1G_2\cap\mathrm{Stab}(e_{c_1})=\mathrm{SU}(3)_{c_1}, and conversely.

Theorem(Charge is kept observer by observer) computed

Let each of the 28 antiflags carry its own copy of the table, the copies compared only along the edges of the Coxeter graph by the flat class of comparisons. Write c(o)c(o) for the point of an antiflag oo and Col(c)\mathrm{Col}(c) for the 96 relabellings fixing ece_c, which lie in SU(3)c\mathrm{SU}(3)_c. Over a collineation gg, a per-observer transport chooses a relabelling RoR_o over gg at each antiflag, with signs sos_o given by Roec(o)=soeg c(o)R_oe_{c(o)}=s_oe_{g\,c(o)}; it is clock-keeping when every so=+1s_o=+1, and a single map when every RoR_o is the same. Along every edge (o,o′)(o,o') the transformed comparison carries eg c(o)e_{g\,c(o)} to soso′eg c(o′)s_os_{o'}e_{g\,c(o')}, so it keeps the edge’s class exactly when soso′=+1s_os_{o'}=+1: the signs form a Z/2\Z/2-cocycle on the Coxeter graph, and since the graph is connected they are constant.

Let hh be a misaligned holonomy and gg its collineation. (1) At every antiflag exactly four of the eight relabellings over gg keep its point, and any two of them differ by an element of Col(g c(o))\mathrm{Col}(g\,c(o)), so the clock-keeping transport is unique up to Col\mathrm{Col} at every antiflag. (2) Every clock-keeping choice satisfies all 42 edges; one takes for RoR_o a relabelling of residual 2 whose reversed pair avoids c(o)c(o). (3) The transformed comparisons are gauge equivalent to the flat class by elements of the groups Col\mathrm{Col}. (4) For every antiflag oo, the transport back along any path composed with RoR_o lies in Col(c(o))\mathrm{Col}(c(o)). (5) In every antiflag’s frame, SU(3)\mathrm{SU}(3) at the target point restores J0J_0.

Proof

(1) 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). (2) The sign condition, and the three relabellings of residual 2, which reverse each point other than c0c_0 once and c0c_0 never. (3) and (4) By flatness. (5) SU(3)\mathrm{SU}(3) at a unit carries R(u)R(u) back to uu when that unit is not reversed. All parts were computed on the 147 misaligned holonomies, on random gauge representatives and for twenty random clock-keeping choices per holonomy.

Proposition(One map breaks the meetings) computed

Every pair of distinct points is joined by exactly two edges of the Coxeter graph, and no edge joins antiflags with the same point. A single map over gg that reverses a set SS of points fails the edge condition exactly on the 2∣S∣(7−∣S∣)2|S|(7-|S|) of the 42 edges that join SS to its complement, also after any element of Col\mathrm{Col} at the targets. Over a misaligned holonomy the eight single maps fail at 20 edges (the three of residual 2), 24 (four) and 12 (one), so none is consistent with the edges; over an aligned holonomy the unsigned map fails nowhere.

Proposition(No twist of order two) computed

Let XX be the Coxeter graph with its 24 heptagons as faces. (1) H1(X;Z)=0H_1(X;\Z)=0 and π1(X)=1\pi_1(X)=1, so a comparison system that is trivial around every heptagon is trivial around every closed path, whatever its structure group. (2) For one broken loop the flat Z/2\Z/2 data on the mapping torus form Z/2\Z/2: a reversal of every antiflag together, never of a pattern of points. (3) Hom⁡(SL⁡(2,Z[ω]),Z/2)=0\operatorname{Hom}(\SL(2,\Z[\omega]),\Z/2)=0 and Hom⁡(ΓS,Z/2)=0\operatorname{Hom}(\Gamma_S,\Z/2)=0; so if the symmetries of the scale tree act by lifts consistent with the edges, the global sign they assign is trivial.

Over the stabilizer S3S_3 of an antiflag the extension 23⋅L3(2)2^3{\cdot}L_3(2) splits, faithfully, by clock-keeping lifts, and the induced lifts form an honest action of the 168 collineations on the 28 copies; so the relabellings, which cannot act on one table without leaving signs, act honestly antiflag by antiflag. A flat comparison system invariant under this action would give a homomorphism of PSL⁡(2,7)\PSL(2,7) into a group Col\mathrm{Col} of order 96 restricting to that faithful splitting, which simplicity forbids; with values in SU(3)\mathrm{SU}(3) it would be one of Klein’s representations 3\mathbf3 or 3ˉ\bar{\mathbf3}.

Proof

(1) The heptagons’ boundaries have rank 15 over Q\Q and over F2\F_2, with all Smith invariants 1; the fundamental group was computed by coset enumeration. (2) π1\pi_1 of the mapping torus is Z\Z by (1). (3) Z[ω]\Z[\omega] is Euclidean, so SL⁡(2,Z[ω])\SL(2,\Z[\omega]) is generated by elementary matrices. For a homomorphism ϕ\phi to Z/2\Z/2, f(x)=ϕ(E12(x))f(x)=\phi(E_{12}(x)) is additive, and conjugation by diag(ω2,ω)\mathrm{diag}(\omega^2,\omega) gives f(ωx)=f(x)f(\omega x)=f(x), so ff vanishes on (1−ω)Z[ω](1-\omega)\Z[\omega], of index 3, and so everywhere; likewise for E21E_{21}. ΓS\Gamma_S is the amalgam of two conjugates of SL⁡(2,Z[ω])\SL(2,\Z[\omega]) and is generated by them. The split action was checked on all 1682168^2 pairs at all 28 antiflags.

Theorem(Closed paths across scales) computed

Each vertex of the scale tree carries a Coxeter graph on the 28 pairs of its link. Take the root t0t_0 and its child vv in direction 0. A site of the two-frame truncation is a pair of its 14 boundary classes: the 21 root-side pairs, the 21 fine pairs in the link of vv, and 49 mixed sites, seen at t0t_0 as a pair {0,d}\{0,d\} and at vv as {u,∞v}\{u,\infty_v\}; two sites meet at a frame when both are its pairs and are joined there by an edge of its Coxeter graph. In P1(Z/49)\Proj^1(\Z/49) a fine pair has exactly 49 coarse partners, all over one pair of the child frame, and the coarse pairs over a residue disk join the two stars by a complete bipartite graph K7,7K_{7,7}.

(1) The truncation has 91 sites and 336 meetings and no triangles. Its 882 four-cycles lie inside one frame, through two sites over one pair, 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 are trivial exactly when the identifications across scales are constant. (3) With each frame’s lifted heptagons and four-cycles as faces the complex has H1≅Z48H_1\cong\Z^{48}, without torsion; adding the five-cycles gives H1=0H_1=0 and a simply connected complex, so across one edge of the tree a flat comparison system is unique up to gauge once the five-cycles are flat. (4) For a hopping with one hop of unit amplitude per meeting, carrying the block of its comparison, in every background with reversible links tr⁡Hk\operatorname{tr}H^k for k≤4k\le4 does not depend on the background, and tr⁡H5=60 (882−W5)\operatorname{tr}H^5=60\,(882-W_5), with W5=∑(1−13Re⁡tr⁡h)W_5=\sum\bigl(1-\tfrac13\operatorname{Re}\operatorname{tr}h\bigr) over the five-cycles.

Proof

Closed walks of length at most four are backtracks and four-cycles, which are trivial, and a closed five-walk in a graph without triangles is a five-cycle, traversed in 10 ways. Simple connectivity follows by van Kampen over the 49 mixed sites and the connectedness of the 7×77\times7 rook’s graph. The enumeration, the ranks and the moments were computed.

Theorem(The Gaussian decimation) computed

Put Wilson’s weight β\beta on the heptagons and wβw\beta on each five-cycle, and integrate out the finest frames. A star, the seven pairs through one point of a frame’s projective line, has members pairwise at distance three with a unique 3-path, and the 21 transports along these paths form its star connection; the 3-path map from the cycle space of K7K_7 to the frame’s is an isomorphism. At leading order in 1/β1/\beta, integrating out a child frame with any positive semi-definite effective form on its 42 links, together with the 49 cross links, induces on the parent’s star connection the form 7w Pcycle7w\,P_{\mathrm{cycle}}, whatever the child’s form, with PcycleP_{\mathrm{cycle}} the projector onto the cycle space of K7K_7. With its seven children integrated out a frame’s effective form is reached after one level and unchanged by deeper levels; on the 15 physical directions its eigenvalues against the heptagon form are 1+wκ1+w\kappa, with κ=12±15/2\kappa=12\pm\sqrt{15/2} (six times each), 21/221/2 (twice) and 129/8129/8 (once).

Every plaquette weight of the tower is ferromagnetic, and for the Z/2\Z/2 factors of the signs and for U(1)U(1) every Wilson loop of a frame is non-decreasing as children are attached, by the inequalities of Griffiths and Ginibre. Refining each meeting to level two copies loops rather than subdividing them: every meeting becomes seven disjoint copies of K7,7K_{7,7}, every heptagon lifts to exactly 777^7 heptagons of full length, no loop is subdivided, and at leading order the coarse coupling is 777^7 times the fine one.

Proof

Each row of cross links can absorb only the gradient part of the star connection, which leaves w∥PcycleT∥2w\lVert P_{\mathrm{cycle}}T\rVert^2 per row, and a flat child with cross links constant down each column attains this bound. For the refinement, each lifted heptagon carries a flux whose mean is the coarse flux, so convexity gives the factor 777^7, attained by the pulled-back configuration. The spectrum, the decimation of random, rigid and zero child forms and the certificate on one heptagon’s fibre were computed.

The volume’s word
meeting