Finite intervals and their transported structure
An interval \([u,b]\) is a finite collection of vertices with the induced Bruhat order. Its intrinsic rank difference is measured by Coxeter length. Order isomorphisms identify the bottom and top and preserve these relative ranks, which makes interval data suitable for induction.
The proof also uses relative intervals inside a root-plane subgroup coset. Their ranks are measured in the induced dihedral system. The full interval transport theorem constructs target coset coordinates, proves affine preservation of relative lengths, and shows that the image fills the entire target relative interval. Its full-range statement permits exact reindexing of the later-edge sums.
At the end of the proof, finite-support reduction realizes an interval inside a Coxeter system generated by finitely many simple reflections and transports the canonical polynomial with it. Thus interval finiteness has two roles: it supports finite sheaf and schedule constructions, and it makes the unrestricted theorem accessible through finite models.
Reading sequence
- Bruhat intervals, endpoints and rank differences — Define interval vertices and order.
- Finiteness of Bruhat intervals — Establish the finite index set.
- Interval isomorphisms preserve endpoints and rank differences — Compare ranks under an isomorphism.
- Relative length and Bruhat intervals in a plane-subgroup coset — Define relative coset intervals.
- Full transport of a relative dihedral interval — Prove full target range and rank transport.
- Finite-support interval models in standard parabolic systems — Package the finite-support model.
- Existence and transport of finite-support interval models — Transport the interval polynomial.