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 , and be the sets of facets, seams and vertices, and let give the number of children at each seam.
A side occurrence of a surface diagram is a seam together with either the parent symbol or a child index in the zero-based ordered set .✦ A side germ is a side occurrence together with an endpoint .✦ Write for a parent occurrence and for a child occurrence.✦ The side and germ sets, and the initial and terminal germs, are given by (1): (1) A facet labelling assigns a facet to each occurrence; distinct occurrences remain distinct when their labels coincide.
A local vertex table consists of a set of ports , a child set for each port, an endpoint assignment , and an involution on the occurrences with . An occurrence of a local vertex table is outgoing when is one if and zero otherwise; the remaining occurrences are incoming, and the involution of exchanges outgoing and incoming occurrences. The reversed table of a local vertex table is the table with the same ports, child sets and pairing as , and with each endpoint replaced by its opposite.✦
For a child set and a permutation of , the permutation passage table has ports , child set at each, and endpoint at port . Its pairing joins the two parents and joins child at port to child at port . An allowed passage on children is a continuation or an interchange at an index ✦; its passage permutation is respectively the identity or the transposition of and .✦ The allowed passage table of an allowed passage on children is the permutation passage table associated with its passage permutation.✦
The splitting table for prefix, subblock and suffix sets has ports , and . Their child lists and endpoint assignments are (2): (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 , , , optionally reversed, where are nonnegative.✦ The port arity of an allowed vertex type is for a passage and is respectively , and at the before, after and branch ports of a splitting table.✦ For an allowed vertex type and a port , its ordered child indexing is the bijection from 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 of allowed types to vertices. A local vertex port is a pair with ✦; a local endpoint occurrence is a triple with .✦ The local corner pairing for an assignment is the pairing of its local endpoint occurrences obtained by applying the table pairing at each vertex.✦
An ordered port assembly is an assignment , a bijection from local vertex ports to 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 with in the specified order when .✦ The endpoint realization of an ordered port assembly is the map from local endpoint occurrences to side germs that, when , sends to the germ at with the port child index of , or with the parent symbol when .✦ A facet labelling of an ordered port assembly satisfies facet continuation when, for every local endpoint occurrence , the two germs and have the same facet label.
A vertex incidence assembly consists of an assignment of allowed types to vertices, a bijection from its local endpoint occurrences to preserving endpoints and the parent or child designation, and a facet labelling for which and have the same facet label for every local endpoint occurrence .✦ The induced vertex assembly of an ordered port assembly uses its endpoint realization and its facet labelling.✦
Corner incidence data consist of a facet labelling and an involution of preserving facet labels and exchanging terminal and initial germs.✦ The induced corner pairing of a vertex assembly is .✦ The boundary successor permutation of corner incidence data is the permutation of described, together with its inverse, by (3), where forgets the endpoint: (3)✦
A ranked surface diagram is an ordered port assembly with a rank satisfying the seam rank sum (4), a genus for each facet, and boundary data.✦ Put and . The rank condition is (4) The boundary data give a count and a positive length for each boundary . A boundary side enumeration of a ranked surface diagram is a bijection from the positions , with , and , to satisfying (5): (5)
The Claim
Definition 1. A proper surface diagram is a ranked surface diagram whose facet ranks and seam arities satisfy (6): (6)✦
Theorem 1. Let be a proper surface diagram. For a seam and any ordered child , the child and parent ranks satisfy (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).