Computation

Seven points, seven lines

A geometry with seven points, in which every two points lie on exactly one line and every two lines meet in exactly one point. There are no parallels, the whole thing is built out of the two-element field, and one of its lines has to be drawn as a circle.

Worth reading first: The field with four elements.

Euclid’s parallel postulate says that through a point off a line there is exactly one line missing it. There is a geometry in which there is none, it has seven points in it, and it fits on a postage stamp.

The Fano plane, and the incidence table behind itSeven points joined by six straight lines and one circle, beside the seven-by-seven table of which point lies on which line.001010100110101011111point on line?0123456L0L1L2L3L4L5L6seven points, seven lines, three points on every line and three lines through every pointthe drawing was checked against the algebra by searching all 5,040 relabellings — one of them carries GF(2)³ onto thispicture
Fig. 1 The Fano plane: seven points and seven lines, three points on every line and three lines through every point. Six of the lines are straight and the seventh is the circle — which is unavoidable, and is the subject of a section below.

The axioms, and how few there are

A projective plane is a set of points, a set of lines, and a relation saying which points lie on which lines, satisfying three conditions:

  1. any two distinct points lie on exactly one common line;
  2. any two distinct lines meet in exactly one common point;
  3. there exist four points with no three of them on a line.

The first is Euclid’s. The second is Euclid’s with the parallel case deleted — in this geometry there are no parallels at all. The third rules out degenerate arrangements, such as all the points sitting on a single line with one extra point off it, which would satisfy the first two vacuously.

Nothing about size is assumed and nothing about straightness is mentioned. A “line” is a set of points, and the axioms are conditions on how those sets intersect.

The counting that fixes the size

From those three conditions alone, the shape of the whole object follows.

Suppose some line has n+1n+1 points on it; call nn the order. Then:

  • Every line has n+1n+1 points. Given two lines, pick a point off both — the third axiom guarantees one — and project one line onto the other through it. The projection is a bijection, since every line through the chosen point meets both lines exactly once.
  • Every point lies on n+1n+1 lines. Same argument dualised.
  • There are n2+n+1n^2+n+1 points. Fix a point PP. Every other point lies on exactly one of the n+1n+1 lines through PP, each of which carries nn points besides PP. So the total is 1+(n+1)n=n2+n+11 + (n+1)n = n^2+n+1.
  • There are n2+n+1n^2+n+1 lines, by the same count with the roles swapped.

For n=2n = 2 that gives seven points and seven lines, which is the figure above. For n=3n = 3, thirteen of each; for n=4n = 4, twenty-one; for n=5n=5, thirty-one.

The generator does not take any of this on trust. It counts the points, the lines, the points on each line and the lines through each point, then checks every pair of points for exactly one common line and every pair of lines for exactly one common point — which at order five is nine hundred and thirty pairs of each kind.

The incidence table of the projective plane of order 3A square grid with a mark wherever a point lies on a line, for the projective plane over a small field.13 × 13, 52 markslines ↓ points →the plane over GF(3): 13 points, 13 lines, 4 points on each line and 4 lines througheach pointevery one of the 78 pairs of points was checked to lie on exactly one line, andevery pair of lines to meet exactly once
Fig. 2 The plane of order 3 as an incidence table: thirteen points, thirteen lines, four marks in every row and every column. Every one of the 78 pairs of points was checked to lie on exactly one line.

Where the planes come from

The construction needs a finite field, and it is the most economical use of one in this collection.

Take three-dimensional space over GF(q)GF(q): triples of field elements, with the usual addition and scaling. Now:

  • a point of the plane is a line through the origin of that space — a set {λv}\{\lambda v\} for a non-zero vv;
  • a line of the plane is a plane through the origin;
  • a point lies on a line when the one-dimensional space is contained in the two-dimensional one.

Counting: there are q31q^3 - 1 non-zero triples, and each line through the origin contains q1q-1 of them, so there are (q31)/(q1)=q2+q+1(q^3-1)/(q-1) = q^2+q+1 points. The same count applies to the planes through the origin, by pairing each with the direction perpendicular to it.

The axioms come free from linear algebra. Two distinct lines through the origin span exactly one plane; two distinct planes through the origin meet in exactly one line. Those are facts about dimensions, and dimension arithmetic over a finite field works exactly as it does over the reals.

The incidence table of the projective plane of order 5A square grid with a mark wherever a point lies on a line, for the projective plane over a small field.31 × 31, 186 markslines ↓ points →the plane over GF(5): 31 points, 31 lines, 6 points on each line and 6 lines through each pointevery one of the 465 pairs of points was checked to lie on exactly one line, and every pair of lines tomeet exactly once
Fig. 3 Order 5: thirty-one points, thirty-one lines, six marks in every row. Nothing here was drawn — it is the incidence relation of GF(5)³ with every count and every intersection verified.
The arithmetic of GF(5)Addition and multiplication tables of a finite field, optionally beside the table of a ring of the same kind of size.+01234012340123412340234013401240123×01234012340000001234024130314204321the 5 elements of GF(5) — every product of two non-zero elements is non-zeroassociativity and distributivity were checked over all 125 triples
Fig. 4 The arithmetic the order-5 plane is made of. Every incidence in the table above is the statement that a sum of three products vanishes in this multiplication — which is why the plane exists at 5 and the question is open at 12.

So there is a projective plane of order qq for every prime power qq. Whether there is one of any other order is a question this essay ends on.

The dependence is worth stating precisely, because it is the reason the two anchors of this field are the same subject. Nothing in the construction uses geometry; it uses the fact that scaling by a non-zero element is invertible, which is what makes “up to scale” an equivalence with classes all of the same size. Take that away — work over the integers modulo six, say — and the classes come out with different sizes, the count q2+q+1q^2+q+1 collapses, and the axioms fail. A field is required, and there is no field of order six.

The plane at infinity, which is where the parallels went

There is a way to arrive at a projective plane without any finiteness at all, and it explains the missing parallels.

Take the ordinary plane and add one new point for each direction — one for horizontal, one for vertical, one for each slope — and declare that all the new points lie on a single new line. Two parallel lines now meet, at the new point belonging to their shared direction. The exceptional case in Euclid’s second axiom disappears, and every two lines meet exactly once.

The finite planes are that construction done over a finite field instead of the reals, and the coordinates make it exact. A point of the plane is a triple (x:y:z)(x:y:z) up to scaling; the ones with z0z \ne 0 can be scaled to (x:y:1)(x:y:1) and are the ordinary plane; the ones with z=0z = 0 are the added directions, and they form one line.

So the Fano plane’s seven points are four “ordinary” ones and three at infinity, and which three depends entirely on which coordinate is called zz — a choice with no meaning inside the object. That is the sharpest statement of what projective geometry is for: the line at infinity is a convention, and every theorem is a statement that survives changing it.

Is the drawing the plane?

The picture at the top of this page is a triangle with its midpoints, its centre, and a circle. That is a drawing; whether it is the Fano plane is a separate question, and the sort of question a figure on this site is required to settle rather than assert.

The drawing offers seven point-positions and seven three-element sets: the three sides, the three medians, and the circle through the midpoints. The algebra offers seven one-dimensional subspaces of GF(2)3GF(2)^3 and seven two-dimensional ones.

The two are the same object if there is a relabelling of the seven points carrying the algebra’s line-sets onto the drawing’s. There are 7!=5,0407! = 5{,}040 relabellings, which is a small enough number to try all of them, so the generator does: it walks every permutation and asks whether the image of the algebraic line system is the drawn one.

One is found. That is a proof of isomorphism rather than a claim of it, and the point labels in the figure are the algebra’s coordinates carried across the map it found.

The incidence table of the projective plane of order 2A square grid with a mark wherever a point lies on a line, for the projective plane over a small field.7 × 7, 21 markslines ↓ points →the plane over GF(2): 7 points, 7 lines, 3 points on each line and 3 lines througheach pointevery one of the 21 pairs of points was checked to lie on exactly one line, andevery pair of lines to meet exactly once
Fig. 5 The same seven points and seven lines as a table, with no geometry in it at all. This is what the drawing was checked against — three marks in every row, three in every column, and any two rows sharing exactly one mark.

Why one line has to bend

The circle in the drawing is not an artistic choice, and it cannot be removed.

The Sylvester–Gallai theorem says that in the ordinary plane, any finite set of points not all on one line has some line through exactly two of them. The Fano plane’s seven points have no such line: every line of the configuration carries three, and the theorem forbids that arrangement of straight lines in the real plane.

So the Fano plane is not drawable with seven straight lines, whatever the arrangement. Every published picture of it bends one line, and every published picture is honest about the same thing: the object exists, and the plane it is being drawn in cannot hold it.

That is worth pausing on, because it is a clean example of a limit on figures rather than on mathematics. The incidence table in the previous figure carries the whole object with nothing bent, and is much harder to read. The bent drawing is easier to read and is a picture of something whose straightness is a lie. Both are shown here for that reason.

The lesson generalises to every finite geometry. Their points are not positions and their lines are not straight; both are labels for sets, and any drawing imposes a geometry the object does not have.

It is a different situation from a Voronoi diagram, where the picture is the definition and the regions really are regions. Here the drawing is a representation chosen by the author, and the site’s rule for such cases — established one field earlier, where logic’s objects had no natural positions either — is that the choice must be checkable. The relabelling search is that check, and it is the reason the bent circle can be shown without apology: the picture has been proved to be a picture of the right thing, whatever its curvature suggests.

Duality, which is free

The axioms are symmetric under swapping the words point and line: “two points lie on one line” becomes “two lines meet in one point”, and the third axiom becomes its own mirror.

So every theorem about projective planes has a dual theorem, obtained by swapping the two words throughout, and it needs no separate proof.

That symmetry is visible in the incidence tables. Transposing the matrix — swapping rows for columns — turns the plane into another plane, its dual. For the planes built from fields the dual is isomorphic to the original, so the tables are symmetric up to relabelling; for some exotic planes it is not, and a plane and its dual are genuinely different objects of the same size.

Duality is the reason all the counts in this essay came in pairs. Nothing had to be proved twice.

Seven objects, seven objects, and a symmetry group

One more count is worth doing, because it says how rigid the object is.

A symmetry of the Fano plane is a relabelling of the seven points carrying lines to lines. The search that established the drawing’s identity found one such map; running it to the end finds all of them, and there are 168168.

That number can be arrived at directly. A symmetry is determined by where it sends a chosen basis: the first point may go to any of 77, the second to any of the remaining 66, and the third to any of the 44 not on the line through the first two — since a triple on a common line does not determine the rest. Multiplying gives 7×6×4=1687 \times 6 \times 4 = 168.

One hundred and sixty-eight symmetries on seven points is a great many. For comparison, the complete graph on seven vertices has 5,0405{,}040, and a generic configuration of seven points would have one. The Fano plane is close to being as symmetric as a seven-point object can be, and its symmetry group is a famous one — the second-smallest non-abelian simple group, appearing elsewhere as the symmetries of a particular curve and as a group of matrices over GF(2)GF(2).

Symmetry of that order is what makes finite geometries useful for building other things. A design with many symmetries can be permuted into itself, so a construction using it can be assumed to start anywhere, and the schedule of the next essay is built by exactly that kind of rotation.

Which orders exist

The construction gives a plane at every prime power: 2,3,4,5,7,8,9,11,13,16,2, 3, 4, 5, 7, 8, 9, 11, 13, 16, \ldots

Whether any others exist is one of the oldest open problems in combinatorics, and the state of knowledge is unusual.

Order 6 does not exist. The Bruck–Ryser theorem says that if n1n \equiv 1 or 22 modulo 44, a plane of order nn exists only if nn is a sum of two squares. Six is 22 mod 44 and is not a sum of two squares, so there is no plane of order six. That result also settles 1414, 2121, 2222 and infinitely many others.

Order 10 does not exist, and Bruck–Ryser says nothing about it, since 10=12+3210 = 1^2+3^2. It was settled in 1989 by Clement Lam and colleagues after several thousand hours of computer search over the possible weight distributions of an associated code. The proof is an exhaustion no person can check, and its status was debated for exactly that reason — the same debate the four-colour theorem had provoked fifteen years earlier.

Order 12 is open. So is every non-prime-power order the two results above do not reach. Nobody has found a plane of non-prime-power order and nobody has proved that none exists, and the gap between those two states has not moved in a hundred years.

That is the situation this whole field keeps producing: a construction that works for a well-understood set of sizes, a necessary condition that rules out some others, and a stubborn silence in between.

Two orthogonal Latin squares of order 3Two Latin squares side by side and their superposition, in which every pair of symbols appears exactly once.first012120201second021102210superimposed001221112002220110two squares of order 3, each Latin, and their 9 superimposed pairs are all differentthe pairs were collected into a set and counted — one repeat would have made the set smaller
Fig. 6 The same algebra in another costume: two orthogonal Latin squares of order 3, built from arithmetic modulo 3. A projective plane of order n and a complete set of orthogonal squares of order n are the same object twice over.

That last figure is a preview of a result worth stating here even though it belongs to another essay: a projective plane of order nn exists exactly when there are n1n-1 mutually orthogonal Latin squares of order nn. The two objects are interchangeable, and the non-existence at order six was first proved in the Latin-square language, by Gaston Tarry, in 1900 — long before Bruck and Ryser, and by pure exhaustion.

Where this anchor goes

A projective plane is one kind of structure defined by an incidence condition. There are others, and the smallest interesting family drops the requirement that the lines all have the same relationship to each other and keeps only the requirement about pairs.

That family is the Steiner triple system: a set of points and a set of triples, such that every pair of points lies in exactly one triple. The Fano plane is one — its seven lines are triples, and every pair of its seven points is on exactly one.

A schedule on 7 points where every pair meets exactly oncePoints around a circle with the triples of a Steiner system drawn between them, beside the list of triples.01234567 triples0 1 20 3 40 5 61 3 51 4 62 3 62 4 57 points, 7 triples, each point in 3 of them — and every one of the 21 pairs appears exactly oncefound by backtracking over the pairs, which decides existence rather than assuming it
Fig. 7 The same seven points and seven lines, drawn without any pretence of geometry: each triple is a closed path among points on a circle, and the only claim made is that every one of the 21 pairs appears in exactly one triple.

Comparing that figure with the one at the top of the page is instructive. Both are the Fano plane. One arranges the points to make the lines look like lines and pays for it with a bent circle; the other makes no spatial claim at all and is unreadable as a geometry. Neither drawing is the object, and the incidence table is closer to being it than either. Which sizes admit one turns out to have a complete and much friendlier answer than the projective plane question, and the answer comes from two divisions.

What links here

Computed from the collection, not written here: the essays that point at this one.

Reads more easily once this is understood

Essays that name this one as worth reading first.

Named objects

A dashed tag is an object no other essay names yet.

BasisCounting argumentDualityFano planeFinite fieldIncidencePrime powerProjective plane