Extended Weak Order in Coxeter and Lattice Theory

• Extended weak order is a family of lattice-theoretic extensions of the classical weak Bruhat order that utilize biclosed subsets to preserve inversion-set structure.
• It employs inversion-set characterizations, closure operations, and congruence transport to extend order relations from finite to more general combinatorial and geometric objects.
• Its applications span finite Coxeter systems, hyperplane arrangements, continuous weak orders, and alternating sign matrices, offering unified lattice models.

Extended weak order denotes a family of lattice-theoretic enlargements of the classical weak Bruhat order, all designed to retain inversion-set control while enlarging the underlying class of objects. In the Coxeter-theoretic sense introduced by Dyer, the extended weak order is the inclusion poset of biclosed subsets of $\Phi^+$, the positive roots of a Coxeter system; its finite elements are exactly the inversion sets of group elements, so it contains the usual weak order as an order ideal and coincides with it in finite type (Dyer, 2011). In parallel, finite Coxeter theory admits the facial weak order on standard parabolic cosets, extending weak order from vertices to all faces of the permutahedron (Dermenjian et al., 2016). Related constructions extend weak-order methods to central hyperplane arrangements (Dermenjian et al., 2019), all subsets or antisymmetric closed subsets of a finite root system (Gay et al., 2018), reflexive binary relations and integer posets (Chatel et al., 2017), continuous monotone paths in $I^d$ (Gouveia et al., 2018), and alternating sign matrices together with their monotone-triangle and bumpless-pipe-dream models (Escobar et al., 26 Feb 2025, Escobar et al., 11 Jun 2026). The common structural themes are inversion-set characterizations, closure/interior operations, congruence transport, and the search for global lattice structure.

1. Classical weak order and the need for extension

For a Coxeter system $(W,S)$ with positive roots $\Phi^+$, the classical right weak order is characterized by inclusion of inversion sets. In one standard formulation, for $w\in W$,

$$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$

and

$$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$

Björner’s result gives weak order as a complete meet semilattice for arbitrary Coxeter groups; when $W$ is finite, it is a lattice (Dyer, 2011).

The fundamental obstruction in infinite type is the failure of joins for arbitrary pairs. Dyer’s extension replaces finite inversion sets by all biclosed subsets of $\Phi^+$, thereby enlarging the poset while preserving the inversion-set model (Dyer, 2011). A distinct but complementary extension in finite type replaces group elements by faces of the Coxeter permutahedron; the resulting facial weak order restricts to the ordinary weak order on vertices (Dermenjian et al., 2016).

The literature therefore does not use “extended weak order” for a single universal object. Rather, it names several closely related constructions, each preserving weak-order behavior in a larger category. A common misconception is to identify Dyer’s biclosed-set poset with the facial weak order. They are related by shared inversion-set and lattice phenomena, but they are defined on different underlying sets: biclosed root subsets in one case, standard parabolic cosets or faces in the other (Dyer, 2011, Dermenjian et al., 2016).

2. Biclosed subsets of roots and Dyer’s extended weak order

Let $X\subseteq\Phi^+$. In Dyer’s framework, a subset is closed if it is stable under the relevant rank-2 root closure, coclosed if its complement is closed, and biclosed if it is both closed and coclosed. In the 2-closure language, the extended weak order is

$I^d$0

ordered by inclusion (Dyer, 2011). In the equivalent root-sum formulation used in later work, a subset $I^d$1 is closed if it is closed under root-sums in the usual sense, coclosed if its complement is closed, and biclosed if both hold; the resulting poset $I^d$2 of biclosed subsets, ordered by inclusion, is again called the extended weak order (Biagioli et al., 13 Oct 2025).

A foundational fact is that the finite biclosed subsets of $I^d$3 are precisely the inversion sets of elements of $I^d$4. Thus $I^d$5 embeds into $I^d$6, and in finite type every biclosed set is of the form $I^d$7 for a unique $I^d$8, so the extended weak order reduces to the ordinary weak order (Dyer, 2011, Biagioli et al., 13 Oct 2025).

Dyer’s central conjecture is that the extended weak order is always a complete lattice. In affine type this is now established: for an untwisted affine Coxeter group, $I^d$9 is a complete lattice, with

$(W,S)$0

where $(W,S)$1 is biclosed closure and $(W,S)$2 biclosed interior (Barkley et al., 2023). Barkley’s affine-symmetric-group model strengthens the structural picture: for $(W,S)$3, the extended weak order $(W,S)$4 is a quotient of the lattice $(W,S)$5 of translation-invariant total orderings of $(W,S)$6; $(W,S)$7 is profinite, algebraic, and completely semidistributive, and $(W,S)$8 inherits these properties (Barkley, 9 Feb 2025).

The conjectural join formula is more refined. Dyer’s second conjecture describes the join through an algebraic-geometric construction on reflections. In finite type this becomes a statement about the left-reflection set $(W,S)$9. It is proved in types $\Phi^+$0 and $\Phi^+$1, and computationally verified in types $\Phi^+$2 and $\Phi^+$3 using Sage (Biagioli et al., 13 Oct 2025).

3. Facial weak order on permutahedra and arrangements

For a finite Coxeter system $\Phi^+$4, the faces of the permutahedron $\Phi^+$5 are indexed by standard parabolic cosets

$\Phi^+$6

Palacios–Ronco’s facial weak order is generated by two cover types: $\Phi^+$7 and

$\Phi^+$8

Under $\Phi^+$9, ordinary weak order appears as the induced suborder on the vertices (Dermenjian et al., 2016).

Two equivalent characterizations are central. The geometric one uses the root inversion set

$w\in W$0

with

$w\in W$1

The combinatorial one uses minimal and maximal coset representatives: $w\in W$2 in ordinary weak order on $w\in W$3 (Dermenjian et al., 2016).

These descriptions imply that the facial weak order is a lattice. For $w\in W$4 and $w\in W$5,

$w\in W$6

where

$w\in W$7

and

$w\in W$8

Moreover, every lattice congruence of the ordinary weak order induces a lattice congruence of the facial weak order; geometrically, the induced classes are the cones of the fan obtained by gluing chambers of the Coxeter fan that belong to the same weak-order congruence class. The descent congruence yields the facial boolean lattice on the faces of the cube, and Reading’s $w\in W$9-Cambrian congruence yields the facial $$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$0-Cambrian lattice on the faces of the generalized associahedron (Dermenjian et al., 2016).

Dermenjian, Hohlweg, McConville, and Pilaud extended the facial weak order from finite Coxeter groups to essential central hyperplane arrangements. For a chosen base region $$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$1, the facial weak order $$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$2 on all faces has four equivalent descriptions: via intervals in the poset of regions, via cover relations, via oriented-matroid covectors, and via root-inversion-type sets $$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$3 related to the corresponding zonotope. When the poset of regions is a lattice, $$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$4 is a lattice; for simplicial arrangements it is semidistributive, with join-irreducibles characterized by

$$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$5

Topologically, every open interval is either contractible or homotopy-equivalent to a sphere, and the Möbius function is correspondingly either $$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$6 or a sign (Dermenjian et al., 2019).

4. Ambient lattices on root subsets, relations, and continuous paths

One important line of work constructs weak-order-like ambient lattices large enough to contain classical objects as sublattices. For a finite crystallographic root system $$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$7, Gay and Pilaud define an extended weak order on all subsets $$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$8 by

$$P_w=\{\alpha\in\Phi^+\mid \ell(s_\alpha w)<\ell(w)\},$$9

This is a lattice, with

$$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$0

For crystallographic root systems, the induced subposet on antisymmetric closed subsets of roots, the $$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$1-posets, is again a lattice. This ambient lattice contains sublattices corresponding to elements, intervals, and faces of the permutahedron, as well as Cambrian and Boolean analogues associated with generalized associahedra and cubes (Gay et al., 2018).

Chatel, Pilaud, and Pons establish an analogous extension on all reflexive binary relations on $$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$2. If $$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$3 and $$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$4 denote the increasing and decreasing parts of a relation $$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$5, then

$$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$6

with meet and join given by the corresponding Boolean formulas. The restriction to integer posets is again a lattice after appropriate transitive deletion and closure operations. This construction recovers classical weak order on permutations and induced sublattices for intervals and faces of permutahedra and associahedra (Chatel et al., 2017).

Santocanale’s continuous weak order extends multinomial lattices from discrete words to images of continuous monotone paths in the cube $$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$7. If $$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$8 and $$x\le y \quad\Longleftrightarrow\quad P_x\subseteq P_y.$$9 are the images of coordinate-wise monotone continuous maps $W$0 with common endpoints, then

$W$1

The resulting lattice $W$2 is complete and self-dual, fails distributivity when $W$3, and has join-irreducibles parameterized by one-step maps $W$4 and points $W$5. Every element is an, possibly infinite, join of these join-irreducibles, but there are no completely join-irreducible or compact elements. The lattice is the Dedekind–MacNeille completion of the directed colimit of finite multinomial lattices arising from subdivisions of $W$6 (Gouveia et al., 2018).

5. Alternating sign matrices, monotone triangles, and weak-order operators

Hamaker–Reiner’s extension of weak order to alternating sign matrices is encoded by operators $W$7 that minimally modify row $W$8 while preserving the other corner sums. A cover in ASM weak order is

$W$9

for some $\Phi^+$0. Escobar, Klein, and Weigandt place this order on algebro-geometric footing. If $\Phi^+$1 is the ASM variety indexed by $\Phi^+$2, then

$\Phi^+$3

They also prove compatibility with $\Phi^+$4-theoretic divided difference operators: for the double ASM Grothendieck polynomial $\Phi^+$5,

$\Phi^+$6

A derivative formula involving $\Phi^+$7, $\Phi^+$8, and column descents extends the usual Grothendieck-polynomial recurrence, and the whole formalism generalizes to arbitrary unions of matrix Schubert varieties indexed by antichains in strong order (Escobar et al., 26 Feb 2025).

The later compatibility theorem identifies this ASM weak order with the Hamaker–Reiner weak order on monotone triangles under the standard bijection $\Phi^+$9: $X\subseteq\Phi^+$0 The same cover relations admit three explicit realizations. On ASMs, a cover occurs exactly when there is an essential cell in row $X\subseteq\Phi^+$1, and it is produced by toggling a $X\subseteq\Phi^+$2 submatrix. On monotone triangles, it is obtained by lowering one essential entry by $X\subseteq\Phi^+$3. On bumpless pipe dreams, it is realized by a simultaneous undroop of all liftable intervals in row $X\subseteq\Phi^+$4. For fixed $X\subseteq\Phi^+$5, each fiber

$X\subseteq\Phi^+$6

is a sublattice of strong Bruhat order on $X\subseteq\Phi^+$7 (Escobar et al., 11 Jun 2026).

These results show that weak-order operators can govern both combinatorial covering relations and algebro-geometric invariants. This suggests a broader principle: extensions of weak order are often most effective when the order, the operator calculus, and the geometry of the corresponding varieties are compatible.

6. Structural themes, current status, and open problems

Several structural properties recur across the various extensions. First, inversion-set or covector models remain decisive: biclosed subsets of $X\subseteq\Phi^+$8 for Dyer’s order, root inversion sets $X\subseteq\Phi^+$9 for facial weak order, sign-vectors and zonotope rays for arrangements, corner sums for ASMs, and join-continuous coordinate functions for continuous paths (Dyer, 2011, Dermenjian et al., 2016, Dermenjian et al., 2019, Escobar et al., 26 Feb 2025, Gouveia et al., 2018). Second, closure/interior operations typically encode join and meet, whether as 2-closure of unions, biclosed closure and interior, or analogous deletion/closure procedures in induced sublattices (Dyer, 2011, Barkley et al., 2023, Chatel et al., 2017). Third, congruence transport is pervasive: weak-order congruences extend to facial weak order, while quotient constructions in other settings preserve lattice-theoretic information (Dermenjian et al., 2016).

The present state of Dyer’s conjecture is sharply stratified. Finite type is classical. Affine type is established via clean arrangements and suitable total orders on $I^d$00 (Barkley et al., 2023). For the affine symmetric group, the quotient model through translation-invariant total orders gives additional profinite and semidistributive structure (Barkley, 9 Feb 2025). The rank-3 universal Coxeter group provides the first non-spherical, non-affine case where the conjecture is proved: every biclosed set is weakly separable by a real hyperplane, implying that the extended weak order is a lattice (Barkley et al., 31 Aug 2025).

The open problems are correspondingly precise. Dyer’s general lattice-property conjecture remains open for arbitrary Coxeter systems (Biagioli et al., 13 Oct 2025). The join-formula conjecture is proved in types $I^d$01 and $I^d$02, verified computationally in $I^d$03 and $I^d$04, and open in further types including $I^d$05, $I^d$06, $I^d$07, and $I^d$08 (Biagioli et al., 13 Oct 2025). A plausible implication is that methods based on separability, clean arrangements, or profinite semidistributive models may continue to propagate to broader classes, but that extrapolation is not yet a theorem in the cited sources.

A second misconception is that once a weak order is extended to a lattice, it should also be distributive. The continuous weak order explicitly shows otherwise: $I^d$09 is self-dual and complete, but when $I^d$10 it is not distributive (Gouveia et al., 2018). The shared conclusion across the literature is therefore not distributivity, but the more flexible package of lattice existence, semidistributivity in special cases, explicit irreducibles, and geometric realization.

In this broader sense, extended weak order has become a unifying framework for relating Coxeter combinatorics, hyperplane arrangements, root-system closure operators, generalized permutahedral geometry, and algebro-geometric models such as ASM varieties. The term now denotes not merely one poset, but an active program of extending weak-order methods to larger combinatorial and geometric universes while preserving the inversion-theoretic backbone that makes weak order tractable.