summed over B ⊆ C ⊆ A such that f(B) is nonempty.
Being a geometric lattice or semilattice, L(A) has a characteristic polynomial, pL(A)(y), which has an extensive theory (see geometric lattice). Thus it is good to know that pA(y) = yi pL(A)(y), where i is the smallest dimension of any flat, except that in the projective case it equals yi + 1pL(A)(y).
The Whitney-number polynomial of A is similarly related to that of L(A).
(The empty set is excluded from the semilattice in the affine case specifically so that these relationships will be valid.)
The Orlik-Solomon algebra
The intersection semilattice determines another combinatorial invariant of the arrangement, the Orlik-Solomon algebra. To define it, fix a commutative subring K of the base field, and form the exterior algebra E of the vector space
generated by the hyperplanes.
A chain complex structure is defined on E with the usual boundary operator .
The Orlik-Solomon algebra is then the quotient of E by the ideal generated by elements of the form where H_1, ..., H_p have empty intersection, and by boundaries of elements of the same form for which has codimension greater than p.
In real affine space, the complement is disconnected: it is made up of separate pieces called regions or chambers, each of which is either a bounded region that is a convex polytope, or an unbounded region that is a convex polyhedral region which goes off to infinity.
Each flat of A is also divided into pieces by the hyperplanes that do not contain the flat; these pieces are called the faces of A.
The regions are faces because the whole space is a flat.
The faces of codimension 1 may be called the facets of A.
The face semilattice of an arrangement is the set of all faces, ordered by inclusion. Adding an extra top element to the face semilattice gives the face lattice.
In two dimensions (i.e., in the real affine plane) each region is a convex polygon (if it is bounded) or a convex polygonal region which goes off to infinity.
- As an example, if the arrangement consists of three parallel lines, the intersection semilattice consists of the plane and the three lines, but not the empty set. There are four regions, none of them bounded.
- If we add a line crossing the three parallels, then the intersection semilattice consists of the plane, the four lines, and the three points of intersection. There are eight regions, still none of them bounded.
- If we add one more line, parallel to the last, then there are 12 regions, of which two are bounded parallelograms.
A typical problem about an arrangement in n-dimensional real space is to say how many regions there are, or how many faces of dimension 4, or how many bounded regions. These questions can be answered just from the intersection semilattice. For instance, two basic theorems are that the number of regions of an affine arrangement equals (−1)npA(−1) and the number of bounded regions equals (−1)npA(1). Similarly, the number of k-dimensional faces or bounded faces can be read off as the coefficient of xn−k in (−1)n wA (−x, −1) or (−1)nwA(−x, 1).
Another question about an arrangement in real space is to decide how many regions are simplices (the n-dimensional generalization of triangles and tetrahedra). This cannot be answered based solely on the intersection semilattice.
A real linear arrangement has, besides its face semilattice, a poset of regions, a different one for each region (Edelman 1984). This poset is formed by choosing an arbitrary base region, R0, and associating with each region R the set A(R0, R) defined as the set of hyperplanes that separate the two regions. One says R1 ≥ R2 if A(R1, R) contains A(R2, R). This lattice has interesting properties that we will not go into here; notably, it is an Eulerian poset.
Meiser designed a fast algorithm to determine the face of an arrangement of hyperplanes containing an input point.
In complex affine space (which is hard to visualize because even the complex affine plane has four real dimensions), the complement is connected (all one piece) with holes where the hyperplanes were removed.
A typical problem about an arrangement in complex space is to describe the holes.
The basic theorem about complex arrangements is that the cohomology of the complement M(A) is completely determined by the intersection semilattice. To be precise, the cohomology ring of M(A) (with integer coefficients) is isomorphic to the Orlik-Solomon algebra on Z.
The isomorphism can be described rather explicitly, and gives a presentation of the cohomology in terms of generators and relations, where generators are represented (in the de Rham cohomology) as logarithmic differential forms
with any linear form defining the generic hyperplane of the arrangement.
Sometimes it is convenient to allow the degenerate hyperplane, which is the whole space S, to belong to an arrangement. If A contains the degenerate hyperplane, then it has no regions because the complement is empty. However, it still has flats, an intersection semilattice, and faces. The preceding discussion assumes the degenerate hyperplane is not in the arrangement.
Sometimes one wants to allow repeated hyperplanes in the arrangement. We did not consider this possibility in the preceding discussion, but it makes no material difference.
| issue = 2
| journal = Transactions of the American Mathematical Society
| pages = 617–631
| title = A partial order on the regions of ℝn dissected by hyperplanes
| volume = 283
| year = 1984}}.
| issue = 2
| journal = Information and Computation
| pages = 286–303
| title = Point location in arrangements of hyperplanes
| volume = 106
| year = 1993}}.
| location = Berlin
| publisher = Springer-Verlag
| series = Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]
| title = Arrangements of Hyperplanes
| volume = 300
| year = 1992}}.
| location = Providence, R.I.
| publisher = American Mathematical Society
| journal = Memoirs of the American Mathematical Society
| title = Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
| year = 1975}}.
HighBeam Research, Inc. © Copyright 2009.
Copyright © 2013 Dictionary.com, LLC. All rights reserved.