Echelonmotion Operator in Posets

• Echelonmotion operator is a bijection on finite posets defined from the Cartan matrix and Bruhat factorization derived from a linear extension.
• It generalizes rowmotion in distributive, semidistributive, and trim lattices, offering bijective proofs of classical results such as Dilworth's theorem.
• It reveals structural symmetries by equating lower and upper cover counts and provides efficient algorithmic tests for echelon-independence in posets.

The echelonmotion operator, denoted $\mathrm{Ech}_\sigma$, is a canonical bijection on the underlying set of a finite poset $R$, defined in terms of the Cartan matrix associated with a linear extension $\sigma$ of $R$ and its Bruhat factorization. Initially formulated by Defant et al., echelonmotion interconnects combinatorics, algebraic geometry, and the theory of lattice and poset symmetries, and yields new insights and short bijective proofs in classical enumerative combinatorics, notably of Dilworth's theorem. The operator aligns closely with the classical rowmotion operator on specific classes of posets and lattices—especially distributive and semidistributive lattices—while exhibiting rich structural and classification phenomena in broader settings (Defant et al., 24 Jul 2025, Defant, 19 May 2026).

1. Definition and Construction of Echelonmotion

Let $R$ be a finite poset of cardinality $n$, and let $\sigma: R \to \{1,2,\dots,n\}$ be a linear extension; that is, a bijection such that $x \leq y$ in $R$ implies $\sigma(x)\leq\sigma(y)$. Define the $R$0 Cartan matrix $R$1 by

$R$2

By the Bruhat decomposition for $R$3, every invertible matrix lies in a unique double coset $R$4 for $R$5 the group of invertible upper-triangular matrices and $R$6 a permutation matrix. There exists a unique $R$7 such that $R$8.

The echelonmotion operator $R$9 is defined by

$\sigma$0

This mapping is always a bijection on $\sigma$1 (Defant et al., 24 Jul 2025).

2. Echelonmotion and Rowmotion: Lattice Classes

The action of $\sigma$2 is closely related to the rowmotion operator, a central object in dynamical algebraic combinatorics. For distributive lattices, Klász, Marczinzik, and Thomas proved $\sigma$3 classical rowmotion for any $\sigma$4. Defant et al. established the following generalizations:

• Semidistributive Lattices: A finite lattice $\sigma$5 is semidistributive if it satisfies specific meet- and join-semidistributive laws. Barnard’s generalization of rowmotion, defined using canonical up/down-labeling, coincides with $\sigma$6 for all linear extensions $\sigma$7. Thus, every semidistributive lattice is echelon-independent (the definition appears below).
• Trim Lattices: For trim lattices, which generalize distributive lattices, there exists a special "vertebral" linear extension $\sigma$8 for which $\sigma$9 agrees with the trim rowmotion defined via the Galois graph on the join-irreducibles.

The table below summarizes the correspondence between $R$0 and rowmotion in various lattice classes:

Lattice Class	$R$1 Rowmotion?	Condition on $R$2
Distributive	Yes	Any
Semidistributive	Yes	Any
Trim, not semidistributive	Yes	Special vertebral $R$3 only

The coincidence with rowmotion highlights the fundamental nature of the echelonmotion operator in algebraic combinatorics (Defant et al., 24 Jul 2025).

3. Echelonmotion on Modular and Eulerian Posets

For finite modular lattices, Defant et al. proved a conjecture relating the cover structure of $R$4 with its image under $R$5. For $R$6,

$R$7

where $R$8 denotes lower covers and $R$9 denotes upper covers of $R$0. This induces a canonical bijection between elements with $R$1 lower covers and those with $R$2 upper covers, furnishing a new bijective proof of Dilworth’s theorem for modular lattices (Defant, 19 May 2026).

If $R$3 is a graded Eulerian poset (Möbius function alternating by rank), then for any $R$4, the Bruhat factor $R$5 satisfies $R$6. Consequently, $R$7 is an involution: $R$8 (Defant et al., 24 Jul 2025).

4. Echelon-Independent Posets

A poset $R$9 is echelon-independent if $n$0 gives the same bijection for all linear extensions $n$1. Defant et al. proved:

• A finite lattice $n$2 is echelon-independent if and only if $n$3 is semidistributive.
• Every connected echelon-independent poset is bounded.
• The MacNeille completion of any connected echelon-independent poset is semidistributive.

These characterizations connect the algebraic property of echelon-independence to fundamental lattice-theoretic structure (Defant et al., 24 Jul 2025).

5. Algorithms for Testing Echelon-Independence

Rather than enumerating all linear extensions, efficient tests exist. When $n$4 and $n$5 are comparable, only two carefully chosen linear extensions must be examined; otherwise, four suffice. These checks are performed by verifying “rank-drop” conditions on small submatrices of $n$6, leveraging properties of the Cartan matrix and its Bruhat decomposition (Defant et al., 24 Jul 2025).

6. Illustrative Examples

• In the four-element modular “diamond” lattice, $n$7 acts as the reverse permutation, explicitly pairing elements and directly verifying the cover count correspondence, thus providing a concrete bijective proof of Dilworth's result in this instance (Defant, 19 May 2026).
• For the pentagon lattice (semidistributive, not distributive), $n$8 agrees with Barnard’s rowmotion for all $n$9.
• In the non-semidistributive trim lattice on seven elements, only the special vertebral extension yields $\sigma: R \to \{1,2,\dots,n\}$0 rowmotion.
• On the Boolean lattice (Eulerian), $\sigma: R \to \{1,2,\dots,n\}$1 for every $\sigma: R \to \{1,2,\dots,n\}$2.
• The Bruhat order on $\sigma: R \to \{1,2,\dots,n\}$3 is not echelon-independent, even though its MacNeille completion is distributive; $\sigma: R \to \{1,2,\dots,n\}$4 is echelon-independent (Defant et al., 24 Jul 2025, Defant, 19 May 2026).

7. Structural and Theoretical Implications

The echelonmotion operator unifies Bruhat-theoretic concepts with dynamical combinatorics on posets and lattices. Its relationships with rowmotion, cover-structure bijections, and semidistributivity reveal deep ties between combinatorial and linear-algebraic frameworks. The application to bijective proofs of classical theorems (notably Dilworth's theorem for modular lattices) demonstrates its enumerative power and theoretical utility (Defant, 19 May 2026). Its involutive nature on Eulerian posets and fixed points in certain classes may suggest new directions in dynamical algebraic combinatorics and categorical approaches to combinatorial dynamics.

References:

• "Rowmotion and Echelonmotion" (Defant et al., 24 Jul 2025)
• "Short Proofs in Algebraic and Enumerative Combinatorics" (Defant, 19 May 2026)