BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help

Building (mathematics)

Print-Friendly
About 7 pages (2,148 words)

Bookmark and Share Know this topic well? Help others and get FREE products!
For the architectural term, see building.

In mathematics, a building (also Tits building) is a combinatorial and geometric structure which simultaneously generalizes certain aspects of flag manifolds, finite projective planes, and Riemannian symmetric spaces. The notion of a building was invented by Jacques Tits as a means of describing simple algebraic groups over an arbitrary field. Tits demonstrated how to every such group G one can associate a simplicial complex Δ = Δ(G) with an action of G, called the spherical building of G. The group G imposes very strong combinatorial regularity conditions on the complexes Δ that can arise in this fashion. By treating these conditions as axioms for a class of simplicial complexes, Tits arrived at his first definition of a building. Not all buildings arise from a group. In particular, projective planes and generalized quadrangles form two classes of graphs studied in incidence geometry which fall under the definition of a building, but may not be connected with any group. Nevertheless, Tits proved a remarkable theorem: that all spherical buildings of rank at least three are connected with a group; and, moreover, the group is essentially determined by the building.

Contents

Formulation

A part of the data defining a building Δ is a certain Coxeter group W. If this group is finite, the corresponding building is of spherical type. If W is an affine Weyl group, the corresponding building is of affine (or Euclidean) type. In the simplest possible case <math>{\scriptstyle\tilde{A}_1,}</math> an affine building is the same as an infinite tree without terminal vertices. Iwahori-Matsumoto, Borel-Tits and Bruhat-Tits demonstrated that in analogy with Tits' construction of spherical buildings, affine buildings can also be constructed from certain groups, namely, reductive algebraic groups over a local non-Archimedean field. Furthermore, if the split rank of the group is at least three, it is essentially determined by its building. Tits later reworked the foundational aspects of the theory of buildings using the notion of a chamber system, which leads to simplifications in both spherical and affine cases. Tits proved that buildings of affine type and rank at least four arise from a group, just as in the spherical case.

Spherical and affine buildings for SLn

The simplicial structure of the affine and spherical buildings associated to SLn(Qp), as well as their interconnections, are easy to explain directly using only concepts from elementary algebra and geometry (see Garrett 1997). In this case there are three different buildings, two spherical and one affine. Each is a union of apartments, themselves simplicial complexes. For the affine group, an apartment is just the simplicial complex obtained from the standard tesselation of Euclidean space En-1 by equilateral (n-1)-simplices; while for a spherical building it is the finite simplicial complex formed by all (n-1)! simplices with a given common vertex in the analogous tesselation in En-2. Each building is a simplicial complex X which has to satisfy the following axioms:

  • X is a union of apartments.
  • Any two simplices in X are contained in a common apartment.
  • If a simplex is contained in two apartments, there is a simplicial isomorphism of one onto the other fixing all common points.

Spherical building

Let F be a field and let X be the simplicial complex with vertices the non-trivial vector subspaces of V=Fn. Two subspaces U1 and U2 are connected if one of them is a subset of the other. The k-simplices of X are formed by sets of k + 1 mutually connected subspaces. Maximal connectivity is obtained by taking n - 1 subspaces and the corresponding (n-2)-simplex corresponds to a complete flag

(0) <math>\subset</math> U1 <math>\subset</math> ··· <math>\subset</math> Un – 1 <math>\subset</math> V

Lower dimensional simplices correspond to partial flags with fewer intermediary subspaces Ui. To define the apartments in X, it is convenient to define a frame in V as a basis (vi) determined up to scalar multiplication of each of its vectors vi; in other words a frame is a set of one-dimensional subspaces Li = F·vi such that any k of them generate a k-dimensional subspace. Now an ordered frame L1, ..., Ln defines a complete flag via

Ui = L1 <math> \oplus</math> ··· <math> \oplus</math> Li

Since reorderings of the Li's also give a frame, it is straightforward to see that the subspaces, obtained as sums of the Li's, form a simplicial complex of the type required for an apartment of a spherical building. The axioms for a building can easily be verified using the classical Schreier refinement argument used to prove the uniqueness of the Jordan-Hölder decomposition.

Affine building

Let K be a field lying between Q and its p-adic completion Qp with respect to the usual non-archimedean p-adic norm ||x||p on Q for some prime p. Let R be the subring of K defined by

<math> R = \{x: \| x\|_p\le 1\}.</math>

When K = Q, R is the localisation of Z at p and, when K = Qp, R = Zp, the p-adic integers, i.e. the closure of Z in Qp. The vertices of the building X are the R-lattices in V = Kn, i.e. R-submodules of the form

L = R·v1 <math>\oplus</math> ···<math>\oplus</math> R·vn

where (vi) is a basis of V over K. Two lattices are said to be equivalent if one is a scalar multiple of the other by an element of the multiplicative group K* of K (in fact only integer powers of p need be used). Two lattice L1 and L2 are said to be adjacent if some lattice equivalent to L2 lies between L1 and its sublattice p·L1: this relation is symmetric. The k-simplices of X are equivalence classes of k + 1 mutually adjacent lattices, The (n - 1)- simplices correspond, after relabelling, to chains

p·Ln <math>\subset</math> L1 <math>\subset</math> L2 <math>\subset</math> ··· <math> \subset</math> Ln – 1 <math> \subset</math> Ln

where each successive quotient has order p. Apartments are defined by fixing a basis (vi) of V and taking all lattices with basis (pai vi) where (ai) lies in Zn and is uniquely determined up to addition of the same integer to each entry. By definition each apartment has the required form and their union is the whole of X. The second axiom follows by a variant of the Schreier refinement argument. The last axiom follows by a simple counting argument based on the orders of finite Abelian groups of the form

L + pk ·Li / pk ·Li .

A standard compactness argument shows that X is in fact independent of the choice of K. In particular taking K = Q, it follows that X is countable. On the other hand taking K = Qp, the definition shows that GLn(Qp) admits a natural simplicial action on the building. The building comes equipped with a labelling of its vertices with values in Z / n Z. Indeed, fixing a reference lattice L, the label of M is given by

label (M) = logp |M/ pk L| modulo n

for k sufficently large. The vertices of any (n – 1)-simplex in X have distinct labels, running through the whole of Z / n Z. Any simplicial automorphism φ of X defines a permutation π of Z / n Z such that label (φ(M)) = π(label (M)). In particular for g in GLn (Qp),

label (g·M) = label (M) + logp || det g ||p modulo n.

Thus g preserves labels if g lies in SLn(Qp).

Automorphisms

Tits proved that any label-preserving automorphism of the affine building arises from an element of SLn(Qp). Since automorphisms of the building permute the labels, there is a natural homomorphism

Aut X <math>\rightarrow</math> Sn.

The action of GLn(Qp) gives rise to an n-cycle τ. Other automorphisms of the building arise from outer automorphisms of SLn(Qp) associated with automorphisms of the Dynkin diagram. Taking the standard symmetric bilinear form with orthonormal basis vi, the map sending a lattice to its dual lattice gives an automorphism with square the identity, giving the permutation σ that sends each label to its negative modulo n. The image of the above homomorphism is generated by σ and τ and is isomorphic to the dihedral group Dn of order 2n; when n = 3, it gives the whole of S3. If E is a finite Galois extension of Qp and the building is constructed from SLn(E) instead of SLn(Qp), the Galois group Gal (E/Qp) will also act by automorphisms on the building.

Geometric relations

Spherical buildings arise in two quite different ways in connection with the affine building X for SLn(Qp):

  • The link of each vertex L in the affine building corresponds to submodules of L/p·L under the finite field F = R/p·R = Z/(p). This is just the spherical building for SLn(F).
  • The building X can be compactified by adding the spherical building for SLn(Qp) as boundary "at infinity" (see Garrett 1997 or Brown 1989).

Classification

Tits proved that all irreducible spherical buildings (i.e. with finite Weyl group) of rank greater than 2 are associated to simple algebraic or classical groups; a similar result holds for irreducible affine buildings of rank greater than two. In rank 2, there is no such classification. In fact Tits proved that every 2-dimensional simplicial complex in which the links of vertices are isomorphic to the flag complex of a finite projective plane has the structure of a building, not necessarily classical. Many rank 2 buildings have been constructed using hyperbolic reflection groups or other more exotic constructions connected with orbifolds.

Applications

The theory of buildings has important applications in several rather disparate fields. Besides the already mentioned connections with the structure of reductive algebraic groups over general and local fields, buildings are used to study their representations. The results of Tits on determination of a group by its building have deep connections with rigidity theorems of George Mostow and Grigory Margulis, and with Margulis arithmeticity. Special types of buildings are studied in discrete mathematics, and the idea of a geometric approach to characterizing simple groups proved very fruitful in the classification of finite simple groups. The theory of buildings of type more general than spherical or affine is still relatively undeveloped, but these generalized buildings have already found applications to construction of Kac-Moody groups in algebra, and to nonpositively curved manifolds and hyperbolic groups in topology and geometric group theory.

See also

References

  • Tits, Jacques (1974), Buildings of spherical type and finite BN-pairs, Lecture Notes in Mathematics, Vol. 386, Springer-Verlag, ISBN 0-387-06757-4
  • Brown, Kenneth S. (1989), Buildings, Springer-Verlag, ISBN 0-387-96876-8
  • Ronan, Mark Lectures on buildings. Perspectives in Mathematics, 7. Academic Press, Inc., Boston, MA, 1989. xiv+201 pp. ISBN 0-12-594750-X
  • Garrett, Paul (1997), Buildings and Classical Groups, Chapman & Hall, ISBN 0-412-06331-X Contents, index, bibliography and errata
  • Weiss, Richard M. The structure of spherical buildings. Princeton University Press, Princeton, NJ, 2003. xiv+135 pp. ISBN 0-691-11733-0
  • Barré, Sylvain (1995), "Polyèdres finis de dimension 2 à courbure ≤ 0 et de rang 2", Ann. Inst. Fourier 45: 1037-1059 Article in djvu and pdf format.
  • Barré, Sylvain & Pichot, Mikaël (2007), "Sur les immeubles triangulaires et leurs automorphismes", Geom. Dedicata 130: 71-91 Preprint of article

View More Summaries on Building (mathematics)
 
Ask any question on Building (mathematics) and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Building (mathematics) from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy