--- title: Echelonmotion in Finite Posets url: https://www.emergentmind.com/topics/echelonmotion type: topic --- # Echelonmotion in Finite Posets Searching arXiv for the cited papers and related work on echelonmotion to ground the article. Echelonmotion is a bijection attached to a finite poset together with a chosen linear extension. In the formulation of Defant–Jiang–Marczinzik–Segovia–Speyer–Thomas–Williams, one forms a Cartan matrix from the order relation, locates the unique Bruhat cell of $GL_n(\mathbb{C})$ containing that matrix, and reads the associated permutation matrix back as a permutation of the poset. The resulting map, denoted $\mathrm{Ech}_\sigma$, is the inverse of the Coxeter permutation studied by Klász, Marczinzik, and Thomas. Its central significance is that it recovers rowmotion in broad lattice-theoretic settings, exhibits involutive behavior on Eulerian posets, and supports structural characterizations of $\sigma$-independence and new results in modular lattice theory [2507.18230]. ## 1. Definition through Cartan matrices and Bruhat decomposition Let $R$ be a finite poset of size $n$, and fix a linear extension $\sigma\colon R\to[n]$, meaning that $\sigma$ is a bijection with $\sigma(x)\le \sigma(y)$ whenever $x\le y$ in $R$. The Cartan matrix $W^{R,\sigma}=(W_{i,j})_{1\le i,j\le n}$ is defined by $$ W^{R,\sigma}_{i,j}= \begin{cases} 1,&\text{if }\sigma^{-1}(i)\ge \sigma^{-1}(j)\text{ in }R,\\ 0,&\text{otherwise.} \end{cases} $$ Because $W^{R,\sigma}$ is lower-triangular with all diagonal entries $1$, it is invertible and lies in the big cell of the Bruhat decomposition $$ GL_n(\mathbb{C})=\bigsqcup_{P\in S_n} B\,P\,B, $$ where $B$ is the subgroup of invertible upper-triangular matrices and each $P$ is an $n\times n$ permutation matrix. Hence there is a unique permutation matrix $P^{R,\sigma}$ such that $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$ [2507.18230]. Echelonmotion with respect to $\sigma$ is then the bijection $\mathrm{Ech}_\sigma\colon R\to R$ determined by $$ \mathrm{Ech}_\sigma(x)=y \quad\Longleftrightarrow\quad P^{R,\sigma}_{\sigma(y),\sigma(x)}=1. $$ Equivalently, if $W=U\,P\,V$ with $U$ and $V$ upper-triangular and $P=P^{R,\sigma}$, then $\mathrm{Ech}_\sigma$ is the permutation underlying that factorization after relabeling by $\sigma$. The permutation matrix can also be recovered by rank conditions on lower-left submatrices: for $1\le i,j\le n$, one has $P_{i,j}=1$ if and only if $$ \operatorname{rank}(W_{\ge i+1,\le j-1}) = \operatorname{rank}(W_{\ge i+1,\le j}) = \operatorname{rank}(W_{\ge i,\le j-1}) = \operatorname{rank}(W_{\ge i,\le j})-1. $$ An explicit example appears for the $5$-element distributive lattice $J(Q)$ of a $3$-element poset, where the paper writes $$ W^{R,\sigma}= \begin{pmatrix} 1&0&0&0&0\\ 1&1&0&0&0\\ 1&0&1&0&0\\ 1&1&1&1&0\\ 1&1&1&1&1 \end{pmatrix}, \qquad P^{R,\sigma}= \begin{pmatrix} 0&0&0&1&0\\ 0&0&1&0&0\\ 0&1&0&0&0\\ 0&0&0&0&1\\ 1&0&0&0&0 \end{pmatrix}, $$ and the induced permutation agrees with classical rowmotion. ## 2. Agreement with rowmotion on semidistributive lattices The primary structural theorem identifies echelonmotion with rowmotion on semidistributive lattices. Recall that a lattice $L$ is meet-semidistributive if whenever $x\le y$ the set $\{z: z\wedge y=x\}$ has a greatest element; join-semidistributive is defined dually; and semidistributive means both hold. Barnard’s rowmotion on a semidistributive lattice may be defined via the canonical edge-labelling by join-irreducibles. Equivalently, using the pop-stack operator $$ \operatorname{Pop}_L(x)=\bigwedge\bigl(\{x\}\cup \operatorname{Cov}_L^{\downarrow}(x)\bigr), $$ one has $$ \operatorname{Row}_L(x)=\max\{z\in L: z\wedge x=\operatorname{Pop}_L(x)\}. $$ Defant–Williams showed the equivalence of these descriptions, and Defant–Jiang–Marczinzik–Segovia–Speyer–Thomas–Williams used them to prove that for a semidistributive lattice $L$ and any linear extension $\sigma$, $$ \mathrm{Ech}_\sigma=\operatorname{Row}_L. $$ In particular, $L$ is echelon-independent [2507.18230]. The proof strategy depends on the interaction between Bruhat rank tests and Möbius-theoretic information. In any semidistrim lattice, hence in particular in any semidistributive lattice, the Möbius function $\mu_L(\operatorname{Pop}_L(x),x)$ is always $\pm 1$, so the interval $[\operatorname{Pop}_L(x),x]$ contributes a nonzero coefficient in the Bruhat-rank tests. Writing $\alpha(x)=\max_\sigma\{z\in L:z\wedge x=\operatorname{Pop}_L(x)\}$, Corollary 3.6 in the paper shows that whenever $\mu_L(\operatorname{Pop}_L(x),x)\neq 0$ and $\alpha\colon L\to L$ is a bijection, the rank tests force $\mathrm{Ech}_\sigma(x)=\alpha(x)$. In the semidistributive case, $\mu=\pm1$ and $\alpha(x)=\operatorname{Row}_L(x)$, yielding the equality. The converse is equally sharp: every echelon-independent lattice is semidistributive. This rules out the stronger but false expectation that $\sigma$-independence should be automatic for lattices in general. Within lattice theory, semidistributivity is exactly the criterion for independence of the chosen linear extension. ## 3. Trim lattices and vertebral linear extensions Trim lattices provide a second major class in which echelonmotion agrees with rowmotion, but the mechanism is more selective. A trim lattice is an extremal lattice, meaning $|J_L|=|M_L|=k$ and there is a maximal chain of length $k+1$, that is also left-modular. Thomas–Williams defined rowmotion on any trim lattice; when the lattice is also semidistributive, this agrees with Barnard’s rowmotion. The result of Defant–Jiang–Marczinzik–Segovia–Speyer–Thomas–Williams is that every trim lattice admits a distinguished family of linear extensions for which echelonmotion coincides with rowmotion [2507.18230]. More precisely, one chooses a maximal chain $$ C=\{\hat{u}_0<\hat{u}_1<\cdots<\hat{u}_k\}, $$ and labels each cover $x