ebook img

Not all free arrangements are $K(π,1)$ PDF

5 Pages·0.11 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Not all free arrangements are $K(π,1)$

RESEARCH ANNOUNCEMENT APPEAREDINBULLETINOFTHE 5 AMERICANMATHEMATICALSOCIETY 9 Volume32,Number1,January1995,Pages61-65 9 1 NOT ALL FREE ARRANGEMENTS ARE K(π, 1) n a J PAUL H. EDELMAN AND VICTOR REINER 1 Abstract. We produce a one-parameter familyof hyperplane arrangements ] T thatarecounterexamplestotheconjectureofSaitothatthecomplexifiedcom- plement of a free arrangement is K(π,1). These arrangements are the re- A strictionofaone-parameterfamilyofarrangementsthataroseinthestudyof . tilingsofcertaincentrallysymmetricoctagons. Thisotherfamilyisdiscussed h aswell. t a m I. Definitions and introduction [ 1 Let A be a finite set of hyperplanes (subspaces of codimension one) passing v through the origin in Rd. The complexification of the arrangement A is the 9 arrangementof hyperplanes in Cd defined by 2 2 AC ={H ⊗RC|H ∈A}. 1 0 Let M(A) be the complement of AC in Cd. We will say that A is K(π, 1) if 5 the space M(A) is a K(π, 1) space; i.e., the universal covering space of M(A) 9 iscontractibleandthefundamentalgroup π (M(A))=π. If A is K(π, 1),then 1 h/ it is known that the cohomology ring H∗(M(A), Z) coincides with the group t cohomology H∗(π, Z). a m The braid arrangement A=Ad−1 is the hyperplane arrangementwhose hyper- planes are defined by the linear forms {x −x = 0 | 1 ≤ i < j ≤ d}. In 1962 : i j v Fadell, Fox, and Neuwirth [FaN, FoN] showed that A is K(π, 1)where π is the i pure braid group on d strands. Subsequently, Arnold [Ar] gave a simple presenta- X tion of the cohomology ring, thereby computing the cohomology of the pure braid r a group. He conjectured that there was a similar presentation of H∗(M(A), Z) for an arbitrary arrangement. Brieskorn [Br] proved this conjecture in 1971 and in 1980 Orlik and Solomon [OS] used these results to give a combinatorial presentation of H∗(M(A), Z). Brieskornalsoconjectured that allCoxeter arrangementsare K(π, 1). A Coxeter arrangement is the set of reflecting hyperplanes of a finite group acting on Rd generated by reflections (see, e.g., [Hu]). In particular the braid arrangement is ReceivedbytheeditorsMay31,1994. 1991Mathematics Subject Classification. Primary52B30,55P20, 20G10. (cid:13)c1995AmericanMathematicalSociety 0273-0979/95 $1.00+$.25 perpage 1 2 P.H.EDELMANANDVICTORREINER the Coxeter arrangement for the symmetric group S permuting the coordinates d in Rd. Brieskorn proved the latter conjecture for many Coxeter groups, and it was settled in the affirmative by Deligne [De]. In fact Deligne proved the stronger result that if an arrangement A is simplicial, i.e., every connected component of Rd−∪H∈AH isaunionofopenraysemanatingfromtheoriginwhosecross-section is an open simplex, then A is K(π, 1). (We should note that the condition of beingsimplicialisnotgeneric.) Inadifferentdirection,FalkandRandell[FR]and Terao [Te] showed that a class of arrangements called supersolvable arrangements is also K(π, 1). A common generalization of Coxeter arrangements and supersolvable arrange- ments is a free arrangement, which we now define. For each hyperplane H in A, let l be the linear form in the polynomial ring S = R[x , ... , x ] which van- H 1 d isheson H (sothat l isuniquelydefineduptoascalarmultiple). Themodule of H A-derivations D(A) is defined to be the set of all derivations θ :S →S with the property that θ(l ) is divisible by l for all H in A. D(A) is a module over H H the polynomial ring S, and we say A is a free arrangement if it is a free module over S. If A is a free arrangementin Rd, then there exists a homogeneous basis {θ , θ , ... , θ } for D(A) and the degrees of these polynomials (with multiplic- 1 2 d ities) only depend on A. Call this multiset of degrees the exponents of the free arrangement. In the case A is a Coxeter arrangement, these exponents coincide with the usual definition of exponents of a Coxeter group (see, e.g., [Hu, §3.20]). In 1975 Saito [Sa] conjectured that if A is a free arrangement, then it is K(π, 1). Thisconjecturedoesnotcompletelyunifywhatisknownabout K(π, 1)arrangements because there are simplicial arrangements that are not free. Orlik and Terao [OT, p. 10] remark that this has been one of the two motivating conjectures for most of the recent work on hyperplane arrangements (the other is Terao’s conjecture that the freeness of an arrangement is dependent only on the combinatorial properties of the arrangement [OT, Conjecture 4.138]). In the next section we describe a one-parameter family of 3-dimensional arrangements that are not K(π, 1), thus disproving Saito’s conjecture. This one-parameter family arises as a restriction of a one-parameter family of 4-dimensional arrangements that have some unusual properties as well. We will discuss this other family in the last section. II. Counterexamples to Saito’s conjecture Considerthehyperplanearrangement A in R3 whosehyperplanesaredefined α by the linear forms {x, y, z, x−y, x−z, y−z, x−αy, x−αz, y−αz}, where α∈R. Theorem2.1. Thearrangement A isfreeforallvalues of α. If α6=−1, 0, 1, α then A is not K(π, 1). α Sketch of proof. Using the Addition-Deletion Theorem [OT, Theorem 4.51], it is routine to show that A is a free arrangementwith exponents α {1, 2, 3} if α=1 or 0, {1, 3, 5} if α=−1, {1, 4, 4} otherwise . NOTALLFREEARRANGEMENTSARE K(π,1) 3 Spaceallowedforart: 14pc Figure 1. The arrangement A−2 To be more explicit, if α = 1 or 0, then A is the Coxeter arrangement A ; α 3 and if α=−1, then A is the Coxeter arrangement B . We thank H. Terao for α 3 computing the following basis for D(A) for all other values of α: ∂ ∂ ∂ θ =x +y +z , 1 ∂x ∂y ∂z ∂ ∂ θ =x(x−z)(x+αz)(x+αy) +y(y−z)(y+αz)(x+αy) , 2 ∂x ∂y ∂ ∂ θ =x(x−z)(x+αz)(x+(α−1)y−αz) +αy(y−z)(y+αz)(x−z) . 3 ∂x ∂y To show that A is not K(π, 1), assume that α < 0 and α 6= −1. Using α elementary linear algebra, one can show that there is a connected component of R3−∪H∈AαH bounded by the hyperplanes {x−z, x−αy, y−αz}. Moreover thelinesofintersectionofpairsofthesehyperplanesarenotcontainedinanyother hyperplane of the arrangement. Such a configuration is called a simple triangle. Figure 1 shows a picture of the arrangement A−2 drawn in the real projective plane with z = 0 as the hyperplane at infinity. It follows from results of Hattori [Ha; OT, p. 164]that any 3-dimensionalarrangementwith a simple triangle is not K(π, 1). By allowing α to range through C, we can construct a lattice isotopy in the sense of Randell [Ra; OT, Definition 5.27] between A and A for any two real α β valuesof α and β neither equalto 0, 1, or −1. This lattice isotopyimplies that M(A ) isdiffeomorphicto M(A ) [Ra;OT,Theorem5.28],andhence A isnot β α β K(π, 1) for any real value of β that is not equal to 0, 1, or −1. ⊔⊓ III. A 4-dimensional family Given any hyperplane H in A, we define the restriction arrangement A| to H bethearrangementwithinthesubspace H (thinkingof H as Rd−1)whosehyper- planesarealloftheintersectionsofhyperplanesof A with H. The 3-dimensional family described in §2 was discovered as the restriction of a 4-dimensional family with its own peculiarities. We will describe that family now. 4 P.H.EDELMANANDVICTORREINER Let B be the arrangement defined by the forms α {x, y, z, w, x−y, x−z, x−w, y−z, y−w, z−w, x−αz, y−αz, x−αw, y−αw}. Theorem 3.1. The arrangement B is α (1) not free if α=−1; (2) a free arrangement with exponents {1, 2, 3, 4} if α=0, 1; (3) a free arrangement with exponents {1, 4, 4, 5} if α6=0, 1, −1. Sketchofproof. TheprooffollowsagainfromaroutineapplicationoftheAddition- Deletion Theorem [OT, Theorem 4.51]. ⊔⊓ Thus B has the property that in the neighborhood of α = −1 a family of α free arrangements deforms continuously into one that is not free, and hence the set of free arrangements is not Zariski-closed in the space of all arrangements. By the same token, since non-freeness is a generic condition in the space of all hyperplanearrangements,assumingthatthecoefficientsofthelinearformsdefining thehyperplanesarechosenrandomly(see[Zi,Corollary7.6]),weknowthattheset offree arrangementsisnotZariski-openinthe spaceofallarrangements. However, work of Yuzvinsky [Yu] shows that it is a constructible set. The arrangement A is obtained from B by restricting to any of the last α α four hyperplanes. The arrangement B arises in the study of tilings of centrally α symmetric octagons. Details ofthis relationshipwillbe discussedinafuture paper [ER]. References [Ar] V. I. Arnold, The cohomology ring of the colored braid group, Mat. Zametki 5 (1969), 227-231;Math.Notes,vol.5,PrincetonUniv.Press,Princeton,NJ,1969,pp.138–140. [Br] E. Brieskorn, Sur les groupe de tresses, S´eminaire Bourbaki 1971/72, Lecture Notes in Math.,vol.317,Springer,NewYork,1973, pp.21–44. [De] P. Deligne, Les immeubles des groupes de tresses g´en´eralis´es, Invent. Math. 17 (1972), 273–302. [ER] P.H.EdelmanandV.Reiner,Free arrangements and tilings,preprint,1994. [FaN] E.FadellandL.Neuwirth,Configuration spaces,Math.Scand.10(1962), 111–118. [FR] M. Falk and R. Randell, The lower central series of a fiber-type arrangement, Invent. Math.82(1985), 77–88. [FoN] R.H.FoxandL.Neuwirth,The braid groups, Math.Scand. 10(1962), 119–126. [Ha] A.Hattori, Topology of Cn minus a finite number of affine hyperplanes in general posi- tion,J.Fac.Sci.Univ.TokyoSect. IAMath.22(1975), 205–219. [Hu] J. E. Humphreys, Reflection groups and Coxeter groups, Cambridge University Press, Cambridge,1990. [OS] P. Orlik and L. Solomon, Combinatorics and topology of complements of hyperplanes, Invent. Math.56(1980), 167–189. [OT] P.OrlikandH.Terao,Arrangements of hyperplanes, Springer-Verlag,Berlin,1992. [Ra] R.Randell,Lattice-isotopicarrangementsaretopologicallyisomorphic,Proc.Amer.Math. Soc.107(1989), 555–559. [Sa] K. Saito, On the uniformization of complements of discriminant loci, Conference Notes, SummerInstitute, Amer.Math.Soc.,Williamstown,1975. [Te] H.Terao,Modularelementsoflatticesandtopologicalfibrations,Adv.inMath.62(1986), 135–154. NOTALLFREEARRANGEMENTSARE K(π,1) 5 [Yu] S. Yuzvinsky, Free and locally free arrangements with a given intersection lattice, Proc. Amer.Math.Soc.118(1993), 745–752. [Zi] G. Ziegler, Combinatorial constructions of logarithmic differential forms, Adv. in Math. 76(1989), 116–154. School of Mathematics, University of Minnesota, Minneapolis, Minnesota 55455 E-mail address, P.Edelman: [email protected] E-mail address, V.Reiner: [email protected]

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.