On the quotient of the homology cobordism group by Seifert spaces

By Kristen Hendricks, Jennifer Hom, Matthew Stoffregen, and Ian Zemke

Abstract

We prove that the quotient of the integer homology cobordism group by the subgroup generated by the Seifert fibered spaces is infinitely generated.

1. Introduction

The homology cobordism group consists of integer homology 3-spheres modulo integer homology cobordism and is a fundamental structure in geometric topology. For example, played a central role in Manolescu’s Reference Man16 disproof of the triangulation conjecture in high dimensions.

A natural question to ask is which types of manifolds can represent a given class . The first answers to this question were in the positive direction. Livingston Reference Liv81 showed that every class in can be represented by an irreducible integer homology sphere, and Myers Reference Mye83 improved this to show that every class admits a hyperbolic representative. More recently, Mukherjee Reference Muk20, Theorem 1.18 showed that every class admits a Stein fillable representative.

In the negative direction, Frøyshov (in unpublished work), Lin Reference Lin17, and Stoffregen Reference Sto17 showed that there are classes in that do not admit a Seifert fibered representative. Nozaki, Sato, and Taniguchi Reference NST19, Corollaries 1.6 and 1.7 improved this result to show that there are classes that admit neither a Seifert fibered representative nor a representative that is surgery on a knot in . The Frøyshov, Stoffregen, and Nozaki-Sato-Taniguchi examples are all connected sums of Seifert fibered spaces, and Lin’s example has Floer homology consistent with it being representable by a Seifert fibered space. In particular, these results are insufficient to show is not generated by Seifert fibered spaces.

Using the involutive Heegaard Floer homology of Hendricks and Manolescu Reference HM17, we proved in Reference HHSZ20, Theorem 1.9 that Seifert fibered spaces do not generate . More precisely, let denote the subgroup of generated by Seifert fibered spaces. We showed that the quotient contains a subgroup isomorphic to , generated by . The main result of this paper is that the quotient is in fact infinitely generated:

Theorem 1.1.

The quotient contains a subgroup isomorphic to , spanned by

Involutive Heegaard Floer homology associates to an integer homology sphere (or more generally a spin rational homology sphere) an algebraic object called an iota-complex. The local equivalence class of this iota-complex is an invariant of the homology cobordism class of , and the set of iota-complexes modulo local equivalence forms a group under tensor product. For technical reasons, it is often convenient to consider a slightly weaker notion of equivalence, called almost local equivalence, and the associated group of almost iota-complexes modulo almost local-equivalence, as in Reference DHST18. There is a group homomorphism

induced by sending to the almost local equivalence class of its iota-complex.

The proof of Theorem 1.1 relies on the following steps:

(1)

A computation of the almost local equivalence class of the iota-complex associated to using the involutive surgery formula of Reference HHSZ20, Theorem 1.6. We call this complex .

(2)

A computation of the almost local equivalence class of linear combinations of , for , following the strategy of Reference DHST18, Section 8.1.

(3)

A comparison of the results from step 2 with the computation of in Reference DHST18, Theorem 8.1.

Remark 1.2.

Let denote the subgroup of spanned by almost-rationally plumbed 3-manifolds; see Reference Ném05 for the precise definition of an almost-rational plumbing. By Reference DS19, Theorem 1.1, , so the proof of Theorem 1.1 actually shows that the quotient contains subgroup isomorphic to .

Recall that a graph manifold is a prime 3-manifold whose JSJ decomposition contains only Seifert fibered pieces. The manifolds in Theorem 1.1 are all graph manifolds, since they are surgery along connected sums of torus knots. Similarly, the manifold in Reference HHSZ20, Theorem 1.9 is a graph manifold, since it is surgery along a connected sum of iterated torus knots. A natural question to ask is whether every homology sphere is homology cobordant to a graph manifold, or more generally, whether graph manifolds generate . As far as the authors know, both of these questions remain open; we expect that the answer to both is no. Note that if Reference NST19, Conjecture 1.22 is true, then graph manifolds do not generate , as pointed out in Reference NST19, Proposition 1.23. Another natural question to ask is whether surgeries on knots in generate .

Organization

This paper is organized as follows. In Section 2 we recall some background on involutive Heegaard Floer homology. In Section 3 we prove that the almost iota-complex of the manifolds in Theorem 1.1 is . In Section 4 we compute the almost local equivalence classes of linear combinations of , and use it to complete the proof of Theorem 1.1.

2. Background on involutive Heegaard Floer homology

We will assume the reader is familiar with the basics of knot Floer homology Reference OS04 Reference Ras03, and confine ourselves to listing some definitions necessary for studying involutive Heegaard Floer homology Reference HM17. In fact, in the present paper we will only need a few properties of this theory, which we summarize here. For more details, see Reference HHSZ20, Section 3.

Definition 2.1.

An iota-complex (or -complex) is a chain complex , which is free and finitely generated over , equipped with an endomorphism . Here is the field of elements, and is a formal variable with grading . Furthermore, the following hold:

(1)

is equipped with a -grading, compatible with the action of . We call this grading the Maslov or homological grading.

(2)

There is a grading-preserving isomorphism .

(3)

is a grading-preserving chain map and .

Given two iota-complexes and , a homogeneously graded -chain map is said to be an -homomorphism if . Two iota-complexes and are called -equivalent if there is a homotopy equivalence which is an -homomorphism.

For any closed oriented -manifold equipped with self-conjugate structure , Hendricks–Manolescu Reference HM17 prove that the -chain complex with homotopy involution is well defined up to homotopy-equivalence. In the case that is a rational homology -sphere, is an iota-complex.

The tensor product of iota-complexes and is given by

Moreover, Hendricks–Manolescu–Zemke Reference HMZ18 establish that

where denotes homotopy-equivalence of iota-complexes.

Definition 2.2.

Suppose and are two iota-complexes.

(1)

A local map from to is a grading-preserving -homomorphism , which induces an isomorphism from to .

(2)

We say that are are locally equivalent if there is a local map from to , as well as a local map from to .

The set of local equivalence classes forms an abelian group, denoted , with product given by the operation in equation Equation 2.1. See Reference HMZ18, Section 8. Inverses are given by dualizing both the chain complex and the map with respect to ; we write for this dual iota-complex. According to Reference HMZ18, Theorem 1.8, the map

determines a homomorphism from to .

There is an additional, weaker, equivalence relation between iota-complexes, introduced in Reference DHST18 (see also Reference HHSZ20, Section 3.3).

Definition 2.3 (Reference DHST18, Definition 3.1).

Let and be free, finitely generated chain complexes over , such that each has an absolute -grading and a relative -grading with respect to which has grading . Two grading-preserving -module homomorphisms

are homotopic mod , denoted , if there exists an -module homomorphism such that increases grading by one and

Definition 2.4 (Reference DHST18, Definition 3.2).

An almost iota-complex (or almost -complex) consists of the following data:

A free, finitely-generated, -graded chain complex over , with

Here has degree and is supported in even gradings.

A grading-preserving -module homomorphism such that

Of course, any iota-complex induces an almost iota-complex. The definition of tensor product of almost iota-complexes is the same as equation Equation 2.1.

In analogy with the terminology above, an almost -homomorphism from to is a homogeneously-graded, -equivariant chain map such that . We then have the following new relation between almost -complexes.

Definition 2.5 (Reference DHST18, Definition 3.5).

Suppose and are almost -complexes.

(1)

An almost local map from to is a grading-preserving almost -homomorphism , which induces an isomorphism from to .

(2)

We say that are are almost locally equivalent if there is an almost local map from to , as well as an almost local map from to .

One special case of this definition will be especially useful to us: if and are maps on the same complex such that and are each almost iota-complexes, and the difference , then the identity map from to itself is an almost local equivalence between and .

Using the definitions above, one may construct an almost local equivalence group of almost iota-complexes. It is a non-trivial result that can be parametrized explicitly Reference DHST18, Theorem 6.2, as we now describe. To a sequence , where and , we may associate an almost iota-complex

called the standard complex of type , as follows. The standard complex is freely generated over by , , …, . For each symbol , we introduce an -arrow between and as follows:

If , then .

If , then .

For each symbol , we introduce a -arrow between and as follows:

If , then .

If , then .

In computations with standard complexes, it will frequently be convenient to represent the group operation with instead of . The dual of the standard complex is the standard complex

where if is then is and vice versa.

Every element of is locally equivalent to a unique standard complex Reference DHST18, Theorem 6.2. Thus, in spite of being infinitely-generated, its elements are easy to describe. We write for the composite

Note that there is not a simple formula for the group operation in terms of standard complexes. Nevertheless, the image has a simple description; see Reference DHST18, Section 8. Indeed,

2.1. Involutive knot Floer homology

Hendricks-Manolescu also constructed an involutive knot Floer homology for a null-homologous knot, which, from our viewpoint, is a finitely-generated -complex with an endomorphism , with properties as follows.

Suppose that is a free, finitely generated complex over the ring . There are two naturally associated maps

as follows. We write as a matrix with respect to a free -basis of . We define to be the endomorphism obtained differentiating each entry of this matrix with respect to . We define to be the endomorphism obtained by differentiating each entry with respect to . These maps naturally appear in the context of knot Floer homology, see Reference Sar11Reference Zem17Reference Zem19c. The maps and are independent of the choice of basis, up to -equivariant chain homotopy Reference Zem19a, Corollary 2.9.

We say an -linear map is skew--equivariant if

We may view a free complex over also as an infinitely generated complex over , where acts diagonally via . Concretely, if is an -basis, then an -basis is given by the elements and , ranging over all , and .

Definition 2.6.
(1)

An -complex is a finitely generated, free chain complex over , equipped with a skew-equivariant endomorphism satisfying

(2)

We say an -complex is of -type if there are two valued gradings, and , such that and have -bigrading and , respectively. We assume has -bigrading , and that switches and . Furthermore, we assume that is integer valued. We call the Alexander grading, and we call and the Maslov gradings. Writing for the subspace in Alexander grading , we assume that there is a grading-preserving isomorphism for all .

In Definition 2.6, an -complex of -type is equipped with two Maslov gradings, and . We note that in the literature, usually one considers just the -grading, which is referred to as the homological grading. All -complexes in this paper will be of -type (as they arise as the complexes associated to knots in ). For further details on the translation to other versions of knot Floer homology, see Reference Zem19b, Section 1.

The tensor product of -complexes has a slightly subtle definition:

Local equivalence of -complexes can defined much as for iota-complexes. See Reference Zem19a, Section 2. For the present paper however, it is helpful to work with the (equivalent) definition that local equivalence of iota-complexes is the equivalence relation generated by declaring two -complexes of -type and locally equivalent if is an -equivariant summand of (cf. Reference HH19). With respect to this definition one may form a local equivalence group of -complexes; inverses are given by dualizing over . As previously, we let denote the dual -complex of .

At present, it is very difficult to compute the -complexes associated to most knots. However, for -space knots , Hendricks-Manolescu Reference HM17 observed that there is a unique choice of such that the knot Floer complex is an -complex. In particular, the involutive knot Floer complex of an -space knot is determined by the Alexander polynomial of .

2.2. The surgery formula

Our main tool is the surgery formula from Reference HHSZ20, which gives an expression for the involutive Heegaard Floer complex in terms of the involutive knot Floer complex of .

We will only need a small part of the surgery formula. For , let denote the -subcomplex of , generated over by the monomials satisfying with and . The -action on is given by . Moreover, we can define a chain map by , since preserves . It turns out (but is not obvious) that is an iota-complex (cf. Reference HM17, Theorem 1.5 and Reference HHSZ20, Lemma 3.16). A consequence of the full surgery formula is:

Proposition 2.7 (Reference HHSZ20, Theorem 1.6).

The local equivalence class of is that of . In particular, the -local equivalence class of depends only on the -local class of .

3. Computation of the almost iota-complex of

In this section we give a computation of the almost iota-complex associated to the manifold for odd. We start by describing the knot Floer homology of the two torus knots and , followed by computing and simplifying several tensor products.

3.1. The knot Floer homology of two families of torus knots

In this subsection we compute the -complexes associated to the torus knots and .

Let denote the complex in Figure 3.1 generated by elements such that with even and such that with odd, with nonzero differentials given by

determined by the symmetric sequence of positive integers .

Likewise, let denote the complex defined similarly using the symmetric string of positive integers given by

with generators such that with odd and such that with even, and nonzero differentials given by

See Figure 3.2 for a depiction of this staircase.

Proposition 3.1.

For odd, the knot Floer homology is chain homotopy equivalent to the complex , and the knot Floer homology is chain homotopy equivalent to the complex . In both cases the involution is given by the natural reflection which interchanges the bigradings.

By Reference OS05 and Reference HM17, the -complex associated to a torus knot is determined by its Alexander polynomial, so it suffices to compute the Alexander polynomials of and for odd. Suppose that is a symmetric sequence of positive integers. We will define

Lemma 3.2.

The Alexander polynomial of is given by the formula

Proof.

Write . The Alexander polynomial is given by

Rearranging, it becomes sufficient to show that

Expanding this out, our desired relation becomes

It is helpful to state a simple algebraic fact. Note that if and are positive integers, and is a sequence which is zero for , then

In particular, if we write , …, for the coefficients of (and set for ), then the coefficient of the right hand side of equation Equation 3.2 is

However, by examining the description of given in equation Equation 3.1 it is easy to verify that equation Equation 3.3 is if for some , and is 0 otherwise. This verifies equation Equation 3.2, and completes the proof.

Lemma 3.3.

The Alexander polynomial of satisfies

Proof.

The proof is in much the same spirit as the proof of Lemma 3.2. Let denote . Using the definition of the Alexander polynomial and rearranging terms, as in Lemma 3.2, it is sufficient to show that

which we expand to

Following the argument of Lemma 3.2, it is sufficient to show that if denote the coefficients of , then is 1 if , for some , and is 0 otherwise. This is straightforward to verify.

Proof of Proposition 3.1.

By Reference OS05 and Reference HM17, the -complex of a torus knot is determined by its Alexander polynomial. The Alexander polynomials computed in Lemmas 3.2 and 3.3 correspond to the staircases and respectively, with given by the natural involution in each case.

3.2. The -complex associated to

In this subsection we compute the -complex associated to the connect sum of torus knots up to -local equivalence.

3.2.1. The -local equivalence class of

As in Section 3.1, let denote the complex of for odd which appears in Figure 3.1, and let denote the complex associated to which appears in Figure 3.2. We first consider . We will choose a new basis for with respect to which our complex decomposes as a direct sum of , as follows. The subset is generated by the basis elements appearing in Figure 3.3.

Observe that in the staircase summand of the subcomplex , the pattern of the construction changes at the basis element . Namely, traveling left to right in Figure 3.3 along the top row, we increase the second index of the generators , followed by the first. Along the second row, we increase the first index of the generators , followed by the second. This complex is equipped with the involution arising from the tensor product, which in particular sends

and is otherwise a reflection.

Before defining the summand , we make a few preliminary observations about gradings. Firstly, we note that

for all odd . As a consequence, if and are odd, then

In particular, if , are odd, then there is an such that

has homogeneous -bigrading. It is not hard to compute that if , then .

Suppose that and are even and . By considering the differential applied to and using the fact that the powers in decrease as we increase the index of , we see that if , then there is an such that

has homogeneous -bigrading. Entirely analogously, if , then there is a so that

has homogeneous -bigrading.

We now describe the summand . The generators have the following form:

(-1)

If and are both odd and , then is a generator of .

(-2)

If is odd, is even, and , then is a generator of .

(-3)

If is even and nonzero, write for some . Then has a generator

(-4)

If is even then has a generator .

(-5)

If and are even with , then

is a generator of , where and .

(-6)

If and are even and , then is a generator of .

(-7)

If and are odd and , then

is a generator of .

(-8)

If is odd, then

is a generator.

(-9)

If and are even and , then following are generators of :

(a)

;

(b)

.

(-10)

For even , the following are generators of :

(a)

;

(b)

.

(-11)

For even , the following are generators of :

(a)

;

(b)

.

In the following, we use

as our model of the involution.

Lemma 3.4.

and satisfy the following:

(1)

and are free.

(2)

.

(3)

and

(4)

and .

In particular, is -locally equivalent to .

Proof.

To prove 1 and 2, we will first show that , and then we will show that the generating set obtained by concatenating the obvious basis of with the basis for above gives a generating set of of the correct number of elements. In particular, this will imply that is free since it has a generating set with no linear relations.

We first address . Suppose and are both odd. Note is in so we may assume that . Consider the case . By adding -1, it is sufficient to consider . By adding -7, we reduce to the case of or which are either in , or are a sum of an element in with an element of -1. Now consider . By adding elements -8, we reduce to the case of and , which are both in . We now consider elements and . Note that if , then either is in , or plus an element -2 is in . The same holds for . Next, we consider an arbitrary . Using -9, we may relate with sums of and with . Hence, by induction, it suffices to show that we can do the same to . If , then we use -2 to relate with , and apply the previous argument. If , then we use -10 or -11. This shows that all and are in the span. Finally, each is a sum of generators -4-5 and -6, as well as the above terms. Hence .

We now show that the generating set obtained by concatenating and has the same cardinality as the rank of , which implies that is free and . Firstly,

Similarly, has generators of type -1, generators of type -2, generators of types -3, -4, -5 or -6, generators of type -7 and -8, and generators of type -9, and generators of type -10 or -11. Hence, we have a generating set of with generators. Concatenating these generating sets gives a generating set of with rank , which must be a basis.

We now prove 3. Clearly , so we focus on . On -1, vanishes. The map sends elements of type -2 to a sum of two elements of -1. Elements -3 and -4 are mapped to sums of -2. Basis elements in -5 are mapped to a sum of -9a and -9b. Basis elements -6 are as follows. If , they are mapped to a sum of -9a and -9b. If , they are mapped to a sum of -9a-9b and -2. If , they are mapped to a sum of -9b and -11a. The differential vanishes on -7 and -8. Elements -9a are mapped to elements -7. Elements -10 are mapped to a sum of -1 and -7 if , or -8 if . Elements -10a are mapped to -8. Elements -10b are mapped to -7. Elements -11a are mapped to a sum of -1 and -7. Finally -11b is mapped to -7.

We now prove 4. Clearly , so we focus on . The map sends elements -1 to elements -1. Similarly elements -2 are sent to elements -2. Elements -3 are sent to elements -4. Elements -4 are sent to the sum of an element -3 and an element -1. Similarly elements -5 are sent to elements -6, while elements -6 and sent to sums of -5 and -7. Generators -7 with are sent to a sum -7 and two elements of -1. Generators -7 with are interchanged with generators -8. Elements -9a and -9b are interchanged. Elements -10a and -10b are interchanged. Similarly elements -11a and -11b are interchanged.

3.2.2. The -local equivalence class of

In this section, we compute the -local equivalence class of .

We begin by introducing a new complex, called the box complex. Let denote the knot-like complex in Figure 3.4 with five generators , , , , , with differential

The -bigradings are as follows:

The involution on is as follows:

We will also be interested in the dual complex , which is generated by , , , , with gradings

and involution

Proposition 3.5.

The -complex of is -locally equivalent to the complex with the involution described above.

Recall that by Lemma 3.4, is -locally equivalent to the complex of Figure 3.3. Moreover, by Proposition 3.1, is -locally equivalent to the complex of Figure 3.2. Our proof of Proposition 3.5 proceeds by demonstrating that the -complex is -locally equivalent to .

Indeed, we prove a general lemma about the tensor product of (positive) staircase complexes with an even number of steps and box complexes. Let be an even number, and let be a staircase complex with generators such that with odd, and such that with even. Let the differentials

be specified by a symmetric sequence of positive integers with the property that . Most importantly, has an even number of steps and the central arrows with target are both weighted by , so that

(Recall that .) We will compute the -local equivalance class of for any staircase of this form. Similarly to the methods of the previous subsection, we construct an -equivariant splitting

into two summands and , which we now describe. The complex , which is the simpler of the two, appears in Figure 3.5. The complex has the following generators:

(-1)

For even , the element .

(-2)

For odd , the element .

(-3)

The elements

(-4)

For even, the elements

(-5)

For even, the elements

(-6)

For odd, then

(-7)

For odd, then

(-8)

The elements and .

(-9)

The elements

(-10)

The elements

As in the previous example, we are using the model of the involution

Note in particular that we have

Lemma 3.6.

The -complex decomposes as the direct sum of -complexes .

Proof.

Confirming that and both preserve and , and furthermore that , proceeds straightforwardly and similarly to Lemma 3.4.

Proof of Proposition 3.5.

We recall that by Lemma 3.4, is -locally equivalent to the complex of Figure 3.3. Moreover, by Proposition 3.1, is -locally equivalent to the staircase complex of Figure 3.2. Applying Lemma 3.6 to shows that is -locally equivalent to . Therefore is -locally equivalent to . The statement of the proposition follows immediately.

3.3. The almost iota-complex associated to

We now consider the tensor product of with the complex of the trefoil , again for odd. Recall that is the staircase complex generated by three elements with and other differentials trivial. We are interested in the iota-complex obtained from the -complex by restricting to monomials in for which and and are non-negative.

Proposition 3.7.

For odd, the iota-complex is almost-locally equivalent to the standard complex .

Proof.

The chain complex has fifteen generators and differentials as shown in Figure 3.6. (Recall that the action of is generated by the action of .)

Using the usual model

the involution takes the following form on :

We now do a change of basis to to obtain the presentation of shown in Figure 3.7.

Let denote the top line of Figure 3.7. There are projection and inclusion maps

which are obviously homotopy equivalences. In particular, is -equivalent to , where

We compute

We briefly remark how is computed in Equation 3.4. The procedure is to write an element in terms of the basis in Figure 3.7, and then project to the top row. As an example

We now consider the induced almost iota-complex. We claim that is -homotopy equivalent equivalent to the complex where is the following map

The equivalence of and is seen as follows. The map sends to and vanishes on all other generators of . In particular, on , where is the -equivariant map which satisfies and vanishes on all other generators.

However, is the iota-complex

where dashed arrows denote . This clearly reduces to the almost iota-complex .

4. Tensor products of almost iota-complexes

4.1. The subgroup of the group of almost iota-complexes spanned by

We now compute the subgroup of the group of almost iota-complexes spanned by linear combinations of the almost iota-complexes for varying . The results of this section are similar to Reference DHST18, Section 8.1. In this section we use the symbol instead of to represent the tensor product of almost iota complexes. Observe that is parametrized by . We will consider sums of the form

where each . Without loss of generality, we assume that the are non-increasing, that is, . Furthermore, we assume that is fully simplified, meaning that if , the complexes and occur with the same sign. Theorem 4.1 and its proof are analogous to Reference DHST18, Theorem 8.1.

Theorem 4.1.

Let

be fully simplified with . Then the standard representative of is obtained by concatenating the parameters of the above terms in the order that they appear.

Example 4.2.

The standard representative of is

Example 4.3.

The standard representative of is

Example 4.4.

The standard representative of is

Proof of Theorem 4.1.

This proof closely follows the proof of Reference DHST18, Theorem 8.1. We begin with a model calculation in the case . Let and be positive integers and consider and . We consider the following two cases:

(1)

with ,

(2)

with ,

and show that we have the following almost local equivalences

The other two cases and follow by dualizing. For both and , the obvious tensor product basis consists of 25 generators. These bases are displayed in the left of Figures 4.1 and 4.2, where they are labeled through . The dashed red arrows represent the action of and the solid black arrows represent , with the label over the arrow denoting the associated power of ; for example, in , we have that and that .

On the right of Figure 4.1, we have performed the change of basis

keeping the other basis elements the same. The reader should verify that this results in the diagram in the right of Figure 4.1. It is then evident from the right of Figure 4.1 that is almost locally equivalent to

as desired.

The computation of is similar. On the right of Figure 4.2, we have performed a change of basis

keeping the other basis elements the same (e.g., , etc). The reader should verify that this results in the diagram on the right of Figure 4.2, where we consider modulo . For example,

We have marked the dashed red arrows that are congruence modulo (rather than equality) with congruence symbols to emphasize this point. (Here is where we first use the notion of almost local equivalence; in the computations of Section 3, all of the maps were local equivalences.) Note that since , we have that . It is then evident from the right of Figure 4.2 that is almost locally equivalent to the standard complex , as desired.

We now consider the general case, by induction on . Suppose we have established the claim for

as in the statement of the theorem. Let be a positive integer such that . Now consider

The case where we add rather than subtract follows by dualizing. The obvious tensor product basis for is schematically depicted in Figure 4.3 (where we have arbitrarily chosen signs in front of each ). Using the inductive hypothesis applied to , this complex has generators.

Our strategy will be to split off subcomplexes by change-of-basis moves paralleling those defined for and . We begin by comparing the leftmost 25 generators of . Label these through , as usual. We begin by letting assume the role of from the previous argument, so that applying the appropriate change of basis based as in Figure 4.1 if the coefficient of is negative and as in Figure 4.2 if the coefficient of is positive results in the second row of Figure 4.3. Note that in the first case, there is an additional subtlety: since we replace with respectively, we are in danger of changing the dashed red arrows entering/exiting , and on the right. To check that this does not happen, we consider two cases:

(1)

Suppose that there are dashed red arrows entering from the right. We claim that in order for this to happen, we must have . Indeed, because is fully simplified, if , then all subsequent terms in our sum are , in which case would have dashed red arrows exiting them, rather than entering. Hence . But this shows that

which means that the original dashed red arrows hold modulo .

(2)

Suppose that there are dashed red arrows exiting to the right. Then we can explicitly check that the dashed red arrows exiting are unchanged:

In particular, we see that in either case, our change of basis does not change the form of the diagram lying to the right of , and .

We now consider the 25 generators lying inside the dashed box in the second row of Figure 4.3, relabeling them through as usual. Again, we attempt to perform a change of basis as in Figure 4.1 or 4.2, now with taking the role of from the initial argument, as follows.

If the second term appears with negative sign in , then we use the change of basis in Figure 4.1.

If the second term appears with positive sign in , then we attempt to use the change of basis in Figure 4.2. However, there is an additional subtlety, as depicted in Figure 4.4. Namely, we have a black arrow entering/exiting from the left, so when we set

we must ensure that we don’t change the diagram to the left of the dashed box. If the black arrow to the left of is exiting , then this follows from the fact that . However, if the arrow is instead entering (representing the relation ), then the diagram is no longer accurate, since evidently . In this situation, we carry out the additional (retroactive) basis change

as in Figure 4.4, so that . Note that by hypothesis. Furthermore, note that , since is fully simplified. Hence , so modulo , our basis change does not change the dashed red arrow leaving . In any case, we see that performing the appropriate change-of-basis splits off another subcomplex and leads to a diagram as in the third row of Figure 4.3. Iterating this procedure results in the complex depicted in the bottom row of Figure 4.3, as desired.

4.2. Proof of Theorem 1.1

We are now ready to complete the proof of our main theorem.

Proof of Theorem 1.1.

By Proposition 2.7, the iota-complex is locally equivalent to . By Proposition 3.5 and Proposition 3.7, for odd, the almost local equivalence class of is . Theorem 4.1 implies that the complexes span a subgroup in ; in particular, elements in this subgroup of are of the form

where

and

By Reference DHST18, Theorem 8.1, elements in are of the form

where

and so the span of the intersects trivially. Therefore, we conclude that the classes

span a subgroup of .

Acknowledgments

We are grateful to Irving Dai and Linh Truong for helpful conversations. The search for the examples in this paper was inspired by the examples of knot-like complexes computed by Wenzhao Chen in Reference Che20 (although our ultimate examples and methods are significantly different from his). We also thank the anonymous referees for helpful comments and feedback.

Figures

Figure 3.1.

The complex

\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzcd}[column sep={.8cm,between origins}, labels=description, row sep=1cm] y_{1-2n}&& y_{3-2n}&& \cdots&& y_{-1}&& y_{1}&&\cdots&& y_{2n-3}&&y_{2n-1}\\ &x_{2-2n}\ar[ul, "\scV"]\ar[ur, "\scU^{2n-1}"]&&x_{4-2n}\ar[ul, "\scV^2"] \ar[ur, "\scU^{2n-2}"]&& \cdots\ar[ur] \ar[ul] && x_{0} \ar[ul, "\scV^{n}"] \ar[ur, "\scU^{n}"]&& \cdots\ar[ur] \ar[ul] && x_{2n-4} \ar[ul, "\scV^{2n-2}"] \ar[ur, "\scU^{2}"]&& x_{2n-2} \ar[ul, "\scV^{2n-1}"] \ar[ur, "\scU"] \end{tikzcd}
Figure 3.2.

The complex . Note that the staircase continues onto the second row of the figure, such that .

Figure 3.3.

The subcomplex . Note that the top two rows form a staircase complex, such that .

Figure 3.4.

The box complex and its dual

Figure 3.5.

The complex . Note that on the bottom row of the staircase complex, the terms to the right of are all of the form .

Figure 3.6.

The complex

\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzpicture}[scale=1.4,auto] \node(a) at (-.25,.75) {$a$}; \node(b) at (-.25, -.25) {$b$}; \node(c) at (.75,-.25) {$c$}; \node(d) at (0,0) {$d$}; \node(e) at (0,1) {$e$}; \node(f) at (1,0) {$f$}; \node(g) at (0,4) {$g$}; \node(h) at (1,4) {$h$}; \node(i) at (0,5) {$i$}; \node(j) at (4,4) {$j$}; \node(k) at (5,4) {$k$}; \node(l) at (4,5) {$l$}; \node(m) at (4,0) {$m$}; \node(n) at (5,0) {$n$}; \node(p) at (4,1) {$p$}; \draw[->] (b) to (a); \draw[->] (b) to (c); \draw[->] (d) to (e); \draw[->] (d) to (f); \draw[->] (g) to (i); \draw[->] (j) to (l); \draw[->] (j) to (k); \draw[->] (m) to node {$\Ss{U}$} (p); \draw[->] (m) to (n); \draw[->] (g) to node [swap] {$\Ss{U}$} (h) ; \draw[->, bend right=20] (d) to (g); \draw[->, bend left=20] (e) to (i); \draw[->, bend left=20] (i) to node {$\Ss{U^n}$} (l); \draw[->, bend left=20] (g) to node {$\Ss{U^n}$} (j); \draw[->, bend right=20] (h) to node {$\Ss{U^{n-1}}$} (k); \draw[->, bend left=20] (e) to node {$\Ss{U}$} (p); \draw[->, bend right =20] (f) to node {$\Ss{U}$} (h); \draw[->, bend right=20] (f) to (n); \draw[->, bend left=20] (d) to (m); \draw[->, bend left=20] (p) to node {$\Ss{U^{n-1}}$} (l); \draw[->, bend right=20] (n) to node {$\Ss{U^{n}}$} (k); \draw[->, bend right=20] (m) to node {$\Ss{U^n}$} (j); \end{tikzpicture}
Figure 3.7.

A new basis of . Arrows denote the differential.

\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzpicture}[scale=1.4,auto] \node(1-1) at (0,3) {$a$}; \node(1-2) at (2,3) {$e+g$}; \node(1-3) at (4,3) {$h+U^{n-1} j+p$}; \node(1-4) at (6,3) {$p$}; \node(1-5) at (8,3) {$l$}; \node(2-1) at (0,2) {$b$}; \node(2-2) at (2,2) {$a+c$}; \node(2-3) at (4,2) {$j$}; \node(2-4) at (6,2) {$l+k$}; \node(3-1) at (0,1) {$e$}; \node(3-2) at (2,1) {$i+Up$}; \node(3-3) at (4,1) {$m$}; \node(3-4) at (6,1) {$n+Up+U^n j$}; \node(4-1) at (0,0) {$d$}; \node(4-2) at (2,0) {$e+f+g+m$}; \draw[->] (1-2) to node {$\Ss{U}$} (1-3); \draw[->] (1-4) to node {$\Ss{U^{n-1}}$} (1-5); \draw[->] (2-1) to (2-2); \draw[->] (2-3) to (2-4); \draw[->] (3-1) to (3-2); \draw[->] (3-3) to (3-4); \draw[->] (4-1) to (4-2); \end{tikzpicture}
Figure 4.1.

Left, the obvious tensor product basis for . Right, after a change of basis. Recall that .

Graphic without alt text
Figure 4.2.

Left, the obvious tensor product basis for . Right, after a change of basis. Recall that .

Graphic without alt text
Figure 4.3.
Figure 4.3(a)
\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzpicture}[scale=0.85] \filldraw(0, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(0, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(0, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(0, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(0, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(1, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(1, 3) circle (1pt) node[label=below right:{\lab{}}] (i) {}; \filldraw(1, 2) circle (1pt) node[label=below right : {\lab{}}] (h) {}; \filldraw(1, 1) circle (1pt) node[label=below right : {\lab{}}] (g) {}; \filldraw(1, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(2, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(2, 3) circle (1pt) node[label=below right:{\lab{}}] (n) {}; \filldraw(2, 2) circle (1pt) node[label=below right : {\lab{}}] (m) {}; \filldraw(2, 1) circle (1pt) node[label=below right : {\lab{}}] (l) {}; \filldraw(2, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(3, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(3, 3) circle (1pt) node[label=below right:{\lab{}}] (s) {}; \filldraw(3, 2) circle (1pt) node[label=below right : {\lab{}}] (r) {}; \filldraw(3, 1) circle (1pt) node[label=below right : {\lab{}}] (q) {}; \filldraw(3, 0) circle (1pt) node[label= below : {\lab{}}] (p) {}; \par\filldraw(4, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(4, 3) circle (1pt) node[label= right:{\lab{}}] (x) {}; \filldraw(4, 2) circle (1pt) node[label= right : {\lab{}}] (w) {}; \filldraw(4, 1) circle (1pt) node[label= right : {\lab{}}] (v) {}; \filldraw(4, 0) circle (1pt) node[label= below : {\lab{}}] (u) {}; \par\draw[->, red, dashed] (a) to (f); \draw[->] (k) to node[above]{\lab{1}} (f); \draw[->, red, dashed] (k) to (p); \draw[->] (u) to node[above]{\lab{n_1}} (p); \par\draw[->, red, dashed] (a) to (b); \draw[->, red, dashed] (a) to (g); \draw[->, red, dashed] (f) to (g); \draw[->, red, dashed] (k) to (l); \draw[->, red, dashed] (k) to (q); \draw[->, red, dashed] (p) to (q); \draw[->, red, dashed] (u) to (v); \par\draw[->, red, dashed] (b) to (g); \draw[->] (l) to node[above]{\lab{1}} (g); \draw[->, red, dashed] (l) to (q); \draw[->] (v) to node[above]{\lab{n_1}} (q); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (c) to (h); \draw[->] (m) to node[above]{\lab{1}} (h); \draw[->, red, dashed] (m) to (r); \draw[->] (w) to node[above]{\lab{n_1}} (r); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (c) to (i); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (m) to (s); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (d) to (i); \draw[->] (n) to node[above]{\lab{1}} (i); \draw[->, red, dashed] (n) to (s); \draw[->] (x) to node[above]{\lab{n_1}} (s); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (e) to (j); \draw[->] (o) to node[above]{\lab{1}} (j); \draw[->, red, dashed] (o) to (t); \draw[->] (y) to node[above]{\lab{n_1}} (t); \par\filldraw(5, 4) circle (1pt) node[label= above:{\lab{}}] (j2) {}; \filldraw(5, 3) circle (1pt) node[label=below left:{\lab{}}] (i2) {}; \filldraw(5, 2) circle (1pt) node[label=below left : {\lab{}}] (h2) {}; \filldraw(5, 1) circle (1pt) node[label=below left : {\lab{}}] (g2) {}; \filldraw(5, 0) circle (1pt) node[label= below : {\lab{}}] (f2) {}; \par\filldraw(6, 4) circle (1pt) node[label= above:{\lab{}}] (o2) {}; \filldraw(6, 3) circle (1pt) node[label=below left:{\lab{}}] (n2) {}; \filldraw(6, 2) circle (1pt) node[label=below left : {\lab{}}] (m2) {}; \filldraw(6, 1) circle (1pt) node[label=below left : {\lab{}}] (l2) {}; \filldraw(6, 0) circle (1pt) node[label= below : {\lab{}}] (k2) {}; \par\filldraw(7, 4) circle (1pt) node[label= above:{\lab{}}] (t2) {}; \filldraw(7, 3) circle (1pt) node[label=below left:{\lab{}}] (s2) {}; \filldraw(7, 2) circle (1pt) node[label=below left : {\lab{}}] (r2) {}; \filldraw(7, 1) circle (1pt) node[label=below left : {\lab{}}] (q2) {}; \filldraw(7, 0) circle (1pt) node[label= below : {\lab{}}] (p2) {}; \par\filldraw(8, 4) circle (1pt) node[label= above:{\lab{}}] (y2) {}; \filldraw(8, 3) circle (1pt) node[label= right:{\lab{}}] (x2) {}; \filldraw(8, 2) circle (1pt) node[label= right : {\lab{}}] (w2) {}; \filldraw(8, 1) circle (1pt) node[label= right : {\lab{}}] (v2) {}; \filldraw(8, 0) circle (1pt) node[label= below : {\lab{}}] (u2) {}; \par\draw[->] (f2) to node[above]{\lab{1}} (k2); \draw[->, red, dashed] (p2) to (k2); \draw[->] (p2) to node[above]{\lab{n_2}} (u2); \par\draw[->, red, dashed] (f2) to (g2); \draw[->, red, dashed] (k2) to (l2); \draw[->, red, dashed] (p2) to (l2); \draw[->, red, dashed] (p2) to (q2); \draw[->, red, dashed] (u2) to (v2); \par\draw[->] (g2) to node[above]{\lab{1}} (l2); \draw[->, red, dashed] (q2) to (l2); \draw[->] (q2) to node[above]{\lab{n_2}} (v2); \par\draw[->] (h2) to node[left]{\lab{1}} (g2); \draw[->] (m2) to node[left]{\lab{1}} (l2); \draw[->] (r2) to node[left]{\lab{1}} (q2); \draw[->] (w2) to node[left]{\lab{1}} (v2); \par\draw[->] (h2) to node[above]{\lab{1}} (m2); \draw[->, red, dashed] (r2) to (m2); \draw[->] (r2) to node[above]{\lab{n_2}} (w2); \par\draw[->, red, dashed] (h2) to (i2); \draw[->, red, dashed] (m2) to (n2); \draw[->, red, dashed] (r2) to (n2); \draw[->, red, dashed] (r2) to (s2); \draw[->, red, dashed] (w2) to (x2); \par\draw[->] (i2) to node[above]{\lab{1}} (n2); \draw[->, red, dashed] (s2) to (n2); \draw[->] (s2) to node[above]{\lab{n_2}} (x2); \par\draw[->] (j2) to node[left]{\lab{M}} (i2); \draw[->] (o2) to node[left]{\lab{M}} (n2); \draw[->] (t2) to node[left]{\lab{M}} (s2); \draw[->] (y2) to node[left]{\lab{M}} (x2); \par\draw[->] (j2) to node[above]{\lab{1}} (o2); \draw[->, red, dashed] (t2) to (o2); \draw[->] (t2) to node[above]{\lab{n_2}} (y2); \par\draw[->, red, dashed] (f2) to (u); \draw[->, red, dashed] (g2) to (v); \draw[->, red, dashed] (h2) to (w); \draw[->, red, dashed] (i2) to (x); \draw[->, red, dashed] (j2) to (y); \draw[->, red, dashed] (f2) to (v); \draw[->, red, dashed] (h2) to (x); \par\node at (8.75, 0) () {\dots}; \node at (8.75, 2) () {\dots}; \node at (8.75, 4) () {\dots}; \par\filldraw(9.5, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(9.5, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(9.5, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(9.5, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(9.5, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(10.5, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(10.5, 3) circle (1pt) node[label=below right:{\lab{}}] (i) {}; \filldraw(10.5, 2) circle (1pt) node[label=below right : {\lab{}}] (h) {}; \filldraw(10.5, 1) circle (1pt) node[label=below right : {\lab{}}] (g) {}; \filldraw(10.5, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(11.5, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(11.5, 3) circle (1pt) node[label=below right:{\lab{}}] (n) {}; \filldraw(11.5, 2) circle (1pt) node[label=below right : {\lab{}}] (m) {}; \filldraw(11.5, 1) circle (1pt) node[label=below right : {\lab{}}] (l) {}; \filldraw(11.5, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(12.5, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(12.5, 3) circle (1pt) node[label=below right:{\lab{}}] (s) {}; \filldraw(12.5, 2) circle (1pt) node[label=below right : {\lab{}}] (r) {}; \filldraw(12.5, 1) circle (1pt) node[label=below right : {\lab{}}] (q) {}; \filldraw(12.5, 0) circle (1pt) node[label= below : {\lab{}}] (p) {}; \par\filldraw(13.5, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(13.5, 3) circle (1pt) node[label= right:{\lab{}}] (x) {}; \filldraw(13.5, 2) circle (1pt) node[label= right : {\lab{}}] (w) {}; \filldraw(13.5, 1) circle (1pt) node[label= right : {\lab{}}] (v) {}; \filldraw(13.5, 0) circle (1pt) node[label= below : {\lab{}}] (u) {}; \par\draw[->, red, dashed] (a) to (f); \draw[->] (k) to node[above]{\lab{1}} (f); \draw[->, red, dashed] (k) to (p); \draw[->] (u) to node[above]{\lab{n_m}} (p); \par\draw[->, red, dashed] (a) to (b); \draw[->, red, dashed] (a) to (g); \draw[->, red, dashed] (f) to (g); \draw[->, red, dashed] (k) to (l); \draw[->, red, dashed] (k) to (q); \draw[->, red, dashed] (p) to (q); \draw[->, red, dashed] (u) to (v); \par\draw[->, red, dashed] (b) to (g); \draw[->] (l) to node[above]{\lab{1}} (g); \draw[->, red, dashed] (l) to (q); \draw[->] (v) to node[above]{\lab{n_m}} (q); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (c) to (h); \draw[->] (m) to node[above]{\lab{1}} (h); \draw[->, red, dashed] (m) to (r); \draw[->] (w) to node[above]{\lab{n_m}} (r); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (c) to (i); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (m) to (s); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (d) to (i); \draw[->] (n) to node[above]{\lab{1}} (i); \draw[->, red, dashed] (n) to (s); \draw[->] (x) to node[above]{\lab{n_m}} (s); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (e) to (j); \draw[->] (o) to node[above]{\lab{1}} (j); \draw[->, red, dashed] (o) to (t); \draw[->] (y) to node[above]{\lab{n_m}} (t); \par\draw[densely dotted] (-0.5,-0.5) rectangle (4.5,4.5); \par\end{tikzpicture}
Figure 4.3(b)
\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzpicture}[scale=0.85] \filldraw(0, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(0, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(0, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(0, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(0, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(1, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(1, 3) circle (1pt) node[label=below right:{\lab{}}] (i) {}; \filldraw(1, 2) circle (1pt) node[label=below right : {\lab{}}] (h) {}; \filldraw(1, 1) circle (1pt) node[label=below right : {\lab{}}] (g) {}; \filldraw(1, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(2, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(2, 3) circle (1pt) node[label=below right:{\lab{}}] (n) {}; \filldraw(2, 2) circle (1pt) node[label=below right : {\lab{}}] (m) {}; \filldraw(2, 1) circle (1pt) node[label=below right : {\lab{}}] (l) {}; \filldraw(2, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(3, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(3, 3) circle (1pt) node[label=below right:{\lab{}}] (s) {}; \filldraw(3, 2) circle (1pt) node[label=below right : {\lab{}}] (r) {}; \filldraw(3, 1) circle (1pt) node[label=below right : {\lab{}}] (q) {}; \filldraw(3, 0) circle (1pt) node[label= below : {\lab{}}] (p) {}; \par\filldraw(4, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(4, 3) circle (1pt) node[label= right:{\lab{}}] (x) {}; \filldraw(4, 2) circle (1pt) node[label= right : {\lab{}}] (w) {}; \filldraw(4, 1) circle (1pt) node[label= right : {\lab{}}] (v) {}; \filldraw(4, 0) circle (1pt) node[label= below : {\lab{}}] (u) {}; \par\draw[->, red, dashed] (a) to (f); \draw[->] (k) to node[above]{\lab{1}} (f); \draw[->, red, dashed] (k) to (p); \draw[->] (u) to node[above]{\lab{n_1}} (p); \par\draw[->, red, dashed] (u) to (v); \par\draw[->, red, dashed] (b) to (g); \draw[->] (l) to node[above]{\lab{1}} (g); \draw[->, red, dashed] (l) to (q); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (c) to (h); \draw[->] (m) to node[above]{\lab{1}} (h); \draw[->, red, dashed] (m) to (r); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (c) to (i); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (m) to (s); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (d) to (i); \draw[->] (n) to node[above]{\lab{1}} (i); \draw[->, red, dashed] (n) to (s); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (e) to (j); \draw[->] (o) to node[above]{\lab{1}} (j); \draw[->, red, dashed] (o) to (t); \par\filldraw(5, 4) circle (1pt) node[label= above:{\lab{}}] (j2) {}; \filldraw(5, 3) circle (1pt) node[label=below left:{\lab{}}] (i2) {}; \filldraw(5, 2) circle (1pt) node[label=below left : {\lab{}}] (h2) {}; \filldraw(5, 1) circle (1pt) node[label=below left : {\lab{}}] (g2) {}; \filldraw(5, 0) circle (1pt) node[label= below : {\lab{}}] (f2) {}; \par\filldraw(6, 4) circle (1pt) node[label= above:{\lab{}}] (o2) {}; \filldraw(6, 3) circle (1pt) node[label=below left:{\lab{}}] (n2) {}; \filldraw(6, 2) circle (1pt) node[label=below left : {\lab{}}] (m2) {}; \filldraw(6, 1) circle (1pt) node[label=below left : {\lab{}}] (l2) {}; \filldraw(6, 0) circle (1pt) node[label= below : {\lab{}}] (k2) {}; \par\filldraw(7, 4) circle (1pt) node[label= above:{\lab{}}] (t2) {}; \filldraw(7, 3) circle (1pt) node[label=below left:{\lab{}}] (s2) {}; \filldraw(7, 2) circle (1pt) node[label=below left : {\lab{}}] (r2) {}; \filldraw(7, 1) circle (1pt) node[label=below left : {\lab{}}] (q2) {}; \filldraw(7, 0) circle (1pt) node[label= below : {\lab{}}] (p2) {}; \par\filldraw(8, 4) circle (1pt) node[label= above:{\lab{}}] (y2) {}; \filldraw(8, 3) circle (1pt) node[label= right:{\lab{}}] (x2) {}; \filldraw(8, 2) circle (1pt) node[label= right : {\lab{}}] (w2) {}; \filldraw(8, 1) circle (1pt) node[label= right : {\lab{}}] (v2) {}; \filldraw(8, 0) circle (1pt) node[label= below : {\lab{}}] (u2) {}; \par\draw[->] (f2) to node[above]{\lab{1}} (k2); \draw[->, red, dashed] (p2) to (k2); \draw[->] (p2) to node[above]{\lab{n_2}} (u2); \par\draw[->, red, dashed] (f2) to (g2); \draw[->, red, dashed] (k2) to (l2); \draw[->, red, dashed] (p2) to (l2); \draw[->, red, dashed] (p2) to (q2); \draw[->, red, dashed] (u2) to (v2); \par\draw[->] (g2) to node[above]{\lab{1}} (l2); \draw[->, red, dashed] (q2) to (l2); \draw[->] (q2) to node[above]{\lab{n_2}} (v2); \par\draw[->] (h2) to node[left]{\lab{1}} (g2); \draw[->] (m2) to node[left]{\lab{1}} (l2); \draw[->] (r2) to node[left]{\lab{1}} (q2); \draw[->] (w2) to node[left]{\lab{1}} (v2); \par\draw[->] (h2) to node[above]{\lab{1}} (m2); \draw[->, red, dashed] (r2) to (m2); \draw[->] (r2) to node[above]{\lab{n_2}} (w2); \par\draw[->, red, dashed] (h2) to (i2); \draw[->, red, dashed] (m2) to (n2); \draw[->, red, dashed] (r2) to (n2); \draw[->, red, dashed] (r2) to (s2); \draw[->, red, dashed] (w2) to (x2); \par\draw[->] (i2) to node[above]{\lab{1}} (n2); \draw[->, red, dashed] (s2) to (n2); \draw[->] (s2) to node[above]{\lab{n_2}} (x2); \par\draw[->] (j2) to node[left]{\lab{M}} (i2); \draw[->] (o2) to node[left]{\lab{M}} (n2); \draw[->] (t2) to node[left]{\lab{M}} (s2); \draw[->] (y2) to node[left]{\lab{M}} (x2); \par\draw[->] (j2) to node[above]{\lab{1}} (o2); \draw[->, red, dashed] (t2) to (o2); \draw[->] (t2) to node[above]{\lab{n_2}} (y2); \par\draw[->, red, dashed] (f2) to (u); \draw[->, red, dashed] (g2) to (v); \draw[->, red, dashed] (h2) to (w); \draw[->, red, dashed] (i2) to (x); \draw[->, red, dashed] (j2) to (y); \draw[->, red, dashed] (f2) to (v); \draw[->, red, dashed] (h2) to (x); \par\node at (8.75, 0) () {\dots}; \node at (8.75, 2) () {\dots}; \node at (8.75, 4) () {\dots}; \par\filldraw(9.5, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(9.5, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(9.5, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(9.5, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(9.5, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(10.5, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(10.5, 3) circle (1pt) node[label=below right:{\lab{}}] (i) {}; \filldraw(10.5, 2) circle (1pt) node[label=below right : {\lab{}}] (h) {}; \filldraw(10.5, 1) circle (1pt) node[label=below right : {\lab{}}] (g) {}; \filldraw(10.5, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(11.5, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(11.5, 3) circle (1pt) node[label=below right:{\lab{}}] (n) {}; \filldraw(11.5, 2) circle (1pt) node[label=below right : {\lab{}}] (m) {}; \filldraw(11.5, 1) circle (1pt) node[label=below right : {\lab{}}] (l) {}; \filldraw(11.5, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(12.5, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(12.5, 3) circle (1pt) node[label=below right:{\lab{}}] (s) {}; \filldraw(12.5, 2) circle (1pt) node[label=below right : {\lab{}}] (r) {}; \filldraw(12.5, 1) circle (1pt) node[label=below right : {\lab{}}] (q) {}; \filldraw(12.5, 0) circle (1pt) node[label= below : {\lab{}}] (p) {}; \par\filldraw(13.5, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(13.5, 3) circle (1pt) node[label= right:{\lab{}}] (x) {}; \filldraw(13.5, 2) circle (1pt) node[label= right : {\lab{}}] (w) {}; \filldraw(13.5, 1) circle (1pt) node[label= right : {\lab{}}] (v) {}; \filldraw(13.5, 0) circle (1pt) node[label= below : {\lab{}}] (u) {}; \par\draw[->, red, dashed] (a) to (f); \draw[->] (k) to node[above]{\lab{1}} (f); \draw[->, red, dashed] (k) to (p); \draw[->] (u) to node[above]{\lab{n_m}} (p); \par\draw[->, red, dashed] (a) to (b); \draw[->, red, dashed] (a) to (g); \draw[->, red, dashed] (f) to (g); \draw[->, red, dashed] (k) to (l); \draw[->, red, dashed] (k) to (q); \draw[->, red, dashed] (p) to (q); \draw[->, red, dashed] (u) to (v); \par\draw[->, red, dashed] (b) to (g); \draw[->] (l) to node[above]{\lab{1}} (g); \draw[->, red, dashed] (l) to (q); \draw[->] (v) to node[above]{\lab{n_m}} (q); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (c) to (h); \draw[->] (m) to node[above]{\lab{1}} (h); \draw[->, red, dashed] (m) to (r); \draw[->] (w) to node[above]{\lab{n_m}} (r); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (c) to (i); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (m) to (s); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (d) to (i); \draw[->] (n) to node[above]{\lab{1}} (i); \draw[->, red, dashed] (n) to (s); \draw[->] (x) to node[above]{\lab{n_m}} (s); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (e) to (j); \draw[->] (o) to node[above]{\lab{1}} (j); \draw[->, red, dashed] (o) to (t); \draw[->] (y) to node[above]{\lab{n_m}} (t); \par\draw[densely dotted] (3.5,-0.5) rectangle (8.5,4.5); \par\end{tikzpicture}
Figure 4.3(c)
\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzpicture}[scale=0.85] \filldraw(0, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(0, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(0, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(0, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(0, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(1, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(1, 3) circle (1pt) node[label=below right:{\lab{}}] (i) {}; \filldraw(1, 2) circle (1pt) node[label=below right : {\lab{}}] (h) {}; \filldraw(1, 1) circle (1pt) node[label=below right : {\lab{}}] (g) {}; \filldraw(1, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(2, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(2, 3) circle (1pt) node[label=below right:{\lab{}}] (n) {}; \filldraw(2, 2) circle (1pt) node[label=below right : {\lab{}}] (m) {}; \filldraw(2, 1) circle (1pt) node[label=below right : {\lab{}}] (l) {}; \filldraw(2, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(3, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(3, 3) circle (1pt) node[label=below right:{\lab{}}] (s) {}; \filldraw(3, 2) circle (1pt) node[label=below right : {\lab{}}] (r) {}; \filldraw(3, 1) circle (1pt) node[label=below right : {\lab{}}] (q) {}; \filldraw(3, 0) circle (1pt) node[label= below : {\lab{}}] (p) {}; \par\filldraw(4, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(4, 3) circle (1pt) node[label= right:{\lab{}}] (x) {}; \filldraw(4, 2) circle (1pt) node[label= right : {\lab{}}] (w) {}; \filldraw(4, 1) circle (1pt) node[label= right : {\lab{}}] (v) {}; \filldraw(4, 0) circle (1pt) node[label= below : {\lab{}}] (u) {}; \par\draw[->, red, dashed] (a) to (f); \draw[->] (k) to node[above]{\lab{1}} (f); \draw[->, red, dashed] (k) to (p); \draw[->] (u) to node[above]{\lab{n_1}} (p); \par\draw[->, red, dashed] (b) to (g); \draw[->] (l) to node[above]{\lab{1}} (g); \draw[->, red, dashed] (l) to (q); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (c) to (h); \draw[->] (m) to node[above]{\lab{1}} (h); \draw[->, red, dashed] (m) to (r); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (c) to (i); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (m) to (s); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (d) to (i); \draw[->] (n) to node[above]{\lab{1}} (i); \draw[->, red, dashed] (n) to (s); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (e) to (j); \draw[->] (o) to node[above]{\lab{1}} (j); \draw[->, red, dashed] (o) to (t); \par\filldraw(5, 4) circle (1pt) node[label= above:{\lab{}}] (j2) {}; \filldraw(5, 3) circle (1pt) node[label=below left:{\lab{}}] (i2) {}; \filldraw(5, 2) circle (1pt) node[label=below left : {\lab{}}] (h2) {}; \filldraw(5, 1) circle (1pt) node[label=below left : {\lab{}}] (g2) {}; \filldraw(5, 0) circle (1pt) node[label= below : {\lab{}}] (f2) {}; \par\filldraw(6, 4) circle (1pt) node[label= above:{\lab{}}] (o2) {}; \filldraw(6, 3) circle (1pt) node[label=below left:{\lab{}}] (n2) {}; \filldraw(6, 2) circle (1pt) node[label=below left : {\lab{}}] (m2) {}; \filldraw(6, 1) circle (1pt) node[label=below left : {\lab{}}] (l2) {}; \filldraw(6, 0) circle (1pt) node[label= below : {\lab{}}] (k2) {}; \par\filldraw(7, 4) circle (1pt) node[label= above:{\lab{}}] (t2) {}; \filldraw(7, 3) circle (1pt) node[label=below left:{\lab{}}] (s2) {}; \filldraw(7, 2) circle (1pt) node[label=below left : {\lab{}}] (r2) {}; \filldraw(7, 1) circle (1pt) node[label=below left : {\lab{}}] (q2) {}; \filldraw(7, 0) circle (1pt) node[label= below : {\lab{}}] (p2) {}; \par\filldraw(8, 4) circle (1pt) node[label= above:{\lab{}}] (y2) {}; \filldraw(8, 3) circle (1pt) node[label= right:{\lab{}}] (x2) {}; \filldraw(8, 2) circle (1pt) node[label= right : {\lab{}}] (w2) {}; \filldraw(8, 1) circle (1pt) node[label= right : {\lab{}}] (v2) {}; \filldraw(8, 0) circle (1pt) node[label= below : {\lab{}}] (u2) {}; \par\draw[->] (f2) to node[above]{\lab{1}} (k2); \draw[->, red, dashed] (p2) to (k2); \draw[->] (p2) to node[above]{\lab{n_2}} (u2); \par\draw[->, red, dashed] (u2) to (v2); \par\draw[->] (g2) to node[above]{\lab{1}} (l2); \draw[->, red, dashed] (q2) to (l2); \par\draw[->] (h2) to node[left]{\lab{1}} (g2); \draw[->] (m2) to node[left]{\lab{1}} (l2); \draw[->] (r2) to node[left]{\lab{1}} (q2); \draw[->] (w2) to node[left]{\lab{1}} (v2); \par\draw[->] (h2) to node[above]{\lab{1}} (m2); \draw[->, red, dashed] (r2) to (m2); \par\draw[->, red, dashed] (h2) to (i2); \draw[->, red, dashed] (m2) to (n2); \draw[->, red, dashed] (r2) to (n2); \draw[->, red, dashed] (r2) to (s2); \draw[->, red, dashed] (w2) to (x2); \par\draw[->] (i2) to node[above]{\lab{1}} (n2); \draw[->, red, dashed] (s2) to (n2); \par\draw[->] (j2) to node[left]{\lab{M}} (i2); \draw[->] (o2) to node[left]{\lab{M}} (n2); \draw[->] (t2) to node[left]{\lab{M}} (s2); \draw[->] (y2) to node[left]{\lab{M}} (x2); \par\draw[->] (j2) to node[above]{\lab{1}} (o2); \draw[->, red, dashed] (t2) to (o2); \par\draw[->, red, dashed] (f2) to (u); \draw[->, red, dashed] (g2) to (v); \draw[->, red, dashed] (h2) to (w); \draw[->, red, dashed] (i2) to (x); \draw[->, red, dashed] (j2) to (y); \draw[->, red, dashed] (h2) to (x); \par\node at (8.75, 0) () {\dots}; \node at (8.75, 2) () {\dots}; \node at (8.75, 4) () {\dots}; \par\filldraw(9.5, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(9.5, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(9.5, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(9.5, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(9.5, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(10.5, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(10.5, 3) circle (1pt) node[label=below right:{\lab{}}] (i) {}; \filldraw(10.5, 2) circle (1pt) node[label=below right : {\lab{}}] (h) {}; \filldraw(10.5, 1) circle (1pt) node[label=below right : {\lab{}}] (g) {}; \filldraw(10.5, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(11.5, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(11.5, 3) circle (1pt) node[label=below right:{\lab{}}] (n) {}; \filldraw(11.5, 2) circle (1pt) node[label=below right : {\lab{}}] (m) {}; \filldraw(11.5, 1) circle (1pt) node[label=below right : {\lab{}}] (l) {}; \filldraw(11.5, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(12.5, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(12.5, 3) circle (1pt) node[label=below right:{\lab{}}] (s) {}; \filldraw(12.5, 2) circle (1pt) node[label=below right : {\lab{}}] (r) {}; \filldraw(12.5, 1) circle (1pt) node[label=below right : {\lab{}}] (q) {}; \filldraw(12.5, 0) circle (1pt) node[label= below : {\lab{}}] (p) {}; \par\filldraw(13.5, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(13.5, 3) circle (1pt) node[label= right:{\lab{}}] (x) {}; \filldraw(13.5, 2) circle (1pt) node[label= right : {\lab{}}] (w) {}; \filldraw(13.5, 1) circle (1pt) node[label= right : {\lab{}}] (v) {}; \filldraw(13.5, 0) circle (1pt) node[label= below : {\lab{}}] (u) {}; \par\draw[->, red, dashed] (a) to (f); \draw[->] (k) to node[above]{\lab{1}} (f); \draw[->, red, dashed] (k) to (p); \draw[->] (u) to node[above]{\lab{n_m}} (p); \par\draw[->, red, dashed] (a) to (b); \draw[->, red, dashed] (a) to (g); \draw[->, red, dashed] (f) to (g); \draw[->, red, dashed] (k) to (l); \draw[->, red, dashed] (k) to (q); \draw[->, red, dashed] (p) to (q); \draw[->, red, dashed] (u) to (v); \par\draw[->, red, dashed] (b) to (g); \draw[->] (l) to node[above]{\lab{1}} (g); \draw[->, red, dashed] (l) to (q); \draw[->] (v) to node[above]{\lab{n_m}} (q); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (c) to (h); \draw[->] (m) to node[above]{\lab{1}} (h); \draw[->, red, dashed] (m) to (r); \draw[->] (w) to node[above]{\lab{n_m}} (r); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (c) to (i); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (m) to (s); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (d) to (i); \draw[->] (n) to node[above]{\lab{1}} (i); \draw[->, red, dashed] (n) to (s); \draw[->] (x) to node[above]{\lab{n_m}} (s); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (e) to (j); \draw[->] (o) to node[above]{\lab{1}} (j); \draw[->, red, dashed] (o) to (t); \draw[->] (y) to node[above]{\lab{n_m}} (t); \par\draw[densely dotted] (8.5, -0.5) -- (7.5,-0.5) -- (7.5, 4.5) --(8.5, 4.5); \par\end{tikzpicture}
Figure 4.3(d)
\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzpicture}[scale=0.85] \filldraw(0, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(0, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(0, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(0, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(0, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(1, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(1, 3) circle (1pt) node[label=below right:{\lab{}}] (i) {}; \filldraw(1, 2) circle (1pt) node[label=below right : {\lab{}}] (h) {}; \filldraw(1, 1) circle (1pt) node[label=below right : {\lab{}}] (g) {}; \filldraw(1, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(2, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(2, 3) circle (1pt) node[label=below right:{\lab{}}] (n) {}; \filldraw(2, 2) circle (1pt) node[label=below right : {\lab{}}] (m) {}; \filldraw(2, 1) circle (1pt) node[label=below right : {\lab{}}] (l) {}; \filldraw(2, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(3, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(3, 3) circle (1pt) node[label=below right:{\lab{}}] (s) {}; \filldraw(3, 2) circle (1pt) node[label=below right : {\lab{}}] (r) {}; \filldraw(3, 1) circle (1pt) node[label=below right : {\lab{}}] (q) {}; \filldraw(3, 0) circle (1pt) node[label= below : {\lab{}}] (p) {}; \par\filldraw(4, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(4, 3) circle (1pt) node[label= right:{\lab{}}] (x) {}; \filldraw(4, 2) circle (1pt) node[label= right : {\lab{}}] (w) {}; \filldraw(4, 1) circle (1pt) node[label= right : {\lab{}}] (v) {}; \filldraw(4, 0) circle (1pt) node[label= below : {\lab{}}] (u) {}; \par\draw[->, red, dashed] (a) to (f); \draw[->] (k) to node[above]{\lab{1}} (f); \draw[->, red, dashed] (k) to (p); \draw[->] (u) to node[above]{\lab{n_1}} (p); \par\draw[->, red, dashed] (b) to (g); \draw[->] (l) to node[above]{\lab{1}} (g); \draw[->, red, dashed] (l) to (q); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (c) to (h); \draw[->] (m) to node[above]{\lab{1}} (h); \draw[->, red, dashed] (m) to (r); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (c) to (i); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (m) to (s); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (d) to (i); \draw[->] (n) to node[above]{\lab{1}} (i); \draw[->, red, dashed] (n) to (s); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (e) to (j); \draw[->] (o) to node[above]{\lab{1}} (j); \draw[->, red, dashed] (o) to (t); \par\filldraw(5, 4) circle (1pt) node[label= above:{\lab{}}] (j2) {}; \filldraw(5, 3) circle (1pt) node[label=below left:{\lab{}}] (i2) {}; \filldraw(5, 2) circle (1pt) node[label=below left : {\lab{}}] (h2) {}; \filldraw(5, 1) circle (1pt) node[label=below left : {\lab{}}] (g2) {}; \filldraw(5, 0) circle (1pt) node[label= below : {\lab{}}] (f2) {}; \par\filldraw(6, 4) circle (1pt) node[label= above:{\lab{}}] (o2) {}; \filldraw(6, 3) circle (1pt) node[label=below left:{\lab{}}] (n2) {}; \filldraw(6, 2) circle (1pt) node[label=below left : {\lab{}}] (m2) {}; \filldraw(6, 1) circle (1pt) node[label=below left : {\lab{}}] (l2) {}; \filldraw(6, 0) circle (1pt) node[label= below : {\lab{}}] (k2) {}; \par\filldraw(7, 4) circle (1pt) node[label= above:{\lab{}}] (t2) {}; \filldraw(7, 3) circle (1pt) node[label=below left:{\lab{}}] (s2) {}; \filldraw(7, 2) circle (1pt) node[label=below left : {\lab{}}] (r2) {}; \filldraw(7, 1) circle (1pt) node[label=below left : {\lab{}}] (q2) {}; \filldraw(7, 0) circle (1pt) node[label= below : {\lab{}}] (p2) {}; \par\filldraw(8, 4) circle (1pt) node[label= above:{\lab{}}] (y2) {}; \filldraw(8, 3) circle (1pt) node[label= right:{\lab{}}] (x2) {}; \filldraw(8, 2) circle (1pt) node[label= right : {\lab{}}] (w2) {}; \filldraw(8, 1) circle (1pt) node[label= right : {\lab{}}] (v2) {}; \filldraw(8, 0) circle (1pt) node[label= below : {\lab{}}] (u2) {}; \par\draw[->] (f2) to node[above]{\lab{1}} (k2); \draw[->, red, dashed] (p2) to (k2); \draw[->] (p2) to node[above]{\lab{n_2}} (u2); \par\draw[->] (g2) to node[above]{\lab{1}} (l2); \draw[->, red, dashed] (q2) to (l2); \par\draw[->] (h2) to node[left]{\lab{1}} (g2); \draw[->] (m2) to node[left]{\lab{1}} (l2); \draw[->] (r2) to node[left]{\lab{1}} (q2); \draw[->] (w2) to node[left]{\lab{1}} (v2); \par\draw[->] (h2) to node[above]{\lab{1}} (m2); \draw[->, red, dashed] (r2) to (m2); \par\draw[->, red, dashed] (h2) to (i2); \draw[->, red, dashed] (m2) to (n2); \draw[->, red, dashed] (r2) to (n2); \draw[->, red, dashed] (r2) to (s2); \draw[->, red, dashed] (w2) to (x2); \par\draw[->] (i2) to node[above]{\lab{1}} (n2); \draw[->, red, dashed] (s2) to (n2); \par\draw[->] (j2) to node[left]{\lab{M}} (i2); \draw[->] (o2) to node[left]{\lab{M}} (n2); \draw[->] (t2) to node[left]{\lab{M}} (s2); \draw[->] (y2) to node[left]{\lab{M}} (x2); \par\draw[->] (j2) to node[above]{\lab{1}} (o2); \draw[->, red, dashed] (t2) to (o2); \par\draw[->, red, dashed] (f2) to (u); \draw[->, red, dashed] (g2) to (v); \draw[->, red, dashed] (h2) to (w); \draw[->, red, dashed] (i2) to (x); \draw[->, red, dashed] (j2) to (y); \draw[->, red, dashed] (h2) to (x); \par\node at (8.75, 0) () {\dots}; \node at (8.75, 2) () {\dots}; \node at (8.75, 4) () {\dots}; \par\filldraw(9.5, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(9.5, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(9.5, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(9.5, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(9.5, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(10.5, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(10.5, 3) circle (1pt) node[label=below right:{\lab{}}] (i) {}; \filldraw(10.5, 2) circle (1pt) node[label=below right : {\lab{}}] (h) {}; \filldraw(10.5, 1) circle (1pt) node[label=below right : {\lab{}}] (g) {}; \filldraw(10.5, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(11.5, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(11.5, 3) circle (1pt) node[label=below right:{\lab{}}] (n) {}; \filldraw(11.5, 2) circle (1pt) node[label=below right : {\lab{}}] (m) {}; \filldraw(11.5, 1) circle (1pt) node[label=below right : {\lab{}}] (l) {}; \filldraw(11.5, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(12.5, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(12.5, 3) circle (1pt) node[label=below right:{\lab{}}] (s) {}; \filldraw(12.5, 2) circle (1pt) node[label=below right : {\lab{}}] (r) {}; \filldraw(12.5, 1) circle (1pt) node[label=below right : {\lab{}}] (q) {}; \filldraw(12.5, 0) circle (1pt) node[label= below : {\lab{}}] (p) {}; \par\filldraw(13.5, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(13.5, 3) circle (1pt) node[label= right:{\lab{}}] (x) {}; \filldraw(13.5, 2) circle (1pt) node[label= right : {\lab{}}] (w) {}; \filldraw(13.5, 1) circle (1pt) node[label= right : {\lab{}}] (v) {}; \filldraw(13.5, 0) circle (1pt) node[label= below : {\lab{}}] (u) {}; \par\draw[->, red, dashed] (a) to (f); \draw[->] (k) to node[above]{\lab{1}} (f); \draw[->, red, dashed] (k) to (p); \draw[->] (u) to node[above]{\lab{n_m}} (p); \par\draw[->, red, dashed] (u) to (v); \par\draw[->, red, dashed] (b) to (g); \draw[->] (l) to node[above]{\lab{1}} (g); \draw[->, red, dashed] (l) to (q); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (c) to (h); \draw[->] (m) to node[above]{\lab{1}} (h); \draw[->, red, dashed] (m) to (r); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (c) to (i); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (m) to (s); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (d) to (i); \draw[->] (n) to node[above]{\lab{1}} (i); \draw[->, red, dashed] (n) to (s); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (e) to (j); \draw[->] (o) to node[above]{\lab{1}} (j); \draw[->, red, dashed] (o) to (t); \par\end{tikzpicture}
Figure 4.4.
Figure 4.4(a)
\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzpicture}[scale=1] \par\filldraw(0, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(0, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(0, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(0, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(0, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(1, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(1, 3) circle (1pt) node[label=below left:{\lab{}}] (i) {}; \filldraw(1, 2) circle (1pt) node[label=below left : {\lab{}}] (h) {}; \filldraw(1, 1) circle (1pt) node[label=below left : {\lab{}}] (g) {}; \filldraw(1, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(2, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(2, 3) circle (1pt) node[label=below left:{\lab{}}] (n) {}; \filldraw(2, 2) circle (1pt) node[label=below left : {\lab{}}] (m) {}; \filldraw(2, 1) circle (1pt) node[label=below left : {\lab{}}] (l) {}; \filldraw(2, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(3, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(3, 3) circle (1pt) node[label=below left:{\lab{}}] (s) {}; \filldraw(3, 2) circle (1pt) node[label=below left : {\lab{}}] (r) {}; \filldraw(3, 1) circle (1pt) node[label=below left : {\lab{}}] (q) {}; \filldraw(3, 0) circle (1pt) node[label= below : {\lab{\alpha}}] (p) {}; \par\filldraw(4, 4) circle (1pt) node[label= above:{\lab{e}}] (y) {}; \filldraw(4, 3) circle (1pt) node[label= left:{\lab{d}}] (x) {}; \filldraw(4, 2) circle (1pt) node[label= left : {\lab{c}}] (w) {}; \filldraw(4, 1) circle (1pt) node[label= left : {\lab{b}}] (v) {}; \filldraw(4, 0) circle (1pt) node[label= below : {\lab{a}}] (u) {}; \par\draw[->, red, dashed] (f) to (a); \draw[->] (f) to node[above]{\lab{1}} (k); \draw[->, red, dashed] (p) to (k); \draw[->] (p) to node[above]{\lab{n_1}} (u); \par\draw[->, red, dashed] (u) to (v); \par\draw[->, red, dashed] (g) to (b); \draw[->] (g) to node[above]{\lab{1}} (l); \draw[->, red, dashed] (q) to (l); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (h) to (c); \draw[->] (h) to node[above]{\lab{1}} (m); \draw[->, red, dashed] (r) to (m); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (h) to (d); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (r) to (n); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (i) to (d); \draw[->] (i) to node[above]{\lab{1}} (n); \draw[->, red, dashed] (s) to (n); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (j) to (e); \draw[->] (j) to node[above]{\lab{1}} (o); \draw[->, red, dashed] (t) to (o); \par\filldraw(5, 4) circle (1pt) node[label= above:{\lab{j}}] (j2) {}; \filldraw(5, 3) circle (1pt) node[label=below left:{\lab{i}}] (i2) {}; \filldraw(5, 2) circle (1pt) node[label=below left : {\lab{h}}] (h2) {}; \filldraw(5, 1) circle (1pt) node[label=below left : {\lab{g}}] (g2) {}; \filldraw(5, 0) circle (1pt) node[label= below : {\lab{f}}] (f2) {}; \par\filldraw(6, 4) circle (1pt) node[label= above:{\lab{o}}] (o2) {}; \filldraw(6, 3) circle (1pt) node[label=below left:{\lab{n}}] (n2) {}; \filldraw(6, 2) circle (1pt) node[label=below left : {\lab{m}}] (m2) {}; \filldraw(6, 1) circle (1pt) node[label=below left : {\lab{\ell}}] (l2) {}; \filldraw(6, 0) circle (1pt) node[label= below : {\lab{k}}] (k2) {}; \par\filldraw(7, 4) circle (1pt) node[label= above:{\lab{t}}] (t2) {}; \filldraw(7, 3) circle (1pt) node[label=below left:{\lab{s}}] (s2) {}; \filldraw(7, 2) circle (1pt) node[label=below left : {\lab{r}}] (r2) {}; \filldraw(7, 1) circle (1pt) node[label=below left : {\lab{q}}] (q2) {}; \filldraw(7, 0) circle (1pt) node[label= below : {\lab{p}}] (p2) {}; \par\filldraw(8, 4) circle (1pt) node[label= above:{\lab{y}}] (y2) {}; \filldraw(8, 3) circle (1pt) node[label= right:{\lab{x}}] (x2) {}; \filldraw(8, 2) circle (1pt) node[label= right : {\lab{w}}] (w2) {}; \filldraw(8, 1) circle (1pt) node[label= right : {\lab{v}}] (v2) {}; \filldraw(8, 0) circle (1pt) node[label= below : {\lab{u}}] (u2) {}; \par\draw[->] (f2) to node[above]{\lab{1}} (k2); \draw[->, red, dashed] (p2) to (k2); \draw[->] (p2) to node[above]{\lab{n_2}} (u2); \par\draw[->, red, dashed] (f2) to (g2); \draw[->, red, dashed] (k2) to (l2); \draw[->, red, dashed] (p2) to (l2); \draw[->, red, dashed] (p2) to (q2); \draw[->, red, dashed] (u2) to (v2); \par\draw[->] (g2) to node[above]{\lab{1}} (l2); \draw[->, red, dashed] (q2) to (l2); \draw[->] (q2) to node[above]{\lab{n_2}} (v2); \par\draw[->] (h2) to node[left]{\lab{1}} (g2); \draw[->] (m2) to node[left]{\lab{1}} (l2); \draw[->] (r2) to node[left]{\lab{1}} (q2); \draw[->] (w2) to node[left]{\lab{1}} (v2); \par\draw[->] (h2) to node[above]{\lab{1}} (m2); \draw[->, red, dashed] (r2) to (m2); \draw[->] (r2) to node[above]{\lab{n_2}} (w2); \par\draw[->, red, dashed] (h2) to (i2); \draw[->, red, dashed] (m2) to (n2); \draw[->, red, dashed] (r2) to (n2); \draw[->, red, dashed] (r2) to (s2); \draw[->, red, dashed] (w2) to (x2); \par\draw[->] (i2) to node[above]{\lab{1}} (n2); \draw[->, red, dashed] (s2) to (n2); \draw[->] (s2) to node[above]{\lab{n_2}} (x2); \par\draw[->] (j2) to node[left]{\lab{M}} (i2); \draw[->] (o2) to node[left]{\lab{M}} (n2); \draw[->] (t2) to node[left]{\lab{M}} (s2); \draw[->] (y2) to node[left]{\lab{M}} (x2); \par\draw[->] (j2) to node[above]{\lab{1}} (o2); \draw[->, red, dashed] (t2) to (o2); \draw[->] (t2) to node[above]{\lab{n_2}} (y2); \par\draw[->, red, dashed] (f2) to (u); \draw[->, red, dashed] (g2) to (v); \draw[->, red, dashed] (h2) to (w); \draw[->, red, dashed] (i2) to (x); \draw[->, red, dashed] (j2) to (y); \draw[->, red, dashed] (f2) to (v); \draw[->, red, dashed] (h2) to (x); \par\end{tikzpicture}
Figure 4.4(b)
\renewcommand{\arraystretch}{1} \setlength{\unitlength}{1.0pt} \begin{tikzpicture}[scale=1] \par\filldraw(0, 4) circle (1pt) node[label= left:{\lab{}}] (e) {}; \filldraw(0, 3) circle (1pt) node[label= left:{\lab{}}] (d) {}; \filldraw(0, 2) circle (1pt) node[label= left : {\lab{}}] (c) {}; \filldraw(0, 1) circle (1pt) node[label= left : {\lab{}}] (b) {}; \filldraw(0, 0) circle (1pt) node[label= left : {\lab{}}] (a) {}; \par\filldraw(1, 4) circle (1pt) node[label= above:{\lab{}}] (j) {}; \filldraw(1, 3) circle (1pt) node[label=below left:{\lab{}}] (i) {}; \filldraw(1, 2) circle (1pt) node[label=below left : {\lab{}}] (h) {}; \filldraw(1, 1) circle (1pt) node[label=below left : {\lab{}}] (g) {}; \filldraw(1, 0) circle (1pt) node[label= below : {\lab{}}] (f) {}; \par\filldraw(2, 4) circle (1pt) node[label= above:{\lab{}}] (o) {}; \filldraw(2, 3) circle (1pt) node[label=below left:{\lab{}}] (n) {}; \filldraw(2, 2) circle (1pt) node[label=below left : {\lab{}}] (m) {}; \filldraw(2, 1) circle (1pt) node[label=below left : {\lab{}}] (l) {}; \filldraw(2, 0) circle (1pt) node[label= below : {\lab{}}] (k) {}; \par\filldraw(3, 4) circle (1pt) node[label= above:{\lab{}}] (t) {}; \filldraw(3, 3) circle (1pt) node[label=below left:{\lab{}}] (s) {}; \filldraw(3, 2) circle (1pt) node[label=below left : {\lab{}}] (r) {}; \filldraw(3, 1) circle (1pt) node[label=below left : {\lab{}}] (q) {}; \filldraw(3, 0) circle (1pt) node[label= below : {\lab{\alpha'}}] (p) {}; \par\filldraw(4, 4) circle (1pt) node[label= above:{\lab{}}] (y) {}; \filldraw(4, 3) circle (1pt) node[label= left:{\lab{}}] (x) {}; \filldraw(4, 2) circle (1pt) node[label= left : {\lab{}}] (w) {}; \filldraw(4, 1) circle (1pt) node[label= left : {\lab{}}] (v) {}; \filldraw(4, 0) circle (1pt) node[label= below : {\lab{a'}}] (u) {}; \draw[->, red, dashed] (f) to (a); \draw[->] (f) to node[above]{\lab{1}} (k); \draw[->, red, dashed] (p) to (k); \draw[->] (p) to node[above]{\lab{n_1}} (u); \par\draw[->, red, dashed] (g) to (b); \draw[->] (g) to node[above]{\lab{1}} (l); \draw[->, red, dashed] (q) to (l); \par\draw[->] (c) to node[left]{\lab{1}} (b); \draw[->] (h) to node[left]{\lab{1}} (g); \draw[->] (m) to node[left]{\lab{1}} (l); \draw[->] (r) to node[left]{\lab{1}} (q); \draw[->] (w) to node[left]{\lab{1}} (v); \par\draw[->, red, dashed] (h) to (c); \draw[->] (h) to node[above]{\lab{1}} (m); \draw[->, red, dashed] (r) to (m); \par\draw[->, red, dashed] (c) to (d); \draw[->, red, dashed] (h) to (d); \draw[->, red, dashed] (h) to (i); \draw[->, red, dashed] (m) to (n); \draw[->, red, dashed] (r) to (n); \draw[->, red, dashed] (r) to (s); \draw[->, red, dashed] (w) to (x); \par\draw[->, red, dashed] (i) to (d); \draw[->] (i) to node[above]{\lab{1}} (n); \draw[->, red, dashed] (s) to (n); \par\draw[->] (e) to node[left]{\lab{M}} (d); \draw[->] (j) to node[left]{\lab{M}} (i); \draw[->] (o) to node[left]{\lab{M}} (n); \draw[->] (t) to node[left]{\lab{M}} (s); \draw[->] (y) to node[left]{\lab{M}} (x); \par\draw[->, red, dashed] (j) to (e); \draw[->] (j) to node[above]{\lab{1}} (o); \draw[->, red, dashed] (t) to (o); \par\filldraw(5, 4) circle (1pt) node[label= above:{\lab{}}] (j2) {}; \filldraw(5, 3) circle (1pt) node[label=below left:{\lab{}}] (i2) {}; \filldraw(5, 2) circle (1pt) node[label=below left : {\lab{}}] (h2) {}; \filldraw(5, 1) circle (1pt) node[label=below left : {\lab{}}] (g2) {}; \filldraw(5, 0) circle (1pt) node[label= below : {\lab{}}] (f2) {}; \par\filldraw(6, 4) circle (1pt) node[label= above:{\lab{}}] (o2) {}; \filldraw(6, 3) circle (1pt) node[label=below left:{\lab{}}] (n2) {}; \filldraw(6, 2) circle (1pt) node[label=below left : {\lab{}}] (m2) {}; \filldraw(6, 1) circle (1pt) node[label=below left : {\lab{}}] (l2) {}; \filldraw(6, 0) circle (1pt) node[label= below : {\lab{}}] (k2) {}; \par\filldraw(7, 4) circle (1pt) node[label= above:{\lab{}}] (t2) {}; \filldraw(7, 3) circle (1pt) node[label=below left:{\lab{}}] (s2) {}; \filldraw(7, 2) circle (1pt) node[label=below left : {\lab{}}] (r2) {}; \filldraw(7, 1) circle (1pt) node[label=below left : {\lab{}}] (q2) {}; \filldraw(7, 0) circle (1pt) node[label= below : {\lab{}}] (p2) {}; \par\filldraw(8, 4) circle (1pt) node[label= above:{\lab{}}] (y2) {}; \filldraw(8, 3) circle (1pt) node[label= right:{\lab{}}] (x2) {}; \filldraw(8, 2) circle (1pt) node[label= right : {\lab{}}] (w2) {}; \filldraw(8, 1) circle (1pt) node[label= right : {\lab{}}] (v2) {}; \filldraw(8, 0) circle (1pt) node[label= below : {\lab{}}] (u2) {}; \par\draw[->] (f2) to node[above]{\lab{1}} (k2); \draw[->, red, dashed] (p2) to (k2); \draw[->] (p2) to node[above]{\lab{n_2}} (u2); \par\draw[->, red, dashed] (u2) to (v2); \par\draw[->] (g2) to node[above]{\lab{1}} (l2); \draw[->, red, dashed] (q2) to (l2); \par\draw[->] (h2) to node[left]{\lab{1}} (g2); \draw[->] (m2) to node[left]{\lab{1}} (l2); \draw[->] (r2) to node[left]{\lab{1}} (q2); \draw[->] (w2) to node[left]{\lab{1}} (v2); \par\draw[->] (h2) to node[above]{\lab{1}} (m2); \draw[->, red, dashed] (r2) to (m2); \par\draw[->, red, dashed] (h2) to (i2); \draw[->, red, dashed] (m2) to (n2); \draw[->, red, dashed] (r2) to (n2); \draw[->, red, dashed] (r2) to (s2); \draw[->, red, dashed] (w2) to (x2); \par\draw[->] (i2) to node[above]{\lab{1}} (n2); \draw[->, red, dashed] (s2) to (n2); \par\draw[->] (j2) to node[left]{\lab{M}} (i2); \draw[->] (o2) to node[left]{\lab{M}} (n2); \draw[->] (t2) to node[left]{\lab{M}} (s2); \draw[->] (y2) to node[left]{\lab{M}} (x2); \par\draw[->] (j2) to node[above]{\lab{1}} (o2); \draw[->, red, dashed] (t2) to (o2); \par\draw[->, red, dashed] (f2) to (u); \draw[->, red, dashed] (g2) to (v); \draw[->, red, dashed] (h2) to (w); \draw[->, red, dashed] (i2) to (x); \draw[->, red, dashed] (j2) to (y); \draw[->, red, dashed] (h2) to (x); \par\node at (3, -1) () {\lab{\alpha' = \alpha+ U^{n_1-1} (c+h+i) + U^{n_1-M} t}}; \node at (3, -1.5) () {\lab{a' = a+b+g+m+n+s+U^{n_1-M}y}}; \end{tikzpicture}

Mathematical Fragments

Theorem 1.1.

The quotient contains a subgroup isomorphic to , spanned by

Equation (2.1)
Definition 2.6.
(1)

An -complex is a finitely generated, free chain complex over , equipped with a skew-equivariant endomorphism satisfying

(2)

We say an -complex is of -type if there are two valued gradings, and , such that and have -bigrading and , respectively. We assume has -bigrading , and that switches and . Furthermore, we assume that is integer valued. We call the Alexander grading, and we call and the Maslov gradings. Writing for the subspace in Alexander grading , we assume that there is a grading-preserving isomorphism for all .

Proposition 2.7 (Reference HHSZ20, Theorem 1.6).

The local equivalence class of is that of . In particular, the -local equivalence class of depends only on the -local class of .

Proposition 3.1.

For odd, the knot Floer homology is chain homotopy equivalent to the complex , and the knot Floer homology is chain homotopy equivalent to the complex . In both cases the involution is given by the natural reflection which interchanges the bigradings.

Lemma 3.2.

The Alexander polynomial of is given by the formula

Equation (3.2)
Equation (3.3)
Lemma 3.3.

The Alexander polynomial of satisfies

Lemma 3.4.

and satisfy the following:

(1)

and are free.

(2)

.

(3)

and

(4)

and .

In particular, is -locally equivalent to .

Proposition 3.5.

The -complex of is -locally equivalent to the complex with the involution described above.

Lemma 3.6.

The -complex decomposes as the direct sum of -complexes .

Proposition 3.7.

For odd, the iota-complex is almost-locally equivalent to the standard complex .

Equation (3.4)
Theorem 4.1.

Let

be fully simplified with . Then the standard representative of is obtained by concatenating the parameters of the above terms in the order that they appear.

References

Reference [Che20]
Wenzhao Chen, An infinite-rank summand from iterated Mazur pattern satellite knots, 2020. Preprint, arXiv:2010.11277.,
Show rawAMSref \bib{ChenMazur}{misc}{ author={Chen, Wenzhao}, title={An infinite-rank summand from iterated {M}azur pattern satellite knots}, date={2020}, note={Preprint, \arXiv {2010.11277}}, }
Reference [DHST18]
Irving Dai, Jennifer Hom, Matthew Stoffregen, and Linh Truong, An infinite-rank summand of the homology cobordism group, 2018. Preprint, arXiv:1810.06145.,
Show rawAMSref \bib{DHSThomcob}{misc}{ author={Dai, Irving}, author={Hom, Jennifer}, author={Stoffregen, Matthew}, author={Truong, Linh}, title={An infinite-rank summand of the homology cobordism group}, date={2018}, note={Preprint, \arXiv {1810.06145}}, }
Reference [DS19]
Irving Dai and Matthew Stoffregen, On homology cobordism and local equivalence between plumbed manifolds, Geom. Topol. 23 (2019), no. 2, 865–924, DOI 10.2140/gt.2019.23.865. MR3939054,
Show rawAMSref \bib{dai-stoffregen}{article}{ author={Dai, Irving}, author={Stoffregen, Matthew}, title={On homology cobordism and local equivalence between plumbed manifolds}, journal={Geom. Topol.}, volume={23}, date={2019}, number={2}, pages={865--924}, issn={1465-3060}, review={\MR {3939054}}, doi={10.2140/gt.2019.23.865}, }
Reference [HH19]
Kristen Hendricks and Jennifer Hom, A note on knot concordance and involutive knot Floer homology, Breadth in contemporary topology, Proc. Sympos. Pure Math., vol. 102, Amer. Math. Soc., Providence, RI, 2019, pp. 113–118. MR3967364,
Show rawAMSref \bib{HHStableEquivalence}{article}{ author={Hendricks, Kristen}, author={Hom, Jennifer}, title={A note on knot concordance and involutive knot Floer homology}, conference={ title={Breadth in contemporary topology}, }, book={ series={Proc. Sympos. Pure Math.}, volume={102}, publisher={Amer. Math. Soc., Providence, RI}, }, date={2019}, pages={113--118}, review={\MR {3967364}}, }
Reference [HHSZ20]
Kristen Hendricks, Jennifer Hom, Matthew Stoffregen, and Ian Zemke, Surgery exact triangles in involutive Heegaard Floer homology, 2020. Preprint, arXiv:2011.00113.,
Show rawAMSref \bib{HHSZ}{misc}{ author={Hendricks, Kristen}, author={Hom, Jennifer}, author={Stoffregen, Matthew}, author={Zemke, Ian}, title={Surgery exact triangles in involutive {H}eegaard {F}loer homology}, date={2020}, note={Preprint, \arXiv {2011.00113}}, }
Reference [HM17]
Kristen Hendricks and Ciprian Manolescu, Involutive Heegaard Floer homology, Duke Math. J. 166 (2017), no. 7, 1211–1299, DOI 10.1215/00127094-3793141. MR3649355,
Show rawAMSref \bib{HMInvolutive}{article}{ author={Hendricks, Kristen}, author={Manolescu, Ciprian}, title={Involutive Heegaard Floer homology}, journal={Duke Math. J.}, volume={166}, date={2017}, number={7}, pages={1211--1299}, issn={0012-7094}, review={\MR {3649355}}, doi={10.1215/00127094-3793141}, }
Reference [HMZ18]
Kristen Hendricks, Ciprian Manolescu, and Ian Zemke, A connected sum formula for involutive Heegaard Floer homology, Selecta Math. (N.S.) 24 (2018), no. 2, 1183–1245, DOI 10.1007/s00029-017-0332-8. MR3782421,
Show rawAMSref \bib{HMZConnectedSum}{article}{ author={Hendricks, Kristen}, author={Manolescu, Ciprian}, author={Zemke, Ian}, title={A connected sum formula for involutive Heegaard Floer homology}, journal={Selecta Math. (N.S.)}, volume={24}, date={2018}, number={2}, pages={1183--1245}, issn={1022-1824}, review={\MR {3782421}}, doi={10.1007/s00029-017-0332-8}, }
Reference [Lin17]
Francesco Lin, The surgery exact triangle in -monopole Floer homology, Algebr. Geom. Topol. 17 (2017), no. 5, 2915–2960, DOI 10.2140/agt.2017.17.2915. MR3704248,
Show rawAMSref \bib{LinExact}{article}{ author={Lin, Francesco}, title={The surgery exact triangle in $\mathrm {Pin}(2)$-monopole Floer homology}, journal={Algebr. Geom. Topol.}, volume={17}, date={2017}, number={5}, pages={2915--2960}, issn={1472-2747}, review={\MR {3704248}}, doi={10.2140/agt.2017.17.2915}, }
Reference [Liv81]
Charles Livingston, Homology cobordisms of -manifolds, knot concordances, and prime knots, Pacific J. Math. 94 (1981), no. 1, 193–206. MR625818,
Show rawAMSref \bib{livingston}{article}{ author={Livingston, Charles}, title={Homology cobordisms of $3$-manifolds, knot concordances, and prime knots}, journal={Pacific J. Math.}, volume={94}, date={1981}, number={1}, pages={193--206}, issn={0030-8730}, review={\MR {625818}}, }
Reference [Man16]
Ciprian Manolescu, Pin(2)-equivariant Seiberg-Witten Floer homology and the triangulation conjecture, J. Amer. Math. Soc. 29 (2016), no. 1, 147–176, DOI 10.1090/jams829. MR3402697,
Show rawAMSref \bib{ManolescuPin2Triangulation}{article}{ author={Manolescu, Ciprian}, title={Pin(2)-equivariant Seiberg-Witten Floer homology and the triangulation conjecture}, journal={J. Amer. Math. Soc.}, volume={29}, date={2016}, number={1}, pages={147--176}, issn={0894-0347}, review={\MR {3402697}}, doi={10.1090/jams829}, }
Reference [Muk20]
Anubhav Mukherjee, A note on embeddings of 3-manifolds in symplectic 4-manifolds, 2020. Preprint, arXiv:2010.03681.,
Show rawAMSref \bib{Mukherjee}{misc}{ author={Mukherjee, Anubhav}, title={A note on embeddings of 3-manifolds in symplectic 4-manifolds}, date={2020}, note={Preprint, \arXiv {2010.03681}}, }
Reference [Mye83]
Robert Myers, Homology cobordisms, link concordances, and hyperbolic -manifolds, Trans. Amer. Math. Soc. 278 (1983), no. 1, 271–288, DOI 10.2307/1999315. MR697074,
Show rawAMSref \bib{myers}{article}{ author={Myers, Robert}, title={Homology cobordisms, link concordances, and hyperbolic $3$-manifolds}, journal={Trans. Amer. Math. Soc.}, volume={278}, date={1983}, number={1}, pages={271--288}, issn={0002-9947}, review={\MR {697074}}, doi={10.2307/1999315}, }
Reference [Ném05]
András Némethi, On the Ozsváth-Szabó invariant of negative definite plumbed 3-manifolds, Geom. Topol. 9 (2005), 991–1042, DOI 10.2140/gt.2005.9.991. MR2140997,
Show rawAMSref \bib{NemethiAR}{article}{ author={N\'{e}methi, Andr\'{a}s}, title={On the Ozsv\'{a}th-Szab\'{o} invariant of negative definite plumbed 3-manifolds}, journal={Geom. Topol.}, volume={9}, date={2005}, pages={991--1042}, issn={1465-3060}, review={\MR {2140997}}, doi={10.2140/gt.2005.9.991}, }
Reference [NST19]
Yuta Nozaki, Kouki Sato, and Masaki Taniguchi, Filtered instanton Floer homology and the homology cobordism group, 2019. Preprint, arXiv:1905.04001.,
Show rawAMSref \bib{NST}{misc}{ author={Nozaki, Yuta}, author={Sato, Kouki}, author={Taniguchi, Masaki}, title={Filtered instanton {F}loer homology and the homology cobordism group}, date={2019}, note={Preprint, \arXiv {1905.04001}}, }
Reference [OS04]
Peter Ozsváth and Zoltán Szabó, Holomorphic disks and knot invariants, Adv. Math. 186 (2004), no. 1, 58–116, DOI 10.1016/j.aim.2003.05.001. MR2065507,
Show rawAMSref \bib{OSKnots}{article}{ author={Ozsv\'{a}th, Peter}, author={Szab\'{o}, Zolt\'{a}n}, title={Holomorphic disks and knot invariants}, journal={Adv. Math.}, volume={186}, date={2004}, number={1}, pages={58--116}, issn={0001-8708}, review={\MR {2065507}}, doi={10.1016/j.aim.2003.05.001}, }
Reference [OS05]
Peter Ozsváth and Zoltán Szabó, On knot Floer homology and lens space surgeries, Topology 44 (2005), no. 6, 1281–1300, DOI 10.1016/j.top.2005.05.001. MR2168576,
Show rawAMSref \bib{OSlens}{article}{ author={Ozsv\'{a}th, Peter}, author={Szab\'{o}, Zolt\'{a}n}, title={On knot Floer homology and lens space surgeries}, journal={Topology}, volume={44}, date={2005}, number={6}, pages={1281--1300}, issn={0040-9383}, review={\MR {2168576}}, doi={10.1016/j.top.2005.05.001}, }
Reference [Ras03]
Jacob Andrew Rasmussen, Floer homology and knot complements, ProQuest LLC, Ann Arbor, MI, 2003. Thesis (Ph.D.)–Harvard University. MR2704683,
Show rawAMSref \bib{RasmussenKnots}{book}{ author={Rasmussen, Jacob Andrew}, title={Floer homology and knot complements}, note={Thesis (Ph.D.)--Harvard University}, publisher={ProQuest LLC, Ann Arbor, MI}, date={2003}, pages={126}, isbn={978-0496-39374-9}, review={\MR {2704683}}, }
Reference [Sar11]
Sucharit Sarkar, Maslov index formulas for Whitney -gons, J. Symplectic Geom. 9 (2011), no. 2, 251–270. MR2811652,
Show rawAMSref \bib{SarkarMaslov}{article}{ author={Sarkar, Sucharit}, title={Maslov index formulas for Whitney $n$-gons}, journal={J. Symplectic Geom.}, volume={9}, date={2011}, number={2}, pages={251--270}, issn={1527-5256}, review={\MR {2811652}}, }
Reference [Sto17]
Matthew Stoffregen, Manolescu invariants of connected sums, Proc. Lond. Math. Soc. (3) 115 (2017), no. 5, 1072–1117, DOI 10.1112/plms.12060. MR3733559,
Show rawAMSref \bib{stoffregen-sums}{article}{ author={Stoffregen, Matthew}, title={Manolescu invariants of connected sums}, journal={Proc. Lond. Math. Soc. (3)}, volume={115}, date={2017}, number={5}, pages={1072--1117}, issn={0024-6115}, review={\MR {3733559}}, doi={10.1112/plms.12060}, }
Reference [Zem17]
Ian Zemke, Quasistabilization and basepoint moving maps in link Floer homology, Algebr. Geom. Topol. 17 (2017), no. 6, 3461–3518, DOI 10.2140/agt.2017.17.3461. MR3709653,
Show rawAMSref \bib{ZemQuasi}{article}{ author={Zemke, Ian}, title={Quasistabilization and basepoint moving maps in link Floer homology}, journal={Algebr. Geom. Topol.}, volume={17}, date={2017}, number={6}, pages={3461--3518}, issn={1472-2747}, review={\MR {3709653}}, doi={10.2140/agt.2017.17.3461}, }
Reference [Zem19a]
Ian Zemke, Connected sums and involutive knot Floer homology, Proc. Lond. Math. Soc. (3) 119 (2019), no. 1, 214–265, DOI 10.1112/plms.12227. MR3957835,
Show rawAMSref \bib{ZemConnectedSums}{article}{ author={Zemke, Ian}, title={Connected sums and involutive knot Floer homology}, journal={Proc. Lond. Math. Soc. (3)}, volume={119}, date={2019}, number={1}, pages={214--265}, issn={0024-6115}, review={\MR {3957835}}, doi={10.1112/plms.12227}, }
Reference [Zem19b]
Ian Zemke, Link cobordisms and absolute gradings on link Floer homology, Quantum Topol. 10 (2019), no. 2, 207–323, DOI 10.4171/QT/124. MR3950650,
Show rawAMSref \bib{ZemAbsoluteGradings}{article}{ author={Zemke, Ian}, title={Link cobordisms and absolute gradings on link Floer homology}, journal={Quantum Topol.}, volume={10}, date={2019}, number={2}, pages={207--323}, issn={1663-487X}, review={\MR {3950650}}, doi={10.4171/QT/124}, }
Reference [Zem19c]
Ian Zemke, Link cobordisms and functoriality in link Floer homology, J. Topol. 12 (2019), no. 1, 94–220, DOI 10.1112/topo.12085. MR3905679,
Show rawAMSref \bib{ZemCFLTQFT}{article}{ author={Zemke, Ian}, title={Link cobordisms and functoriality in link Floer homology}, journal={J. Topol.}, volume={12}, date={2019}, number={1}, pages={94--220}, issn={1753-8416}, review={\MR {3905679}}, doi={10.1112/topo.12085}, }

Article Information

MSC 2020
Primary: 57K18 (Homology theories in knot theory (Khovanov, Heegaard-Floer, etc.)), 57K31 (Invariants of 3-manifolds (also skein modules; character varieties)), 57R58 (Floer homology)
Author Information
Kristen Hendricks
Department of Mathematics, Rutgers University, New Brunswick, New Jersey, 08854
kristen.hendricks@rutgers.edu
MathSciNet
Jennifer Hom
School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia, 30332
hom@math.gatech.edu
ORCID
MathSciNet
Matthew Stoffregen
Department of Mathematics, Michigan State University, East Lansing, Michigan, 48824
stoffre1@msu.edu
MathSciNet
Ian Zemke
Department of Mathematics, Princeton University, Princeton, New Jersey, 08544
izemke@math.princeton.edu
MathSciNet
Additional Notes

The first author was partially supported by NSF grant DMS-2019396 and a Sloan Research Fellowship. The second author was partially supported by NSF grant DMS-1552285. The third author was partially supported by NSF grant DMS-1952762. The fourth author was partially supported by NSF grant DMS-1703685.

Journal Information
Transactions of the American Mathematical Society, Series B, Volume 9, Issue 25, ISSN 2330-0000, published by the American Mathematical Society, Providence, Rhode Island.
Publication History
This article was received on , revised on , and published on .
Copyright Information
Copyright 2022 by the authors under Creative Commons Attribution-NonCommercial 3.0 License (CC BY NC 3.0)
Article References
  • Permalink
  • Permalink (PDF)
  • DOI 10.1090/btran/110
  • MathSciNet Review: 4480068
  • Show rawAMSref \bib{4480068}{article}{ author={Hendricks, Kristen}, author={Hom, Jennifer}, author={Stoffregen, Matthew}, author={Zemke, Ian}, title={On the quotient of the homology cobordism group by Seifert spaces}, journal={Trans. Amer. Math. Soc. Ser. B}, volume={9}, number={25}, date={2022}, pages={757-781}, issn={2330-0000}, review={4480068}, doi={10.1090/btran/110}, }

Settings

Change font size
Resize article panel
Enable equation enrichment

Note. To explore an equation, focus it (e.g., by clicking on it) and use the arrow keys to navigate its structure. Screenreader users should be advised that enabling speech synthesis will lead to duplicate aural rendering.

For more information please visit the AMS MathViewer documentation.