First, some considerations about the exterior algebra
are needed. It is easy to see and well known
that this graded -algebra is a
comodule algebra for the bialgebra , i.e. it is an -comodule such that multiplication is a
morphism of comodules. In fact, the homogenous summands
of
are comodules for the coalgebras . Since
is an epimorphic image of the exterior
algebra is a comodule algebra for the latter one, as well.
As usual we write for the residue class of in and denote arbitrary multiplications by , too. For a subset ordered by the given order on (called an ordered subset in the sequel) we use the abbreviation . The elements give a basis of if ranges over all subsets of . A basis for is obtained when ranges over all subsets of cardinality , the collection of which will be denoted by . The comodule structure of can be described in a simple way using bideterminants for the partition . These are just the usual -minor determinants. Denoting the structure map by (we will use the same symbol in the case later on) we explicitly have
where and are the multi-indices corresponding to the ordered subsets and , respectively. Define and for a subset of cardinality . Again, we write for the collection of all such subsets . Note that the are in the center of the exterior algebra and in particular commute with each other. Thus is defined independent of the order of the elements of . Set
and let be the ideal in generated by the elements . One crucial point in the proof of proposition 7.3 is to show that the elements are invariant under the bialgebra . But first, let us establish a prototype straightening algorithm inside the graded algebra with respect to the set . We call an ordered subset symplectic if the corresponding multi-index is -symplectic standard.
PROOF: We follow [Do3]. Clearly, we may reduce to the case since and the canonical isomorphism therein respects the basis elements and the ideal . If then in we calculate as in [Do3], 2.2.
In the case
this implies .
Set
and .
It follows from (18) that the equation
The proof can be finished now in a similar way to the proof of the
Symplectic Carter-Lusztig Lemma in [Do3]:
Since is not symplectic there is a number
such that
contains an element satisfying
if or if . We assume to be
as small as possible with this property.
Let
be the unique numbers with
and
. By minimality of we have . On the other hand,
implies .
This gives
, that is and .
Now let be the ordered subset of the first entries of and be the set of all such that both and are contained in . Setting and we obtain since the elements are in the center of . Therefore, by equation (19) it remains to show that for all subsets which do not intersect we have where is the multi-index corresponding to the ordered set . Since if or contains an element of we further may assume . Now, suppose . Let be the set of all such that or lies in . Since the intersection of and is empty, as well. This gives a contradiction
for and are disjoint subsets of by assumption on
. Thus, the largest element of
must be greater than , whereas all
elements of are smaller or equal to . If
and
it follows that and
for . By definition of our order on
this
means
completing the proof.
As mentioned before, the crucial point in the proof of proposition 7.3 is contained in the following
PROOF: In the case this easily follows from (15) using the relations given by the set defined in (14). If we could divide by , we would be able to finish the proof right now using and the fact that multiplication is a morphism of -comodules. But, as this is not possible in general (note, that we don't know if is a free -module, yet) we have to proceed in another way. We set and
where is the multi-index corresponding to the ordered
subset
of . If is the
multi-index corresponding to the ordered subset
we also
write
. By (17)
we have
If is a multi-index and we set . Since the result is clear in the case we know
Therefore, the element
is zero
or depending on . Let us investigate this in more
detail. If
denotes the involution defined by
for
and the
centralizer of in , then clearly
if and only if
for all . The group
is isomorphic to the Weyl group of type . It is
a semi-direct product of the normal subgroup consisting of all
which permute neighboured pairs together
with , the
subgroup generated by the transpositions for
.
is isomorphic to , whereas the group can be
identified with
. Choose a set of left coset
representatives for in the element representing
itself being
.
Now, if corresponds to an ordered set for some
the inequality
holds for a permutation
if and only if
. Thus, for we have
if
and
. If there is no such that one
clearly has
for all .
Therefore, the proof is finished
as soon as we have shown
On the other hand, using Laplace Duality (see for example [Mr] 2.5.1) we calculate
Therein, note that is precisely the column stabilizer of the basic tableaux , whereas the column stabilizer of is all of (here ). Also, note that is a set of left coset representatives of and that all permutations of are even. Furthermore, in the right-hand-side equation we have used the commutativity between the -determinant factors of . Now, the proof of (20) can be reduced to the verification of
To this claim we associate to a multi-index its contents which is defined by . It is a composition of into parts, that is an -tuple of non negative integers summing up to . These compositions count the set of -orbits in . Denoting the set of all such compositions by we can write down the right-hand term in (22) as a sum of subsums each of which is given by
Now, the subsum (for ) is just the left-hand-side in (22). Therefore, it remains to show that all other subsums are zero. To this claim we denote the cardinality of the standard Young subgroup of corresponding to the composition by . If is the unique multi-index with contents and (the initial index corresponding to ) then is just the stabilizer of in . Identifying with it is the stabilizer of in . Applying (21) again we obtain
Now,
must be zero since
implies that contains at least one
number twice. We obtain
and because
this equation is already valid in the free -module
we conclude
for all
completing the proof.
Let us prove proposition 7.3 in the case first. Take . Using the classical straighening algorithm 7.2 we may assume (observe that implies ). This means, that is a multi-index corresponding to a non symplectic ordered set in the sense of lemma . Application of the latter one yields
According to proposition 8.2 must be contained in where denotes the ideal in generated by . Applying (17) we obtain the following equation in :
Since
is a basis of
each
individual summand in the summation over must be zero.
This gives the desired result in the case of multi-indices
corresponding to ordered subsets
, that is
. The general case for can be
deduced from this, easily (see [Oe], 3.11.4).
Now, lets turn to the general case of . Again, we may assume by the classical straightening algorithm. Let be the dual partition (). We spilt into multi-indices where for each the entries of are taken from the -th column of . The same thing can be done with . Since is not -symplectic standard but standard there must be a column such that is not -symplectic standard. Applying the result to the known case of we obtain
Therein, satisfies , is constructed from replacing the entries of by that of and is the same as for the corresponding . One easily checks and the proof of 7.3 is completed.