The Setting
Prescribing labels on one alphabet of edges leaves the extra edge labels as unknowns. Ordinary relators impose exact product equations at every vertex, while distinguished words measure the holonomy to be kept small.
Let be a group, an alphabet and a value assignment. For a vertex of and a letter of , the based edge is an edge from to ; different letters remain distinct when their values agree. Write for the free group on . The label group consists of the norm-one quaternions in , and distance from the identity means the chord norm .✦
For labels , the semidirect label homomorphism is the homomorphic extension specified in (1), with the shift action of on functions.✦ For a word and a vertex , the path holonomy is the value at of the function component of : (1) Products follow traversal order, and reverse traversal uses the inverse edge label. Let and be alphabets. For assignments and , the combined assignment uses on and on .✦
The based chain module is the free abelian group with basis indexed by based labelled edges.✦ The path chain counts the traversals of each edge along from , with reverse traversals counted negatively; denotes the coefficient of an edge in a chain .✦
For and words indexed by , the relator boundary , extra edge projection and extra relator boundary are the integral linear maps given by (2): (2)
Words with Coefficients
Let be a coefficient alphabet and variable letters. For paths and a family , with finite, of words on , the coefficient word map sends an input , with , to the tuple obtained by evaluating coefficient letters at and variable letters at .✦ Coefficient erasure is the homomorphism from the free group on to the free group on the variable letters that sends each coefficient letter to and fixes each .✦ For words , the exponent sum matrix is the integer matrix whose entry is the total signed exponent of after erasure, as in (3): (3) The norm for a finite tuple in is the supremum of its coordinate chord distances from .
The Claim
Theorem 1. Let and be coefficient words as above. Suppose each is smooth as a quaternion-valued function, , and . Assume that, for , every solution of has . Then sublevel word solvability gives an satisfying (4): (4)✦
Let be groups, a value assignment and a family indexed by . Suppose is an integral linear isomorphism. For every homomorphism and injection with finite, write . There is an injection giving the nonzero finite boundary minor (5): (5)✦
Let be a finite group with values , ordinary words indexed by , distinguished words indexed by , and words , also regarded as words on . Let be finite subsets of , and suppose is an integral linear isomorphism. Suppose , and satisfy (6): (6) Assume the comparison estimate (7) holds for all and whenever and a full label assignment satisfies on , for , and at every base vertex: (7) For every prescribed assignment with , there is an assignment satisfying the finite group comparison conclusion (8): (8)✦
In the paper, the result reads: for any finite quotient of , arbitrary prescribed -edge labels at distance less than from , and any finite containing , there are labels on all -edges such that for and all , while , with an empty maximum interpreted as zero.
What Is Checked
The assertions are stated over integral projected relator boundaries and quaternionic word evaluation, with a boundary isomorphism for (5) and (8), smooth coefficient paths and a nonsingular exponent sum matrix for (4), and the uniform estimate (7) with the bounds (6) for (8).