OctoInformBeta

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

Planar diagrams: A word is fillable when it spells a face of a finite labelled genus-zero map of darts, triangular elsewhere on components meeting that face

Triangle fillings and triangle spheres as planar maps of darts.

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

In a triangle complex, a van Kampen diagram for a word in its oriented edges is a finite planar complex of triangles whose boundary reads the word. The library defines such fillings, and their closed analogue, triangle spheres, as combinatorial maps of genus zero whose darts, the half-edges of the diagram, are labelled by oriented edges.

A combinatorial map records a diagram by its darts, two to an edge, one for each direction. A fixed-point-free involution α\alpha of the set of darts swaps the two darts of each edge, and a face permutation φ\varphi sends a dart to the next dart along the boundary of its face. The edges are the orbits of α\alpha, the faces the orbits of φ\varphi, and the vertices the orbits of the product αφ\alpha\varphi, where (αφ)(x)=α(φ(x))(\alpha\varphi)(x) = \alpha(\varphi(x)). A connected map has genus zero exactly when its numbers n0n_0, n1n_1, n2n_2 of vertices, edges and faces satisfy Euler’s formula n0−n1+n2=2n_0 - n_1 + n_2 = 2.

Cycles and Components

The cycles of a permutation ff of a set AA are the classes of the equivalence relation on AA under which aa is equivalent to bb when fn(a)=bf^n(a) = b for some integer nn.✦ The components of two permutations ff and gg of AA are the classes of the equivalence relation generated by lying in a common cycle of ff and lying in a common cycle of gg; they are the orbits of the group ⟨f,g⟩\langle f, g\rangle.✦

The number of cycles c(f)c(f) of ff, a fixed point counting as a cycle of length one, and the number of components k(f,g)k(f,g) of ff and gg are c(f)=|A/⟨f⟩|,k(f,g)=|A/⟨f,g⟩|.c(f) = \bigl|A/\langle f\rangle\bigr|, \qquad k(f,g) = \bigl|A/\langle f, g\rangle\bigr|.(1)

The Definition

Definition 1. Let EE be a set with a map e↦e‾e \mapsto \bar e of EE to itself, the reversal, let τ:E→V\tau\colon E \to V be a map to a set VV, the coloring, and let Φ\Phi be a ternary relation on EE, the face relation.

Two permutations α\alpha and φ\varphi of a finite set AA form a planar map when c(α)+c(φ)+c(αφ)=|A|+2k(α,φ).c(\alpha) + c(\varphi) + c(\alpha\varphi) = |A| + 2\,k(\alpha, \varphi).(2)✦

A boundary of a permutation ff of a set AA is a finite sequence (a1,…,an)(a_1, \dots, a_n), possibly empty, of pairwise distinct elements of AA that ff moves cyclically along itself: f(a1)=a2,…,f(an−1)=an,f(an)=a1.f(a_1) = a_2, \quad \dots, \quad f(a_{n-1}) = a_n, \quad f(a_n) = a_1.(3)✦

A diagram (D,α,φ,λ)(D, \alpha, \varphi, \lambda) is a finite set DD of darts with two permutations α\alpha and φ\varphi of DD that form a planar map and a labelling λ:D→E\lambda\colon D \to E such that, for every dart xx, α2(x)=x,α(x)≠x,λ(αx)=λ(x)¯,τ(λ(αφx))=τ(λ(x)).\alpha^2(x) = x, \quad \alpha(x) \neq x, \quad \lambda(\alpha x) = \overline{\lambda(x)}, \quad \tau\bigl(\lambda(\alpha\varphi x)\bigr) = \tau\bigl(\lambda(x)\bigr).(4)

A triangle filling of a word ww in EE is a diagram (D,α,φ,λ)(D, \alpha, \varphi, \lambda) with a boundary ∂=(b1,…,bn)\partial = (b_1, \dots, b_n) of φ\varphi whose labels spell ww, such that every dart xx off ∂\partial that lies in a component of α\alpha and φ\varphi containing a dart of ∂\partial lies on a face of three darts whose labels, in order, are in the face relation: λ(b1)⋯λ(bn)=w,φ3(x)=x,φ(x)≠x,Φ(λ(x),λ(φx),λ(φ2x)).\lambda(b_1) \cdots \lambda(b_n) = w, \qquad \varphi^3(x) = x, \quad \varphi(x) \neq x, \quad \Phi\bigl(\lambda(x), \lambda(\varphi x), \lambda(\varphi^2 x)\bigr).(5)✦

A word ww in EE is fillable when w has a triangle filling (D,α,φ,λ,∂).w \text{ has a triangle filling } (D, \alpha, \varphi, \lambda, \partial).(6)✦

A triangle sphere is a diagram (D,α,φ,λ)(D, \alpha, \varphi, \lambda), possibly with several components, in which every dart lies on a face of three darts whose labels, in order, are in the face relation: for every dart xx, φ3(x)=x,φ(x)≠x,Φ(λ(x),λ(φx),λ(φ2x)).\varphi^3(x) = x, \quad \varphi(x) \neq x, \quad \Phi\bigl(\lambda(x), \lambda(\varphi x), \lambda(\varphi^2 x)\bigr).(7)✦

In the paper, the definition reads: a filling is a finite connected complex of edges and triangles embedded in the plane, every bounded face of which is a triangle, with its exterior walk counted with multiplicity.

What Is Checked

These definitions are stated over a set EE of labels with a reversal e↦e‾e \mapsto \bar e, a coloring τ:E→V\tau\colon E \to V and a face relation Φ\Phi, and over the number of cycles c(f)c(f) of a permutation and the number of components k(f,g)k(f,g) of two permutations of a finite set.