OctoInformBeta

OpenAI preprint, September 2026 · §5. Small transport with nontrivial holonomy

Proposition 5.1: Flat quaternion transport on negative integral levels and its boundary-basis triangle words

Small level labels retain nontrivial holonomy.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Let H=SU(2)H=\mathrm{SU}(2) be the group of unit quaternions.✦ An edge label takes values in HH; its distance from the identity is the quaternion chord norm ∥h−1∥\|h-1\|. The holonomy of a directed walk is the product of its labels in traversal order, with an inverse for each reverse traversal.

The seed presentation complex has two circles, labelled xx and yy, and two polygonal cells with boundary words R0=x2y−5,R1=x2(yx−1)3.R_0=x^2y^{-5},\qquad R_1=x^2(yx^{-1})^3.(1)✦ Each circle is subdivided into three directed edges, running from the common base vertex through two interior vertices and back to the base vertex. The boundary polygon for RiR_i in (1) has 3|Ri|3|R_i| edges and is coned from its own vertex.✦ A sector of the seed presentation complex is a triangle obtained by coning a subdivided boundary polygon, indexed by the position jj of a boundary edge in the cyclic order.✦ Its letter is the letter of RiR_i at position ⌊j/3⌋\lfloor j/3\rfloor✦; its circle edge has index jmod⁡3j\bmod 3 for a positive letter and 2−(jmod⁡3)2-(j\bmod 3) for a negative letter.✦ Its initial vertex is the initial endpoint of that circle edge for a positive letter and the terminal endpoint for a negative letter.✦ Its other two edges are the radial edges at that sector and the next sector. The endpoints of a circle edge are its initial and terminal vertices; the endpoints of the radial edge indexed by a sector are its polygon cone vertex and its sector initial vertex. The vertices of a sector form the union of the endpoint sets of its three edges.✦

Let VV be the set of vertices, edges and sectors of this complex.✦ Its cell incidence graph LL joins a vertex to an incident edge or sector, and an edge to a sector containing it.✦ Write P=ALP=A_L, with standard generators xvx_v, and let λ:P→ℤ\lambda:P\to\mathbb Z send every xvx_v to 11. The source group is G=ker⁡λG=\ker\lambda. For N∈ℕN\in\mathbb N, the negative integral level and its directed steps are XN={g∈P:λ(g)=−N},Eqr(g)=gxqxr−1,Uq(g)=gxq∈XN−1(N>1),zN,q=xq−N∈XN.\begin{aligned} X_N&=\{g\in P:\lambda(g)=-N\},& E_{qr}(g)&=gx_qx_r^{-1},\\ U_q(g)&=gx_q\in X_{N-1}\quad(N>1),& z_{N,q}&=x_q^{-N}\in X_N. \end{aligned}(2) A level walk pp in XNX_N is a finite sequence of steps in (2), with qq adjacent to rr in LL and the ordered pair (q,r)(q,r) recorded at every step, including parallel edges; the empty walk stays at its initial vertex. For a label function a:XN×V×V→Ha:X_N\times V\times V\to H, write Hol⁡a(p)\operatorname{Hol}_a(p) for its holonomy, with value 11 on the empty walk.✦ The level edge terminal vertex Eqr(g)E_{qr}(g) associated with the ordered pair (q,r)(q,r) is the point gxqxr−1gx_qx_r^{-1} of XNX_N. The pure power vertex zN,qz_{N,q} associated with qq is the point xq−Nx_q^{-N} of XNX_N.

Quaternion Transport

The transport construction also applies to a finite graph LL on VV whose cliques have at most three vertices. A point bb of the coordinate simplex on VV is a nonnegative weight function on VV of total weight 11.✦ The face of the coordinate simplex on a subset s⊆Vs\subseteq V is the set of weight functions supported on ss; the simplex two-skeleton is Δ(2)(V)=⋃|s|≤3{b:V→ℝ:bv≥0,∑vbv=1,bv=0(v∉s)}.\Delta^{(2)}(V)= \bigcup_{|s|\leq3} \left\{b:V\to\mathbb R: b_v\geq0,\ \sum_v b_v=1,\ b_v=0\ (v\notin s)\right\}.(3)✦ For b∈Δ(2)(V)b\in\Delta^{(2)}(V), choose a support vertex ρ(b)\rho(b) with bρ(b)≠0b_{\rho(b)}\ne0.✦

Two vertices of LL are related when they are equal or adjacent.✦ A flat connection is a function h:V×V→Hh:V\times V\to H such that huvhvw=huwwhenever u,v,w are pairwise related.h_{uv}h_{vw}=h_{uw} \quad\text{whenever $u,v,w$ are pairwise related}.(4)✦ A family of quaternions QvQ_v is in general position for hh when, for every u∈Vu\in V and every subset s⊆Vs\subseteq V of cardinality at most three, the family (huvQv)v∈s(h_{uv}Q_v)_{v\in s} is linearly independent over ℝ\mathbb R.✦ The affine gauge Bu(b)B_u(b) and its normalized gauge γu(b)\gamma_u(b) are Bu(b)=∑v∈VbvhuvQv,γu(b)=Bu(b)∥Bu(b)∥if Bu(b)≠0.B_u(b)=\sum_{v\in V}b_vh_{uv}Q_v,\qquad \gamma_u(b)=\frac{B_u(b)}{\|B_u(b)\|}\quad\text{if }B_u(b)\ne0.(5) Radial normalization at zero takes a fixed value in HH. Local chart transport, rooted transport and two-piece transport are, respectively, Tu(b,c)=γu(b)−1γu(c),T(b,c)=Tρ(b)(b,c),ℰ(b,c,d)=T(b,c)T(c,d).\begin{aligned} T_u(b,c)&=\gamma_u(b)^{-1}\gamma_u(c),\\ T(b,c)&=T_{\rho(b)}(b,c),\\ \mathcal E(b,c,d)&=T(b,c)T(c,d). \end{aligned}(6)

For a finite graph LL whose cliques have at most three vertices and an element g∈Pg\in P, the reduced Artin normal trace records a reduced word for gg up to exchanges of adjacent commuting letters; when this trace has positive length, the Artin direction point β(g)∈Δ(2)(V)\beta(g)\in\Delta^{(2)}(V) has barycentric coordinates equal to its normalized initial-letter counts. At a negative integral level, write βN(g)=β(g)\beta_N(g)=\beta(g) for g∈XNg\in X_N, N>0N>0.✦ The level edge transport uses the upper vertex from (2): aN(g;q,r)=ℰ(βN(g),βN−1(Uq(g)),βN(Eqr(g))),N>1.a_N(g;q,r)=\mathcal E\bigl( \beta_N(g),\beta_{N-1}(U_q(g)),\beta_N(E_{qr}(g))\bigr),\qquad N>1.(7)✦ For a graph walk ww, write Hol⁡h(w)\operatorname{Hol}_h(w) for the product of the labels hqrh_{qr} along its successive directed edges.✦

Boundary-basis Words

A crossing shape (w,j)(w,j) of dimension kk in LL consists of an ordered simplex list ww with kk vertices and an integer lower height jj satisfying Sk={(w,j):w is a valid ordered simplex,|w|=k,j<0<j+k}.S_k=\{(w,j):w\text{ is a valid ordered simplex},\ |w|=k, \ j<0<j+k\}.(8) For an ordered edge [a,b][a,b], its crossing edge shape is sab=([a,b],−1)∈S2s_{ab}=([a,b],-1)\in S_2.✦ The alphabet S=S2S=S_2 assigns the group value v(sab)=xa−1xb∈Gv(s_{ab})=x_a^{-1}x_b\in G to its letter; the letters remain distinct when their values coincide.✦

Fix a vertex o∈Vo\in V. Translation identifies GG with XNX_N, and pulls a level label function aa back to based labels bNb_N: τN(g)=xo−Ng,τN−1(k)=xoNk,bN(g;sab)=a(τN(g);b,a).\tau_N(g)=x_o^{-N}g,\qquad \tau_N^{-1}(k)=x_o^Nk,\qquad b_N(g;s_{ab})=a(\tau_N(g);b,a).(9) In the Cayley graph for the alphabet SS, a letter ss runs from gg to gv(s)gv(s); let F(S)F(S) be the free group on SS, and let b:G×S→Hb:G\times S\to H be a based label function. The semidirect label homomorphism and path holonomy are ℓb:F(S)→(G→H)⋊G,ℓb(s)=(b(⋅;s),v(s)),Hol⁡b(w;g)=ℓb(w)function(g),\ell_b:F(S)\longrightarrow (G\to H)\rtimes G, \quad \ell_b(s)=(b(\,\cdot\,;s),v(s)),\qquad \operatorname{Hol}_b(w;g)=\ell_b(w)_{\mathrm{function}}(g),(10) where GG acts on functions by (k⋅f)(g)=f(gk)(k\cdot f)(g)=f(gk).

Write tabt_{ab} for the free generator corresponding to sabs_{ab}. For a crossing triangle s=([a,b,c],j)∈S3s=([a,b,c],j)\in S_3, its boundary-basis triangle word is Rs={tactbc−1tab−1,j=−1,tab(tbctabtac−1)tab−1,j=−2.R_s= \begin{cases} t_{ac}t_{bc}^{-1}t_{ab}^{-1},&j=-1,\\ t_{ab}(t_{bc}t_{ab}t_{ac}^{-1})t_{ab}^{-1},&j=-2. \end{cases}(11)✦ These are the lower and upper triangle words, respectively.

The Claim

Theorem 1. For the seed cell incidence graph LL, let ε>0\varepsilon>0. There exist N>1N>1, a function a:XN×V×V→Ha:X_N\times V\times V\to H, a vertex g*∈XNg_*\in X_N and a closed level walk pp based at g*g_* such that a(Eqr(g);r,q)=a(g;q,r)−1,∥a(g;q,r)−1∥<ε(g∈XN,q,r∈V),a(g0;q0,r0)a(g1;q1,r1)a(g2;q2,r2)=1if Eqiri(gi)=gi+1(imod⁡3),Hol⁡a(p)≠1.\begin{gathered} a(E_{qr}(g);r,q)=a(g;q,r)^{-1},\qquad \|a(g;q,r)-1\|<\varepsilon \quad(g\in X_N,\ q,r\in V),\\ a(g_0;q_0,r_0)a(g_1;q_1,r_1)a(g_2;q_2,r_2)=1 \quad\text{if }E_{q_i r_i}(g_i)=g_{i+1}\ (i\bmod3),\\ \operatorname{Hol}_a(p)\ne1. \end{gathered}(12)✦

In the paper, the result reads: for every ε>0\varepsilon>0, the oriented edges ee of the level complex XX, with e¯\overline e denoting the reverse edge, admit HH-labels heh_e with he¯=he−1h_{\overline e}=h_e^{-1} and ∥he−1∥<ε\|h_e-1\|<\varepsilon, whose product around every triangular two-cell is 11 but whose product along some closed edge path is not 11.

What Is Checked

The statement (12) is over the seed cell incidence graph and the translated negative integral levels XNX_N, with level walks and quaternion holonomy as defined above. For the general transport (7), the graph is finite with cliques of cardinality at most three, and QQ is in general position for hh.

Theorem 2. Every point of (3) has nonempty support.✦ An ordered triangle [a,b,c][a,b,c] has the ordered edges [a,b][a,b], [a,c][a,c] and [b,c][b,c] used in (11).✦

For every δ>0\delta>0 there is M∈ℕM\in\mathbb N such that ∥aN(g;q,r)−1∥<δ(N≥M,N>1,g∈XN,q,r∈V).\|a_N(g;q,r)-1\|<\delta \quad(N\geq M,\ N>1,\ g\in X_N,\ q,r\in V).(13)✦ Assume also that hh is flat. Let N>1N>1 satisfy 8/N<1/(|V|+1)8/N<1/(|V|+1), and let three steps satisfy Eqiri(gi)=gi+1E_{q_i r_i}(g_i)=g_{i+1} with indices modulo three. Then aN(g0;q0,r0)aN(g1;q1,r1)aN(g2;q2,r2)=1.a_N(g_0;q_0,r_0)a_N(g_1;q_1,r_1)a_N(g_2;q_2,r_2)=1.(14)✦ For a closed graph walk ww based at qq with Hol⁡h(w)≠1\operatorname{Hol}_h(w)\ne1, and any N>1N>1, there is a closed level walk pp based at zN,qz_{N,q} satisfying Hol⁡aN(p)≠1.\operatorname{Hol}_{a_N}(p)\ne1.(15)✦ Let a:XN×V×V→Ha:X_N\times V\times V\to H assign inverse labels to reverse steps and have product 11 on every closed triple of steps. For the based labels (9), every s∈S3s\in S_3 and g∈Gg\in G satisfy Hol⁡bN(Rs;g)=1.\operatorname{Hol}_{b_N}(R_s;g)=1.(16)✦