Echelon-Independent Posets in Finite Order

• Echelon-independent posets are finite posets where the permuted structure derived from the Bruhat decomposition of their Cartan matrix is independent of the chosen linear extension.
• They connect poset dynamics by equating echelonmotion with rowmotion in semidistributive lattices, and impose strong constraints like boundedness and absence of fixed points in connected cases.
• The theory introduces a combinatorial-matrix test and efficient algorithmic criteria that offer practical methods for verifying echelon-independence in various poset classes.

Echelon-independent posets are finite posets whose echelonmotion is independent of the chosen linear extension. Given a linear extension $\sigma$ of a finite poset $R$, one forms a lower-triangular Cartan matrix $W^{R,\sigma}$, extracts the unique permutation matrix $P^{R,\sigma}$ in the Bruhat decomposition $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$, and then reads off a bijection $Ech_\sigma:R\to R$. A poset is echelon-independent precisely when this bijection is intrinsic to the poset rather than an artifact of labeling. The subject was initiated in “Rowmotion and Echelonmotion” (Defant et al., 24 Jul 2025), which also shows that finite lattices are echelon-independent exactly when they are semidistributive, and that connected echelon-independent posets satisfy strong boundedness and completion constraints.

1. Definition via echelonmotion

Let $R$ be a finite poset with $|R|=n$, and let $\sigma:R\to [n]$ be a linear extension, meaning

$$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$

The associated Cartan matrix is

$R$0

Because $R$1 is a linear extension, $R$2 is lower triangular with $R$3's on the diagonal, hence invertible. The Bruhat decomposition of $R$4 yields a unique permutation matrix $R$5 such that

$R$6

where $R$7 is the group of upper-triangular invertible matrices in $R$8 (Defant et al., 24 Jul 2025).

The resulting permutation of $R$9 is echelonmotion with respect to $W^{R,\sigma}$0: $W^{R,\sigma}$1 defined by the rule that $W^{R,\sigma}$2 if and only if $W^{R,\sigma}$3 has a $W^{R,\sigma}$4 in row $W^{R,\sigma}$5 and column $W^{R,\sigma}$6. The paper also notes that $W^{R,\sigma}$7 is the Coxeter permutation studied by Klász, Marczinzik, and Thomas.

A finite poset $W^{R,\sigma}$8 is therefore echelon-independent if

$W^{R,\sigma}$9

for all linear extensions $P^{R,\sigma}$0 of $P^{R,\sigma}$1. This is a rigidity property: the definition of $P^{R,\sigma}$2 visibly depends on $P^{R,\sigma}$3, yet in an echelon-independent poset that dependence disappears.

The paper also gives a direct criterion for determining whether $P^{R,\sigma}$4. Writing

$P^{R,\sigma}$5

and

$P^{R,\sigma}$6

one has $P^{R,\sigma}$7 if and only if there exist maps

$P^{R,\sigma}$8

with $P^{R,\sigma}$9, $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$0, the sums over $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$1 and $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$2 nonzero, and the analogous sums for every $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$3 and every $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$4 equal to $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$5. This provides the paper’s main combinatorial-matrix test for specific images under echelonmotion.

2. Relation to rowmotion and the lattice characterization

The decisive theorem concerns lattices. In distributive lattices, Klász, Marczinzik, and Thomas had already shown that echelonmotion agrees with rowmotion. The 2025 paper generalizes this from distributive lattices to semidistributive lattices and then identifies echelon-independence exactly (Defant et al., 24 Jul 2025).

For distributive lattices $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$6, rowmotion is given by

$W^{R,\sigma}\in B\,P^{R,\sigma}\,B$7

where $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$8 is the upper order ideal generated by $W^{R,\sigma}\in B\,P^{R,\sigma}\,B$9. For semidistributive lattices, the paper uses Barnard’s rowmotion $Ech_\sigma:R\to R$0, characterized by

$Ech_\sigma:R\to R$1

and also the Defant–Williams formulation via

$Ech_\sigma:R\to R$2

together with

$Ech_\sigma:R\to R$3

The central theorem is:

$Ech_\sigma:R\to R$4

More precisely, if $Ech_\sigma:R\to R$5 is semidistributive, then

$Ech_\sigma:R\to R$6

for every linear extension $Ech_\sigma:R\to R$7 of $Ech_\sigma:R\to R$8. Conversely, every echelon-independent lattice is semidistributive. This result is conceptually notable because semidistributivity is an internal lattice-theoretic condition, whereas echelonmotion is defined by Cartan matrices, Schubert cells, and Bruhat decomposition; the theorem identifies the two viewpoints.

This also clarifies the status of several familiar classes. Distributive lattices are echelon-independent because they are semidistributive. More broadly, the paper lists intervals in weak order on Coxeter groups, facial weak orders of simplicial hyperplane arrangements, Cambrian lattices, $Ech_\sigma:R\to R$9-Tamari lattices, framing lattices, and lattices of torsion classes of finite-dimensional algebras as semidistributive examples, hence echelon-independent.

The paper also isolates a weaker phenomenon for trim lattices. It defines vertebral linear extensions and proves that if $R$0 is trim and $R$1 is vertebral, then

$R$2

This does not imply echelon-independence: agreement with rowmotion for some chosen $R$3 is strictly weaker than independence from all $R$4.

3. Structural restrictions on connected echelon-independent posets

Outside the lattice setting, the paper proves strong necessary conditions. If $R$5 is a connected echelon-independent poset, then $R$6 must be bounded, meaning it has both a minimum element $R$7 and a maximum element $R$8 (Defant et al., 24 Jul 2025). The proof uses a lemma stating that if $R$9 is minimal and $|R|=n$0 is maximal with $|R|=n$1, then there exists a linear extension $|R|=n$2 with $|R|=n$3, $|R|=n$4, and for any such $|R|=n$5,

$|R|=n$6

If a connected poset had two distinct maximal elements, linear extensions could be chosen to send the same minimal element to different echelonmotion images, contradicting echelon-independence.

A second restriction is dynamical: if $|R|=n$7 is an echelon-independent connected poset of cardinality at least $|R|=n$8, then its echelonmotion has no fixed points. Thus connected echelon-independent posets cannot support a canonical echelonmotion with stationary elements.

A third restriction concerns completion. The MacNeille completion of an echelon-independent connected poset is a semidistributive lattice. Since the MacNeille completion is the smallest lattice completion, this places a strong lattice-theoretic constraint on any connected example. However, the converse fails. The paper gives a connected poset that is not echelon-independent even though its MacNeille completion is a Boolean lattice of size $|R|=n$9, hence distributive and semidistributive. It also notes that the strong Bruhat order on $\sigma:R\to [n]$0 has distributive MacNeille completion but is not echelon-independent.

These results show that, beyond lattices, echelon-independence is stricter than merely having a well-behaved completion. It forces boundedness, absence of fixed points, and semidistributivity of the completion, but those conditions do not characterize the class.

A related but logically separate theorem concerns Eulerian posets. For an Eulerian poset $\sigma:R\to [n]$1, and for every linear extension $\sigma:R\to [n]$2, the map $\sigma:R\to [n]$3 is an involution. This is a uniform dynamical property, but it does not imply echelon-independence, because the involutions for different $\sigma:R\to [n]$4 need not coincide.

4. Examples, counterexamples, and computation

The most important examples are semidistributive lattices, since the lattice classification is complete. In these cases echelonmotion is canonical and coincides with rowmotion. The paper also includes a worked example on a $\sigma:R\to [n]$5-element distributive lattice $\sigma:R\to [n]$6, computes $\sigma:R\to [n]$7 and $\sigma:R\to [n]$8 explicitly for one linear extension, and verifies that the resulting permutation agrees with rowmotion (Defant et al., 24 Jul 2025).

Counterexamples are equally informative. A connected poset may have semidistributive, even distributive, MacNeille completion and still fail to be echelon-independent. The paper gives such a connected example with Boolean completion of size $\sigma:R\to [n]$9. It also reports an algorithmic computation for Bruhat order on symmetric groups: Bruhat order on $$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$0 is echelon-independent for $$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$1, but not for $$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$2. More concretely, for

$$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$3

in one-line notation, one linear extension yields $$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$4, while for a suitable $$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$5,

$$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$6

The paper also develops practical tests for echelon-independence. If one first computes

$$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$7

for one chosen linear extension $$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$8, then:

• if $$\sigma(x)\le \sigma(y)\quad\text{whenever }x\le y\text{ in }R.$$9 and $R$00 are comparable, it suffices to test two specially chosen linear extensions $R$01;
• if $R$02 and $R$03 are incomparable, it suffices to test four specially chosen linear extensions $R$04.

This yields an algorithm requiring one initial echelonmotion computation and then rank computations for at most $R$05 matrices of size at most $R$06. The result is computational access to the notion without enumerating all linear extensions.

5. Related but distinct notions

Several nearby notions in poset theory use the language of independence, echelon-like structure, or matrix encoding, but they are not the same as echelon-independence. The distinction is substantive rather than terminological.

Notion	Defining feature in the source	Relation to echelon-independent posets
c-independence	Subsets are independent when the complemented order matrix admits a nonsingular triangular witness submatrix over the superboolean semiring (Izhakian et al., 2011)	Different notion of independence; matrix-triangular but not echelonmotion
Factorial / primitive $R$07-free posets	Predecessor sets are initial segments, and primitive means $R$08 [(Claesson et al., 2010); (Dukes et al., 2010)]	Echelon-like labeling structure, but unrelated to $R$09
Anatomic lattices / skeletal posets	Extensions preserving all principal-ideal heights $R$10; common label-$R$11 covers form $R$12 (La, 15 Jun 2026)	Height-preservation under refinement, not linear-extension independence
Permutation-similarity classes of poset matrices	Naturally labeled posets are encoded by Boolean unit lower triangular matrices up to permutation similarity (Cheon et al., 4 Feb 2026)	Matrix classification of posets, but no echelonmotion or independence criterion
Independence posets	Tight orthogonal pairs of independent sets in an acyclic digraph ordered by flips (Thomas et al., 2018)	Uses “independence poset” in a different sense; related instead to trim lattices and rowmotion generalizations

These comparisons help avoid a common misconception: the adjective “echelon” elsewhere in poset theory may refer to initial-segment behavior, lower-triangular matrices, or witness minors, but echelon-independent posets in the strict sense are defined only by the invariance of $R$13 across all linear extensions.

6. Indirect structural lenses and current scope

The direct theory of echelon-independent posets is still limited outside the lattice case. The 2025 paper initiates the subject by giving a complete characterization for lattices, several necessary conditions for connected posets, examples, counterexamples, and algorithms, but not a full classification for general finite posets (Defant et al., 24 Jul 2025).

An indirect structural lens comes from a separate Cayley-type representation theorem for posets with the Ascending Chain Condition. That theorem shows that any such poset $R$14 embeds isomorphically into

$R$15

via

$R$16

where $R$17 is the poset of antichains of $R$18 under the domination order. This theorem does not mention echelon-independent posets, but it provides a canonical representation of an ACC poset by antichain-valued maps built from maximal common lower bounds (Chajda et al., 30 Jan 2026). This suggests an additional way to analyze special subclasses: echelon-independence is defined through linear extensions and Bruhat cells, whereas the Cayley representation records how elements interact with lower cones. A plausible implication is that comparing these two encodings could be useful when studying nonlattice examples.

Within current knowledge, the decisive facts are therefore these. A finite poset is echelon-independent exactly when its echelonmotion is independent of linear extension. In lattices this is equivalent to semidistributivity. In connected nonlattice cases, boundedness, absence of fixed points, and semidistributive MacNeille completion are necessary, but not sufficient. The classification problem beyond lattices remains open, and the subject presently sits at the intersection of rowmotion, Bruhat-theoretic matrix constructions, and structural poset completion theory.