Incidences and projective geometries

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last update: 2 June 2013

Incidence

An incidence geometry is a triple (P,L,I) where P and L are sets and I⊆P×L.

I⊆P×L ⟶pr1P pr2↓pr2 L

A point p∈P is contained in a line ℓ∈L if (p,ℓ)∈I. A set of points S⊆P is collinear if there exists ℓ∈L such that if p∈S then (p,ℓ)∈I.

Often it is convenient to

identify ℓ∈L with the set of points  pr1 (pr2-1(ℓ)) .

Subspaces

Assume that (P,L,I) is an incidence geometry such that

if p1,p2∈P  and p1≠p2  then there exists a unique ℓ∈L with  (p1,ℓ)∈I  and (p2,ℓ)∈I.

The line ℓ=ℓ(p1,p2) containing p1 and p2 is the line connecting p1 and p2.

A subspace is a subset S⊆P such that

if p1,p2∈S  then pr1 (pr2-1(ℓ(p1,p2))) ⊆S.

A subspace is S⊆P which contains any line connecting two of its points.

Lattices

Let ℒ be a partially ordered set and let x,y∈ℒ. The join, or supremum, or least upper bound of x and y is

x∨y=sup{x,y}  in ℒ such that
(a) sup{x,y}≥x  and sup{x,y}≥y, and
(b) If z∈ℒ and z≥x and z≥y then z≥sup{x,y}.

The meet, or infinum, or greatest lower bound, of x and y is

x∧y=inf{x,y} in  ℒ such that
(a) inf{x,y}≤x  and inf{x,y}≤y, and
(b) If z∈ℒ and z≤x and z≤y then z≤inf{x,y}.

A lattice is a partially ordered set ℒ such that

if x,y∈ℒ then  x∨y and x∧y exist in  ℒ.

A modular lattice is a lattice ℒ such that

if x,z∈ℒ and  x≤z then x∨(y∧z)= (x∨y)∧z.

Projective lattices

Let ℒ be a finite lattice with a unique minimal element 0 and a unique maximal element 1.

An atom is a∈ℒ such that there does not exist a′∈ℒ with 0<a′<a.

An atomic lattice is a lattice ℒ such that every element is a join of atoms.

A maximal chain is a maximal length sequence 0<a1<a2<…<aℓ<1 in ℒ.

A lattice ℒ is ranked if all maximal chains in ℒ have the same length.

Let ℒ be a ranked lattice and let a∈ℒ. The rank of a is i if there exists a maximal chain

0<a1<a2<…< aℓ<1with ai=a.Write rank(a)=?

A projective lattice is an atomic ranked modular lattice such that

if x,y∈ℒ then  rank(x∨y)+ rank(x∧y)= rank(x)+ rank(y).

A projective geometry is an incidence (P,L,I)

I⊆P×L ⟶pr1P pr2↓pr2 L

such that

(a) If p1,p2∈P and p1≠p2 then there exists a unique line ℓ(p1,p2)∈L containing p1 and p2,
(b) If p1,p2,p3∈P are noncollinear and ℓ is a line intersecting ℓ(p1,p3) and ℓ(p2,p3) then there exists p6∈P contained in ℓ and ℓ(p1,p2). p1 p2 p3 p6 ℓ(p1,p2) ℓ(p1,p3) ℓ(p2,p3) ℓ
(c) Any line contains at least 3 points
(d) There exist 3 noncollinear points in P
(e) Any increasing sequence of subspaces has finite length.

Theorem Let ℒ be the subspace lattice of (P,L,I). Then

{projective geometries} ⟷ {projective lattices} (P,L,I) ⟼ℒ

is a bijection.

Automorphisms

An automorphism of (P,L,I) is

g∈Sym(P)× Sym(L) such that  gI=I.

Hence, an automorphism of (P,L,I) is

g∈ ( Sym(P)× Sym(L) ) ∩Sym(I).

If G is the automorphism group of (P,L,I) then

I⊆P×L ⟶pr2P pr1↓pr2 L is G-equivariant.

A homology is a matrix g conjugate to

( a 1 ⋱ 1 ) ,

i.e. g is semisimple and fixes a hyperplane.

An elation is a matrix g conjugate to

( 11 01 1 ⋱ 1 ) ,

i.e. g is unipotent and fixes a hyperplane.

Theorem If ℒ is a projective lattice of rank r≥3 then

Aut(ℒ)=PΓ Lr(𝔻)=P GLr(𝔻)⋊ Gal(𝔻?)

where 𝔻 is a division ring and

ℒ is the lattice of subspaces of 𝔻r.

Notes and References

This is a typed copy of handwritten notes by Arun Ram from discussions with J. Bamberg and M. Givdici on 24-25/10/2012.

page history