OctoInformBeta

OpenAI preprint, September 2026 · §5. Reducing the rank of a surface diagram

§5 (setting): normalized diagrams and maximal-rank parents: The rank condition at a seam and the local incidence data of a surface diagram

Ranks and properness of surface diagrams.

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

A surface diagram records facets meeting along seams, with a parent facet and an ordered list of child facets at each seam. Its rank condition compares the rank of the parent with the ranks of those children. Let FF, SS and VV be the sets of facets, seams and vertices, and let ν:S→ℕ\nu\colon S\to\mathbb N give the number of children at each seam.

A side occurrence aa of a surface diagram is a seam qq together with either the parent symbol ⌀\varnothing or a child index jj in the zero-based ordered set [ν(q)][\nu(q)].✦ A side germ is a side occurrence together with an endpoint e∈{0,1}e\in\{0,1\}.✦ Write ϵ(a)=1\epsilon(a)=1 for a parent occurrence and ϵ(a)=0\epsilon(a)=0 for a child occurrence.✦ The side and germ sets, and the initial and terminal germs, are given by (1): 𝒜=∐q∈S({⌀}⊔[ν(q)]),𝒢=𝒜×{0,1},a−=(a,1−ϵ(a)),a+=(a,ϵ(a)).\mathcal A=\coprod_{q\in S}\bigl(\{\varnothing\}\sqcup[\nu(q)]\bigr), \qquad \mathcal G=\mathcal A\times\{0,1\}, \qquad a^-=(a,1-\epsilon(a)),\quad a^+=(a,\epsilon(a)).(1) A facet labelling ϕ:𝒜→F\phi\colon\mathcal A\to F assigns a facet to each occurrence; distinct occurrences remain distinct when their labels coincide.

A local vertex table TT consists of a set of ports PTP_T, a child set CpC_p for each port, an endpoint assignment eT:PT→{0,1}e_T\colon P_T\to\{0,1\}, and an involution on the occurrences (p,u)(p,u) with u∈{⌀}⊔Cpu\in\{\varnothing\}\sqcup C_p. An occurrence (p,u)(p,u) of a local vertex table TT is outgoing when eT(p)e_T(p) is one if u=⌀u=\varnothing and zero otherwise; the remaining occurrences are incoming, and the involution of TT exchanges outgoing and incoming occurrences. The reversed table of a local vertex table TT is the table with the same ports, child sets and pairing as TT, and with each endpoint replaced by its opposite.✦

For a child set CC and a permutation σ\sigma of CC, the permutation passage table has ports 0,10,1, child set CC at each, and endpoint 1−b1-b at port bb. Its pairing joins the two parents and joins child cc at port 00 to child σ(c)\sigma(c) at port 11. An allowed passage on mm children is a continuation or an interchange at an index 0≤i<m−10\leq i<m-1✦; its passage permutation is respectively the identity or the transposition of ii and i+1i+1.✦ The allowed passage table of an allowed passage on mm children is the permutation passage table associated with its passage permutation.✦

The splitting table for prefix, subblock and suffix sets A,B,CA,B,C has ports before\mathrm{before}, after\mathrm{after} and branch\mathrm{branch}. Their child lists and endpoint assignments are (2): pCpeT(p)beforeA⊔{*}⊔C1afterA⊔B⊔C0branchB1\begin{array}{c|c|c} p&C_p&e_T(p)\\ \hline \mathrm{before}&A\sqcup\{*\}\sqcup C&1\\ \mathrm{after}&A\sqcup B\sqcup C&0\\ \mathrm{branch}&B&1 \end{array}(2) The splitting germ pairing joins the parents before and after, and joins each prefix or suffix child across those ports. It joins the distinguished child ** before to the branch parent, and each subblock after to its corresponding branch child.

An allowed vertex type is an allowed passage, or a splitting table with A=[a]A=[a], B=[b]B=[b], C=[c]C=[c], optionally reversed, where a,b,ca,b,c are nonnegative.✦ The port arity of an allowed vertex type is mm for a passage and is respectively a+1+ca+1+c, a+b+ca+b+c and bb at the before, after and branch ports of a splitting table.✦ For an allowed vertex type kk and a port pp, its ordered child indexing is the bijection from CpC_p to the zero-based positions of the port arity: the identity for a passage and at the branch port, the unrefined enumeration before a split or merge, and the refined enumeration after it.✦ The unrefined enumeration at the before port of a splitting table is the child indexing that concatenates the prefix, the singleton block and the suffix✦; the refined enumeration at the after port is the child indexing that concatenates the prefix, the subblocks and the suffix.✦ Both enumerate from zero, and reversal retains these orders. The allowed incidence table of a vertex type is its allowed passage table for a passage, its splitting table for a split, and the reversed splitting table for a merge.✦

Fix an assignment κ\kappa of allowed types to vertices. A local vertex port is a pair (v,p)(v,p) with p∈Pκ(v)p\in P_{\kappa(v)}✦; a local endpoint occurrence is a triple (v,p,u)(v,p,u) with u∈{⌀}⊔Cpu\in\{\varnothing\}\sqcup C_p.✦ The local corner pairing λ\lambda for an assignment κ\kappa is the pairing of its local endpoint occurrences obtained by applying the table pairing at each vertex.✦

An ordered port assembly is an assignment κ\kappa, a bijection α\alpha from local vertex ports to S×{0,1}S\times\{0,1\} preserving the assigned endpoints and child counts, and a facet labelling satisfying continuation across local corner pairings.✦ The port child indexing of an ordered port assembly identifies CpC_p with [ν(q)][\nu(q)] in the specified order when α(v,p)=(q,e)\alpha(v,p)=(q,e).✦ The endpoint realization ρ\rho of an ordered port assembly is the map from local endpoint occurrences to side germs that, when α(v,p)=(q,e)\alpha(v,p)=(q,e), sends (v,p,u)(v,p,u) to the germ at (q,e)(q,e) with the port child index of uu, or with the parent symbol when u=⌀u=\varnothing.✦ A facet labelling of an ordered port assembly satisfies facet continuation when, for every local endpoint occurrence xx, the two germs ρ(x)\rho(x) and ρ(λ(x))\rho(\lambda(x)) have the same facet label.

A vertex incidence assembly consists of an assignment κ\kappa of allowed types to vertices, a bijection ρ\rho from its local endpoint occurrences to 𝒢\mathcal G preserving endpoints and the parent or child designation, and a facet labelling for which ρ(x)\rho(x) and ρ(λ(x))\rho(\lambda(x)) have the same facet label for every local endpoint occurrence xx.✦ The induced vertex assembly of an ordered port assembly uses its endpoint realization ρ\rho and its facet labelling.✦

Corner incidence data consist of a facet labelling and an involution μ\mu of 𝒢\mathcal G preserving facet labels and exchanging terminal and initial germs.✦ The induced corner pairing of a vertex assembly is μ=ρ∘λ∘ρ−1\mu=\rho\circ\lambda\circ\rho^{-1}.✦ The boundary successor permutation β\beta of corner incidence data is the permutation of 𝒜\mathcal A described, together with its inverse, by (3), where π:𝒢→𝒜\pi\colon\mathcal G\to\mathcal A forgets the endpoint: β(a)=π(μ(a+)),β−1(a)=π(μ(a−)).\beta(a)=\pi\bigl(\mu(a^+)\bigr), \qquad \beta^{-1}(a)=\pi\bigl(\mu(a^-)\bigr).(3)✦

A ranked surface diagram DD is an ordered port assembly with a rank r:F→ℕr\colon F\to\mathbb N satisfying the seam rank sum (4), a genus g(f)∈ℕg(f)\in\mathbb N for each facet, and boundary data.✦ Put pq=ϕ(q,⌀)p_q=\phi(q,\varnothing) and cq,j=ϕ(q,j)c_{q,j}=\phi(q,j). The rank condition is r(pq)=∑j∈[ν(q)]r(cq,j).r(p_q)=\sum_{j\in[\nu(q)]}r(c_{q,j}).(4) The boundary data give a count B(f)B(f) and a positive length ℓ(f,b)\ell(f,b) for each boundary 0≤b<B(f)0\leq b<B(f). A boundary side enumeration ξ\xi of a ranked surface diagram DD is a bijection from the positions (f,b,i)(f,b,i), with f∈Ff\in F, 0≤b<B(f)0\leq b<B(f) and 0≤i<ℓ(f,b)0\leq i<\ell(f,b), to 𝒜\mathcal A satisfying (5): ϕ(ξ(f,b,i))=f,β(ξ(f,b,i))=ξ(f,b,(i+1)mod⁡ℓ(f,b)).\phi\bigl(\xi(f,b,i)\bigr)=f, \qquad \beta\bigl(\xi(f,b,i)\bigr) =\xi\bigl(f,b,(i+1)\bmod\ell(f,b)\bigr).(5)

The Claim

Definition 1. A proper surface diagram DD is a ranked surface diagram whose facet ranks and seam arities satisfy (6): r(f)>0(f∈F),ν(q)≥2(q∈S).r(f)>0\quad(f\in F), \qquad \nu(q)\geq2\quad(q\in S).(6)✦

Theorem 1. Let DD be a proper surface diagram. For a seam qq and any ordered child j∈[ν(q)]j\in[\nu(q)], the child and parent ranks satisfy r(cq,j)<r(pq).r(c_{q,j})<r(p_q).(7)✦

In the paper, the result reads: a diagram is normalized when every facet has positive rank and every seam has at least two children; in such a diagram a facet of maximal rank can occur only as a parent, and every child along its boundary has smaller rank.

What Is Checked

The claim (7) is stated for ranked surface diagrams with the ordered port assembly and cyclic boundary enumeration above, under the properness conditions (6).