The Setting
Take the complex , with three vertices , , and triangles that have one corner at each, and the group it presents. Van Kampen’s lemma turns an edge loop of that is trivial in into a planar diagram of triangles whose boundary reads the loop, and the same holds for the lift of over . Angle arguments need such a diagram without a pair of adjacent triangles that cancel across their common edge. The question is then what the corners around an interior vertex trace in the link of , and how small their angle sum can be.
The Complex and Its Group
A Cartesian block with parameter is a finite set of labels together with a bijection onto , for positive integers .✦ Block presentation data over a set of labels, with indices , consist of a Cartesian block of labels from for each in a set , with sides , and coordinates , together with a base block and a base index .✦
The complex of these data has the vertices , , and three kinds of edges: middle edges from to , for and ; left edges from to , for , and ; right edges from to , for , and . An oriented edge is an edge taken in its own direction or in the reverse one✦; is reversed✦, and is the vertex at which ends, so that starts at .✦
For a block , a label of its Cartesian block and indices , the triangle of with these data has the edges (1) the index read modulo and modulo . The triangle faces of are the triples of oriented edges read around a triangle of with edges as in (1): the word read from , from or from , and the inverse word read from , from or from .✦
The group has one generator for each edge of and the relators (2)✦ the last two being the left and the right tree edge, which span a tree on , , . The value of an oriented edge is the generator of its edge, inverted when is reversed.✦
Edge Paths and the Lift
An edge path of is a finite sequence of oriented edges, each starting where the one before it ends✦; an edge loop at a vertex is an edge path that starts and ends at ; is the empty path at , and the word of is its sequence of oriented edges.✦ Two edge paths , with the same ends are homotopic, , when a finite chain of moves, each applied to a subpath, turns one into the other: inserting or deleting a backtrack , and replacing by or by for a triangle (1).✦
The free groupoid on has the objects , , and, as morphisms, the edge paths of up to cancelling an edge against its reverse.✦ The fundamental groupoid of is the quotient of the free groupoid on by the triangle relation , and an edge path has its class in .✦
The lift of over has the vertices , for a vertex of and ✦, and the oriented edges , for an oriented edge of , with (3)✦ A triple of oriented edges of is a triangle face when their first coordinates form a triangle face of and each of the three starts where the one before it ends, cyclically.✦ In or in , a closed word path at a vertex is a word in the oriented edges with starting at , each starting where ends and ending at ; the empty word is one.✦
Triangle Fillings
Fillings are defined for any set of labels with a reversal , a coloring of by a set , and a set of triples in , the faces. Over , the labels are its oriented edges, the reversal is , the coloring is the end vertex , and the faces are its triangle faces; over , the same notions of .
For permutations , of a finite set , whose elements are called darts, let be the number of cycles of a permutation , fixed points counting as cycles of length one, and the number of components, the orbits of the group generated by and .✦ A pair of permutations of is a planar map when (4)✦ Here is a fixed-point-free involution pairing darts into edges, runs around the faces and around the vertices.
A triangle filling of a word in is a finite set of darts with a fixed-point-free involution , a face permutation and a labelling , such that is a planar map and, for every dart , paired darts carry reversed labels, , and the darts around each vertex carry labels of one color, .✦ The boundary of a triangle filling of is a list of distinct darts, either empty or one cycle of in order, whose labels spell .✦ A triangle filling is triangular when every dart off in a component that meets lies on a cycle of of length exactly three whose labels, in order, form a face. A dart is active when its component meets .✦ A word in is fillable when it has a triangle filling; it is fillable over or over when , the reversal, the coloring and the faces are those of or of .✦
A dipole of a triangle filling is a pair of adjacent triangles that cancel: six distinct darts off , in a component that meets , such that has the cycles and , , and (5)✦
Ribbons and Angles
A triangle ribbon is a finite set of darts with a fixed-point-free involution , whose cycles are the edges, a face permutation with one of its cycles chosen as the outer face, and a coloring of the vertices, the cycles of , by the three colors , , .✦ In a triangle ribbon , every inner face, that is every cycle of other than the outer face, has exactly one dart at a vertex of each color, and (6) the Euler count of a disc. A dart is outer when it lies on the outer face.✦
Angles are measured in units of : the corner of a triangle of at a vertex of color has the angle , where (7)✦ so that the angles of a triangle sum to . For a dart of , write for of the color of its vertex; the corner angle of is when is outer and otherwise.✦ The angle at a vertex is the sum of the corner angles of its darts.✦ The boundary of is its outer face; it visits a vertex once for each outer dart at , and is interior when the boundary never visits it.
A walk in a simple graph is reduced when no step immediately reverses the previous one: its vertices at positions and differ whenever both exist, with no condition across the base point of a closed walk.✦
The Claim
Theorem 1. Let be the complex of block presentation data, its group and its lift.
(a) For edge paths and of with the same ends, (8)✦
(b) If an edge loop of at a vertex is homotopic to , then (9)✦
(c) If a word in the oriented edges of is a closed word path at a vertex of , then (10)✦
(d) For any set of labels with a reversal, a coloring and faces, if a word is fillable, then (11)✦
(e) Suppose that the three labels of every face have pairwise distinct colors, that reversal is an involution, that the mirror of a face is a face, and that a face is determined by its first two labels. If a triangle filling has no dipole and is an active dart with and off , then (12)✦
(f) Let be a triangle ribbon whose darts are labelled by the vertices of a simple graph , so that around each interior vertex the labels of its darts, in turn, form a reduced closed walk in . If a real number satisfies for every dart and every reduced closed walk in of positive length at the label of , then every interior vertex of satisfies (13)✦
In the paper, the result reads: if is the barycentric subdivision of , or a further compatible Euclidean simplicial subdivision, then every prescribed nonempty nullhomotopic closed edge path in is the exterior walk of a planar diagram with a map sending each edge and each triangle isometrically onto an edge and a triangle, each triangle of has three distinct vertices and edges, at every interior vertex of the cyclic sequence of corners maps to a nonempty cyclically reduced closed walk in the target link, and every edge loop in contracts in .
What Is Checked
The claim is stated over the complex of block presentation data and its group , the edge paths of with their homotopy and the fundamental groupoid , the lift with its closed word paths, triangle fillings with their dipoles, and triangle ribbons with their angles at vertices.