Definition External lower vertices and their parity classes
✓ definition formalized

External lower vertices and their parity classes

Let \(W\) be a Coxeter system with length \(\ell\) and strong Bruhat order. For \(x,c\in W\), define the finite external lower set \[ E(x,c)=[1,c]\setminus[1,x] =\{z:z\le c,\ z\not\le x\}. \] This is externalLower. The definition makes sense for any \(x,c\); the parity comparison used later assumes \(x\le c\).

Partition it according to the parity of \(\ell(x)\): \[ Y(x,c)=\{z\in E(x,c):\ell(z)\not\equiv\ell(x)\pmod2\}, \] \[ Z(x,c)=\{z\in E(x,c):\ell(z)\equiv\ell(x)\pmod2\}. \] These are the opposite-parity and same-parity external vertices. The source names these two filters oppositeExternal and sameExternal in its dihedral interpolation section.

Every external vertex belongs to exactly one of \(Y,Z\). In particular, \(x\) belongs to neither class, since \(x\le x\).

A two-generator example

Take a reduced word \(st\) and \(x=s,\ c=st\). The lower intervals are \[ [1,st]=\{1,s,t,st\},\qquad [1,s]=\{1,s\}. \] Thus \(E(s,st)=\{t,st\}\). Since \(\ell(s)=1\), \[ Y(s,st)=\{st\},\qquad Z(s,st)=\{t\}. \]

For \(x=c\), the external set is empty. For \(x=1\), it consists of all nonidentity vertices below \(c\).

The lower-interval parity theorem proves \(|Z(x,c)|\le|Y(x,c)|\) when \(x\le c\). In a dihedral system, the opposite-parity class corresponds to the outgoing reflection edges from \(x\) whose targets lie below \(c\).

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.externalLower: SheafMorphisms.lean:275.

OAI.KLInvariance.mem_externalLower: SheafMorphisms.lean:279.

OAI.KLInvariance.Dihedral.oppositeExternal: DihedralIntervals.lean:235.

OAI.KLInvariance.Dihedral.sameExternal: DihedralIntervals.lean:239.

Used by