Definition The unlabelled diamond closure of cover edges
✓ definition formalized

The unlabelled diamond closure of cover edges

For a partially ordered set \(X\), define a relation \(D\) by the following two rules.

  1. Every cover \(x\prec y\) belongs to \(D\).
  2. If \(a\ne b\), \(c\ne d\), and the eight pairs \[ (x,a),(x,b),(a,c),(a,d),(b,c),(b,d),(c,z),(d,z) \] belong to \(D\), then \((x,z)\) belongs to \(D\).

Take the smallest relation closed under these rules. Only the order is used: there are no reflection labels, roots, or Coxeter generators in the definition.

An order isomorphism preserves covers, distinctness, and every instance of the eight-edge rule. Induction on a derivation therefore transports \(D\). The substantial theorem is that, on a Bruhat interval, this combinatorially generated relation is exactly the full upward reflection-edge relation. That identification is not built into the definition.

References

Related paper context.

Lean formalization

The constructors cover and diamond implement the two rules, with eight recursive premises and the two distinctness conditions.

OAI.KLInvariance.DiamondEdges: ReflectionSchedules.lean:1529.

Used by