The Setting
Matrix transports on facets must respect filtrations along seams, including the maps to specified graded modules. At a vertex, the relevant identified flags are compared after the incident fiber coordinates have been identified. The library defines these conditions over a commutative ring and a commutative -algebra .
For a finite coordinate set and a grading , let have coordinate prefixes and coordinate projections to the named modules . A frame gives a prefix and a grade map , as in (1): (1) Two frames determine the same identified flag when (2) holds: (2)✦ The grade map on identifies its quotient by with . For a finite coordinate set , an invertible coordinate matrix from to is a pair of matrices with and ; its linear isomorphism sends to . Identity matrices, composition and direct sums give the corresponding isomorphisms, and bijections of coordinate sets relabel their rows and columns.
The Definition
Definition 1. Let be sets of facets, seams and vertices, and let be the number of ordered children of a seam . The set of side occurrences is (3): (3)✦ Here is the parent occurrence and is the th child occurrence. A facet label does not identify distinct elements of (3). A side germ is a pair of an occurrence and an endpoint in .✦ Set and ; the initial and terminal germs of are and . The positive boundary orientation follows the seam parameter on the parent occurrence and opposes it on every child occurrence.✦
The allowed vertex types form the set in (4): (4)✦ Each type in (4) has a local vertex table: ports with ordered child sets , endpoint labels , and an involution on pairs , where is either or a child of . The involution pairs incoming and outgoing oriented sides. A continuation has two ports with endpoint labels and pairs corresponding parents and children. An interchange uses the same table with the child pairing given by the transposition of and .
A split has ports called before, after and branch, with endpoint labels . Their child lists have the respective forms , and , where the ordered lists have lengths .✦ The corner pairing joins the before and after parents, joins corresponding children in and , joins the distinguished before child to the branch parent, and joins the after children in to the branch children.✦ A merge reverses every endpoint label in this table.✦
A local port is a pair with a port of the type assigned to ; a local end is a triple . Write for the ports at , let range over local ends, write for endpoint realization and for the map forgetting a germ’s endpoint; an ordered port assembly on the facet, seam and vertex sets consists of the data in (5), with the indicated conditions: (5)✦ In (5), the endpoint realization sends to the germ at the attached seam endpoint, using for the parent and the prescribed enumeration of for its children; acts within each vertex. The induced vertex assembly has corner pairing .✦ The boundary successor sends an occurrence to the side of the germ paired by with its terminal germ.✦
A surface incidence diagram is an ordered port assembly together with facet ranks , genera , boundary counts and positive boundary lengths , subject to (6): (6)✦ All ranks, genera and counts in (6) are nonnegative integers. A scalar puncture datum on is the choice in (7): (7)✦ The units in (7) specify scalar puncture monodromies.
The transport generators are a side matrix of size , a seam frame at each endpoint, and two handle matrices of size for . Write for this generator set and for the size of a generator . Seam frame sizes and their coordinate gradings are given by (8): (8) A transport word in the generators over is a matrix expression formed from those generators and constant invertible matrices by products, inverses and block sums. Its evaluation substitutes the generator matrices and applies to constants; an empty product is the identity.
The boundary monodromy word of boundary of facet , the surface word , scalar target , and the left and right seam words are defined in (9); products are written in increasing index order: (9) The edge flag circuit has one comparison for every facet and seam, using constant grading on a facet and on a seam. Its compatibility condition for an assignment is (10): (10)✦ Matrices in (10) act as frames of their coordinate modules. A flag incidence circuit consists of transport generators and constraints, each with two transport words and a specified grading; a solution of the circuit over is an assignment of invertible matrices to its transport generators for which the two words at every constraint determine the same identified flag for its specified grading.
The boundary monodromy word of boundary of facet is the product of its boundary side transports in reverse boundary order, as in (9).✦ The handle commutator word at handle of facet is .✦
The local occurrence rank at is the rank of its facet.✦ Corner identifications identify the corresponding coordinate sets. The port frame is , with columns indexed by the sum of its child coordinate sets and rows by its parent coordinate set.✦ A passage is a continuation or an interchange; its flag comparison uses the parent identification and the child permutation, and its quotient grading is for a continuation, while an interchange at assigns grade also to child .
For a split, write for the before child module and for the after child module. Here are the sums of the prefix and suffix coordinate modules, and is the sum of the branch child modules. Corners identify with , with , and with the branch parent module. The splitting refinement isomorphism from the after child module to the before child module uses the corner identifications on the prefix and suffix and inserts the branch frame from to into the splitting block, with the prescribed child coordinate order.✦ The splitting comparison is the framed flag comparison of the refined frame with the unrefined frame after inserting the branch frame into the splitting block and identifying the parent fibers.✦ It retains each named graded module and its quotient identification in prefix, subblock, suffix order. For a merge, the comparison uses the same ranks with the endpoint orientations reversed.
Write for the resulting vertex flag comparison, with coordinate grading and frames . Define vertex compatibility by for every . A solution of over is an element of (11): (11)✦
Introduce two matrices of indeterminates for each in the polynomial ring . The polynomial form of a word replaces a generator and its inverse by these two matrices; inversion reverses the order of a product and inverts each block of a block sum.✦ For an edge comparison , let be the polynomial form of its right word inverse times its left word, and let be its grading. The edge coordinate algebra of is the quotient in (12): (12) The parentheses in (12) denote the ideal generated by the displayed elements.✦ The images of are the universal edge transports, and the images of are their inverse matrices. Evaluate every vertex comparison on these transports; let be the entry of whenever .✦ The surface coordinate algebra of is the quotient algebra in (13): (13)✦ For every commutative -algebra , evaluating polynomial coordinates at a solution and evaluating the universal transports at an algebra map give the correspondence in (14): (14)✦ For a matrix presentation , the matrix coordinate algebra is the polynomial ring in a forward and an inverse matrix for each occurrence, modulo the ideal generated by both inverse identities and all its incidence equations. The matrix point correspondence is the bijection between matrix incidence solutions over and -algebra maps , obtained by evaluating polynomial coordinates at a solution and evaluating universal transport matrices at an algebra map.
The coordinate algebra of a flag incidence circuit is the matrix coordinate algebra for its flag equations: the entries of the relative transport minus the identity whose column grade is at most their row grade.✦
For an equation family in an -algebra , passage to the quotient identifies the -algebra maps annihilating every with the -algebra maps .✦ The equation quotient algebra is the quotient of by the equation ideal.✦
In the paper, the result reads: a surface diagram consists of finitely many compact oriented facets of ranks between and a fixed , with finitely many interior punctures carrying prescribed scalar roots of unity in a field ; boundary pieces are grouped into seams with a parent and ordered children satisfying and child boundary orientations opposite to the parent’s, with continuation, adjacent interchange, split and merge vertices and distinct side occurrences even when their facets coincide; a solution assigns local systems and parallel filtrations with identified quotients , satisfying all vertex compatibilities, including, for the two adjacent graded modules and at an interchange, preservation of the coarsened identified quotient and complementarity of the intermediate summands with their natural projection maps; choosing frames and paths gives the algebraic solution space , and integral solutions use free -fibers and the specified free graded modules.
What Is Checked
The constructions are stated for arbitrary commutative coefficient rings and their commutative algebras, with the occurrence incidence data of (6) and unit puncture data of (7); the finite type setting takes the facet and seam sets to be finite.
For a matrix presentation, evaluation on a solution annihilates the relation ideal.✦ In a flag circuit, agreement of the identified flags is equivalent to the vanishing of the entries of the relative transport minus the identity at the positions whose column grade is at most their row grade.✦ The edge point correspondence identifies solutions of (10) with -algebra maps from .✦ For every flag incidence circuit , its solutions over are in bijection with the -algebra maps .