OctoInformBeta

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

Lemma 5.3: Compatible supports and a supremum metric estimate from a common lower bound on reduced trace lengths

A generator step controls direction points.

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 graph on a finite vertex set VV, with every clique of size at most three, and let P=ALP=A_L be its right-angled Artin group. Write ℓ(g)\ell(g) for the length of the reduced normal trace of g∈Pg\in P. A signed standard generator is a standard generator or its inverse.

The standard coordinate simplex Δ(V)\Delta(V) is the set of nonnegative real weight functions on VV with total mass one: Δ(V)={b∈ℝV:b(v)≥0 for all v∈V,∑v∈Vb(v)=1}.\Delta(V)=\left\{b\in\mathbb R^V: b(v)\geq 0\text{ for all }v\in V,\quad \sum_{v\in V}b(v)=1\right\}.(1)✦ For a subset s⊆Vs\subseteq V, the closed coordinate face FsF_s consists of the points of (1) whose coordinates vanish outside ss: Fs={b∈Δ(V):b(v)=0 for every v∉s}.F_s=\{b\in\Delta(V): b(v)=0\text{ for every }v\notin s\}.(2)✦ The simplex two-skeleton T(2)(V)T^{(2)}(V) is the union of the faces (2) indexed by subsets with at most three vertices: T(2)(V)=⋃s⊆V|s|≤3Fs.T^{(2)}(V)=\bigcup_{\substack{s\subseteq V\\ |s|\leq 3}}F_s.(3)✦

For g∈Pg\in P with ℓ(g)>0\ell(g)>0, the Artin direction point b(g)b(g) is the point of (3) whose coordinate at each vertex is its normalized initial-letter count in the reduced normal trace of gg.✦ The supremum metric on T(2)(V)T^{(2)}(V) is d∞(b,c)=maxv∈V|b(v)−c(v)|,max⁡⌀=0.d_\infty(b,c)=\max_{v\in V}|b(v)-c(v)|, \qquad \max\varnothing=0.(4)

Two vertices of LL are reflexively adjacent if they are equal or adjacent.✦ For a coordinate vector bb, write supp⁡(b)={v∈V:b(v)≠0}\operatorname{supp}(b)=\{v\in V:b(v)\ne0\}. Two points b,c∈T(2)(V)b,c\in T^{(2)}(V) are compatible when every pair of vertices in the union of their supports is reflexively adjacent: Comp⁡L(b,c)⇔every two vertices of supp⁡(b)∪supp⁡(c) are equal or adjacent in L.\operatorname{Comp}_L(b,c) \quad\Longleftrightarrow\quad \text{every two vertices of } \operatorname{supp}(b)\cup\operatorname{supp}(c) \text{ are equal or adjacent in }L.(5)✦

The Claim

Theorem 1. Let g∈Pg\in P, and let xx be a signed standard generator. Suppose ℓ(g)>0\ell(g)>0 and ℓ(gx)>0\ell(gx)>0, and let NN be a nonnegative integer no larger than either length. Then, with compatibility as in (5), Comp⁡L(b(g),b(gx))andd∞(b(g),b(gx))≤2N+1.\operatorname{Comp}_L\bigl(b(g),b(gx)\bigr) \qquad\text{and}\qquad d_\infty\bigl(b(g),b(gx)\bigr)\leq\frac{2}{N+1}.(6)✦

In the paper, the result reads: if gg and gxgx are nonidentity, with xx a signed standard generator, their direction vectors lie in a common simplex of the flag complex of LL, and if their word lengths are nn and n+1n+1, in either order, then ∥b(gx)−b(g)∥1≤2/(n+1)\|b(gx)-b(g)\|_1\leq 2/(n+1).

What Is Checked

The estimate (6) concerns the supremum metric (4) on Artin direction points for a right-angled Artin group whose defining graph has cliques of size at most three, with a common lower bound on the positive reduced trace lengths. The support of the initial-letter count of a reduced normal trace is a clique of LL; the Artin direction construction places its normalized vector in the face indexed by that support.