Bruhat upper sets and their reflected union and intersection
Let \(W\) be a Coxeter group with strong Bruhat order. A Bruhat upper set is a subset \(U\subseteq W\) such that \[ x\in U,\quad x\le y\quad\Longrightarrow\quad y\in U. \] This is the source's BruhatUpper predicate on the ambient group.
Fix a simple reflection \(s\). Its reflected preimage is \[ sU=\{x\in W:sx\in U\}. \] Because \(s^2=1\), this is also the image \(\{sx:x\in U\}\). The source calls it simplePull.
Define \[ J=U\cup sU,\qquad K=U\cap sU. \] These are simpleUnion and simpleInter: \[ x\in J\iff(x\in U\text{ or }sx\in U),\qquad x\in K\iff(x\in U\text{ and }sx\in U). \] The four natural inclusions are \(K\subseteq U\), \(K\subseteq sU\), \(U\subseteq J\), and \(sU\subseteq J\).
A set is reflection-stable when \(sx\in U\) if and only if \(x\in U\). Exchanging \(x\) and \(sx\) in the two membership formulas proves that both \(J\) and \(K\) are reflection-stable.
A single simple reflection
For the two-element Coxeter group \(1<s\), take \(U=\{s\}\). Then \[ sU=\{1\},\qquad J=\{1,s\},\qquad K=\varnothing. \] The upper set \(U\) selects the higher endpoint. Its reflected union fills the pair, and its reflected intersection is empty.
The reflected upper-set theorem proves that \(J,K\) are upper whenever \(U\) is. These sets control the restriction maps used to prove projectivity of word-coordinate images.
References
The local source declarations below give the construction and proof.
Lean formalization
OAI.KLInvariance.TitsSpace.BruhatUpper: IntegralPairings.lean:384.
OAI.KLInvariance.TitsSpace.simplePull: IntegralPairings.lean:630.
OAI.KLInvariance.TitsSpace.simpleUnion: IntegralPairings.lean:387.
OAI.KLInvariance.TitsSpace.simpleInter: IntegralPairings.lean:388.
Used by
- Extending an interval assignment to its ambient upper closure
- Patching the two tail assignments on a reflected union
- The two-stage kernel data for upper-coordinate images
- Tail maps on coordinate-image modules
- Compatible tuples, upper-image projectivity and lifting
- Reflected upper sets and their crossing edges