Strong Formal Subdivision Theory
- Strong formal subdivision is an order-preserving, rank-increasing surjective map between lower Eulerian posets, defined by a strict local Euler characteristic condition.
- It arises from a canonical mapping cylinder construction that establishes a bijection with join-admissible triples, linking combinatorial, topological, and algebraic properties.
- Applications include polytope subdivisions, fan morphisms, and computations of invariants such as the cd-index and local h-polynomials in both standard and equivariant contexts.
A strong formal subdivision is an order-preserving, rank-increasing surjective morphism between lower Eulerian posets that satisfies a strict local Euler characteristic condition. This concept simultaneously abstracts polyhedral subdivisions of polytopes and proper surjective morphisms of fans, encapsulating their combinatorial, topological, and algebraic properties. The framework naturally leads to a canonical bijection with certain join-admissible triples in lower Eulerian posets via the non-Hausdorff mapping cylinder construction, resulting in deep connections to flag invariants, the cd-index, local -polynomials, and Kazhdan–Lusztig–Stanley theory.
1. Lower Eulerian Posets and Strong Formal Subdivisions
A finite poset is ranked if there exists a rank function such that whenever covers . The poset is locally Eulerian if for every interval , the number of elements of even rank equals that of odd rank; it is lower Eulerian if, in addition, a unique minimal element exists. A poset is Eulerian if it is lower Eulerian with a unique maximal element (Stapledon, 20 Nov 2025).
Let and be lower Eulerian posets with rank functions and . A map is called a strong formal subdivision if it is:
- order-preserving,
- rank-increasing: for all ,
- strongly surjective: for every , with , there is in so that and ,
- and for every and with ,
These properties are designed to guarantee that the fibers over points in have the right local Euler characteristic, ensuring compatibility with subdivisions arising in geometry or topology (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).
2. The Canonical Cylinder Bijection and Join-Admissible Triples
Each strong formal subdivision corresponds canonically to a triple , where is a lower Eulerian poset with rank function and is join-admissible (i.e., exists for all ). This relationship is established via the non-Hausdorff mapping cylinder construction:
- The mapping cylinder is the disjoint union with the original orders and additional relations whenever , , and .
- The rank function is defined by for , for .
- The triple is .
Conversely, starting from such a triple, the strong formal subdivision is recovered as
with the appropriate (possibly shifted) rank functions. This bijection underpins the combinatorial abstraction of geometric subdivision phenomena and provides a natural vehicle for structural translation across discrete and geometric settings (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).
3. Examples and Structural Significance
Strong formal subdivisions naturally model a range of examples:
- Polytope Subdivisions: A refinement of a polyhedral subdivision of a polytope induces
mapping each cell to the minimal -cell containing it, giving a strong formal subdivision of rank $0$ (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).
- Fan Morphisms: A proper surjective map of fans induces , a strong formal subdivision of rank equal to the kernel dimension of the underlying vector space map.
- Identity Map: For any lower Eulerian poset , the identity map is a strong formal subdivision, whose cylinder is the pyramid poset .
- One-Point Adjunctions: The join-admissible element in the cylinder construction corresponds combinatorially to joining with an "adjoined" minimum.
The mapping cylinder provides a categorical 'join' operation interpolating between domain and codomain posets, supporting recursion and uniform proofs for invariants (Stapledon, 20 Nov 2025).
4. Invariants: cd-Index and Flag Polynomials
For Eulerian posets, the flag -polynomial
encodes face incidence data. The unique polynomial in noncommuting and satisfying is the cd-index.
Under the strong formal subdivision setting and cylinder construction, the cd-index can be computed recursively:
where is the local cd-index, and overbars indicate certain quotient posets (Stapledon, 20 Nov 2025).
This recurrence applies to standard constructions, such as pyramids, prisms, and bipyramids, and demonstrates the algorithmic tractability of computing the cd-index via strong formal subdivision theory.
5. Local -Polynomials and Kazhdan–Lusztig–Stanley Invariants
Given a strong formal subdivision with cylinder , the local -polynomial is constructed via the incidence algebras associated to the Eulerian kernel . For Eulerian,
is symmetric and unimodal, as proved by Karu.
The main connection to Kazhdan–Lusztig–Stanley (KLS) invariants is as follows. Let , be the left-KLS functions for , respectively, and define the involution and operator on symmetric polynomials
Then,
with analogous statements for right-KLS and the -function (Stapledon, 20 Nov 2025).
This formalism further unifies local -polynomials, KLS functions, and relative -polynomials. For instance, when is a polytope face lattice and arises from a projective subdivision,
demonstrating that Braden–MacPherson's relative -polynomials coincide with these local -polynomials (Stapledon, 20 Nov 2025).
6. Equivariant Generalizations and Ehrhart Theory Applications
If a finite group acts compatibly on the posets, all incidence algebra constructions lift to the equivariant setting, resulting in equivariant KLS functions and local -polynomials valued in representation rings. For a -invariant lattice polytope subdivided by a -invariant subdivision ,
where is the equivariant -series, and denotes the local equivariant -series. For unimodular triangulations, equals the equivariant -polynomial (Stapledon, 20 Nov 2025).
This framework unifies and generalizes combinatorial and cohomological results: Stanley's theory of subdivisions, intersection cohomology-based proofs of local symmetry and unimodality, and the equivariant Braden–MacPherson -polynomials—all subsumed via the strong formal subdivision theory and the canonical cylinder bijection.
7. Summary Table: Key Structures in Strong Formal Subdivision Theory
| Structure | Description | Origin/Example |
|---|---|---|
| Lower Eulerian poset | Ranked poset with unique , locally Eulerian intervals | Face lattice of a polytope, fan poset |
| Strong formal subdivision | Order-preserving, rank-increasing surjection satisfying | Polytope/fan subdivision morphism |
| Mapping cylinder | Poset on with induced and bridging order | Used in canonical bijection construction |
| Join-admissible element | Non-minimum s.t.\ exists for all in | Pointed face in a face lattice |
| Local -polynomial | Derived from fibers of in incidence algebra; symmetric | Tracks refined face structure |
| cd-index | Encodes flag -vector information via noncommuting variables | Provides recursive invariants |
| KLS-invariants | Kazhdan–Lusztig–Stanley functions; recover local via subdivision | Enables intersection cohomology linkage |
| Equivariant versions | Invariance under group actions; values in representation rings | Ehrhart theory, group-labeled polytopes |
Strong formal subdivisions provide a unified combinatorial structure for analyzing subdivisions in discrete geometry and topology. This theory supports explicit calculation of invariants relevant in enumerative, geometric, and representation-theoretic contexts, and facilitates their extension to equivariant and cohomological settings (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).