For the rest of this section, we will use the technique of inductive resolution to prove Tor of certain modules vanishes for positive degrees.
4.1. Inductive Resolution for Rook-Brauer Algebras
Definition 7. Suppose that X is a subset of the set . Define to be the left-ideal in that is the R-span of all diagrams in which, among the nodes on the right labeled by elements of X, there is at least one singleton or a right-to-right connection. For , let be denoted by .
Notice that is spanned by all non-permutation diagrams of so . We will use inductive resolution to establish the following theorem, which will play a key role in proving the analogues of Shapiro’s Lemma.
Theorem 4. Let and suppose is invertible and , then the groups vanish in positive degrees.
The proof of this result will occupy the rest of this section and we follow a similar outline as
Section 4 of [
1] with some modifications. Below, we prove a short lemma that is necessary for Theorem 2.
Lemma 1. Let J be a left ideal of that is included in . Then
for all .
Proof. Since , elements of J acts as zero on and this gives □
We will prove Theorem 2 by induction on the cardinality of and to do that, we will resolve in term of these special modules introduced below.
Definition 8. Let , and let , define three left -submodules of as follows:
is the span of all diagrams in which x is a singleton.
is the span of all diagrams in which x is connected to some element of X.
is the span of all diagrams in which nodes a and b are connected.
We also define the quotients:
We prove some results about these special modules.
Lemma 2. Let be invertible. The modules , , and behave as follows under tensor product with .
Let . Then and is a direct summand of .
Let with . Then .
Let , then . Furthermore, is a direct summand of .
Proof. Since are quotients of and respectively, we show that these modules vanish when tensoring with .
To show , let be a diagram in which means node x is a singleton. This means also has another singleton on the left or right side, say . If is on the left, then and if is on the right, then where in both cases, is the diagram obtained from by connecting x and together while leaving all other connections unchanged. Then, in both cases,
because
and
in the second case are both non-permutation diagrams and hence, acts as 0 on
.
For the second part, we prove that is a direct summand of . Since right-multiplying by takes to itself, this induces the map . This map is surjective because for any diagram , we have ; it also splits because is idempotent with splitting map induced by the inclusion .
To show , let be a diagram, then the node x is connected to some node y of X. Since each node is connected to at most one other node in any Rook-Brauer diagram, this implies that there is either a left-to-left connection or a pair of isolated nodes on the left.
Case 1: If there is a left-to-left connection from to , choose to be the diagram obtained from by removing the connection from x to y. Notice that .
Case 2: If there is a pair of isolated nodes on the left, choose to be the diagram obtained from by removing the connection from x to y, then either connect with x or with y but not both. Notice that .
In both case, is a non-permutation diagram which gives .
Finally, we conclude that by applying the second part above. To see that is a direct summand of , note that right-multiplication by takes into itself so this induces the map
we will show that this map is surjective and splits. To see that the map is surjective, pick any diagram
, we then have
which shows that the map is surjective.
This map also splits because is idempotent with the splitting map induced by the inclusion . □
One can readily verify that decomposes as a direct sum of ’s as follows.
Lemma 3. For any , there exists a left -modules isomorphism .
Proof. The isomorphism is given by where, on each summand, is the map induced by the inclusions
To see that is surjective, observe that for any diagram , the node x must be connected to some node . This means lies in the image of the direct summand indexed by , which shows that is indeed surjective.
Note that images of diagrams from different direct summand are distinct because for , diagrams in has node x connected with while diagrams in has node x connected with . Hence, to show that is injective, we can show for each direct summand, is injective. Pick a diagram in the kernel of this map i.e in . This implies lies in which means, two nodes of labeled by elements of must be connected or a node labeled by is isolated.
Since lies in , is not isolated and is connected with x. Hence, must have a right-to-right connection between two nodes labeled by or an isolated node among nodes labeled by . But this implies so this map is injective, hence is also injective. □
We now resolve
in terms of
and
. The proof of the following proposition is almost identical, with small modifications, to the proof of Proposition 4.6 presented in [
1].
Proposition 2.
Let , let , and assume . The following sequence, in which all maps are induced by either an inclusion or an identity map, is a resolution of .
Moreover, applying to the sequence gives a resolution of .
Proof. Since all maps are induced by either inclusion or identity, all maps are well-defined because
,
and
. The surjectivity of the map
is clear so the complex is exact at degree
. To see the complex is exact at degree 0, we observe that the kernel of the map
is spanned by diagrams in
that lies in
. For a diagram
to be in
, there must be a right-to-right connection or an isolated node among nodes labeled by
X. For it to
also not be in
, among nodes labeled by
X, it must have exactly one right-to-right connection between
x and another node in
X or
x must be the only isolated node. If
has a right-to-right connection between
x and another node in
X, then
is in the image of the inclusion
. If
x is an isolated node in
, then
is in the image of the inclusion
. Hence, the complex is exact at degree 0. To show exactness at degree 1 i.e the map
is injective, note that if
and
such that
, then
because
and
have no basis elements in common. Hence, the complex is exact at degree 1 and it is a resolution of
. To prove the second claim, after applying
and by Lemmas 2 and 1, the resolution becomes
and the claim now follows. □
We use this proposition to prove the vanishing of Tor’s group of
, Theorem 4. The proof below follows a similar outline with some modifications to that of the analogous statement for Partition algebras. (see section 4.4 of [
1]).
Proof of Theorem 4 For the case when
, we have
and the result follows immediately. For the case when
, we either have
or
. If
, then
so that
and the result follows. If
, then
is spanned by
which implies
and we have a SES
Since is invertible, and are direct summand of and the result now follows. Assume that and . We prove the theorem by using strong induction on cardinality of X. From above, the result is clear when . Assume and the result holds for any subset of smaller cardinality. By Proposition 2 and Theorem 3, it suffices to show that the three modules and all vanish under for . But this is immediate since for because of the induction hypothesis and for because is a direct summand of by Lemma 2, which vanishes under so does as well. By Lemma 3, is a direct summand of ’s for and Lemma 2 implies is also a direct summand of which vanishes under because of the induction hypothesis. This, in turn, implies also vanishes under and so does . □
4.2. Inductive Resolution for Motzkin Algebras
This subsection is similar to the subsection 4.1 above and we will prove the analogue of Theorem 4 for the Motzkin algebras.
By replacing with in Definition 7 and 8, we obtain similar left -submodules of , namely , , and the corresponding quotients , . We also introduce a new left -submodule tailored specifically to the structure of Motzkin algebras.
Notational Remark: For with , define .
Definition 9. Let with , if P is a partition of into subsets of size at most 2, define to be the right-link state of a Motzkin n-diagram in which all right-to-right connections and isolated nodes are in one-to-one correspondence to pairs and singletons, respectively, in P (labeled by pairs and singletons in P) while all other nodes have defects.
If any of the above connections violate planarity, there is no right link state for that particular P.
For example, if and , then is given below.
Figure 5.
when and .
Figure 5.
when and .
Definition 10. Given a right-link state , define a left -submodule spanned by diagrams having right-link state obtained from by a (possibly empty) sequence of splices and deletion (see Def 6). If no right-link state exists for P, define to be the zero module.
Definition 11.
Given with , let P be a partition of as above with and the corresponding right-link state , define the quotient
We prove the analogue of Lemma 2 for .
Lemma 4. Let and P be a partition of if or if as above with , then . Furthermore, is a direct summand of where with .
Proof. To show , we show . For a diagram , define to be the diagram obtained from by preserving all right-to-right connections of and for the other nodes, make all horizontal left-to-right connections without violating planarity.
Note that where k is a nonnegative integer that depends on the number of right-to-right connections and isolated nodes on the right of . Since any diagram in has a right-to-right connection from node x to node y, it is a non-permutation diagram. Hence,
so
as needed.
To prove the second claim, WLOG, assume and let . Note that .
To see that is a direct summand of , observe that if and i.e a right-to-right connection between two nodes labeled by , then
because no sequence of splices/deletions can remove a right-to-right connection. Similarly, if
and
i.e an isolated node labeled by
, then
because of reason similar to above. Hence, in both cases,
and is trivially a direct summand of
.
For the last case, assume there is no such that i.e no right-to-right connections or isolated nodes labeled by inside the connection x to y.
Let be a diagram obtained from the right-link state by making all defects into left-to-right horizontal connections. For ex, if and , then
Note that where is a fixed nonnegative integer. Assume first that is nonempty, then any diagram in has a right-to-right connection or isolated node labeled by i.e these connections or isolated nodes are outside the connection . This implies right-multiplying by takes into and this induces the map
Since there is no such that , any diagram in has to have a right-to-right connection or isolate node labeled by and hence, we have an inclusion . Along with the inclusion , these induce the map
The map induced by right-multiplying by is surjective because for any diagram , . Since , this maps also splits with the splitting map
as above. Therefore,
is a direct summand of
.
If , then and we also have because of the assumption that no right-to-right connections or isolated nodes labeled by inside the connection x to y so . The same map as above implies that is a direct summand of . □
Similar result holds for and .
Lemma 5. Let be invertible.
Let . Then and is a direct summand of .
Let with . Then .
Proof. To show that , it suffices to show that . This follows because for any diagram . The proof that is a direct summand of mirrors that of Lemma 2 with replaced by . It suffices to show . Any diagram in has x connected to some element which implies for some partition P containing . The result then follows because by the proof of Lemma 4. □
Analogue of Lemma 1 also holds with identical proof where is replaced by .
Lemma 6. Let J be a left ideal of that is included in . Then
for all .
We also have a similar resolution of in terms of and .
Proposition 3.
Let , let , and assume . The following sequence, in which all maps are induced by either an inclusion or an identity map, is a resolution of .
Moreover, applying to the sequence gives a resolution of .
The proof of this proposition is identical to that of Lemma 2 with replaced by , Lemmas 5 and 6 in place of Lemmas 2 and 1, respectively.
Lemma 7. Let with , then the map
induced by inclusion maps is an isomorphism of left -modules where the outermost direct sum runs over all ; with y fixed, the inner sum runs over all partitions P of (or if ) into subsets of size at most 2 such that .
Proof. Since , is sent into . Since , diagrams in have node y connected to node x so these diagrams are also in and is sent into . The map above is well-defined following from these facts.
To see that the map is surjective, any diagram in has a right-to-right connection from node x to another node . Inside this connection, there might be more right-to-right connections which, taken all together, can be identified with a partition P of (or ) into subsets of size at most 2 such that . Hence, the diagram is in the image of the direct summand with the specified y and P above so the map is surjective.
To see that the map in injective, note that two diagrams from different direct summands ’s have to be distinct in . This is because for different y’s, node x of the two diagrams is connected to two different nodes so the diagram can’t be the same. When y’s are the same, different partitions P’s of (or ) yields different right-to-right connections inside the right-to-right connection of node x and y and hence, two diagram also can’t be the same as well.
Therefore, to show that the map is injective, it suffices to show that for each direct summand , the map is injective. This is clear because in order for a diagram in to be zero in , there must be at least a right-to-right connection or an isolated node among nodes of labeled by . Since has node x connected to node y, this implies that the right-to-right connection or isolated node must occur among nodes of labeled by . But this implies in . □
We are now fully equipped to establish the analogue of Theorem 4 in the context of Motzkin algebras.
Theorem 5. For invertible and any , let , then the groups vanish in positive degrees.
Proof. The proof of this is almost identical to that of Theorem 4 with the following changes:
Replace all by .
Replace Proposition 2 by Proposition 3.
is a direct summand of by Lemma 5.
By Lemma 7, is a direct sum of ’s and by Lemma 4, is a direct summand of where with .
□