OctoInformBeta

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

§5 (setting): Barycentric points supported on at most three vertices determine transport on negative integral levels

Trace directions give quaternion edge labels.

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 LL be a finite graph with vertex set VV, and suppose that every clique of LL has at most three vertices. Write P=ALP=A_L for its right-angled Artin group, with standard generators xvx_v for v∈Vv\in V. The height homomorphism λ:P→ℤ\lambda\colon P\to\mathbb Z sends each xvx_v to 11, and G=ker⁡λG=\ker\lambda. Quaternion labels will be assigned to paths that pass through two successive height levels of PP.

The standard coordinate simplex Δ(V)\Delta(V) on VV is the set of nonnegative weights of total mass one, as in (1). Δ(V)={b∈ℝV:bv≥0 for every v∈V,∑v∈Vbv=1}.\Delta(V)=\left\{b\in\mathbb R^V: b_v\geq0\text{ for every }v\in V,\quad \sum_{v\in V}b_v=1\right\}.(1)✦ For a subset s⊆Vs\subseteq V, the closed coordinate face Δ(s)\Delta(s) is the subset of Δ(V)\Delta(V) defined in (2). Δ(s)={b∈Δ(V):bv=0 whenever v∉s}.\Delta(s)=\{b\in\Delta(V):b_v=0\text{ whenever }v\notin s\}.(2)✦ The simplex two-skeleton Δ(2)(V)\Delta^{(2)}(V) is the subset of Δ(V)\Delta(V) consisting of points in faces with at most three vertices, as specified in (3)✦; a triangle point b∈Δ(V)b\in\Delta(V) is a point of Δ(2)(V)\Delta^{(2)}(V).✦ Δ(2)(V)=⋃s⊆V|s|≤3Δ(s).\Delta^{(2)}(V)=\bigcup_{\substack{s\subseteq V\\|s|\leq3}}\Delta(s).(3)

For g∈Pg\in P, denote the length of its reduced normal trace by ℓ(g)\ell(g). When ℓ(g)>0\ell(g)>0, write D(g)∈ℝVD(g)\in\mathbb R^V for the normalized direction vector supplied by the Artin trace construction.

Let H=SU(2)H=\mathrm{SU}(2) be the group of quaternions of norm one in ℍ\mathbb H.✦ Quaternion radial normalization is the map ν:ℍ→H\nu\colon\mathbb H\to H given by ν(z)=z/‖z‖\nu(z)=z/\lVert z\rVert for z≠0z\ne0, with a fixed value in HH at zero.✦ Fix labels hav∈Hh_{av}\in H and quaternions Qv∈ℍQ_v\in\mathbb H for a,v∈Va,v\in V. The affine quaternionic gauge RaR_a on ℝV\mathbb R^V and its normalized gauge UaU_a on Δ(2)(V)\Delta^{(2)}(V) are given by (4). Ra(b)=∑v∈VbvhavQv∈ℍ,b∈ℝV,Ua(b)=ν(Ra(b))∈H,b∈Δ(2)(V).\begin{aligned} R_a(b)&=\sum_{v\in V}b_v\,h_{av}Q_v\in\mathbb H, &&b\in\mathbb R^V,\\ U_a(b)&=\nu(R_a(b))\in H, &&b\in\Delta^{(2)}(V). \end{aligned}(4) Choose a support vertex ρ(b)\rho(b) for each triangle point bb, with the condition in (5). ρ(b)∈supp⁡(b):={v∈V:bv≠0}.\rho(b)\in\operatorname{supp}(b) :=\{v\in V:b_v\ne0\}.(5)✦ For a vertex a∈Va\in V and triangle points b,c∈Δ(2)(V)b,c\in\Delta^{(2)}(V), the local chart transport Ca(b,c)∈HC_a(b,c)\in H is the quotient of the gauges at bb and cc specified in (6).✦ For triangle points b,c∈Δ(2)(V)b,c\in\Delta^{(2)}(V), the rooted transport T(b,c)∈HT(b,c)\in H is the local chart transport at the support vertex ρ(b)\rho(b), as specified in (6). Ca(b,c)=Ua(b)−1Ua(c),T(b,c)=Cρ(b)(b,c).C_a(b,c)=U_a(b)^{-1}U_a(c),\qquad T(b,c)=C_{\rho(b)}(b,c).(6) The two-piece transport E(b,c,d)∈HE(b,c,d)\in H through triangle points b,c,db,c,d is the product in traversal order in (7). E(b,c,d)=T(b,c)T(c,d).E(b,c,d)=T(b,c)T(c,d).(7)✦

The Definition

Definition 1. For an element g∈Pg\in P with ℓ(g)>0\ell(g)>0, its Artin direction point β(g)∈Δ(2)(V)\beta(g)\in\Delta^{(2)}(V) has barycentric coordinates given by the normalized initial-letter counts of its reduced normal trace, as in (8).✦ Its coordinate at a vertex outside the count support is zero. β(g)=D(g)∈Δ(2)(V).\beta(g)=D(g)\in\Delta^{(2)}(V).(8)✦ At height −N-N, where NN is a natural number, the integral level is the subset ℒ−N\mathcal L_{-N} of PP defined in (9). ℒ−N={g∈P:λ(g)=−N}.\mathcal L_{-N}=\{g\in P:\lambda(g)=-N\}.(9)✦ For N>0N>0 and g∈ℒ−Ng\in\mathcal L_{-N}, the level direction point βN(g)\beta_N(g) is the point of Δ(2)(V)\Delta^{(2)}(V) specified in (10). βN(g)=β(g)∈Δ(2)(V).\beta_N(g)=\beta(g)\in\Delta^{(2)}(V).(10)✦ Given g∈ℒ−Ng\in\mathcal L_{-N} and vertices u,v∈Vu,v\in V, the terminal vertex guv∈ℒ−Ng_{uv}\in\mathcal L_{-N} is the group element specified in (11). guv=gxuxv−1∈ℒ−N.g_{uv}=gx_ux_v^{-1}\in\mathcal L_{-N}.(11)✦ For N>1N>1, g∈ℒ−Ng\in\mathcal L_{-N} and u∈Vu\in V, the upper vertex gu+∈ℒ−(N−1)g_u^+\in\mathcal L_{-(N-1)} is the group element specified in (12). gu+=gxu∈ℒ−(N−1).g_u^+=gx_u\in\mathcal L_{-(N-1)}.(12)✦ With N>1N>1, g∈ℒ−Ng\in\mathcal L_{-N} and u,v∈Vu,v\in V, define the level edge label κN(g;u,v)∈H\kappa_N(g;u,v)\in H by the transport in (13). κN(g;u,v)=E(βN(g),βN−1(gu+),βN(guv)).\kappa_N(g;u,v) =E\bigl(\beta_N(g),\beta_{N-1}(g_u^+),\beta_N(g_{uv})\bigr).(13)✦

In the paper, the result reads: for a nonempty reduced trace of g∈Pg\in P, assign each occurrence to the first minimal predecessor direction in a fixed order, let cv(g)c_v(g) count these assignments and put b(g)=∑v∈Vcv(g)ev/|g|b(g)=\sum_{v\in V}c_v(g)e_v/|g|, with eve_v the standard coordinate vector and |g||g| the trace length, and for N≥2N\geq2 and d∈Pd\in P with λ(d)=N\lambda(d)=N, the zero-level vertex map is fN(g)=b(d−1g)f_N(g)=b(d^{-1}g) for g∈Gg\in G.

What Is Checked

The definition is stated over a finite defining graph whose cliques have at most three vertices, with its normalized Artin trace directions and fixed quaternion data hav,Qvh_{av},Q_v. Every triangle point has a nonzero coordinate.✦