OctoInformBeta

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

Angular Gauss-Bonnet (3.1): The angular Gauss-Bonnet identity ∑y(10−5ny−θy)=10\sum_y (10 - 5n_y - \theta_y) = 10 for angle disk counts, and the angle disk counts of a triangle ribbon

Curvatures of a triangle disk sum to a full turn.

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 a disk diagram built from triangles of the complex KK, which has three vertices OO, VV and WW and whose triangles each have one corner at each of them. Angles are measured in units of π/5\pi/5: each triangle has angle 33 at its corner at OO and 11 at its corners at VV and WW, so its angles sum to 55, which is π\pi, and a full turn is 1010. At a vertex yy of the disk, θy\theta_y is the sum of the angles of the triangles with a corner at yy, and nyn_y is the number of times the boundary of the disk passes through yy.

The library states the combinatorial Gauss-Bonnet formula for abstract counts of a disk, and attaches such counts to every triangle ribbon, a combinatorial filling by triangles with one outer face.

Angle Disk Counts

A system of angle disk counts CC is a finite set YY of vertices with natural numbers EE and FF of edges and faces and, at each vertex yy, a natural number nyn_y of exterior visits and a real angle θy≥0\theta_y \ge 0, such that YY, EE and FF satisfy Euler’s relation for a disk and the visits and angles satisfy two counting identities: |Y|+F=E+1,∑y∈Yny+3F=2E,∑y∈Yθy=5F.|Y| + F = E + 1, \qquad \sum_{y \in Y} n_y + 3F = 2E, \qquad \sum_{y \in Y} \theta_y = 5F .(1)✦

The curvature of CC at a vertex yy is κ(y)=10−5ny−θy.\kappa(y) = 10 - 5n_y - \theta_y .(2)✦

Triangle Ribbons

The cycles of a permutation ff of a finite set AA are the classes of AA under the equivalence relation in which aa and bb are equivalent when b=fk(a)b = f^k(a) for some integer kk✦; the cycle [a]f[a]_f of an element aa is its class, the set of images of aa under the powers of ff.✦

A triangle ribbon RR is a finite set 𝒟\mathcal D of darts with a fixed-point-free involution ι\iota of 𝒟\mathcal D (the edge involution), a permutation φ\varphi of 𝒟\mathcal D (the face permutation), a cycle oo of φ\varphi (the outer face) and a coloring χ\chi of the cycles of σ=ιφ\sigma = \iota\varphi by the colors 00, 11 and 22, subject to two conditions.✦ The vertex permutation σ\sigma applies φ\varphi and then ι\iota; it rotates the darts about a vertex.✦ The edges, vertices and inner faces of RR are the cycles of ι\iota, the cycles of σ\sigma and the cycles of φ\varphi other than oo, forming the sets ℰ(R)\mathcal E(R), Y(R)Y(R) and ℱ(R)\mathcal F(R), and a dart dd is the corner of the face [d]φ[d]_\varphi at the vertex [d]σ[d]_\sigma. The first condition, the triangle condition, asks that for every inner face cc the map d↦χ([d]σ)d \mapsto \chi([d]_\sigma) be a bijection from cc onto {0,1,2}\{0, 1, 2\}. The second, the Euler count of a disk, asks that |Y(R)|+|ℱ(R)|=|ℰ(R)|+1.|Y(R)| + |\mathcal F(R)| = |\mathcal E(R)| + 1 .(3)✦

The color 00 stands for OO and the colors 11 and 22 for VV and WW, and the weight ww of a color is the angle of a triangle of KK at the corresponding corner.✦ The corner angle α(d)\alpha(d) of a dart dd is 00 when dd lies in the outer face oo and w(χ([d]σ))w(\chi([d]_\sigma)) otherwise.✦ At a vertex yy of RR, the angle θy\theta_y is the sum of the corner angles of the darts of yy✦, and the number nyn_y of exterior visits is the number of darts of yy that lie in oo: θy=∑d∈yα(d),ny=|y∩o|.\theta_y = \sum_{d \in y} \alpha(d), \qquad n_y = |y \cap o| .(4)✦

The Claim

Theorem 1. (i) Let CC be a system of angle disk counts with vertex set YY. Then the curvatures of CC sum to a full turn: ∑y∈Yκ(y)=10.\sum_{y \in Y} \kappa(y) = 10 .(5)✦

(ii) Let RR be a triangle ribbon with E=|ℰ(R)|E = |\mathcal E(R)| edges and F=|ℱ(R)|F = |\mathcal F(R)| inner faces, and with the angles θy\theta_y and exterior visits nyn_y of (4). Then every θy\theta_y is nonnegative✦ and ∑y∈Y(R)ny+3F=2E,∑y∈Y(R)θy=5F,\sum_{y \in Y(R)} n_y + 3F = 2E, \qquad \sum_{y \in Y(R)} \theta_y = 5F ,(6)✦ so that, with the Euler count (3), the vertices of RR with these numbers form a system of angle disk counts, the angle disk counts of RR, and (5) holds for them.✦

In the paper, the result reads ∑y((2−ny)π−θy)=2π\sum_y \bigl((2 - n_y)\pi - \theta_y\bigr) = 2\pi, the sum running over the vertices yy of a diagram, with nyn_y the exterior visits at yy.

What Is Checked

The claim is stated over systems of angle disk counts, a finite set of vertices with numbers of edges and faces, exterior visits and nonnegative angles bound by (1), with the curvature (2), and over triangle ribbons, whose edges, vertices and inner faces are the cycles of the edge involution, the vertex permutation and the face permutation, and whose angles and exterior visits (4) are built from the color weights and the corner angles.