Bruhat intervals, endpoints and rank differences
For elements \(u,b\) of a Coxeter system, define the interval \[ [u,b]=\{x:u\le x\le b\} \] with the induced strong Bruhat order. An element of the source's interval type consists of its underlying group element and the two endpoint inequalities.
The interval is nonempty exactly when \(u\le b\). A member \(x\) gives \(u\le x\le b\), hence \(u\le b\). Conversely, when \(u\le b\), both \(u\) and \(b\) are members.
The endpoints and subintervals
For \(u\le b\), the interval bottom is \(u\), with evidence \(u\le u\le b\); the interval top is \(b\), with evidence \(u\le b\le b\). Every member lies above the bottom and below the top.
Given \(u\le x\le y\le b\), the subinterval \([x,y]\) has its natural inclusion in \([u,b]\), because \(u\le x\le z\le y\le b\). The cases \([u,y]\) and \([x,b]\) are initial and upper subintervals. A singleton \([x,x]\) consists of \(x\).
Rank difference and its arithmetic
The source defines the natural number \[ \delta(x,y)=\max\{\ell(y)-\ell(x),0\}, \] where the difference inside the maximum is an integer. For comparable \(x\le y\), length monotonicity makes this \[ d(x,y)=\ell(y)-\ell(x). \]
For \(x\le z\le y\), the differences add: \[ d(x,y)=d(x,z)+d(z,y). \] This follows by adding \((\ell(z)-\ell(x))+(\ell(y)-\ell(z))\); the middle lengths cancel.
For \(u\le x\le y\le b\), apply this twice: \[ d(u,b)=d(u,x)+d(x,y)+d(y,b). \] If \(x\ne u\) or \(y\ne b\), at least one outer term is positive by strict Bruhat length increase. Thus every such proper subinterval has smaller rank.
For \([1,st]\), the rank is two. Its upper interval \([s,st]\) and initial interval \([1,s]\) have rank one, while \([s,s]\) has rank zero.
Interval order isomorphisms
An interval order isomorphism \(\phi:[u,b]\to[u',b']\) is a bijection satisfying \[ x\le y\quad\Longleftrightarrow\quad\phi(x)\le\phi(y). \] Its inverse preserves order as well. It transports a subinterval by restricting to its members, and it transports an interval-indexed function \(f\) by \[ f'(x')=f(\phi^{-1}(x')). \] Composition with \(\phi\) recovers the original function.
The endpoint-and-rank theorem proves that the isomorphism carries the named bottom and top to their counterparts and preserves every relative rank \(d(x,y)\).
References
The local source declarations below give the construction and proof.
Lean formalization
OAI.KLInvariance.Interval: Model.lean:22.
OAI.KLInvariance.rankDifference: Model.lean:45.
OAI.KLInvariance.intervalBottom: CanonicalKL.lean:428.
OAI.KLInvariance.intervalTop: CanonicalKL.lean:431.
OAI.KLInvariance.rankDifference_add: OrdinaryR.lean:228.
Used by
- Freeness of all terminal kernels in a transported schedule
- A length-one successor inside every strict Bruhat interval
- External lower vertices and their parity classes
- Restricting an order isomorphism to a subinterval
- Parity balance in lower Bruhat intervals
- Strictly monotone interval maps cannot decrease rank
- The unlabelled diamond closure of cover edges
- Reflection roots as polynomial edge labels
- Transported edge scores, schedules and remaining conditions
- The coset interval embedding into an ambient interval
- Coset root identities and reindexing of actual later counts
- The induced reflection graph and inversion count on a plane-subgroup coset
- Relative rank fibers and two-edge detection of rank two
- Finiteness of Bruhat intervals
- The normalization data for ordinary R and KL polynomials
- Interval isomorphisms preserve endpoints and rank differences
- The reversed R-kernel with its bottom term removed
- The recursive polynomial family on Bruhat intervals
- Scaled polynomial evaluations and KL vectors
- The finite relative coset graph inside a Bruhat interval
- Finiteness and outgoing lifts of the relative coset graph
- Finite-support interval models in standard parabolic systems
- Relative length and Bruhat intervals in a plane-subgroup coset
- Unlabelled interval isomorphisms preserve reflection edges
- The boundary-sheaf family obtained by upper-interval restriction