Toggleability Spaces in Poset Dynamics
- Toggleability Spaces are defined as affine combinations of toggle statistics on order ideals and antichains, capturing key homomesic properties under rowmotion.
- They bridge local toggle combinatorics and global dynamical invariants by offering explicit bases and rank-plus-one dimension formulas for various poset families.
- Applications include linking rook statistics and piecewise-linear and birational rowmotion, with concrete examples in products of chains, shifted staircases, and fences.
Toggleability spaces are spaces of statistics on order ideals or antichains of a finite poset that admit two simultaneous descriptions: as affine combinations of toggleability statistics and as linear combinations of indicator statistics. For a finite poset with order-ideal set $\J(P)$, the order-ideal toggleability space is
and the antichain analogue is obtained by intersecting the same affine span with . These spaces arise from the fact that each toggleability statistic is $0$-mesic under rowmotion, so affine combinations of toggles furnish homomesic statistics. Recent results determine the dimensions of these spaces for products of chains, shifted staircases, type- and type- root posets, restricted diagrams, and fences, and connect the subject to rook statistics and to piecewise-linear and birational rowmotion (Adenbaum et al., 20 Aug 2025, Mertin et al., 2024).
1. Formal definitions
Let be a finite poset and $\J(P)$ its set of order ideals. For each $\J(P)$0, three $\J(P)$1–$\J(P)$2-valued statistics on $\J(P)$3 are used repeatedly: $\J(P)$4 and
$\J(P)$5
The toggleability statistic at $\J(P)$6 is
$\J(P)$7
so that
$\J(P)$8
The dimension of $\J(P)$9 or 0 is the dimension of the corresponding real vector space. Concretely, the problem is to find a basis of independent affine functions in 1 whose restrictions to 2 remain independent. In the fence setting, the analogous spaces are denoted 3 and 4; they consist of all real-valued statistics on ideals or antichains expressible as a constant plus a linear combination of toggleabilities (Mertin et al., 2024).
The dual antichain side uses antichain toggles and antichain toggleability statistics 5. The available results treat order ideals and antichains in parallel, but the proofs often use different bases and different triangularity arguments.
2. Rowmotion, toggles, and homomesy
For a finite poset 6, rowmotion on order ideals is
7
Cameron–Fon-der-Flaass showed that 8 can be presented as the product of all toggles in any linear extension order, and Striker proved that each 9 is 0-mesic under rowmotion. Consequently, every affine combination
1
is 2-mesic. This is the basic reason toggleability spaces matter: they isolate those indicator-type statistics that are automatically homomesic under rowmotion (Adenbaum et al., 20 Aug 2025).
The fence results make this mechanism explicit. Every element of 3 or 4 is homomesic under rowmotion, because it is, by definition, a constant plus a linear combination of toggleabilities. The same paper further states that when
5
on ideals, one may lift 6 to a piecewise-linear statistic 7 on 8 and to a birational statistic 9 on 0, and these lifts remain homomesic under the corresponding generalizations of rowmotion (Mertin et al., 2024).
This places toggleability spaces within dynamical algebraic combinatorics. The dimensions computed in recent work do not merely enumerate linear relations; they describe the size of the linear homomesy space accessible from toggle statistics under rowmotion.
3. Dimension formulas for major poset families
A uniform theorem identifies the dimensions of both order-ideal and antichain toggleability spaces for several classical families. Let 1 denote the rank of 2, defined as one less than the maximum size of a chain. Then for each family below,
3
| Family | Realization | Dimension |
|---|---|---|
| 4, 5 | product of two chains | 6 |
| 7 | shifted staircase | 8 |
| 9 | cells on or below the anti-diagonal | $0$0 |
| $0$1 | cells on or below both diagonal and anti-diagonal | $0$2 |
| restricted diagrams | simply-connected, row- and column-convex, no outward corners; equivalently order ideals of a finite width-two poset | $0$3 |
These results were proved for products of chains, shifted staircases, type-$0$4 root posets, type-$0$5 posets, and the broader restricted-diagram family (Adenbaum et al., 20 Aug 2025).
The examples in the same work illustrate the theorem concretely. For $0$6, $0$7, hence $0$8; a basis is indexed by the six diagonals $0$9, 0. For the shifted staircase 1, the rank is 2, so the dimension is 3. For 4, the rank is 5, so the dimension is 6, and the five toggling sums correspond to lines of slope 7 crossing the anti-diagonal. For 8, the rank is 9 and the dimension is 0, with diagonal classes 1.
A common oversimplification is to regard the formula 2 as universal. The Ferrers-diagram result shows otherwise: for a Ferrers-diagram poset 3 associated to an integer partition 4, if 5 is the number of cells in the border strip of 6 and 7 the number of its corners, then
8
which in general differs from 9 (Adenbaum et al., 20 Aug 2025).
4. Fence posets and explicit bases
A fence poset is specified by a positive integer 0 and positive integers 1 with 2. The fence
3
has segments
4
with identifications 5 for 6. Thus 7 consists of alternating chains sharing endpoints. A shared element is a peak if it covers two elements, or a valley if it is covered by two elements; the remaining elements are unshared.
For fences, the order-ideal and antichain toggleability spaces are completely described. The dimensions are
8
Moreover, both spaces admit explicit bases. If 9 is an unshared element of segment $\J(P)$0, then
$\J(P)$1
forms a basis element of $\J(P)$2, where $\J(P)$3 if $\J(P)$4 and $\J(P)$5 otherwise. On the order-ideal side,
$\J(P)$6
forms a basis element of $\J(P)$7, where $\J(P)$8 if $\J(P)$9 and $\J(P)$00 otherwise (Mertin et al., 2024).
The structural characterization is equally explicit. Both $\J(P)$01 and $\J(P)$02 decompose non-canonically as direct sums
$\J(P)$03
where each $\J(P)$04 has dimension $\J(P)$05 and is spanned by basis elements supported on the $\J(P)$06th segment. Key lemmas show that no toggleability statistic of a peak can appear in a non-trivial expression of an antichain or order-ideal statistic that lies in the other space, and that the span of peak indicators has trivial intersection with $\J(P)$07, while the span of valley indicators has trivial intersection with $\J(P)$08. Together these imply that the codimension of the toggleability space inside the full indicator span is exactly $\J(P)$09 (Mertin et al., 2024).
These fence results complement the rank-based formulas for width-two distributive lattices. The paper on restricted diagrams states that the width-two generalization recovers the product-of-chains and shifted-staircase cases, while the fence paper gives a complete basis-level description for the distinct fence family.
5. Proof techniques: local relations, diagonal bases, and rook statistics
The dimension proofs for products of chains, shifted staircases, root posets, and restricted diagrams proceed in two complementary stages. The upper bound
$\J(P)$10
is obtained by forcing the coefficients $\J(P)$11 in
$\J(P)$12
to satisfy local relations. Two named lemmas are central. The diamond lemma states that if $\J(P)$13 and $\J(P)$14 form a diamond, then $\J(P)$15. The root-zero lemma states that if $\J(P)$16 are incomparable minimal-cover neighbors of $\J(P)$17, then $\J(P)$18. In $\J(P)$19, the diamond lemma yields $\J(P)$20, so coefficients are constant along diagonals $\J(P)$21, leaving at most $\J(P)$22 degrees of freedom; an additional relation from the minimal elements determines the affine constant $\J(P)$23 and gives the sharp bound (Adenbaum et al., 20 Aug 2025).
The lower bound
$\J(P)$24
is obtained by constructing explicit independent toggle combinations. In $\J(P)$25, one sets
$\J(P)$26
and when $\J(P)$27 includes a $\J(P)$28 so that $\J(P)$29. These $\J(P)$30 functions are linearly independent. The unique-cover chain lemma provides another explicit mechanism: if $\J(P)$31 has a unique lower cover $\J(P)$32 and unique upper cover $\J(P)$33, then
$\J(P)$34
lies in $\J(P)$35 (Adenbaum et al., 20 Aug 2025).
Equality for $\J(P)$36 uses rook statistics, first introduced by Chan–Haddadan–Hopkins–Moci for homomesy. In the restricted-diagram setting, the rook at cell $\J(P)$37 is defined by a signed sum of $\J(P)$38 and $\J(P)$39 terms, including two correction sums along the opposite corners, and the rook-evaluation lemma asserts that
$\J(P)$40
for every order ideal $\J(P)$41. This allows one to express each indicator $\J(P)$42, up to toggle combinations, as an upper-triangular combination of antichain toggles $\J(P)$43. The reduced rooks attached to southeast boundary cells then provide $\J(P)$44 linearly independent elements of $\J(P)$45, yielding the lower bound and hence equality (Adenbaum et al., 20 Aug 2025).
For fences, the proofs are organized differently but follow the same dimension-theoretic pattern: first show each basis element $\J(P)$46 lies in the corresponding toggleability space by writing it as a constant plus an $\J(P)$47-combination of toggleabilities; then prove linear independence by evaluation on carefully chosen ideals or antichains; and finally show that no larger dimension is possible using relations among indicator functions (Mertin et al., 2024).
6. Homomesy consequences, lifts, and open directions
Because toggleability spaces are defined via affine combinations of $\J(P)$48-mesic toggle statistics, every element of $\J(P)$49, $\J(P)$50, $\J(P)$51, or $\J(P)$52 yields a rowmotion homomesy. The fence paper makes several of these consequences explicit. For any fence $\J(P)$53, for each segment $\J(P)$54 and any two unshared positions $\J(P)$55, the difference
$\J(P)$56
is $\J(P)$57-mesic. When $\J(P)$58 for all $\J(P)$59, the total number of antichain elements $\J(P)$60 is $\J(P)$61-mesic. On the order-ideal side, for each segment $\J(P)$62 and $\J(P)$63,
$\J(P)$64
is $\J(P)$65-mesic (Mertin et al., 2024).
The same paper proves opposite-element homomesies on self-dual fences. If $\J(P)$66 is palindromic, with $\J(P)$67 odd, then the order-reversing involution $\J(P)$68 yields
$\J(P)$69
and
$\J(P)$70
By the lifting results of Einstein–Propp and Hopkins cited there, these combinatorial homomesies tropicalize and detropicalize to corresponding piecewise-linear and birational homomesies. The explicit lifted toggleability statistics are
$\J(P)$71
for piecewise-linear rowmotion and
$\J(P)$72
for birational rowmotion (Mertin et al., 2024).
The broader dimension results point in the same direction. The restricted-diagram paper states that these toggleability spaces classify all linear homomesies under rowmotion on the lattices under consideration, thereby linking the subject to rowmotion and the toggle group. It also records several open problems: identifying other families where $\J(P)$73, finding combinatorial interpretations of bases in more general distributive lattices, and exploring the relation between rook-statistics homomesy and other actions such as promotion and gyration (Adenbaum et al., 20 Aug 2025).
Taken together, these results show that toggleability spaces form a precise interface between local toggle combinatorics and global dynamical invariants. The known families exhibit two complementary phenomena: exact rank-plus-one dimension formulas in several geometrically rigid diagram classes, and explicit segmentwise bases in fences. A plausible implication is that future progress will continue to depend on identifying poset-specific local relations—such as diamond equalities, root-zero vanishing, or rook evaluations—that rigidify the affine toggle span enough to make its indicator intersection computable.