Supersolvable Arrangement¶
A finite central hyperplane arrangement whose intersection lattice has a full rank-by-rank chain of modular flats.
Core Idea¶
A supersolvable arrangement is a finite family of central hyperplanes whose intersections form a ranked lattice with a complete chain of modular flats. The chain has one flat at every rank, and each chosen flat must satisfy a rank identity against every other flat in the lattice. Simply finding a chain of intersections does not establish the condition.[^ref-0ae2d6fafb92]
The flag makes the arrangement easier to analyze. It yields factors for the Poincaré polynomial and, for the relevant complex setting, a fiber-type description of the complement. Those are consequences, not replacement tests: another arrangement can have a factored polynomial without being supersolvable.[^ref-0ae2d6fafb92]
Scope of Application¶
Use this term for central hyperplane arrangements and their reverse-inclusion intersection lattices. In an affine setting, declare a construction such as coning before applying the central definition. Claims about complement fibrations concern complex arrangements, and characteristic-polynomial formulas must distinguish an essential rank-r model from a nonessential ambient realization.[^ref-0ae2d6fafb92]
Reflection arrangements and graphic arrangements provide unlike examples. A simple graph's graphic arrangement is supersolvable exactly when the graph is chordal; the theorem lets one analyze a graph-derived hyperplane family through the same modular-flag condition.[^ref-0ae2d6fafb92]
Clarity¶
The question is whether a modular flat occurs at every rank in one full chain. A tidy picture, one modular flat, or linear factors in a polynomial does not answer it. The type-D4 reflection arrangement, for example, has a factored Poincaré polynomial but lacks the required supersolvability.[^ref-0ae2d6fafb92]
Modularity here is a property of flats in the intersection lattice. It does not mean that the hyperplanes are independent modules or that every element of the lattice is modular.[^ref-0ae2d6fafb92]
Manages Complexity¶
Intersections of many hyperplanes can be hard to track. A verified modular flag organizes the family into rank layers. If m_i counts hyperplanes entering at level i, the Poincaré polynomial is π(A,t)=∏_i(1+m_i t). For an essential rank-r arrangement, the corresponding characteristic polynomial factors as ∏_i(q−m_i); a nonessential ambient model carries extra powers of q.[^ref-0ae2d6fafb92]
This shortcut comes after the flag proof. Reading the product backward is unsafe because the same factorization can occur for nonmembers.[^ref-0ae2d6fafb92]
Abstract Reasoning¶
To classify a new central arrangement, first list its intersection flats, order them by reverse inclusion, and test candidate flats against all others with the modular rank identity. If the selected flats form a full rank-by-rank chain, use their layer counts to compute the polynomial. In the complex case, the established class also supports the fiber-type conclusion under the stated realization conventions.[^ref-0ae2d6fafb92]
A factorization or a Koszul Orlik–Solomon algebra is a clue, not enough for membership. A September 2026 original preprint reports Koszul examples that are not supersolvable; the claim is presented here with its preprint status.[ref-0ae2d6fafb92][ref-6baff67aecd8]
Knowledge Transfer¶
The same test applies to the signed-coordinate equations of type B3 and to edge-equality equations from a graph. Their geometry differs, but both supply a central hyperplane family, ranked intersection lattice, and modular flag.[^ref-0ae2d6fafb92]
The portable idea of finding common intersections is already represented by Prime Intersection, upstream through the live Arrangement of Hyperplanes parent. The modular-flag requirement and its factorization theorems are specific to this mathematical class; they do not make every layered system a supersolvable arrangement.
Example¶
Type B3. In C³ take x_i=0 and x_i=±x_j for i<j, nine hyperplanes in total. The source identifies modular coordinate-axis rank-two flats and the resulting supersolvable arrangement. A full flag uses one such flat together with flats at the other ranks. Its layer counts are 1, 3, 5, giving π(B3,t)=(1+t)(1+3t)(1+5t). Those are type-B counts, not the braid/type-A sequence.[^ref-0ae2d6fafb92]
The path P4. The graph edges 12, 23 and 34 give x₁=x₂, x₂=x₃ and x₃=x₄ in C⁴. P4 is chordal, so the graphic-arrangement theorem gives supersolvability. After quotienting by the common diagonal, the three edge forms are independent and the rank-three intersection lattice is Boolean; hence a full modular flag exists. That explicit Boolean verification is a curator deduction from the equations, not a printed worked case. The essential Poincaré polynomial is (1+t)³, while the ambient characteristic polynomial has an extra q factor.[^ref-0ae2d6fafb92]
Both map the same roles: finite central family, ranked lattice, modular flats at each rank, and derived layer counts. B3 uses nine signed reflection hyperplanes; P4 uses three graph-edge hyperplanes.[^ref-0ae2d6fafb92]
Relationships to Other Abstractions¶
Current abstraction Supersolvable Arrangement Domain-specific
Parents (1) — more general patterns this builds on
-
Supersolvable Arrangement is a kind of Arrangement of hyperplanes Domain-specific
A supersolvable arrangement is a hyperplane arrangement with a complete modular flag in its intersection lattice.
Hierarchy path (1) — routes to 1 parentless root
- Supersolvable Arrangement → Arrangement of hyperplanes → Intersection → Set and Membership
Neighborhood in Abstraction Space¶
Supersolvable Arrangement sits in a moderately populated region (52nd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Vector Spaces & Linear Structures (17 abstractions)
Nearest neighbors
- Arrangement of hyperplanes — 0.87
- Complete intersection — 0.85
- Balanced set — 0.85
- Distributivity (order theory) — 0.85
- Representation on coordinate rings — 0.85
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
A general hyperplane arrangement need not have the modular flag. Polynomial factorization is a consequence that does not prove it, as D4 shows. Koszulness is also insufficient as a definition, according to the September 2026 preprint's non-supersolvable examples. A fiber-type arrangement names the equivalent complex-arrangement class through its complement fibration, with relevant essentiality qualifications for one-step results.[ref-0ae2d6fafb92][ref-6baff67aecd8]
References¶
[^ref-0ae2d6fafb92]: Dan Cohen, Graham Denham, Michael Falk, Hal Schenck, Alex Suciu, Hiro Terao, and Sergey Yuzvinsky, Complex Arrangements: Algebra, Geometry, Topology, draft of March 29, 2009, §§1.1–1.2, 3.2, 3.4, and 3.6; especially Definition 3.16, Examples 3.18 and 3.24, Definition 3.22, Corollaries 3.23 and 3.26, Theorem 3.31, and Theorem 3.42. Author-hosted full draft; source for the definitions, B3 facts, consequences, counterexample and chordal-graph theorem. Complex Arrangements Algebra Geometry Topology
[^ref-6baff67aecd8]: Tuong Le, Chayim Lowen, and Jason McCullough, “Koszul Orlik–Solomon Algebras from Non-supersolvable Arrangements,” arXiv:2609.03836v1, submitted September 3, 2026, abstract, Theorem A, and Example 3.5. Original full preprint, not represented here as peer-reviewed; reports Koszul non-supersolvable arrangements. https://arxiv.org/pdf/2609.03836