The Setting
The comparison concerns a prescribed family of Cayley cycles and the relators of a presentation of a group , possibly on a different alphabet. Stabilization adjoins letters whose value in is the identity.
Put . For an alphabet and a value map , word evaluation is the homomorphism extending from the free group .✦ The based integral chain group consists of finitely supported integral sums of edges from to ; letters with the same value remain distinct.✦ Write for the chain consisting of the single edge . The edge boundary of is the homomorphism to given in (1), and the cycle module is its kernel, with acting on the left: (1)
For edge labels in a group , the semidirect label homomorphism extends , using right translation on functions.✦ The path holonomy of a word in at a vertex in is the element of obtained by evaluating the function component of at ; its factors follow traversal order, and reverse traversal takes inverses.✦ The signed path chain uses each edge as its own additive label, with reverse traversal contributing its negative; write .✦
For a word family , the relator boundary is the integral linear map from to given in (2). A boundary basis for is an integral linear isomorphism whose composite with inclusion into is . A genuine presentation of is an alphabet and relator family for which word evaluation is surjective and (3) holds. A null word in is a word whose evaluation is . (2)✦ (3)
Stabilized Chain Groups
Adjoin an alphabet , and let be the value map on extending and taking value on . The chain splitting and cycle splitting in (4) separate the two alphabets. The extra edge projection retains only -coordinates; the extra relator boundary is its composite with the full relator boundary for a value map . (4)
Let be an alphabet. Given an integral linear isomorphism , its stabilized boundary basis is the map in (5). Let and be alphabets. For an integral linear isomorphism , the ordinary block is defined there too. All coordinates use the splittings in (4); inclusions of words from into enlarged alphabets are denoted by . (5)
The Claim
Theorem 1. For presentation basis alignment (6), let and have surjective word evaluations. Let and be null word families whose boundaries induce integral linear isomorphisms and . Suppose normally generates . Put , and . There are a family and an integral linear isomorphism satisfying (6)✦
For stabilized boundary alignment (7), let have surjective evaluation, and let and be null word families with boundary isomorphisms and . Suppose normally generates . Put and . There are families and satisfying, for and , (7)✦
For relator block alignment (8), let , let induce , and let be an integral linear isomorphism. Put . Suppose null word families and together normally generate , with injective, and satisfy and for all and in their chain groups. Set and . There is a family satisfying (8)✦
In the paper, the result reads: under the hypotheses of Theorem 3.1, including a two-dimensional , there is a genuine presentation with all -letters of value , the complete relator boundaries freely forming the cycle module, , where denotes the prescribed cycle indexed by , and projection of the ordinary relator boundaries to -coordinates an isomorphism , with no cardinality restriction on or .
What Is Checked
The alignments (6), (7) and (8) are stated over arbitrary groups and alphabets, using integral chain isomorphisms and the stated normal-generation hypotheses, with no cardinality bounds.