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 central hyperplane arrangement whose intersection lattice contains a maximal chain of modular flats, one at each rank. The test concerns the incidence structure of the entire arrangement: an arbitrary chain of intersections is insufficient because each selected flat must satisfy the modularity condition against every flat in the lattice.[1]
Once that flag is established, it organizes several computations. The Poincaré polynomial factors using the numbers of hyperplanes contributed at successive levels, and for complex arrangements the complement is fiber-type. These are consequences of the modular flag, not substitute definitions. A polynomial that happens to factor can belong to a nonsupersolvable arrangement.[1]
Structural Signature¶
- Finite central family — constitutive carrier. Begin with codimension-one linear subspaces of one vector space, all containing the origin. An arbitrary family of curved sets or higher-codimension subspaces changes the object class.[1]
- Ranked intersection lattice — constitutive representation. Intersect subfamilies, order their flats by reverse inclusion, and rank them by codimension. The geometric union of the hyperplanes does not supply this order.[1]
- Modularity test — constitutive condition. A flat X is modular if its rank identity with every flat Y holds: r(X)+r(Y)=r(X∧Y)+r(X∨Y). For arrangement flats, the corresponding subspace-sum test provides another form.[1]
- Complete modular flag — defining relation. Find a maximal chain from bottom to top containing modular flats at successive ranks. A single modular flat or a shorter chain does not meet the definition.[1]
- Rank-layer counts — derived computation. The number of new hyperplanes at each flag step gives the factors of the Poincaré polynomial after membership is proved. Those counts are not an independent membership test.[1]
What It Is Not¶
It is not any arrangement whose characteristic or Poincaré polynomial splits into linear factors. The type-D4 reflection arrangement has a factored Poincaré polynomial yet is not supersolvable; its missing modular flag defeats the proposed inference.[1]
Nor is it defined by the Orlik–Solomon algebra merely being Koszul. Supersolvability yields a quadratic Gröbner basis in the stated standard presentation and hence Koszulness. A September 2026 original preprint gives non-supersolvable arrangements with Koszul Orlik–Solomon algebra; this newer result must be labeled as a preprint, while the modular flag remains the defining test.[1][2]
Scope of Application¶
The class begins with central hyperplane arrangements and their ranked intersection lattices. For topology claims below, use complex arrangements and state whether a realization is essential or has a common linear factor in its ambient space. An affine arrangement requires an explicit convention, such as coning, before importing the central definition; a real-region count alone cannot establish a complex-complement fibration.[1]
The class appears in reflection and graphic arrangements. Their membership is established through arrangement-specific lattice structure, not by treating the names of the groups or graphs as interchangeable. The graphic arrangement of a simple graph is supersolvable exactly when the graph is chordal.[1]
Clarity¶
The modular flag answers a precise question: can the arrangement's intersection lattice be traversed by a full chain whose chosen flats interact modularly with every other flat? This is more discriminating than asking whether the arrangement has many intersections, a visually regular picture, or a convenient polynomial.[1]
Keep the direction of reasoning explicit. Prove the flag first, then use the factorization or fiber-type results. If only factorization is known, D4 shows why the classification has not followed.[1]
Manages Complexity¶
A finite family of hyperplanes has many subfamily intersections. The full modular flag compresses that incidence data into successive rank layers while preserving enough structure to compute the Poincaré polynomial as a product. If m_i is the number of hyperplanes entering at flag level i, the theorem gives π(A,t)=∏_i(1+m_i t). For an essential rank-r arrangement, the characteristic polynomial has corresponding factors ∏_i(q−m_i). A nonessential ambient realization carries extra powers of q, so its ambient characteristic polynomial should not be reported as the essential one.[1]
The compression has a proof obligation: identify a modular flat at each rank. Merely reading factors from a polynomial saves work but may classify a nonmember as supersolvable.[1]
Abstract Reasoning¶
Given an unfamiliar central arrangement, form its reverse-inclusion intersection lattice and test candidate flats against every other flat with the modular rank identity. If a full flag exists, compute each layer size and derive the Poincaré factors. Over the complex numbers, the same membership supports the fiber-type description of the complement, with successive punctured-complex-line fibers under the relevant essentiality conventions.[1]
If a factorization is observed before a flag is found, treat it as a clue for a search, not as a converse theorem. D4 supplies a direct counterexample to that shortcut. A Koszul calculation likewise cannot replace the flag test in view of the 2026 preprint's claimed counterexamples.[1][2]
Knowledge Transfer¶
The modular-flag test works across unlike arrangement families. Type-B reflection hyperplanes arise from signed coordinate equations, while a graphic arrangement arises from equality equations attached to graph edges. In both, the carrier is a central hyperplane family and the membership question is the same ranked-lattice condition.[1]
The transfer does not make supersolvability a general slogan for any hierarchy with convenient layers. Its modular-flat test and consequent factorization live inside hyperplane arrangement theory. A separate use of “supersolvable” in group or lattice theory needs its own definition and should not be merged into this entry merely because the word recurs.
Examples¶
Type-B3 reflection arrangement¶
In C³, take the nine hyperplanes x_i=0 and x_i=±x_j for i<j. Their intersections form the ranked lattice. The coordinate-axis rank-two flats identified in the arrangement text are modular; choosing a contained rank-one hyperplane and the top flat completes a modular flag. The text explicitly identifies this type-B picture as supersolvable.[1]
Mapped back: the nine signed-coordinate hyperplanes provide the finite central family; their reverse-inclusion intersections provide the ranked lattice; the modular rank-two flat, together with bottom, rank-one and top flats, provides the complete flag. The type-B3 layer counts are 1, 3, 5, so π(B3,t)=(1+t)(1+3t)(1+5t). The braid/type-A sequence must not be copied into this type-B case.[1]
Graphic arrangement of the path P4¶
Let P4 have edges 12, 23, and 34. Its graphic arrangement in C⁴ consists of x₁=x₂, x₂=x₃, and x₃=x₄. P4 is chordal, and the cited graphic-arrangement theorem therefore makes its arrangement supersolvable. More explicitly, after quotienting by the common diagonal, the three edge forms are independent; their intersection lattice is Boolean. Every element of a Boolean lattice is modular, so adjoining these hyperplanes successively gives a full modular flag. This explicit Boolean verification is a curator deduction from the sourced equations and theorem, not a printed worked example.[1]
Mapped back: the three edge-equality hyperplanes provide the central family; their intersections, after removing the common diagonal, give an essential rank-three lattice; the Boolean chains provide the modular flag. Each rank layer contributes one, so the essential Poincaré polynomial is (1+t)³. The ambient C⁴ characteristic polynomial has an extra q factor. P4 is non-complete and uses only three graphic hyperplanes, unlike the nine signed reflection hyperplanes of B3.[1]
Structural Tensions¶
Quick algebraic recognition versus defining lattice proof. A factored polynomial or Koszul algebra is easier to spot than a full modular flag. The shortcut can be useful for choosing what to inspect, but it admits false positives: D4 factors without supersolvability, and the 2026 preprint presents Koszul nonmembers. Checking modularity against all flats costs more work, yet it establishes the named class and licenses its stronger layer and fiber-type consequences.[1][2]
Diagnostic: have we exhibited modular flats at every rank, or only a consequence that can occur elsewhere?
Structural–Framed Character¶
Evaluative weight: supersolvability is mathematically useful but is not a claim that the arrangement is good. Human-practice dependence: notation and ambient realization are chosen by mathematicians; membership is fixed by the stated arrangement and its lattice. Institutional origin: the class is defined in mathematical literature rather than by one regulator or product. Vocabulary travel: the word appears in other branches of mathematics, but this entry names the hyperplane-arrangement version. Import versus recognition: a new example belongs here when its modular flag is proved, not when a convenient analogy or polynomial suggests it.[1]
The portable skeleton of intersection is already represented by the live Prime Intersection: multiple specified sets or constraints can share common elements, and here the hyperplane intersections form flats. That portable overlap survives outside this field, whereas a complete modular flag of arrangement flats and its polynomial consequences do not follow from overlap alone. A more general Prime for rankwise modular-chain factorization is an explicit future-Prime question; two unlike non-arrangement settings with the same all-instance mechanism would need to be shown before adding such a node or edge. The existing Arrangement of Hyperplanes parent already connects this entry to Prime Intersection, so a duplicate direct edge is unnecessary.[1]
Its character: strongly structural within the formal hyperplane-arrangement frame. The intersection skeleton travels, but membership in this named class still requires its central family and modular flag; field and realization assumptions bound the derived claims.[1]
Structural Core vs. Domain Accent¶
The core is the finite central hyperplane family, its ranked intersection lattice, and a complete modular chain. Signed coordinates in B3 and graph-edge equalities in P4 are domain accents: they give different routes to the same lattice condition. Factorization, fiber-type topology, and Koszulness are valuable derived features, not components of the definition.[1][2]
The skeletal relation is repeated intersection of constraints, a portable pattern already owned by Prime Intersection through the live Arrangement of Hyperplanes parent. The domain-bound mechanism is stronger: a ranked lattice of flats of a finite central hyperplane family must contain a complete modular chain, and that chain supplies the arrangement-specific factorization and fiber-type conclusions. B3 and P4 instantiate this one mechanism through different defining equations. Remove the hyperplane family and its lattice, and the named supersolvable-arrangement test disappears. Prime Intersection does not assert modular flags; Prime Modularity names independently revisable units rather than lattice-modular flats. A broader rankwise factorization relation remains a future-Prime question, not a reason to inflate this entry's domain or add a second parent.[1]
Instantiates / Related Primes¶
This entry is a kind of Arrangement of hyperplanes.
A supersolvable arrangement is, in every case, a kind of Arrangement of Hyperplanes: every member here is first a finite central hyperplane arrangement, with the full modular flag as additional structure. The body of the Arrangement of Hyperplanes entry defines that object class, even though its current one-line summary describes the activity of studying it. A non-supersolvable hyperplane arrangement such as D4 shows that the broader category is strictly larger.[1]
Intersection already sits above Arrangement of Hyperplanes, so listing it directly here would be redundant. Modularity, as the encyclopedia defines it, concerns independently revisable units and is not the lattice-theoretic modular-flat condition. A modular flag does not imply that the entire intersection lattice is completely distributive. Those neighbors are therefore not listed as additional broader abstractions.
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.A finite central hyperplane family is an instance of the live Arrangement of Hyperplanes object class. A rank-by-rank chain of modular flats imposes a further condition that general arrangements, including the D4 reflection arrangement, need not satisfy. Independent typed-DAG review confirmed the child-to-parent strict subsumption and declined redundant or stronger lattice neighbors.
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 fiber-type arrangement is equivalent to a supersolvable arrangement in the complex central setting used here, but the phrase emphasizes the complement's iterated fibration; essentiality qualifications matter for the one-step criterion.[1] A factored Poincaré polynomial is only a one-way consequence, as D4 shows. A Koszul Orlik–Solomon algebra is also not the defining test, given the September 2026 preprint's counterexamples. An arbitrary hyperplane arrangement has no requirement to admit a modular flag.[1][2]
References¶
[1] 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 registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r ↩s ↩t ↩u ↩v ↩w ↩x ↩y ↩z ↩27 ↩28 ↩29 ↩30 ↩31
[2] 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 registry ↩a ↩b ↩c ↩d ↩e