Hilbert functions of points on Schubert varieties in Orthogonal Grassmannians
K. N. Raghavan, Shyamashree Upadhyay

TL;DR
This paper develops a combinatorial method using standard monomial theory to compute Hilbert functions at points on Schubert varieties in orthogonal Grassmannians, extending previous work on related varieties.
Contribution
It introduces a new combinatorial approach to determine Hilbert functions for Schubert varieties in orthogonal Grassmannians, generalizing earlier methods used for other types of Grassmannians.
Findings
Provides a combinatorial formula for Hilbert functions
Interprets multiplicity as non-intersecting lattice paths
Connects geometric and combinatorial perspectives
Abstract
A solution is given to the following problem: how to compute the multiplicity, or more generally the Hilbert function, at a point on a Schubert variety in an orthogonal Grassmannian. Standard monomial theory is applied to translate the problem from geometry to combinatorics. The solution of the resulting combinatorial problem forms the bulk of the paper. This approach has been followed earlier to solve the same problem for the Grassmannian and the symplectic Grassmannian. As an application, we present an interpretation of the multiplicity as the number of non-intersecting lattice paths of a certain kind. Taking the Schubert variety to be of a special kind and the point to be the "identity coset," our problem specializes to a problem about Pfaffian ideals treatments of which by different methods exist in the literature. Also available in the literature is a geometric solution when…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Advanced Algebra and Geometry
Hilbert functions of points on
Schubert varieties in Orthogonal Grassmannians00footnotetext: Mathematics Subject Classification 2000: 05E15 (Primary), 13F50, 13P10, 14L35 (Secondary)
K. N. Raghavan
Institute of Mathematical Sciences
C. I. T. Campus, Taramani
Chennai 600 113, INDIA
email: [email protected]
Shyamashree Upadhyay
Chennai Mathematical Institute
Plot No. H1, SIPCOT IT Park
Padur Post, Siruseri 603 103, Tamilnadu, INDIA
email: [email protected]
(04 April 2007)
Abstract
A solution is given to the following problem: how to compute the multiplicity, or more generally the Hilbert function, at a point on a Schubert variety in an orthogonal Grassmannian. Standard monomial theory is applied to translate the problem from geometry to combinatorics. The solution of the resulting combinatorial problem forms the bulk of the paper. This approach has been followed earlier to solve the same problem for the Grassmannian and the symplectic Grassmannian.
As an application, we present an interpretation of the multiplicity as the number of non-intersecting lattice paths of a certain kind.
Taking the Schubert variety to be of a special kind and the point to be the “identity coset,” our problem specializes to a problem about Pfaffian ideals treatments of which by different methods exist in the literature. Also available in the literature is a geometric solution when the point is a “generic singularity.”
Contents
Introduction
In this paper the following problem is solved: given a Schubert variety in an orthogonal Grassmannian (by which is meant the variety of isotropic subspaces of maximum possible dimension of a finite dimensional vector space with a symmetric non-degenerate form—see §1 for precise definitions) and an arbitrary point on the Schubert variety, how to compute the multiplicity, or more generally the Hilbert function, of the local ring of germs of functions at that point. In a sense, our solution is but a translation of the problem: we do not give closed form formulas but alternative combinatorial descriptions. The meaning of “alternative” will presently become clear.
The same problem for the Grassmannian was treated in [11, 8, 7, 9, 12] and for the symplectic Grassmannian in [4]. The present paper is a sequel to [11, 7, 9, 12, 4] and toes the same line as them. In particular, its strategy is borrowed from them and runs as follows: first translate the problem from geometry to combinatorics, or, more precisely, apply standard monomial theory to obtain an initial combinatorial description of the Hilbert function (the earliest version of the theory capable of handling Schubert varieties in an orthogonal Grassmannian is to be found in [17]); then transform the initial combinatorial description to obtain the desired alternative description. But that is easier said than done.
While the problem makes sense for Schubert varieties of any kind and standard monomial theory itself is available in great generality [13, 15], the translation of the problem from geometry to combinatorics has been made—in [14]—only for “minuscule111Symplectic Grassmannians are not minuscule but can be treated as if they were. generalized Grassmannians.” Orthogonal Grassmannians being minuscule, this translation is available to us and we have an initial combinatorial description of the Hilbert function. As to the passage from the initial to the alternative description—and this is where the content of the present paper lies—neither the end nor the means is clear at the outset.
The first problem then is to find a good alternative description. But how to measure the worth of an alternative description? The interpretation of multiplicity as the number of certain non-intersecting lattice paths (deduced in §11 from our alternative description) seems to testify to the correctness of our alternative description, but we are not sure if there are others that are equally or more correct.
The proof of the equivalence of the initial and alternative combinatorial descriptions is, unfortunately, a little technically involved. It builds on the details of the proofs of the corresponding equivalences in the cases of the Grassmannian and the symplectic Grassmannian. In [10] it is shown that the equivalence in the case of the Grassmannian is a kind of KRS correspondence, called “bounded KRS.” The proof there is short and elegant and it would be nice to realise the main result of the present paper too in a similar spirit as a kind of KRS correspondence.
The initial description is in terms of “standard monomials” and the alternative description in terms of “monomials in roots.” The equivalence of the two descriptions thus gives a bijective correspondence between standard monomials and monomials in roots. Roughly—but not actually—the correspondence maps each standard monomial to its initial term (with respect to a certain monomial order). Thus it is natural to wonder whether we can compute the initial ideal of the ideal of the tangent cone to the Schubert variety at the given point.
We believe that this can be done but that it is far more involved and difficult than the corresponding computation for Grassmannians and symplectic Grassmannians (the natural set of generators of the ideal of the tangent cone do not form a Gröbner basis unlike in those cases). If all goes well, the computation will soon appear [16].
Taking the Schubert variety to be of a special kind and the point to be the “identity coset,” our problem specializes to a problem about Pfaffian ideals considered in [5, 2]. On the other side of the spectrum from the identity coset, so to speak, lie the “generic singularities,” points that are generic in the complement of the open orbit of the stabiliser of the Schubert variety. For these, a geometric solution to the problem appears in [1].
Given that our solution of the problem is but a translation, it makes sense to ask if one can extract more tangible information—closed form formulas for example—from our alternative description. See the papers quoted in the previous paragraph and also [3] for some answers in the special cases they consider.
Organization of the paper
The table of contents indicates how the paper is organized.
There is a brief description at the beginning of every subdivision of the contents therein. An index of definitions and notation is included, for it would otherwise be difficult to find the meanings of certain words and symbols.
Important note added
The recent article [6] treats some of the questions addressed here and some that could be addressed by using the main result proved here. It includes:
- •
an interpretation of the multiplicity similar to ours.
- •
a closed formula for the multiplicity (as a specialization of a factorial Schur function), thereby answering the question we raised above.
- •
a formula for the restriction to the torus fixed point of the equivariant cohomology class of a Schubert variety.
The approach in [6] is quite different from ours. In fact, it is the opposite of ours in that it circumvents the lack of results about initial ideals of tangent cones, while our prime motivation is to remedy the lack. The starting points in the two approaches are also different: [6] takes off from certain results of Kostant-Kumar and Arabia on equivariant cohomology, while our launchpad is standard monomial theory.
The appearance of [6] notwithstanding, our approach is worthwhile, for, quite apart from the difference in starting points, there is no way, as far as we can tell, to the Hilbert function via the approach of [6], nor to the initial ideal, both of which are interesting in their own right.
Part I The theorem
Definitions are recalled, the problem formulated, and the theorem stated.
1 The set up
In this section, we state the problem to be addressed after recalling the necessary basic definitions, make some choices that are convenient for studying the problem, and see why it is enough to focus on a particular case of the problem.
1.1 The statement of the problem
Fix an algebraically closed field of characteristic not equal to . Fix a vector space of finite dimension over this field and a non-degenerate symmetric bilinear form on . Let be the integer such that either or . A linear subspace of is said to be isotropic if the form vanishes identically on it. It is elementary to see that an isotropic subspace of has dimension at most and that every isotropic subspace is contained in one of dimension . Denote by the closed sub-variety of the Grassmannian of -dimensional subspaces consisting of the points corresponding to isotropic subspaces.
The orthogonal group of linear automorphisms of preserving acts transitively on , for by Witt’s theorem an isometry between subspaces can be lifted to one of the whole vector space. If is odd the special orthogonal group (consisting of form preserving linear automorphisms with trivial determinant) itself acts transitively on . If is even the special orthogonal group does not act transitively on , and has two connected components. We define the orthogonal Grassmannian to be if is odd and to be one of the two components of if is even.
The Schubert varieties of are defined to be the -orbit closures in (with canonical reduced scheme structure), where is a Borel subgroup of . The choice of is immaterial, for any two of them are conjugate. The question that is tackled in this paper is this: given a point on a Schubert variety in , how to compute the multiplicity (and more generally, the Hilbert function) of the Schubert variety at the given point? The answers are contained in Theorem 2.3.1 and Corollary 2.3.2. But in order to make sense of those statements, we need some preparation.
1.2 Some convenient choices
We now make some choices that are convenient for the study of Schubert varieties. For an integer such that , set . Fix a basis of such that
[TABLE]
The advantage of this choice is: the elements of for which each is an eigenvector form a maximal torus, and the elements that are upper triangular with respect to this basis form a Borel subgroup (a linear transformation is upper triangular if for each , , the image of under the transformation is a linear combination of ). We denote this maximal torus and this Borel subgroup by and respectively. Our Schubert varieties will be orbit closures of this particular Borel subgroup .
The -orbits of are naturally indexed by its -fixed points: each orbit contains one and only one such point. The -fixed points are evidently of the form , where and for each , , there does not exist , , such that —in other words, for each , , such that , exactly one of and appears in ; in addition, if is odd, then does not appear in . Denote the set of such -element subsets by . We thus have a bijective correspondence between and the -orbits of . Each -orbit being irreducible and open in its closure, it follows that -orbit closures are indexed by the -orbits. Thus is an indexing set for -orbit closures in .
Suppose that is even—it will be shown presently that it is enough to consider this case. As already observed, has two connected components on each of which acts transitively. The -orbits belong to one or the other component accordingly as the parity of the cardinality of the number of entries bigger than in the corresponding element of . We take to be the component in which these cardinalities are even. We let denote the subset of consisting of elements for which this cardinality is even. Schubert varieties in are thus indexed by elements of .
1.3 Reduction to the case even
We now argue that it is enough to consider the case even. Suppose that is odd. Let and be a vector space of dimension with a non-degenerate symmetric form. Let be a basis of as in 1.2. Put and . Take to be an element of the field such that . We can take to be the subspace of spanned by the vectors , and a basis of to be these vectors in that order.
There is a natural map from to : intersecting with an isotropic subspace of of dimension gives an isotropic subspace of of dimension . This map is onto, for every isotropic subspace of (and hence of ) is contained in an isotropic subspace of of dimension . It is also elementary to see that the map is two-to-one (essentially because in a two-dimensional space with a non-degenerate symmetric form there are two isotropic lines), and that the two points in any fiber lie one in each component (there is clearly an element in that moves one element of the fiber to the other, and so if there was an element of that also moved one point to the other, the isotropy at the point would not be contained in , a contradiction).
We therefore get a natural isomorphism between and . We will now show that the -orbits in correspond under the isomorphism to -orbits of (we denote by and the maximal torus and Borel subgroups of as in §1.2). It will then follow that Schubert varieties in are isomorphic to those in and the purpose of this subsection will be achieved.
The group can be realized as the subgroup of consisting of the elements that fix . The isomorphism above is equivariant for , and we have and . It should now be clear that the preimages in of two elements in the same -orbit of are in the same -orbit: an element of that moves one to the other considered as an element of moves also the preimage of the one to that of the other.
On the other hand, the preimages of distinct -fixed points are distinct -fixed points, the corresponding map from to being given as follows:
[TABLE]
where
[TABLE]
(Note that never occurs as an entry in any element of and that the elements , …, , (respectively , …, , ) are not in increasing order except in the trivial case .) Given that each -orbit has a -fixed point and that distinct -fixed points belong to distinct -orbits, this implies that the preimages of two elements in distinct -orbits belong to distinct -orbits, and the proof is over.
2 The theorem
The purpose of this section is to state the main theorem and its corollary. We first set down some basic notation and two fundamental definitions needed in order to state the theorem.
2.1 Basic notation
We keep the terminology and notations of §1.1, 1.2. As observed in §1.3, it is enough to consider the case even. So from now on let . Recall that, for an integer , , . As observed in §1.2, Schubert varieties in are indexed by .
Since now determines , we will henceforth write instead of . In other words, is the set of -element of subsets of such that
- •
for each , , the subset contains exactly one of , , and
- •
the number of elements in the subset that exceed is even.
We write for the set of all -element subsets of . There is a natural partial order on and so also on : if and only if , …, .
Given , the corresponding -fixed point in (namely, the span of , …, ) is denoted . Given , the corresponding Schubert variety in (which, by definition, is the closure of the -orbit of the -fixed point with canonical reduced scheme structure) is denoted . The point belongs to if and only if in the partial order just defined. Since, under the natural action of on , each point of is in the -orbit of a -fixed point for some such that , it is enough to focus attention on such -fixed points.
For the rest of this section an element of will remain fixed.
We will be dealing extensively with ordered pairs , , such that is not and is an entry of . Let denote the set of all such ordered pairs, and set
diagonalboundaryof \mathfrak{N}$$(r,c)$$(c^{*},c)$$(r,r^{*})legleg
The picture shows a drawing of . We think of and in as row index and column index respectively. The columns are indexed from left to right by the entries of in ascending order, the rows from top to bottom by the entries of in ascending order. The points of are those on the diagonal, the points of are those that are (strictly) above the diagonal, and the points of are those that are to the South-West of the poly-line captioned “boundary of ”—we draw the boundary so that points on the boundary belong to . The reader can readily verify that and for the particular picture drawn. The points of indicated by solid circles form a -chain (see §2.2.1 below).
We will be considering monomials, also called multisets, in some of these sets. A monomial, as usual, is a subset with each member being allowed a multiplicity (taking values in the non-negative integers). The degree of a monomial has also the usual sense: it is the sum of the multiplicities in the monomial over all elements of the set. The intersection of a monomial in a set with a subset of the set has also the natural meaning: it is a monomial in the subset, the multiplicities being those in the original monomial.
We will refer to as the diagonal.
2.2 Two fundamental definitions
2.2.1 Definition of -chain
Given two elements and in , we write if and (note that these are strict inequalities). An ordered sequence , , … of elements of is called a -chain if \alpha>\beta>\ldots\. A -chain has head , tail , and length .
2.2.2 Definition of -domination
To a -chain in there corresponds, as described in §5.3.3, a subset of which, as observed in Proposition 5.3.5, is “distinguished” in the sense of §5.1.1. To a distinguished subset of there corresponds, as described below in §5.1.2, an element of . Following these correspondences through, we get an element of attached to the -chain . Let denote this element—sometimes we write . (All this makes sense even when is empty— will turn out to be itself in that case.)
Furthermore, as will be obvious from its definition, the monomial is “symmetric” in the sense of §5.2.2 and contains evenly many elements of the diagonal . Thus, by Proposition 5.2.1, the element of belongs to .
An element of is said to -dominate if , or, equivalently—and this is important for the proofs—if dominates in the sense of [7] the monomial (for the proof of the equivalence, see [7, Lemma 5.5]). An element of -dominates a monomial of (repsectively of ) if it -dominates every -chain in (respectively in ).
2.3 The main theorem and its corollary
Theorem 2.3.1
Fix a positive integer and elements of . Let be a vector space of dimension with a symmetric non-degenerate bilinear form (over a field of characteristic not ). Let be the Schubert variety corresponding to in the orthogonal Grassmannian , and the torus fixed point of corresponding to . Let denote the associated graded ring with respect to the unique maximal ideal of the local ring of germs at of functions on . Then, for any non-negative integer , the dimension as a vector space of the homogeneous piece of of degree equals the cardinality of the set of monomials of degree of that are -dominated by .
The proof of this theorem occupies us for most of this paper. It is reduced in §3, by an application of standard monomial theory, to combinatorics. The resulting combinatorial problem is solved in §4–10. For now, let us note the following immediate consequence:
Corollary 2.3.2
The multiplicity at the point of the Schubert variety equals the number of monomials in of maximal cardinality that are square-free and -dominated by .
Proof: The proof of Corollary 2.2 of [7] holds verbatim here too.
Part II From geometry to combinatorics
The problem is translated from geometry to combinatorics. The main combinatorial results are formulated.
3 Reduction to combinatorics
In this section we translate the problem from geometry to combinatorics. In §3.1 we recall from [17] the theorem that enables the translation. The translation itself is done in 3.2 and follows [14].
3.1 Homogeneous co-ordinate ring of the Schubert variety
3.1.1 The line bundle on
Let be the Plücker embedding (where denotes the Grassmannian of all -dimensional subspaces of ). The pull-back to of the line bundle on is the square of the ample generator of the Picard group of . Letting denote the ample generator, we observe that it is very ample and want to describe the homogeneous coordinate rings of and its Schubert subvarieties in the embedding defined by .
3.1.2 The section of
For in , let denote the corresponding Plücker coordinate. Consider the affine patch of given by , where . The intersection of this patch with the Grassmannian is an affine space. Indeed the -plane corresponding to an arbitrary point of has a basis consisting of column vectors of a matrix of the form
[TABLE]
where is the identity matrix and an arbitrary matrix both of size . The association is bijective. The restriction of a Plücker coordinate to is given by the determinant of a submatrix of size of , the entries of determining the rows to be chosen from to form the submatrix.
As can be readily verified, a point of represents an isotropic subspace if and only if the corresponding matrix is skew-symmetric with respect to the anti-diagonal: , where the columns and rows of are numbered and respectively. For example, if , then a matrix that is skew-symmetric with respect to the anti-diagonal looks like this:
[TABLE]
Since the set of these matrices is connected and contains the point that is spanned by , it follows that does not intersect the other component of . In other words, vanishes everywhere on .
Now suppose that belongs to . Computing as a function on the affine patch , we see that it is the determinant of a skew-symmetric matrix of even size, and therefore a square. The square root, which is determined up to sign, is called the Pfaffian. This suggests that itself is a square: more precisely that there exists a section of the line bundle on such that . A weight calculation confirms this to be the case. The are also called Pfaffians.
3.1.3 Standard monomial theory for
A standard monomial in is a totally ordered sequence (with repetitions allowed) of elements of . Such a standard monomial is said to be -dominated for if . To a standard monomial in we associate the product , where the are the sections defined above of the line bundle . Such a product is also called a standard monomial and it is said to be dominated by for if the underlying monomial in is dominated by . Standard monomial theory for says:
Theorem 3.1.1
(Seshadri [17])* Standard monomials of degree form a basis for the space of forms of degree in the homogeneous coordinate ring of in the embedding defined by the ample generator of the Picard group. More generally, for , the -dominated standard monomials of degree form a basis for the space of forms of degree in the homogeneous coordinate ring of the Schubert subvariety of .*
3.2 Co-ordinate rings of affine patches and tangent cones of
From Theorem 3.1.1 one can deduce rather easily, as we now show, bases for co-ordinate rings of affine patches of the form and of tangent cones of Schubert varieties. An element of will remain fixed for the rest of this section. To simplify notation we will suppress explicit reference to .
3.2.1 Standard monomial theory for affine patches
Let denote the affine patch of given by . The origin of the affine space is identified as the -fixed point . The functions , , provide a set of coordinate functions on . Monomials in these form a -basis for the polynomial ring of functions on , where denotes the underlying field.
Fix in , so that the point belongs to the Schubert variety , and let be the affine patch of defined thus:
[TABLE]
The coordinate ring of is a quotient of the polynomial ring , and the proposition that follows identifies a subset of the monomials in which forms a -basis for .
We say that a standard monomial in is -compatible if for each , , either or . Given in , we denote by the set of -dominated -compatible standard monomials.
Proposition 3.2.1
As runs over the set of -dominated -compatible standard monomials, the elements form a basis for the coordinate ring of the affine patch of the Schubert variety .
Proof: The proof is similar to the proof of Proposition 3.1 of [7]. First consider a linear dependence relation among the . Replacing by and “homogenizing” by yields a linear dependence relation among the -dominated standard monomials restricted to , and so the original relation must only have been the trivial one, for by Theorem 3.1.1 the are linearly independent on .
To prove that generate as a vector space, we make the following claim: if be any monomial in the Pfaffians , and a standard monomial that occurs with non-zero co-efficient in the expression for (the restriction to of) as a linear combination of -dominated standard monomials, then as multisets of . To prove the claim, consider the maximal torus of as in §1.2. The affine patch is -stable and there is an action of on . The sections are eigenvectors for with corresponding characters , where denotes the character of given by the projection to the diagonal entry on row . The claim now follows since eigenvectors corresponding to different characters are linearly independent.
Let be an arbitrary monomial in the . Fix an integer such that and consider the expression for (the restriction to of) as a linear combination of -dominated standard monomials. We claim that occurs in every standard monomial in this expression (from which it will follow that the are all comparable to ). Suppose that none of equals . For each there is at least one entry of that does not occur in it. The number of occurrences of entries of in is thus at most . But these entries occur at least times in (where is repeated times), a contradiction to the claim proved in the previous paragraph. Hence our claim is proved. Dividing by the expression for as a linear combination of -dominated standard monomials provides an expression for as a linear combination of , as varies over .
3.2.2 Standard monomial theory for tangent cones
The affine patch of the orthogonal Grassmannian is an affine space whose coordinate ring can be taken to be the polynomial ring in variables of the form with , where (as in §2.1)
[TABLE]
Taking and for example, a general element of has a basis consisting of column vectors of a matrix of the following form:
[TABLE]
The expression for in terms of the is a square root of the determinant of the submatrix of a matrix like the one above obtained by choosing the rows given by the entries of . Thus is a homogeneous polynomial of degree the -degree of , where the -degree of is defined as one half of the cardinality of .
Since the ideal of the Schubert variety in the homogeneous coordinate ring of is generated222 This is a consequence of Theorem 3.1.1. It is easy to see that the such that vanish on . Since all standard monomials form a basis for the homogeneous coordinate ring of in , it follows that -dominated standard monomials span the quotient ring by the ideal generated by such . Since such monomials are linearly independent in the homogeneous coordinate ring of , the desired result follows. by the , such that , it follows that the ideal of in is generated by the the , such that . We are interested in the tangent cone to at (or, what is the same, the tangent cone to at the origin), and since is graded, its associated graded ring with respect to the maximal ideal corresponding to the origin is itself.
Proposition 3.2.1 says that the graded piece of of degree is generated as a -vector space by elements of degree of the set of -dominated -compatible standard monomials, where the degree of a standard monomial is defined to be the sum of the -degrees of . To prove Theorem 2.3.1 it therefore suffices to prove the following:
Theorem 3.2.2
The set of standard monomials in of degree that are -dominated and -compatible is in bijection with the set of monomials in of degree that are -dominated by .
4 Further reductions
In the last section, we reduced the proof of our main theorem (Theorem 2.3.1) to that of Theorem 3.2.2. We now reduce the proof of Theorem 3.2.2 to that of Propositions 4.1.1, 4.1.2 and 4.1.3 below. These propositions will eventually be proved in §10.
4.1 The main propositions
Fix once and for all an element of . The bijection stated in Theorem 3.2.2 will be described by means of two maps and whose definitions will be given in §7 and §8 below. We will now state some properties of these maps. In §4.2 we will see how Theorem 3.2.2 follows once these properties are established.
The map associates to a monomial in a pair consisting of an element of and a “smaller” monomial in . This map enjoys the following good properties:
Proposition 4.1.1
. 2. 2.
\textup{v-degree}(w)+\textup{degree}(\mathfrak{S}^{\prime})=\textup{degree}(\mathfrak{S}). 3. 3.
* -dominates .* 4. 4.
* is the least element of that -dominates .*
The map , on the other hand, associates a monomial in to a pair consisting of an element of with and a monomial in that is -dominated by .
Proposition 4.1.2
The maps and are inverses of each other.
For an integer , , consider the following conditions, the first on a monomial in , the second on an element of :
(‡) is not the row index of any element of and is not the column index of any element of .
(‡) is not an entry of .
(It is convenient to the use the same notation (‡) for both conditions.)
Proposition 4.1.3
Assume that satisfies (‡)—all references to (‡) in this proposition are with respect to a fixed , .
Let be an element of with and a monomial in that is -dominated by . If and both satisfy (‡), then so does . 2. 2.
If a monomial in satisfies (‡), then so do the “components” and of its image under .
4.2 From the main propositions to the main theorem
Let us now see how Theorem 3.2.2 follows from the propositions of §4.1. Most of the following argument runs parallel to its counterparts in the case of the Grassmannian and symplectic Grassmannian (Propositions 4.1.1 and 4.1.2 have their counterparts in [7, 4]), but, in the case that is odd, the part involving the “mirror image” requires additional work. This is where Proposition 4.1.3 comes in.
Let , , and , denote respectively the sets of monomials in , , and . Let denote the set of -compatible standard monomials that are “anti-dominated” by : a standard monomial is anti-dominated by if (we can also write since by -compatibility).
Define the domination map from to by sending a monomial in to the least element that -dominates it. Define the domination map from to by sending to . Both these maps take, by definition, the value on the empty monomial.
Notation 4.2.1
In the following, we use subscripts, superscripts, suffixes, and combinations thereof to modify the meanings of , , , , and .
- •
superscript: this will be an element of ; when used on it denotes -domination (more precisely, denotes the subset of consisting of those elements that are -dominated by ); when used on or it denotes domination by .
- •
subscript: denotes anti-domination (applied only to standard monomials).
- •
suffix “”: indicates degree (for example, denotes the set of -compatible standard monomials that are anti-dominated by , dominated by , and of degree ).
Repeated application of gives a map from to that commutes with domination (as just defined) and preserves degree. Repeated application of gives a map from to . These two maps being inverses of each other (Proposition 4.1.2) and so we have a bijection between and . In fact, since domination and degree are respected (Proposition 4.1.1), we get a bijection .
As explained below, the “mirror image” of the bijection gives a bijection . Putting these bijections together, we get the desired result:
[TABLE]
We now explain how to realize the bijection as the “mirror image” of the bijection . For an element of , define . In the case is even, the association is an order reversing involution, and the argument in [4] for the symplectic Grassmannian holds here too. In the case is odd, is not an element of , and so some additional work is required.
Recall that a “base element” of has been fixed and that our notation does not explicitly indicate this dependence upon : for example, is dependent upon . For a brief while now (until the end of this section) we need to simultaneously handle several base elements of . We will use the following convention: when the base element of is not , we will explicitly indicate it by means of a suffix. For instance, denotes the set of -compatible standard monomials in .
Let us first do the case when is even. We get a bijection by associating to the element . The sum of the -degrees of equals the sum of the -degrees of , so that we get a bijection .
For an element of , consider its flip . Since belongs to , the complement of in is , and it follows that belongs to . This induces a degree preserving bijection . Putting this together with the bijection of the previous paragraph and the one deduced earlier in this section (using and ), we get what we want:
[TABLE]
Now suppose that is odd. Then the map does not map to but to (defined as the set consisting of those elements of such that, for each , , exactly one of , belongs to , and the number of entries of greater than is odd). We define a map from to as follows: (the elements are not in increasing order except in the trivial case ), where, for an integer , , we set
[TABLE]
This map is an order preserving injection.
Consider the composition from to . This is an order reversing injection. The induced map on standard monomials is an injection from to . It is readily seen that the image under this map is the subset consisting of those standard monomials all of whose elements satisfy (‡) with . We have already established (using the maps and ) a bijection . It follows from Proposition 4.1.3 that under this bijection the subset maps to (defined as the set of those monomials in satisfying (‡) with ).
Now is in degree preserving bijection with : every element of degree of is uniquely of the form for in , and the desired bijection is induced from this. Putting all of these together, we finally have
[TABLE]
Thus, in order to prove our main theorem (Theorem 2.3.1), it suffices to describe the maps and and to prove Propositions 4.1.1–4.1.3.
Part III The proof
The main combinatorial results formulated in §4.1 are proved. An attempt is made to maintain parallelism with the proofs in [7].
5 Terminology and notation
5.1 Distinguished subsets
5.1.1 Distinguished subsets of
Following [7, §4], we define a multiset of to be distinguished, if, first of all, it is a subset in the usual sense (in other words, it is “multiplicity free”), and if, for any two distinct elements and of , the following conditions are satisfied:
- A.
and . 2. B.
If , then either or .
In terms of pictures, condition A says that cannot lie exactly due North or East of (or the other way around); so we can assume, interchanging the two points if necessary, that lies strictly to the Northeast or Northwest of ; condition B now says that, if lies to the Northwest of , then the point that is simultaneously due North of and due East of (namely ) does not belong to .
5.1.2 Attaching elements of to distinguished subsets of
To a distinguished subset of there is naturally associated an element of as follows: start with , remove all members of which appear as column indices of elements of , and add row indices of all elements of . As observed in [7, Proposition 4.3], this association gives a bijection between distinguished subsets of and elements of . The unique distinguished subset of corresponding to an element of is denoted .
5.2 The involution
5.2.1 The involution on
There are two natural order reversing involutions on . First there is induced by the natural order reversing involution on : here has the obvious meaning, namely, it consists of all such that belongs to . Then there is the map taking to its complement . These two involutions commute. Composing the two we get an order preserving involution on which we denote by . The elements of the subset are fixed points under this involution (there are points not in that are also fixed).
5.2.2 The involution on and
For in , or more generally in , define . The involution is just the reflection with respect to the diagonal . For a subset or even multiset of (or ), the symbol has the obvious meaning. We call symmetric if .
Proposition 5.2.1
An element of belongs to if and only if the distinguished subset of corresponding to it as described in §5.1.2 is symmetric and has evenly many diagonal elements.
Proof: That the symmetry of is equivalent to the condition that is proved in [4, Proposition 5.7]. Now suppose that is symmetric. We claim that for an element of that is not on the diagonal, either both and are bigger than or both are less than . It is enough to prove the claim, for is obtained from by removing the column indices and adding the row indices of elements of , and it would follow that the number of entries in that are bigger than equals the number of such entries in plus the number of diagonal elements in .
We now prove the claim. Since is symmetric, it follows that also belongs to . Since is distinguished, it follows that in case (that is, if lies above the diagonal), we have , and so ; and in case , we have , and so . Thus the claim is proved.
5.3 The subset attached to a -chain
5.3.1 Vertical and horizontal projections of an element of
For in (or more generally in ), the elements and of the diagonal are called respectively the vertical and horizontal projections of . In terms of pictures, the vertical projection is the element of the diagonal due South of ; the horizontal projection is the element of the diagonal due East of . The vertical line joining to its vertical projection and the horizontal line joining to its horizontal projection are called the legs of .
5.3.2 The “connection” relation on elements of a -chain
Let be a -chain in . Two consecutive elements and of are said to be connected if the following conditions are both satisfied:
- •
their legs are “intertwined”; equivalently and more precisely, this means that , or, what amounts to the same, .
- •
the point belongs to ; this just means that .
Consider the coarsest equivalence relation on the elements of generated by the above relation. The equivalence classes of with respect to this equivalence relation are called the connected components of the -chain .
This definition has its quirks:
The -chain in the picture has and as its connected components; but the “sub” -chain of is connected (as a -chain in its own right).
diagonalboundaryof \mathfrak{N}$$\alpha$$\beta$$\gamma$$\in\mathfrak{N}$$\not\in\mathfrak{N}
5.3.3 The definition of
We will define as a multiset of . It is easy to see and in any case stated explicitly as part of Corollary 5.3.5 that it is multiplicity free and so is actually a subset of .
First suppose that is a connected -chain in . Observe that, if there is at all an integer , , such that the horizontal projection does not belong to , then . Define
[TABLE]
For a -chain that is not necessarily connected, let be the partition of into its connected components, and set
[TABLE]
5.3.4 The type of an element of a -chain , and the
set
We introduce some terminology and notation. Their usefulness may not be immediately apparent.
Suppose that is a connected -chain. We define the type in of an element , , of to be V, H, or S, accordingly as:
- V:
, or and is even. 2. H:
, is odd, and . 3. S:
, is odd, and .
The type of an element in a -chain that is not necessarily connected is defined to be its type in its connected component.
The set of elements of generated by an element of is defined to be:
[TABLE]
Observe that, for a -chain , the monomial defined in §5.3.3 is the union, over all elements of , of .
For an element of a -chain , we define to be if is of type V or H and to be if it is of type S.
If the horizontal projection of an element in a -chain does not belong to , then clearly the same is true for every succeeding element. The first such element of a -chain is called the critical element.
Proposition 5.3.1
The cardinality is odd of a connected component that has an element of type H or S. Conversely, if the cardinality of a component is odd, then it has an element of type H or S. 2. 2.
An element of type H or S can only be the last element in its connected component. 3. 3.
The critical element has type either V or S. No element before it can be of type S and every element after it is of type S. In particular, any element that succeeds an element of type S is of type S.
Proof: Clear from definitions.
Proposition 5.3.2
Let be elements of a -chain (we are not assuming that they are consecutive).
If is connected as a -chain in its own right, then is connected to its next member in ; that is, cannot be the last element in its connected component in . 2. 2.
If is not connected as a -chain in its own right and the legs of and intertwine, then the connected component of in is the singleton , and has type S in .
Proof: Clear from definitions.
Proposition 5.3.3
Let be a -chain, and two -chains with tail , and , the concatenations of , respectively with . Then
*The last element in the connected component containing is the same in and (and this is the same as in ). *
Let denote this element.
The only element among , …, that possibly has different types in and is .
Proof: (1): Whether or not two successive elements in a -chain are connected is independent of other elements in the -chain.
(2): The type of an element in a -chain is V unless it is the last element in its connected component. And the type of the last element in a component depends on the cardinality of the component. The components of not containing are still components in and . In contrast, the component containing could possibly be larger in (respectively ) and hence its cardinality could be different.
For an element of , we define to be itself if is either on or above the diagonal (more precisely, if ), and to be its “reflection” in the diagonal (more precisely, ) if is below the diagonal (more precisely, if ). For a monomial of , is defined to be the intersection of (as a multiset) with the subset of . The notations and have similar meanings.
Caution: It is not true that (in the obvious sense one would make of the right hand side). In particular, for a singleton monomial , it is not always true that .
Proposition 5.3.4
Let and be elements of a -chain . Let us use and respectively to denote elements of and .
If (these elements are not necessarily consecutive in ), then, given , there exists such that . In fact, this is true for every choice of except when
[TABLE]
In particular, and . 2. 2.
Conversely, suppose that for some choice of and . Then ; if equality occurs, then is of type H, and . In particular, if (or more specially ), then . 3. 3.
If () holds for in , then*
- (a)
the critical element of is the one just after ; in particular, is uniquely determined. 2. (b)
all elements of succeeding are of type S; in particular, is of type S and . 3. (c)
() holds for in place of for every in that succeeds .*
Proof: (1) If is of type V or H, we need only take , for , , and . Now suppose that is of type S. Then too is of type S (Proposition 5.3.1 (3)), so can only be , and the first part of (1) is proved.
It follows from the above that if or if has type S, then independent of the choice of . So if , then (*) holds and .
(3) Let be the immediate successor of in . Then is not connected to (Proposition 5.3.1 (2)). Since , it follows that and have intertwining legs. Therefore so do and . By Proposition 5.3.2 (2), has type S in .
Since has type H and type S, it follows immediately from the definition of the critical element that is the critical element. This proves (a). Assertion (b) now follows from Proposition 5.3.1 (3). For (c), write , , and . Then , for and have intertwining legs but are not connected. So . This means . And being of type S (by (b)), we can take .
(2) Suppose that . Then . By the second part of (1) above, is of type H and ; by item (b) of (3), is of type S, so . This leads to the contradiction .
Corollary 5.3.5
The multiset attached to a -chain is a distinguished subset of in the sense of 5.1.1.
Proof: If in is of type V or S, then is a singleton; if it is of type H, then . So there can be no violation of conditions A and B of §5.1.1 by elements of .
Suppose . By Proposition 5.3.4 (1), we have for any choice of and except when the condition () holds. By (3) of the same proposition, if () holds, then , and writing , , we have (since ) and (see proof of item 3(c) of the proposition). Thus there can be no violation of conditions A and B of §5.1.1.
Corollary 5.3.6
*Let be a -chain in and an element of . If -dominates , then dominates in the sense of [7] the monomial of . *
Proof: By [4, Proposition 5.15], it is enough to show that dominates . Let be a -chain in . Writing and we have and . By Proposition 5.3.4 (1), we have . Since -dominates , it in particular dominates and so also .
6 -depth
The concept of -depth defined in §6.1 below plays a key role in this paper. As the name suggests, it is the orthogonal analogue of the concept of depth of [7]. In §6.2 below, it is observed that the -depth is no smaller than depth in the sense of [7]. In §6.3, some observations about the relation between -depths and types of elements in -chains are recorded.
6.1 Definition of -depth
The -depth of an element in a -chain in is the depth in in the sense of [7] of : in other words, it is the depth in of in case is of type V or H, and of (equivalently of ) in case is of type S. It is denoted . The -depth of an element in a monomial of is the maximum, over all -chains in containing , of the -depth of in . It is denoted . Finally, the -depth of a monomial in is the maximum of the -depths in of all the elements of .
There is a conflict in the above definitions: Is the -depth of an element of a -chain the same as its depth as an element of the monomial ? In other words, could the -depth of an element in a -chain be exceeded by its -depth in a sub-chain? The conflict is resolved by the first item of the following proposition.
Proposition 6.1.1
For -chains , the -depth in of an element of is no more than its -depth in . 2. 2.
If a -chain is an initial segment of a -chain , then the -depths in and of an element of are the same.
Proof: (1): By an induction on the difference in the cardinalities of and , we may assume that has one more element than . Call this extra element . Suppose that lies between successive elements and of (the modifications needed to cover the extreme cases when it goes at the beginning or the end are being left to the reader).
The only elements of that could possibly undergo changes of type on addition of are and the last element in the connected component of , which let us call . If there are no type changes, then and the assertion is immediate. The only type change that can undergo is from H to V. The type changes that can undergo are: H to V; V to H; S to V; V to S. An easy enumeration of cases shows that only one of and can undergo a type change.
We need not worry about changes from V to H for in this case .
First let us suppose that undergoes a change of type (from H to V). Then is connected to . It follows from Proposition 5.3.1 (1) that has type V in : the connected component of in has odd number of elements, so if happens to be the last element in its connected component in , the number of elements in that component will be even. Replacing an occurrence of in a -chain of by would result in a -chain in (by Proposition 5.3.4 (1)), and this case is settled.
Now suppose that undergoes a type change. Then is connected to and is of type V in (Proposition 5.3.1 (2)). Replacing by any occurrence in a -chain in of , , accordingly as the type of in is V, H, or S, (not necessarily in the same place but at an appropriate place) would result in a -chain in (by Proposition 5.3.4 (1)), and we see that the -depth cannot decrease.
(2): It follows from Proposition 5.3.4 (2) that, for an element of , contributions to from elements beyond (in particular from those not in ) do not affect the depth in of . Looking for the possibility of differences in types in and of elements of , we see that the only element of that has possibly a different type in is its last element. And this too can change type only from H to V.
The above two observations imply that the calculations of -depths in and of an element of are no different: we would be considering the depth in and respectively of the same element (either or ), and the differences in and have no effect on this consideration.
Corollary 6.1.2
*If are -chains in , then (although it is not always true that ). *
Proof: By [7, Lemma 5.5], it is enough to show that every -chain in is dominated by . Let be an arbitrary -chain in . To show that it is dominated by , it is enough, by [7, Lemma 4.5], to show the existence of a -chain in with and for . Such a -chain exists by the proof of (1) of Proposition 6.1.1.
Corollary 6.1.3
Let be a monomial in and . Then there exists a -chain in with tail such that . 2. 2.
For elements in a -chain (these need not be consecutive), we have . 3. 3.
For elements of a monomial in , we have . 4. 4.
No two elements of the same -depth in a monomial in are comparable.
Proof: (1) This follows from (2) of the Proposition above and the definition of -depth.
(2) This follows from Proposition 5.3.4 (1) and the definition of -depth.
(3) By (1), there exists a -chain with tail such that . Concatenate with and let denote the resulting -chain. By (2) of the Proposition above, . By (2) above, . And finally, by the definition of .
(4) Immediate from (3).
Corollary 6.1.4
Let be elements of a -chain of elements of . Let be a -chain in with tail and length . Then occurs in .
Proof: It is enough to show that for in , either or . Let be in such that . If , then by Proposition 5.3.4 (1). If and , then, by (1) and (3) of the same proposition, , a contradiction.
6.2 -depth and depth
Lemma 6.2.1
The -depth of an element in a monomial of is no less than its depth (in the sense of [7]) in .
Proof: Let be a -chain in with tail , where is the depth of in . We then have , so we may assume to be in . By Proposition 5.3.4 (1), in . So .
6.3 -depth and type
We begin by defining some useful terminology. Let and be two elements of . To say that dominates means that and (in terms of pictures, lies (not necessarily strictly) to the Northeast of ). To say that they are comparable means that either or . While this is admittedly strange, there will arise no occasion for confusion.
For an integer , we let be the largest odd integer not bigger than and the smallest even integer not smaller than .
Lemma 6.3.1
For consecutive elements of a -chain ,
[TABLE] 2. 2.
For an element of a -chain such that either its horizontal projection belongs to or it is connected to its predecessor, the parity of its -depth in is the same as that of its ordinality in its connected component in . 3. 3.
The -depth in a -chain of an element of type H is odd. 4. 4.
If in a -chain an element of type V is the last in its connected component, then its -depth is even. 5. 5.
If in a -chain there is an element of -depth , then
- (a)
for every odd integer not exceeding , there is in an element of -depth . 2. (b)
if, for an even integer not exceeding , there is no element in of -depth , then the element in of -depth is of type H, and , where denotes the immediate successor of in . 6. 6.
Let be a -chain and an element of type H in . Then the depth in of equals . In particular, this depth is even.
Proof: (1): From items 1 and 3(a) of Proposition 5.3.4, it follows that, for in with , if for some in , then . Thus exceeds by the number of elements in that dominate . This number is if is of type V, or of type S, or of type H and ; it is if is of type H and (note that if and only if ).
(2): Let be such an element. Everything preceding in is of type H or V (Proposition 5.3.1 (3)). Let belong to the connected component, and , …, be respectively the cardinalities of the first, …, connected components. By (1) above and item 3(b) of Proposition 5.3.4, is plus the ordinality of in the connected component.
(3) and (4): These are special cases of 2.
(5): This follows easily from (1) and (3).
(6): It follows from Proposition 5.3.4 (2) that there is no element in that lies between and (meaning ), so the assertion holds.
Corollary 6.3.2
For a -chain in , if the -depths of elements in are bounded by , then the depths of elements in are bounded by .
Proof: The depth of in for any in is at most by hypothesis. An element of that is not for any in can only be of the form for some . By Proposition 5.3.4, , which implies . If, moreover, is even, then by (3) of Lemma 6.3.1 .
Proposition 6.3.3
Given a monomial in and an element in it, there exists a -chain in with tail such that for every in .
Proof: Proceed by induction on . Choose a -chain in with tail such that (such a -chain exists by Corollary 6.1.3 (1)). Let be the element in just before . It follows from item (3) of Corollary 6.1.3 and item (1) of Lemma 6.3.1 that (as also ) is either or . By induction, there exists a -chain with tail that has the desired property. Let be the concatenation of with .
We claim that has the desired property. The only thing to be proved is that . By item (1) of Lemma 6.3.1, we have . In particular, the claim is proved in case is , so let us assume that is . It now follows from the same item that has type H in and ; it further follows that it is enough to show that has type H in .
Since has type H in , it follows (from item (2) of Proposition 5.3.1) that is not connected and (from item (3) of Lemma 6.3.1) that is odd. Now, by item (4) of Lemma 6.3.1, the type in of cannot be V, so it is H, and the claim is proved.
Corollary 6.3.4
Let be a monomial in , an element of , and an integer such that . Then
- (a)
If is odd, there exists an element in of -depth such that . 2. (b)
If is even and there is no element in of -depth such that , then there is element in of -depth such that .
Proof: Choose a -chain in having tail and the good property of Proposition 6.3.3. Apply Lemma 6.3.1 (5).
Corollary 6.3.5
Let be a -chain in with tail such that is odd. Let be a -chain in with head , and the concatenation of with . Let denote the -chain . Then
The type of an element of is the same in both and . In particular, and for in . 2. 2.
The type of an element of is the same in both and . In particular, . 3. 3.
* (disjoint union); letting we have and . (For a monomial , the subset of elements of depth at least is denoted , and the subset of elements of depth exactly is denoted .)*
Proof: (1) Generally (meaning without the assumption that is odd), the only element of that could possibly have a different type in is the last one in the first connected component of ; whether or not it changes type depends exactly upon whether or not the parity of the cardinality of its connected component in is different from that in . Under our hypothesis, this parity does not change, for, by (4) of Lemma 6.3.1, the type of in is H or S, and so the cardinality of the connected component of in is odd.
(2) Generally (meaning without the assumption that is odd), the only element of that could possibly have a different type in is the last one of ; it changes type if and only if it is connected to and the cardinality of its connected component in is odd. Under our hypothesis, this cardinality is even, for the same reason as in (1).
(3) That (disjoint union) is an immediate consequence of (1) and (2). By Lemma 6.3.1 (1), dominates every element of , so (). It is enough to prove the following claim: every element of has depth less than in . Let be an element of . If then the claim is clear. If not, then, by Proposition 5.3.4 (1), . By Lemma 6.3.1 (3), is odd. Since the claim is already true for , we have . By (6) of the same lemma, , so , and the claim is proved.
Proposition 6.3.6
Let be a monomial in and an odd integer. For in , we have
[TABLE]
Proof: Proceed by induction on . For , the assertion reduces to a tautology. Suppose that the assertion has been proved upto . By the induction hypothesis, we have , and we are reduced to proving the assertion for .
Let be a -chain in with tail and . Let be the head of . We may assume that for, if , we can find, by Lemma 6.3.1 (5), of -depth in with , and extending by will not decrease the -depth in of (Proposition 6.1.1 (1)). Let be a -chain in with tail and length . The head of is then (see Proposition 5.3.4 (1)).
Choose in with tail such that . Let be the concatenation of with . By Corollary 6.3.5, is contained in , , and . By Proposition 6.1.1 (2), the -depth of is the same in as in . Choose a -chain in with tail . Concatenating with we get a -chain in with tail of length . This proves that .
To prove the reverse inequality, we need only turn the above proof on its head. Let be a -chain in with tail such that . Let be a -chain in with tail and length . There exists an element in of -depth in (by Lemma 6.3.1 (5)). Let be the part of upto and including , and the part . By Proposition 6.1.1 (2), and, as above, Corollary 6.3.5 applies.
By Corollary 6.1.4, occurs in . The part of upto and including is of length at most , and the part belongs also to (Proposition 5.3.4 (2)). Thus the length of is at most more than the the length of which is at most .
Corollary 6.3.7
For odd integers , , we have .
Corollary 6.3.8
Let be a -chain, and two -chains with tail , and , the concatenations of , respectively with . Then
; 2. 2.
equality holds if and only if the type of is H in and V in , and , where is the last element in the connected component containing of and is the immediate successor in of .
Proof: These assertions follow from combining (2) of Proposition 5.3.3 with (1) of Lemma 6.3.1.
Corollary 6.3.9
Let be an element of a monomial in . Let be a -chain in with tail such that . Then
* for any in .* 2. 2.
If for some in , then
- (a)
letting be the last element in the connected component containing and the element next to , the type of in is H and . 2. (b)
* for all in between and (both inclusive).*
Proof: (1) Let be in . Let denote the part of beyond (and including) . Let be a -chain in with tail such that . Let be the concatenation of and . Applying Proposition 6.3.8 (1), we have
[TABLE]
But , and, by the choice of and Proposition 6.1.1 (2), .
(2) Assertions (a) and (b) follow respectively from the “only if ” and “if” parts of item (2) of Proposition 6.3.8.
7 The map
The purpose of this section is to describe the map . The description is given in §7.1. It relies on certain claims which are proved in §§7.3, 7.4. Those proofs in turn refer to results from §9, but there is no circularity—to postpone the definition of until all the results needed for it have been proved would hurt rather than help readability. The observations in §7.5 are required only in §10.
The symbol will be reserved for an odd positive integer throughout this section.
7.1 Description of
The map takes as input a monomial in and produces as output a pair , where is an element of such that and is a “smaller” monomial, possibly empty, in . If the input is empty, no output is produced (by definition). So now suppose that is non-empty.
We first partition into subsets according to the -depths of its elements. Let be the sub-monomial of consisting of those elements of that have -depth —the superscript “pr” is short for “preliminary”. It follows from Corollary 6.1.3 (4) that there are no comparable elements in and so we can arrange the elements of in ascending order of both row and column indices. Let be the last element of in this arrangement.
Let now be an odd integer. We set
[TABLE]
We say that * is truly orthogonal at * if belongs to (that is, if where ),
Let denote the monomial in defined by
[TABLE]
Here and other terms on the right are to be understood as multisets. As proved in Corollary 7.3.4 (1) below, has depth at most . Let (respectively be the subset (as a multiset) of elements of depth (respectively ) of .
Now, for every integer , we apply the map of of [7, §4] to to obtain a pair , where is an element of and is a monomial in . Let be the distinguished monomial in associated to —see §5.1.2.
Proposition 7.1.1
* and are symmetric. And therefore so are and .* 2. 2.
* is a distinguished subset of (in particular, the are disjoint).* 3. 3.
For an odd integer, either
- •
both and meet the diagonal, or
- •
neither of them meets the diagonal,
precisely as whether or not is truly orthogonal at . And therefore has evenly many diagonal elements. 4. 4.
No intersects the diagonal. And therefore neither does .
The proposition will be proved below in §7.4.
Finally we are ready to define the image of under . We let be the element of associated to the distinguished subset of ; since is symmetric and has evenly many diagonal elements, it follows from Proposition 5.2.1 that is in fact an element of . And we take .
Remark 7.1.2
Setting
[TABLE]
and defining to be the element of associated to \cup_{\textup{j odd}}\mathfrak{S}_{w_{j,j+1}} would give an equivalent definition of .
7.2 Illustration by an example
We illustrate the map by means of an example. Let , and . A monomial in is shown in Figure 7.2.1. Solid black dots indicate the elements that occur in with non-zero multiplicity. Integers written near the solid dots indicate multiplicities.
The -depth of is . The element has -depth although it has depth in . Figure 7.2.2 shows the monomials , , and . Solid dots, open dots, and crosses indicate elements of these monomials respectively. The monomial is truly orthogonal at and but not at : , , and .
Figure 7.2.3 shows the monomials , , and of and also their decomposition into blocks, and Figure 7.2.4 the monomials , , and .
We have
[TABLE]
hence . It is easy to check that . The monomial is the intersection with of the union of , , and —in other words it is just the monomial lying above in Figure 7.2.4.
7.3 A proposition about
The aim of this subsection is to show that has depth no more than —see item (1b) of Proposition 7.3.3. This basic fact was mentioned above in the description of and is necessary (psychologically although not logically) to make sense of the definitions of and . We prepare the way for Proposition 7.3.3 by way of two preliminary propositions. The first of these is about elements of -depth and in , the second about the relation of these elements with .
Proposition 7.3.1
* has no comparable elements.* 2. 2.
For an odd integer and an element of , there exists in such that . In particular, the row index of (if exists) is less than the row index of .
Proof: (1) follows from Corollary 6.1.3 (4); (2) follows from Proposition 6.3.3 and Lemma 6.3.1 (5).
Proposition 7.3.2
Let be an odd integer and let be truly orthogonal at . Then
; if , then ; if , then . 2. 2.
No element of is comparable to or . 3. 3.
No element of is comparable to . 4. 4.
The following is not possible: , , and .
Proof: (1) is trivial. (2) follows immediately from the definition of . We now prove (3). First suppose for some in . By (2) of Proposition 7.3.1, there exists in such that . But then the row index of exceeds that of , a contradiction to the choice of .
We claim that it is not possible for to satisfy . This being a special case of (4), we need only prove that statement. So suppose that belongs to and that . Let be a -chain in with tail such that (see Proposition 6.1.3 (1)). Concatenate with and call the resulting -chain . Then, by Lemma 6.3.1 (4), is of type H in , so that, by Lemma 6.3.1 (1), we have . But, by Proposition 6.1.1 (2), , so that , a contradiction.
Let denote the set—not multiset—defined by:
[TABLE]
Here on the right stands for the underlying set of the multiset defined above. The set is the disjoint union of the sets and defined as follows (here again the terms on the right hand side denote the underlying sets of the corresponding multisets):
[TABLE]
[TABLE]
Proposition 7.3.3
* (respectively ) is precisely the set of elements of depth (respectively ) in . In particular,*
- (a)
Neither nor contains comparable elements. 2. (b)
The length of a -chain in is at most . 3. (c)
There is a -chain of length in unless is empty. 2. 2.
Let be a positive integer, not necessarily odd. If there is in an element of -depth at least , then is non-empty. The converse also holds except possibly if is even and is truly orthogonal at . In particular, if is non-empty, then there is an element of -depth at least .
Proof: (1): It is enough to show that every element of (respectively ) is of depth (respectively ) in , for
- •
implies for elements , of .
- •
.
- •
, , and are symmetric.
In turn, it is enough to show the following:
- (i)
Every element of has depth . 2. (ii)
has no comparable elements. 3. (iii)
Every element of has depth at least .
Item (i) follows from Proposition 7.3.1 and Proposition 7.3.2 (2); item (ii) from Proposition 7.3.1 (1) and Proposition 7.3.2 (3); item (iii) from Proposition 7.3.1 (2) and Proposition 7.3.2 (1).
(2): The first assertion follows from Lemma 6.3.1 (5): if is odd there is an element of -depth in ; if is even and there is no element of -depth in , then there is in an element of -depth and of type H, so is truly orthogonal at . The second assertion is clear from the definition of .
Corollary 7.3.4
No element of has depth more than . 2. 2.
* and (as sets). In particular, and as multisets defined by the intersection of a multiset with a subset. *
Proof: (1): Since (as sets), this follows immediately from (1b) of the proposition above.
(2): Since the union of (which always is contained in ) and is all of , and since , are disjoint, it it enough to show that and .
Now, since elements of have depth even in (by item (1) of the proposition above), it is immediate that . And it follows from the proof of item (iii) in the proof of item (1) of the proposition above that an element of has depth even in (not just in ), so that .
7.4 Proof of Proposition 7.1.1
(1) The monomials are clearly symmetric. Observe that in has the same depth as , for implies and for , in . Thus the monomials are symmetric. Since the map of [7] respects —see Proposition 5.7 of [4]—it follows that and are symmetric. Therefore so are and .
(2) This follows from Corollary 9.3.6.
(3) If is truly orthogonal at , then and are diagonal elements respectively in and —see Corollary 7.3.4 (2). Thus both and have diagonal blocks in the sense of Proposition 5.10 (A) of [4]. It follows from the result just quoted that both and meet the diagonal. It is of course clear that each meets the diagonal at most once since diagonal elements are clearly comparable but elements of are not by Lemma 4.9 of [7].
Suppose that is not truly orthogonal at . Then and belong to different blocks—this is equivalent to the definition of being not truly orthogonal at . By Proposition 7.3.1 (2), it follows that and also belong to different blocks. So neither nor has a diagonal block.
(4) If is not truly orthogonal at , then neither nor has a diagonal block (as has just been said above), and it follows from Proposition 5.10 (A) of [4] that neither nor meets the diagonal.
So suppose that is truly orthogonal at . Then both and have a diagonal entry each of multiplicity , namely and respectively. It is clear from the definition of that no element of shares its row index with . And it follows from Proposition 7.3.1 (2) that no element of shares its row index with . It now follows from the proof of Proposition 5.10 (B) of [4]—see the last line of that proof—that neither nor meets the diagonal.
7.5 More observations
Proposition 7.5.1
The length of any -chain in is at most .
Proof: By Corollary 7.3.4 (1), the length of any -chain in is at most . Applying Lemma 9.1.1 to , we get the desired result.
Proposition 7.5.2
For an element of , there exists an element of with . 2. 2.
For an element of , there exists an element of with . 3. 3.
For an element of , there exists an element of with .
Proof: (1) That there exists in with follows from the definition of . Clearly such an cannot be on the diagonal, so belongs to .
(2) As in the proof of (1), it follows from the definition of that there exists in with . If lies strictly below the diagonal, then , so that , a contradiction to Lemma 9.1.1 ( belongs to by the symmetry of . Thus belongs to .
(3) Writing , by (1), we can find an in with . By Proposition 7.3.1 (2), there exists in such that .
Corollary 7.5.3
If in there exists an element with horizontal projection in , then is truly orthogonal at .
Proof: Follows directly from Proposition 7.5.2 (1) and (3).
Proposition 7.5.4
The -depth of an element in is at most . More strongly, the -depth of an element in is at most .
Proof: It is enough to show that no element in has -depth more than , for we may assume by increasing multiplicities that and (as sets). It follows from Proposition 7.5.1 that a -chain in has length at most . Let be such a -chain. It follows from the proof of Corollary 4.14 (2) of [7] that and . By item (1) of Lemma 6.3.1, it is enough to rule out the following possibility: is of type H in and .
Suppose that this is the case. By Proposition 7.5.2 (1) and (2), it follows that there exist elements and with and . Since , it follows that . Now, if , then Proposition 7.3.2 (2) is contradicted; if belongs to , Proposition 7.3.2 (4) is contradicted (because ).
8 The map
The purpose of this section is to describe the map and prove some basic facts about it. Certain proofs here refer to results from §9, but there is no circularity—to postpone the definition of until all the results needed for it have been proved would hurt rather than help readability. As in §7, the symbol will be reserved for an odd integer throughout this section.
8.1 Description of
The map takes as input a pair , where is a monomial, possibly empty, in and an element of that -dominates , and produces as output a monomial of . To describe , we first partition into subsets . As the subscript in suggests, this partition depends on .
For an odd integer , let (respectively ) denote the subset of consisting of those elements that are -deep (respectively that are deep but not deep, or equivalently of depth or ) in in the sense of [7, §4]. Since is distinguished, symmetric, and has evenly many elements on the diagonal , it follows that and too have these properties, and that, in fact, the number of diagonal elements of is either [math] or (in the latter case, the elements have to be distinct since is distinguished and so is multiplicity free). Let us denote by and the elements of corresponding to and by Proposition 5.2.1.
Let denote the subset of consisting of those elements such that
- •
every -chain in with head is -dominated by , and
- •
there exists a -chain in with head that is not -dominated by .
It is evident that the subsets are disjoint (as varies over the odd integers) and that their union is all of (for -dominates all -chains in by hypothesis and is empty for large and so ). In other words, the form a partition of .
Lemma 8.1.1
The length of a -chain in is at most . In fact, the -depth of any element in is at most . 2. 2.
* -dominates .*
Proof: The lemma follows rather easily from Corollary 9.2.3 as we now show. Let be a -chain in . Let be the tail of . Choose a -chain in with head that is not -dominated by . Let be the concatenation of with . Since the head of belongs to , it follows that is -dominated by . It follows from (the only if part of) Corollary 9.2.3 (applied with and ) that -dominates and -dominates . This means , so , and so . This proves (2). By Proposition 6.1.1 (2), the -depths of elements of are the same in and , so , which proves the second assertion of (1). The first assertion of (1) follows from the second (see Lemma 6.2.1).
Corollary 8.1.2
* dominates in the sense of [7].*
Proof: This follows from (2) of Lemma 8.1.1 and Corollary 5.3.6 (the latter applied with and ).
We may therefore apply the map of [7, §4] to the pair to obtain a monomial in . In applying , there is the partitioning of into “pieces”, these being indexed by elements of —observe that the elements of depth (respectively ) of are precisely those of of depth (respectively ). We denote by the piece of corresponding to in . We also use the notation as in [7]. Moreover, we will use the phrase piece of (with respect to being implicitly understood) to refer to a piece of for some odd integer .
Caution: Thinking of as a monomial in and as an element of that dominates it, there is, as in [7], the notion of “piece of ” (with respect to ). The two notions of “piece” are different.
Lemma 8.1.3
The monomial is symmetric and has either none or two distinct diagonal elements depending exactly on whether has [math] or elements on the diagonal. 2. 2.
The depth of is ; and , are respectively the elements of depth and in .
Proof: (1) The symmetry follows by combining Proposition 5.6 of [4], which says that the map respects the involution , with Proposition 4.2 of [7], which says that and are are inverses of each other.
The assertion about diagonal elements follows by combining item (B) of [4, Proposition 5.10], which is an assertion about the existence and relative multiplicities of diagonal elements in and where is a diagonal block of a monomial in , and Proposition 4.2 of [7].
(2) It follows from Propositions 4.2 of [7] that the map (described in §4 of that paper) applied to results in the pair . It now follows from Lemma 4.16 of [7] that the depth of is exactly . The latter assertions again follow from the results of [7]—in fact, the proof that is identity on pages 47–49 of [7] shows that the are the blocks in the sense of [7] of the monomial .
Suppose that contains the pair , of diagonal elements with . We call the pair , the “twists,” and set . In other words, is the element of the twisted pair that lies above the diagonal—observe that the twisted elements are reflections of each other. We allow ourselves the following ways of expressing the condition that has diagonal elements: * exists; is diagonal at * (the latter expression is justified by the lemma above).
With notation as above, consider the new monomial defined as
[TABLE]
This new monomial is symmetric and contains no diagonal elements. Its intersection with is denoted . In other words, is the intersection of the new monomial with the subset of of those elements that lie strictly above the diagonal.
The union of over all odd integers is defined to be , the result of applied to . This finishes the description of the map .
For in , we define the “orthogonal piece-star”
corresponding to as
[TABLE]
With this, we can say that is the union of as varies over .
Lemma 8.1.4
Suppose that contains the pair , of diagonal elements with . Let
[TABLE]
be respectively the elements of depth and of arranged in increasing order of row and column indices. Then
* and (assuming exists); and* 2. 2.
* and (assuming exists).*
Proof: (1) Suppose that exists. It is clear that . From way the map of [7] is defined, it follows that is an element of . Suppose that . Then belongs to . We consider two cases.
If exists, then, again from the definition of the map , it follows that is an element of . But then and dominates , which means that the -chain (note that because by hypothesis) in has -depth more than , a contradiction to Lemma 8.1.1 (1).
Now suppose that does not exist. (Then is the diagonal element in .) Consider the singleton -chain in . Then which is not dominated by , a contradiction to Lemma 8.1.1 (2).
(2) Suppose that exists. Then there exists, by the definition of the map , an element in . Since lies above the diagonal, it follows that . That is clear.
8.2 Basic facts about and
Lemma 8.2.1
Let be elements of . Let and be the odd integers such that and . Then . 2. 2.
If, further, either
- (a)
there exists in such that , or 2. (b)
* for in ,*
then .
Proof: (1) By hypothesis, every -chain with head is -dominated by . This implies, by Corollary 6.1.2, that every -chain with head is -dominated by . This shows .
(2a) Suppose that . It follows from (1) that , , and all belong to . But then is a -chain of length in , a contradiction to Lemma 8.1.1 (1).
(2b) Suppose that . Then is a -chain in . Being of length , it cannot be dominated by , which means, by the definition of , that cannot belong to , a contradiction.
Proposition 8.2.2
The length of a -chain in is at most . 2. 2.
*The -depth of is at most . * 3. 3.
* is precisely the set of depth elements of (in particular, no two elements there are comparable); if exists, then it is the last element of when the elements are arranged in increasing order of row and column indices. * 4. 4.
* is precisely the set of depth elements of (in particular, no two elements there are comparable); if exists, then its row index exceeds the row index of any element in . *
Proof: For (1), it is enough, given Lemma 8.1.3 (2), to show that is not comparable to any element of depth of , and this follows from Lemma 8.1.4 (1). In fact, the above argument proves also (3).
For (4), it is enough, given Lemma 8.1.3 (2), the symmetry of the monomials involved in that lemma, and the observation that implies for elements , of , to show the following: if for an element of lying (strictly) above the diagonal, then . But this follows from Lemma 8.1.4 (2): is a depth element in , and we have (and since ). In fact, the above argument proves also (2): observe that (Lemma 8.1.4 (2)).
9 Some Lemmas
The main combinatorial results of this paper are Propositions 4.1.1 and 4.1.2. They are analogues respectively of Propositions 4.1 and 4.2 of [7]. We have tried to preserve the structure of the proofs in [7] of those propositions. The proofs in [7] rely on certain lemmas and it is natural therefore to first establish the orthogonal analogues of those. The purpose of this section is precisely that. Needless to say that the lemmas (especially those in §9.4) may be unintelligible until one tries to read §10.
The division of this section into four subsections is also suggested by the structure of the proofs in [7]. Each subsection has at its beginning a brief description of its contents.
9.1 Lemmas from the Grassmannian case
In this subsection, the terminology and notation of [7, §4] are in force. The statements here could have been made in [7, §4] and would perhaps have improved the efficiency of the proofs there, but do not appear there explicitly.
Let be a monomial in . Recall from [7] the notion of depth of an element in : it is the largest possible length of a -chain in with tail and denoted . The depth of is the maximum of the depths in it of all its elements. We denote by the set of elements of depth of (as in [7]) and by the set of elements of depth at least of .
Caution: For a monomial of , we have introduced in §7.1 the notation . That is different from the we have just defined.
Lemma 9.1.1
Let be a monomial in , and let , where is the map defined in [7, §4]. Then the maximum length of a -chain in is the same as the maximum length of a -chain in .
Proof: We use the notation of [7, §4] freely. Let be the maximum length of a -chain in . Suppose is a -chain in . Let be such that belongs to (the integers are uniquely determined—see Corollary 5.4 of [4]). We claim that . This suffices to prove the lemma, for is empty for .
To prove the claim, it is enough to show . It follows from Lemma 4.10 of [7] that . We now assume that and arrive at a contradiction. First suppose that . Then, by the definition of , there exists in with . Now and both , belong to , a contradiction to [7, Lemma 4.10]. If belongs to , then, by the definition of , there exists in with , and there exists in with . This leads to the same contradiction as before.
Lemma 9.1.2
Let and be monomials in . Assume that
- •
the elements of form a single block* (in the sense of [7, Page 38]).*
- •
* has depth (equivalently, there are no comparable elements in ).*
- •
for every in , there exist , and in such that
[TABLE]
(this holds, for example, when there exists in such that : take ).
Then there exists a unique block of such that .
Proof: It is useful to isolate the following observation:
Lemma 9.1.3
Let and be elements of with . Let , and , be elements of such that
. 2. 2.
. 3. 3.
No two of , , , are comparable (they could well be equal and this is important for us—see our definition of comparability).
Then the monomial consists of a single block.
Proof: It follows from assumption (1) that and belong to a single block:
- •
if , then becomes relevant;
- •
if , then the other two inequalities in (1) become relevant:
.
Similarly it follows from assumption (2) that and belong to a single block.
We therefore need only consider the cases when, in the arrangement of the elements in increasing order of row indices, both , come before or after , . In the former case, the first sequence of inequalities below shows that and belong to the same block, and we are done; in the latter case, the second sequence of inequalities below shows that and belong to the same block, and we are done:
- •
.
- •
.
Continuing with the proof of Lemma 9.1.2, we first prove the existence part. Arrange the elements of in non-decreasing order of row numbers as well as column numbers (this is possible since there are no comparable elements in ). If and are successive elements, then (since is a single block). Apply Lemma 9.1.3 with , , and , . We conclude that belongs to a single block, say , of . Continuing thus, we conclude that all and , as varies over , belong to . Since the row (respectively column) index of is the maximum (respectively minimum) of all row (respectively column) indices of elements of (and similarly for ), it follows that .
To prove uniqueness, let and be two blocks of with and . Apply the lemma with and and ; it follows from [7, Lemma 4.9] that and are not comparable. But, unless , neither is the monomial a single block, again by [7, Lemma 4.9].
Lemma 9.1.4
*Let be a monomial in and an element of . For to dominate it is necessary and sufficient that for every in there exist in with , , and . (Here
denotes the distinguished monomial in associated to as in [7, Proposition 4.3].)*
Proof: The lemma is a corollary of [7, Lemma 4.5] as we now show.
First suppose that dominates . Let be an element of , and a -chain in with tail and length . Since dominates , there exists, by [7, Lemma 4.5], a chain in in of length and tail with and , and we are done with the proof of the necessity.
To prove the sufficiency, let be a -chain in . By hypothesis, there exist , …, in with , , and for (observe that replacing the in the latter condition of the statement by an equality yields an equivalent statement). We claim that . By [7, Lemma 4.5], it suffices to prove the claim.
Since has depth in , there exists a of depth in such that . It follows from the distinguishedness of that that : if not, then we have two distinct elements of the same depth (namely ) in both dominating , a contradiction. So , and the claim is proved by continuing in a similar fashion.
Let be an element of . Let denote the distinguished monomial in associated to as in [7, Proposition 4.3]. For a positive integer, let denote the element of corresponding to the distinguished subset . For a monomial of , let . Let denote the element of corresponding to the distinguished monomial ; let denote the element of corresponding to the distinguished subset .
Caution: For a monomial of and an odd integer , we have introduced in §7.1 the notation . That is different from the just defined.
Corollary 9.1.5
* dominates dominates dominates and dominates .*
Proof: The first equivalence is a restatement of the lemma: in the statement of the lemma we could equally well have written . The second follows from the first and the following observations: , , ; and , , .
9.2 Orthogonal analogues of Lemmas of 9.1
Lemma 9.2.2 below is the orthogonal analogue of Lemma 9.1.4 (more precisely, that of the first assertion of Corollary 9.1.5). The following proposition will be used in its proof.
Proposition 9.2.1
Let be an element of and a monomial in . Then -dominates if and only if it -dominates every -chain in of -depth at most .
Proof: The “if” part is immediate from definitions (in any case, see also Proposition 7.5.4). For the “only if” part, let be a -chain in of -depth at most . Our goal is to show that dominates . For this, it is enough, by Corollary 9.1.5, to show that dominates and dominates (by choice of , is empty for ).
Let . Choose in such that . Choose in such that dominates . Since -dominates the singleton -chain , it follows that dominates . We claim that dominates . To prove the claim, we need only rule out the possibility that is of type S in and of type V in . Since , it follows from Proposition 5.3.4 (1) that is the first element of . In particular, if is of type V in , then , so , and is of type H in . The claim is thus proved.
Now consider an element of . Observe that the length of is at most (Lemma 6.2.1). So our element is either the horizontal projection of the head of , or it is where is the tail of . In the first case, let be as in the previous paragraph, and proceed similarly. It is clear that (because ); dominates and so also .
Now we handle the second case. If , then is contained in and there is nothing to prove. So assume that . Choose a -chain in with tail , , and with the good property as in Proposition 6.3.3. There occurs in an element of -depth , say . (Lemma 6.3.1 (5)). Let denote the part of and the part up to but not including . There clearly is an element—call it —of depth in that dominates . This element belongs to (Corollary 6.3.5 (3)). Since has the good property of Proposition 6.3.3, , so is dominated by an element in . In particular, is dominated by the same element of .
We are still not done, for it is possible that be and be . Suppose that this is the case. Then is connected. So and the legs of and intertwine. As seen above in the third paragraph of the present proof, there is an element of that dominates . By the distinguishedness of , it follows that the element in dominating is the same as the one dominating . By the symmetry of , this element lies on the diagonal and so dominates , and, finally, we are done with the proof in the second case.
Lemma 9.2.2
Let be a monomial in and an element of . For to -dominate it is necessary and sufficient that, for every odd integer , every -chain in is -dominated by .
Proof: First suppose that dominates . Let be an odd integer and let a -chain in . We need to show that dominates . For this, we may assume that is maximal (by Corollary 6.1.2). By Corollary 6.1.3 (3), the length of is at most . By Lemma 6.3.1 (5) (b), for every in there exists in with . Thus we may assume that the head of belongs to .
It is enough to show (see [7, Lemma 4.5]) that for any -chain in
- •
the length of is at most ;
- •
there exists an -dominated monomial in containing and the head of is an element of depth at least in that monomial.
The first of these conditions holds by Proposition 7.5.4. We now show that the second holds.
We may assume that is maximal in . By Proposition 5.3.4 (1), the head of is . Let a -chain in with tail such that . Let be the concatenation of with . We claim that the monomial has the desired properties. That is -dominated is clear (since -dominates ). By Corollary 6.3.5, it follows that and (in particular that ). By Proposition 6.1.1 (2), , that is, . The proof of the necessity is thus complete.
To prove the sufficiency, proceed by induction on the largest odd integer such that is non-empty. When , there is nothing to prove, for and -dominates . So suppose that . We implicitly use Corollary 6.3.7 in what follows. By induction, -dominates .
Let be a -chain in . Our goal is to show that dominates . Let be the element of with —such an element exists, by Lemma 6.3.1 (5) (if there exists in an element of -depth in exceeding ); the following proof works also in the case when does not exist. Let be the part of , and the part up to but not including . By Proposition 6.1.1 (2), the -depth (in ) of elements of is at most . By Proposition 9.2.1, dominates . By Corollary 6.3.5 (3), and . Since , it follows that dominates (induction hypothesis). Finally, by an application of Corollary 9.1.5, we conclude that dominates .
Corollary 9.2.3
Let be a a monomial in and an element of . For to -dominate it is necessary and sufficient that -dominate and -dominate .
Proof: It is easy to see that ; it follows from Proposition 6.3.6 that . The assertion follows from the lemma.
9.3 Orthogonal analogues of some lemmas in [7]
The proofs of Propositions 4.1 and 4.2 of [7] are based on assertion 4.9–4.16 (of that paper). Assertion 4.9 being a statement about a single , it is applicable in the present situation. Since references to it are frequent, we recall it below as Lemma 9.3.1. As to assertions 4.10–4.16 of [7], assertions 9.3.2, 9.3.4–9.3.9 below are their respective analogues.
A block of a monomial in means a block of in the sense of [7] for some odd integer .
Caution: Considering as a monomial in , there is the notion of a “block” of as in [7], which has in fact been used in §9.1, and which is different from the notion just defined. Both notions are used and it will be clear from the context which is meant.
Throughout this section denotes a monomial in and an integer (not necessarily odd).
Lemma 9.3.1
If are the blocks in order from left to right of some , and , , , , then
[TABLE]
Proof: This is merely a recall Lemma 4.9 of [7]. In any case it follows easily from the definitions.
Lemma 9.3.2
No two elements of are comparable. More precisely, it is not possible to have elements both belonging to .
Proof: It follows from Lemma 9.3.1 that contains no comparable elements. If is even, then (Corollary 7.3.4 (2)); if is odd, we may assume (as sets) by increasing the multiplicity of in .
Lemma 9.3.3
For integers , there cannot exist and such that . For integers , there cannot exist and such that dominates .
Proof: Let and . If and , then we get a contradiction immediately to Lemma 9.3.2. Now suppose that and that dominates . Apply Corollary 6.3.4 (the notation of the corollary being suggestive of how exactly to apply it). Let be as in its conclusion. The chain contradicts Lemma 9.3.2 in case is odd and either Lemma 9.3.2 or Proposition 7.5.4 in case is even.
Lemma 9.3.4
For in , there exists a unique block of with in .
Proof: The existence is clear from the definition of . For the uniqueness, suppose that and are two distinct blocks of with in both and . We will show that this leads to a contradiction.
Let and be such that and . From Lemma 4.11 of [7] (of which the present lemma is the orthogonal analogue) it follows that , so we can assume without loss of generality that . By applying the involution if necessary, we may assume that . Now there exists an element in with (this follows from the definition of ). Clearly . Taking and , we get a contradiction to Lemma 9.3.3.
Lemma 9.3.5
Let be positive integers.
Given a block of , there exists a unique block of such that . 2. 2.
Given an element in , there exists in such that .
Proof: (1): The assertion follows by applying Lemma 9.1.2 with and . We need to make sure however that the lemma can be applied. More precisely, we need to check that for every in there exist and in such that , , and . We may assume , for, if , then also belongs to because is symmetric, and we can set , and —note that these two belong to since is symmetric.
We consider three cases:
belongs to . 2. 2.
(in particular, is even and is truly orthogonal at ). 3. 3.
(in particular, is odd and is truly orthogonal at ).
Define to be in case 1, in case 2, and in case 3. Let be a -chain in with tail and having the good property as in Proposition 6.3.3.
First suppose that there exists in an element of -depth and denote it by . If (this can happen only in case 1), then set . Now suppose . Then except when with odd and has multiplicity in . If , take and ; if , then take .
Now suppose that has no element of -depth . Then, by Lemma 6.3.1 (5), is even and there exists in an element of -depth . This element of is of type H by Lemma 6.3.1 (1), so is truly orthogonal at . Set .
(2): This proof parallels the proof of (1) above. As in the above proof, we may assume that . Suppose belongs to . Then there exists with . Since does not meet the diagonal, it is clear that , and thus it is enough to prove the assertion for .
So now take . Let and be in the proof of (1). First suppose that there exists in an element of -depth . Denote it by . If , then take . If , then , and we take . In case there is no element in of -depth , we take (see the above proof).
Corollary 9.3.6
If and are blocks of with and , then exactly one of the following holds:
[TABLE]
Proof: This is a formal consequence of Lemmas 9.3.1 and 9.3.5, just as Corollary 4.13 of [7] is of Lemmas 4.9 and 4.12 of that paper.
Corollary 9.3.7
If for blocks and of , then .
Proof: This is a formal consequence of Lemmas 9.3.1 and 9.3.5. It follows from the first lemma that . Suppose . Then there exists by the second lemma a block such that . But then , a contradiction of the first lemma.
Corollary 9.3.8
*Let be elements of , and , be blocks of such that , and . Then . *
Proof: Let and . By Corollary 9.3.6, we have four possibilities. Since dominates and dominates , the possibilities and are eliminated. It is thus enough to eliminate the possibility . Suppose that this is the case. Then, by Corollary 9.3.7, , where and are such that and . Now, by Lemma 9.3.5 (2), there exists in such that . But then this contradicts Lemma 9.3.2.
Corollary 9.3.9
For a of , the depth of in is exactly .
Proof: That the depth is at least follows from Lemma 9.3.5. That the depth cannot exceed follows from Corollary 9.3.7.
Corollary 9.3.10
Let , , and . Then .
Proof: Corollary 9.3.8 and Corollary 9.3.9.
9.4 More lemmas
This subsection is a collection of lemmas to be invoked in the later subsections. More specifically, Lemma 9.4.1 and Corollary 9.4.2 are invoked in the proof of Proposition 4.1.1 in §10.1, Lemma 9.4.3 in the proof of the first half of Proposition 4.1.2 in §10.2, and Lemma 9.4.4 in the proof of the second half of Proposition 4.1.2 in §10.3. Throughout this subsection, denotes a monomial in .
Lemma 9.4.1
Let be a -chain in , an element of , and . Then , for the integer such that .
Proof: Proceed by induction on . If , the assertion follows from Corollary 9.3.10, so assume . Choose a -chain in with tail and . The length of a -chain in is clearly at most . So, if is the element two steps before in (if does not exist then there is clearly nothing to prove), then with (see Proposition 5.3.4 (2)). We claim that . It is enough to prove the claim, for then .
The claim follows by induction from Corollary 9.3.10 if is odd or more generally if with . So assume that is even and . By 7.5.4, it is not possible that is of type H and . So the only possibility is that and is connected. In particular, is of type V and of type H in and .
Now let be the first element in the connected component of