OctoInformBeta

OpenAI preprint, September 2026 · §3. Metrics, planar fillings, and torsion

Lemma 3.2: Homotopy by triangle moves, fillings over KK and its lift K̃\widetilde K, reduced closed walks and angle bounds at interior vertices

Nullhomotopic edge loops have triangle fillings without dipoles.

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

Take the complex KK, with three vertices OO, VV, WW and triangles that have one corner at each, and the group GG it presents. Van Kampen’s lemma turns an edge loop of KK that is trivial in GG into a planar diagram of triangles whose boundary reads the loop, and the same holds for the lift K̃\widetilde K of KK over GG. Angle arguments need such a diagram without a pair of adjacent triangles that cancel across their common edge. The question is then what the corners around an interior vertex trace in the link of KK, and how small their angle sum can be.

The Complex and Its Group

A Cartesian block with parameter rr is a finite set of labels ii together with a bijection i↦(α(i),β(i))i \mapsto (\alpha(i), \beta(i)) onto ℤ/s×ℤ/t\mathbb{Z}/s \times \mathbb{Z}/t, for positive integers s,t≥rs, t \ge r.✦ Block presentation data over a set II of labels, with indices 0≤u<r0 \le u < r, consist of a Cartesian block of labels from II for each bb in a set BB, with sides sbs_b, tbt_b and coordinates (αb,βb)(\alpha_b, \beta_b), together with a base block b0∈Bb_0 \in B and a base index u0<ru_0 < r.✦

The complex KK of these data has the vertices OO, VV, WW and three kinds of edges: middle edges xiuvx_{iuv} from VV to WW, for i∈Ii \in I and 0≤u,v<r0 \le u, v < r; left edges Lb,u,jL_{b,u,j} from OO to VV, for b∈Bb \in B, u<ru < r and j∈ℤ/sbj \in \mathbb{Z}/s_b; right edges Rb,v,kR_{b,v,k} from OO to WW, for b∈Bb \in B, v<rv < r and k∈ℤ/tbk \in \mathbb{Z}/t_b. An oriented edge ee is an edge taken in its own direction or in the reverse one✦; e‾\bar e is ee reversed✦, and τ(e)\tau(e) is the vertex at which ee ends, so that ee starts at τ(e‾)\tau(\bar e).✦

For a block bb, a label ii of its Cartesian block and indices u,v<ru, v < r, the triangle of KK with these data has the edges L=Lb,u,αb(i)+v,x=xiuv,R=Rb,v,βb(i)+u,L = L_{b,u,\alpha_b(i)+v}, \qquad x = x_{iuv}, \qquad R = R_{b,v,\beta_b(i)+u},(1) the index αb(i)+v\alpha_b(i)+v read modulo sbs_b and βb(i)+u\beta_b(i)+u modulo tbt_b. The triangle faces of KK are the triples of oriented edges read around a triangle of KK with edges as in (1): the word LxR‾L\,x\,\bar R read from LL, from xx or from R‾\bar R, and the inverse word Rx‾L‾R\,\bar x\,\bar L read from L‾\bar L, from RR or from x‾\bar x.✦

The group GG has one generator for each edge of KK and the relators LxR−1for each triangle,Lb0,u0,0,Rb0,u0,0,L\,x\,R^{-1} \ \text{for each triangle}, \qquad L_{b_0,u_0,0}, \qquad R_{b_0,u_0,0},(2)✦ the last two being the left and the right tree edge, which span a tree on OO, VV, WW. The value eˆ∈G\hat e \in G of an oriented edge ee is the generator of its edge, inverted when ee is reversed.✦

Edge Paths and the Lift

An edge path pp of KK is a finite sequence of oriented edges, each starting where the one before it ends✦; an edge loop at a vertex PP is an edge path that starts and ends at PP; 1P1_P is the empty path at PP, and the word w(p)w(p) of pp is its sequence of oriented edges.✦ Two edge paths pp, qq with the same ends are homotopic, p≃qp \simeq q, when a finite chain of moves, each applied to a subpath, turns one into the other: inserting or deleting a backtrack ee‾e\,\bar e, and replacing LxL\,x by RR or RR by LxL\,x for a triangle (1).✦

The free groupoid on KK has the objects OO, VV, WW and, as morphisms, the edge paths of KK up to cancelling an edge against its reverse.✦ The fundamental groupoid Π(K)\Pi(K) of KK is the quotient of the free groupoid on KK by the triangle relation Lx=RL\,x = R, and an edge path pp has its class [p][p] in Π(K)\Pi(K).✦

The lift K̃\widetilde K of KK over GG has the vertices (P,g)(P, g), for PP a vertex of KK and g∈Gg \in G✦, and the oriented edges (e,g)(e, g), for ee an oriented edge of KK, with (e,g):(τ(e‾),geˆ−1)→(τ(e),g),(e,g)¯=(e‾,geˆ−1).(e, g)\colon (\tau(\bar e),\, g\hat e^{-1}) \longrightarrow (\tau(e),\, g), \qquad \overline{(e, g)} = (\bar e,\, g\hat e^{-1}).(3)✦ A triple of oriented edges of K̃\widetilde K is a triangle face when their first coordinates form a triangle face of KK and each of the three starts where the one before it ends, cyclically.✦ In KK or in K̃\widetilde K, a closed word path at a vertex yy is a word e1⋯ene_1 \cdots e_n in the oriented edges with e1e_1 starting at yy, each ek+1e_{k+1} starting where eke_k ends and ene_n ending at yy; the empty word is one.✦

Triangle Fillings

Fillings are defined for any set EE of labels with a reversal e↦e‾e \mapsto \bar e, a coloring κ\kappa of EE by a set CC, and a set FF of triples in EE, the faces. Over KK, the labels are its oriented edges, the reversal is e↦e‾e \mapsto \bar e, the coloring is the end vertex τ\tau, and the faces are its triangle faces; over K̃\widetilde K, the same notions of K̃\widetilde K.

For permutations ι\iota, φ\varphi of a finite set DD, whose elements are called darts, let ν(f)\nu(f) be the number of cycles of a permutation ff, fixed points counting as cycles of length one, and k(ι,φ)k(\iota, \varphi) the number of components, the orbits of the group generated by ι\iota and φ\varphi.✦ A pair (ι,φ)(\iota, \varphi) of permutations of DD is a planar map when ν(ι)+ν(φ)+ν(ιφ)=|D|+2k(ι,φ).\nu(\iota) + \nu(\varphi) + \nu(\iota\varphi) = |D| + 2\,k(\iota, \varphi).(4)✦ Here ι\iota is a fixed-point-free involution pairing darts into edges, φ\varphi runs around the faces and σ=ιφ\sigma = \iota\varphi around the vertices.

A triangle filling of a word ww in EE is a finite set DD of darts with a fixed-point-free involution ι\iota, a face permutation φ\varphi and a labelling λ:D→E\lambda\colon D \to E, such that (ι,φ)(\iota, \varphi) is a planar map and, for every dart xx, paired darts carry reversed labels, λ(ιx)=λ(x)¯\lambda(\iota x) = \overline{\lambda(x)}, and the darts around each vertex carry labels of one color, κλ(σx)=κλ(x)\kappa\lambda(\sigma x) = \kappa\lambda(x).✦ The boundary ∂\partial of a triangle filling of ww is a list of distinct darts, either empty or one cycle of φ\varphi in order, whose labels spell ww.✦ A triangle filling is triangular when every dart off ∂\partial in a component that meets ∂\partial lies on a cycle of φ\varphi of length exactly three whose labels, in order, form a face. A dart is active when its component meets ∂\partial.✦ A word ww in EE is fillable when it has a triangle filling; it is fillable over KK or over K̃\widetilde K when EE, the reversal, the coloring and the faces are those of KK or of K̃\widetilde K.✦

A dipole of a triangle filling is a pair of adjacent triangles that cancel: six distinct darts x0,…,x5x_0, \dots, x_5 off ∂\partial, in a component that meets ∂\partial, such that φ\varphi has the cycles (x0x1x2)(x_0\,x_1\,x_2) and (x3x4x5)(x_3\,x_4\,x_5), ιx0=x3\iota x_0 = x_3, and λ(x4)=λ(x2)¯,λ(x5)=λ(x1)¯,κλ(x1)∉{κλ(x0),κλ(x2)}.\lambda(x_4) = \overline{\lambda(x_2)}, \qquad \lambda(x_5) = \overline{\lambda(x_1)}, \qquad \kappa\lambda(x_1) \notin \{\kappa\lambda(x_0), \kappa\lambda(x_2)\}.(5)✦

Ribbons and Angles

A triangle ribbon TT is a finite set of darts with a fixed-point-free involution ι\iota, whose cycles are the edges, a face permutation φ\varphi with one of its cycles chosen as the outer face, and a coloring of the vertices, the cycles of σ=ιφ\sigma = \iota\varphi, by the three colors OO, VV, WW.✦ In a triangle ribbon TT, every inner face, that is every cycle of φ\varphi other than the outer face, has exactly one dart at a vertex of each color, and #{vertices}+#{inner faces}=#{edges}+1,\#\{\text{vertices}\} + \#\{\text{inner faces}\} = \#\{\text{edges}\} + 1,(6) the Euler count of a disc. A dart is outer when it lies on the outer face.✦

Angles are measured in units of π/5\pi/5: the corner of a triangle of KK at a vertex of color cc has the angle ω(c)\omega(c), where ω(O)=3,ω(V)=ω(W)=1,\omega(O) = 3, \qquad \omega(V) = \omega(W) = 1,(7)✦ so that the angles of a triangle sum to 55. For a dart dd of TT, write ωd\omega_d for ω\omega of the color of its vertex; the corner angle of dd is 00 when dd is outer and ωd\omega_d otherwise.✦ The angle θ(v)\theta(v) at a vertex vv is the sum of the corner angles of its darts.✦ The boundary of TT is its outer face; it visits a vertex vv once for each outer dart at vv, and vv is interior when the boundary never visits it.

A walk in a simple graph is reduced when no step immediately reverses the previous one: its vertices at positions nn and n+2n+2 differ whenever both exist, with no condition across the base point of a closed walk.✦

The Claim

Theorem 1. Let KK be the complex of block presentation data, GG its group and K̃\widetilde K its lift.

(a) For edge paths pp and qq of KK with the same ends, [p]=[q]in Π(K)⇔p≃q.[p] = [q] \ \text{in } \Pi(K) \iff p \simeq q.(8)✦

(b) If an edge loop pp of KK at a vertex PP is homotopic to 1P1_P, then w(p)is fillable over K.w(p) \ \text{is fillable over } K.(9)✦

(c) If a word w̃\tilde w in the oriented edges of K̃\widetilde K is a closed word path at a vertex of K̃\widetilde K, then w̃is fillable over K̃.\tilde w \ \text{is fillable over } \widetilde K.(10)✦

(d) For any set of labels with a reversal, a coloring and faces, if a word ww is fillable, then whas a triangle filling with no dipole.w \ \text{has a triangle filling with no dipole.}(11)✦

(e) Suppose that the three labels of every face have pairwise distinct colors, that reversal is an involution, that the mirror (e‾1,e‾3,e‾2)(\bar e_1, \bar e_3, \bar e_2) of a face (e1,e2,e3)(e_1, e_2, e_3) is a face, and that a face is determined by its first two labels. If a triangle filling has no dipole and xx is an active dart with xx and σx\sigma x off ∂\partial, then λ(x)≠λ(σ2x).\lambda(x) \neq \lambda(\sigma^2 x).(12)✦

(f) Let TT be a triangle ribbon whose darts are labelled by the vertices of a simple graph Λ\Lambda, so that around each interior vertex the labels of its darts, in turn, form a reduced closed walk in Λ\Lambda. If a real number MM satisfies M≤ωd|p|M \le \omega_d\,|p| for every dart dd and every reduced closed walk pp in Λ\Lambda of positive length |p||p| at the label of dd, then every interior vertex vv of TT satisfies θ(v)≥M.\theta(v) \ge M.(13)✦

In the paper, the result reads: if SS is the barycentric subdivision of KK, or a further compatible Euclidean simplicial subdivision, then every prescribed nonempty nullhomotopic closed edge path in SS is the exterior walk of a planar diagram Δ\Delta with a map Δ→S\Delta \to S sending each edge and each triangle isometrically onto an edge and a triangle, each triangle of Δ\Delta has three distinct vertices and edges, at every interior vertex of Δ\Delta the cyclic sequence of corners maps to a nonempty cyclically reduced closed walk in the target link, and every edge loop in Δ\Delta contracts in Δ\Delta.

What Is Checked

The claim is stated over the complex KK of block presentation data and its group GG, the edge paths of KK with their homotopy and the fundamental groupoid Π(K)\Pi(K), the lift K̃\widetilde K with its closed word paths, triangle fillings with their dipoles, and triangle ribbons with their angles at vertices.