Unlabelled interval isomorphisms preserve reflection edges
For an interval isomorphism \(\phi:[u,b]\simeq[u',b']\) in arbitrary Coxeter systems, \[ x\longrightarrow y \quad\Longleftrightarrow\quad \phi(x)\longrightarrow\phi(y). \]
Proof
Step 1. Replace the edge predicate by its order-theoretic characterization
The reconstruction theorem gives, on each interval, \[ x\to y\quad\Longleftrightarrow\quad D(x,y), \] where \(D\) is generated by covers and the eight-edge diamond rule. We therefore only need to check that an order isomorphism preserves derivations of \(D\).
Step 2. Transport a cover
If \(x\prec y\), then \(\phi(x)<\phi(y)\). If a vertex \(z'\) lay strictly between them, its inverse image would lie strictly between \(x\) and \(y\), contradicting the cover condition. Thus \(\phi(x)\prec\phi(y)\), and the cover constructor of \(D\) transports.
Step 3. Transport the diamond rule
For a diamond derivation, apply induction to its eight previously derived pairs. The images provide the same eight incidences. The conditions \(a\ne b\), \(c\ne d\) remain true because \(\phi\) is injective. The target diamond rule therefore gives the image of the final pair.
Induction on the finite derivation proves \(D(x,y)\Rightarrow D(\phi(x),\phi(y))\).
Step 4. Obtain the equivalence
Convert to reflection edges using Step 1. Apply the same argument to \(\phi^{-1}\) for the reverse implication. The result preserves all upward reflection edges, including non-cover edges. It does not assign or preserve reflection labels; those are supplied by the two ambient systems separately.
References
3. Dihedral intervals and transported reflection orders.
Lean formalization
OAI.KLInvariance.intervalIso_bruhatStep_iff_general: DyerPaths.lean:234.
Used by
- Transported edge scores, schedules and remaining conditions
- Exact two-edge intermediate sets survive interval transport
- Ambient later-edge selections and their coset pullbacks
- Later-edge selections for the coset model comparison
- Counting supported later edges by their target vertices
- Full transport of a relative dihedral interval
- Later-edge counts in transported dihedral intervals
- A chronological suffix gives the strict later conditions at both endpoints