Next Article in Journal
Cumulants of Multivariate Symmetric and Skew Symmetric Distributions
Next Article in Special Issue
Centralising Monoids with Low-Arity Witnesses on a Four-Element Set
Previous Article in Journal
Research on Remote Sensing Image Matching with Special Texture Background
Previous Article in Special Issue
Semigroups of Terms, Tree Languages, Menger Algebra of n-Ary Functions and Their Embedding Theorems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Identities Generalizing the Theorems of Pappus and Desargues

Department of Mathmatics, Iowa State University, Ames, IA 50011, USA
Symmetry 2021, 13(8), 1382; https://doi.org/10.3390/sym13081382
Submission received: 1 July 2021 / Revised: 21 July 2021 / Accepted: 22 July 2021 / Published: 29 July 2021
(This article belongs to the Special Issue The Study of Lattice Theory and Universal Algebra)

Abstract

:
The Theorems of Pappus and Desargues (for the projective plane over a field) are generalized here by two identities involving determinants and cross products. These identities are proved to hold in the three-dimensional vector space over a field. They are closely related to the Arguesian identity in lattice theory and to Cayley-Grassmann identities in invariant theory.

1. Introduction

Identities that generalize the theorems of Pappus and Desargues come from two primary sources: lattice theory and invariant theory. Schützenberger [1] showed in 1945 that the theorem of Desargues can be expressed as an identity (the Arguesian identity) that holds in the lattice of subspaces of a projective geometry just in case the geometry is Desarguesian. Jónsson [2] showed in 1953 that the Arguesian identity holds in every lattice of commuting equivalence relations. The further literature on Arguesian lattices includes [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]. Two identities similar to those in this paper were published in 1974 [23] (with different meanings for the operations), as examples in the context of invariant theory. For proofs see [24] (p. 150, p. 156). Further literature on such identities includes [25,26,27,28,29,30,31,32,33,34,35,36,37,38,39].
The identities in lattice theory use join and meet and apply to lattices. The identities in invariant theory use the wedge (exterior) product (corresponding to join), bracket (a multilinear altering operation like determinant), and an operation corresponding to meet. The identities apply to Cayley-Grassmann algebras (exterior algebras with a bracket operation). The connections between the two kinds of identities are not straightforward and are studied in several of the papers listed above.
The identities presented in this paper have a more mundane origin. In the spring semester of 1997, the author taught the second semester of college geometry out of the text by Ryan [40]. The text’s analytical approach included the fact that three points (or lines) in the projective plane over a field are collinear (or concurrent) if and only if the determinant of their homogeneous coordinates is zero; see (6) below. Pappus and Desargues both assert that if certain collinearities or concurrences hold, then others do, that is, if some numbers are zero, then so are others. Clearly, then, there must be algebraic formulas that assert such dependences between determinants and from which the two theorems can be deduced. Such formulas were found and included in the course notes [41]; parts of those notes appear in this paper.
Section 2 presents the two identities along with definitions of their operations. They use cross products and determinants rather than the joins, meets, and brackets of invariant theory [24]. Section 3 is a review of the projective plane over a field. Section 4 derives the theorems of Pappus and Desargues from the identities. Section 5 shows how cross product relates to join and meet, followed by a Discussion, an Acknowledgement, and an Appendix A containing proofs of the identities. Good survey papers on the theorems of Pappus and Desargues include [42,43].

2. Cross Products and Determinants

Let F be a field. The elements of F 3 are written as column vectors. Let
r F , a = x 0 x 1 x 2 F 3 , b = y 0 y 1 y 2 F 3 , c = z 0 z 1 z 2 F 3 .
  • The scalar product of r and a is
    r a = r x 0 r x 1 r x 2 F 3 .
  • The inner product of a and b is
    a , b = x 0 y 0 + x 1 y 1 + x 2 y 2 F .
  • The cross product of a and b is
    a × b = x 1 y 2 x 2 y 1 x 2 y 0 x 0 y 2 x 0 y 1 x 1 y 0 F 3 .
  • The determinant of a , b , c is
    det [ a , b , c ] = x 0 y 0 z 0 x 1 y 1 z 1 x 2 y 2 z 2 = x 0 y 1 z 2 + x 2 y 0 z 1 + x 1 y 2 z 0 x 0 y 2 z 1 x 2 y 1 z 0 x 1 y 0 z 2 F .
Identity (1) in the next theorem generalizes the theorem of Pappus and identity (2) generalizes the theorem of Desargues. They can be proved by expanding both sides in 18 variables (3 for each of 6 vectors) and obtaining the same result. A proof of Theorem 1 using properties of cross products and determinants is in the Appendix A. In Theorem 2, the theorems of Pappus and Desargues are proved using Theorem 1.
Theorem 1.
For any field F and any a , b , c , a , b , c F 3 ,
det [ ( a × b ) × ( a × b ) , ( b × c ) × ( b × c ) , ( c × a ) × ( c × a ) ] = det [ a , b , b ] det [ b , c , c ] det [ c , a , a ] det [ a , b , c ] + det [ b , a , a ] det [ a , c , c ] det [ c , b , b ] det [ a , b , c ] ,
det [ ( a × b ) × ( a × b ) , ( b × c ) × ( b × c ) , ( c × a ) × ( c × a ) ] = det [ a × a , b × b , c × c ] det [ a , b , c ] det [ a , b , c ] .

3. The Projective Plane over F

The points A, B, ... of the projective plane over  F are the one-dimensional subspaces of the three-dimensional vector space F 3 over F , and its lines λ , μ , ... are the two-dimensional subspaces of F 3 . A point A is on a line λ if A is a subset of λ :
A is on λ iff A λ .
Every non-zero vector in F 3 determines both a point and a line. Suppose 0 a F 3 . Then A = { r a : r F } is the 1-dimensional subspace generated by a , so A is a point in the projective plane over F , and λ = { x : x , b = 0 } is the 2-dimensional subspace of vectors perpendicular to a , so λ is a line in the projective plane over F . The vector a is referred to as homogeneous coordinates for point A and line λ . The incidence relation between a point and a line holds when their homogeneous coordinates are perpendicular, for if 0 a , b F 3 then
point { r a : r F } is on line { x : x , b = 0 } iff a , b = 0
An axiom of projective geometry (every two points are on a unique line) takes the form in the projective plane over a field that every two 1-dimensional subspaces are contained in a unique 2-dimensional subspace. The 2-dimensional subspace containing two 1-dimensional subspaces is the set of sums of two vectors, one from each subspace. To notate this, we extend the notion of addition from individual vectors to sets of vectors. For arbitrary sets of vectors A , B F 3 , let A + B be the set of their sums:
A + B = { a + b : a A , b B } .
If A and B are distinct points, then there are linearly independent non-zero vectors a , b F 3 such that A = { r a : r F } and B = { s b : s F } . The unique line containing both A and B is the 2-dimensional subspace generated by a and b , consisting of all their linear combinations,
A + B = { r a + s b : r , s F } .
The cross product a × b is perpendicular to both a and b , so any vector perpendicular to a × b will be in the unique line A + B containing A and B (and conversely), that is,
A + B = { x : x , a × b = 0 } .
Thus, points with homogeneous coordinates a and b determine a line with homogeneous coordinates a × b . Suppose two lines, λ and μ , have homogeneous coordinates a , b F , respectively:
λ = { x : x , a = 0 } , μ = { x : x , b = 0 } .
Note that a and b are linearly independent, since otherwise λ = μ (and there is only one line, not two, as postulated). An axiom for projective planes is that distinct lines meet at a unique point. In the projective plane over a field, this axiom asserts the fact that distinct 2-dimensional subspaces contain a unique 1-dimensional subspace, namely, their intersection. Thus, the intersection λ μ of the lines λ and μ is the unique point that occurs on both lines. When λ and μ have coordinates a and b , their intersection is the 1-dimensional subspace of F 3 generated by any non-zero vector perpendicular to both a and b , such as a × b :
λ μ = { r ( a × b ) : r F } .
Thus, two lines with homogeneous coordinates a and b meet at a point with homogeneous coordinates a × b .
Suppose 0 a , b , c F 3 . Let A, B, and C be the points, and λ , μ , and ν the lines, with homogeneous coordinates a , b and c , respectively:
A = { r a : r F } , B = { r b : r F } , C = { r c : r F } , λ = { x : x , a = 0 } , μ = { x : x , b = 0 } , ν = { x : x , c = 0 } .
By definition, A , B , C are collinear iff A + B = A + C = B + C , and λ , μ , ν are concurrent iff λ μ ν is a point. Concurrency and collinearity are equivalent to the homogeneous coordinates having determinant zero:
A , B , C are collinear iff det [ a , b , c ] = 0 iff λ , μ , ν are concurrent .

4. The Theorems of Pappus and Desargues

It is convenient to state the Theorems of Pappus and Desargues together. Between them they deal with the fifteen lines that pass through six points A , B , C , A , B , C . Each pair of points determines a line. Twelve of these lines are intersected in pairs to produce six more constructed points P , Q , R , P , Q , R , three for Pappus and the other three for Desargues, while the remaining three lines are involved in the conclusion of Desargues. The hypotheses also fit together nicely. For Pappus the assumption is that the triples A , B , C and A , B , C are both collinear, while for Desargues the assumption is that neither triple is collinear. A difference arises in the conclusion, which for Pappus is that its three constructed points P , Q , R are collinear, while for Desargues the conclusion is that three lines are concurrent iff its three constructed points P , Q , R are concurrent.
Theorem 2
(Pappus-Desargues). Let F be a field and A , B , C , A , B , C be six points in the projective plane over F . Define six more points
P = ( A + B ) ( A + B ) , P = ( A + B ) ( A + B ) , Q = ( B + C ) ( B + C ) , Q = ( B + C ) ( B + C ) , R = ( C + A ) ( C + A ) , R = ( C + A ) ( C + A ) .
(Pap) 
If A , B , C are collinear and A , B , C are collinear then P , Q , R are collinear.
(Des) 
If A , B , C are non-collinear and A , B , C are non-collinear then the lines A + A , B + B , C + C are concurrent iff the points P , Q , R are collinear.
Proof. 
Choose homogeneous coordinates 0 a , b , c , a , b , c F 3 for the points A , B , C , A , B , C , so that
A = { r a : r F } , A = { r a : r F } , B = { r b : r F } , B = { r b : r F } , C = { r c : r F } , C = { r c : r F } .
From the definitions of P , Q , R , P , Q , R we get their homogeneous coordinates as cross products of cross products:
P = { r ( ( a × b ) × ( a × b ) ) : r F } , Q = { r ( ( b × c ) × ( b × c ) ) : r F } , R = { r ( ( c × a ) × ( c × a ) ) : r F } , P = { r ( ( a × b ) × ( a × b ) ) : r F } , Q = { r ( ( b × c ) × ( b × c ) ) : r F } , R = { r ( ( c × a ) × ( c × a ) ) : r F } .
For (Pap), assume A , B , C are collinear and A , B , C are collinear. By (6),
det [ a , b , c ] = 0 = det [ a , b , c ] .
By (1),
det [ ( a × b ) × ( a × b ) , ( b × c ) × ( b × c ) , ( c × a ) × ( c × a ) ] = det [ a , b , b ] det [ b , c , c ] det [ c , a , a ] det [ a , b , c ] 0 + det [ b , a , a ] det [ a , c , c ] det [ c , b , b ] det [ a , b , c ] 0 = 0 ,
hence P , Q , R are collinear by (6).
For (Des), assume that A , B , C are non-collinear and A , B , C are non-collinear. By (6),
det [ a , b , c ] 0 det [ a , b , c ] .
We wish to show A + A , B + B , C + C are concurrent iff P , Q , R are collinear. By (6), these two statements are equivalent to (8) and (9), respectively.
0 = det [ a × a , b × b , c × c ] ,
0 = det [ ( c × a ) × ( c × a ) , ( a × b ) × ( a × b ) , ( b × c ) × ( b × c ) ] .
The equivalence of (8) and (9) follows from identity (2), written here with assumption (7) incorporated.
det [ ( a × b ) × ( a × b ) , ( b × c ) × ( b × c ) , ( c × a ) × ( c × a ) ] = det [ a × a , b × b , c × c ] det [ a , b , c ] 0 det [ a , b , c ] 0 .
Notice that (8) implies (9) without assuming (7) but to get (8) from (9) requires knowing that if a product of three numbers is zero and two of them are not zero then the third one must be zero. Here the assumption (7) is needed; divide both sides of the equation by the non-zero factors. For example, if A , B , C are collinear then P , Q , R are also collinear because they lie on the same line as A , B , C , but the lines A + A , B + B , and C + C can be non-concurrent.

5. Connection with Invariant Theory

The identities (1) and (2) have the same form as the identities in [23,24], but the operations are different. Some concepts are reviewed here to explain the difference. Let V and W be vector spaces (over a common field), with a V and b W . The tensor product of vectors  a and b is a b , where ⊗ is the generic linear transformation from V × W to another vector space (over the common field), that is, ⊗ obeys no laws other than those that are universally true for linear transformations, namely, for all vectors a , b , c and every scalar r,
( a + b ) c = a c + b c , a ( b + c ) = a b + a c , ( r a ) b = r ( a b ) = a ( r b ) .
The tensor product  V W of V and W is the vector space whose vectors are the tensor products of vectors in the two spaces:
V W = { a b : a V , b W } .
Given a single vector space V, the exterior, wedge, antisymmetric tensor, or alternating, product V V = 2 V of a vector space V with itself is the subspace of the tensor square V V consisting of the wedge products  a b = a b b a of vectors in V:
V V = { a b : a , b V } .
Suppose e 1 , , e n is a basis for V. The set of wedge products of these vectors contains pairs, a b and b a , that are linearly dependent because their sum is zero, but otherwise the set of wedge products of basis elements is linearly independent. The number of linearly independent vectors obtained as wedge products of basis vectors is therefore 1 2 n ( n 1 ) . When n = 3 , the dimension of the exterior product is 3, but for n = 4 , 5 , 6 , the dimension of 2 V is 6 , 10 , 15 , . In three dimensions only, the wedge product “is” the cross product. Suppose a = i < n x i e i and b = j < n y j e j . Simple calculations using the rules above show that, in the 3-dimensional case, the wedge product is
a b = ( x 0 y 1 x 1 y 0 ) e 0 e 1 + ( x 2 y 0 x 0 y 2 ) e 2 e 0 + ( x 1 y 2 x 2 y 1 ) e 1 e 2 .
The cross product is
a × b = ( x 1 y 2 x 2 y 1 ) e 0 + ( x 2 y 0 x 0 y 2 ) e 1 + ( x 0 y 1 x 1 y 0 ) e 2 ,
so a b = a × b follows by setting
e 0 = e 1 e 2 , e 1 = e 2 e 0 , e 2 = e 0 e 1 .
This identification is not possible in dimensions other than 3. The setting must move from undergraduate to graduate mathematics (from 3-dimensional linear algebra to exterior products). The identities as presented here can be understood as the 3-dimensional case of identities arising in invariant theory. In three dimensions, both join and meet are realized through the cross product.

6. Discussion

This elementary presentation may serve as an invitation and introduction to the relevant literature of invariant theory cited in the Introduction, illustrating the concepts in the special case of three dimensions. A key problem is the relationship between the identities of linear lattices and those of Cayley-Grassmann algebras. A linear lattice is a lattice of commuting equivalence relations [13]. Jónsson’s theorem [2] that lattices of commuting equivalence relations are Arguesian is a special case of a similar result: every algebra of binary relations (a set of binary relations closed under intersection, composition of relations, and the formation of converses) satisfies Jónsson’s [22] infinite set of axioms for such algebras, and the Arguesian identity is one of the three simplest of Jónsson’s axioms. It may well be fruitful to explore the connection between this more general setting (of binary relations, not specialized to commuting equivalence relations) and the identities of Cayley-Grassmann algebras.

Funding

This research received no external funding.

Acknowledgments

It was obvious that (1) and (2) must occur in some form somewhere in the literature. Thanks are due to Victor Pambuccian, who responded to an inquiry in 2020 by referring the author to [24,26], which led to [23].

Conflicts of Interest

The author declares no conflict of interest.

Appendix A. Proof of Theorem 1

The basic identities used in the proofs of (1) and (2) are (A1)–(A11).
Cross products are perpendicular to their factors:
a × b , a = a × b , b = 0
The scalar triple product (box product) identity:
a × b , c = a , b × c = det [ a , b , c ]
Determinants with proportional inputs are zero:
det [ a , b , r a ] = 0
Determinants are invariant under cyclic permutations:
det [ a , b , c ] = det [ b , c , a ] = det [ c , a , b ]
Switching inputs of a determinant changes its sign (anti-symmetry):
det [ a , b , c ] = det [ b , a , c ] = det [ a , c , b ] = det [ c , b , a ]
Determinants are unchanged by transposition:
det [ a , b , c ] = x 0 y 0 z 0 x 1 y 1 z 1 x 2 y 2 z 2 = x 0 x 1 x 2 y 0 y 1 y 2 z 0 z 1 z 2 = det a b c
Scalars move in and out of determinants:
r det [ a , b , c ] = det [ r a , b , c ] = det [ a , r b , c ] = det [ a , b , r c ]
Determinants distribute over vector addition:
det [ a + b , c , d ] = det [ a , c , d ] + det [ b , c , d ]
A product of determinants is the determinant of inner products:
det a b c det [ a , b , c ] = a , a a , b a , c b , a b , b b , c c , a c , b c , c
The vector triple product identity:
( a × b ) × c = a , c b b , c a
The vector quadruple product identity:
( a × b ) × ( c × d ) = det [ c , b , d ] a + det [ d , a , c ] b
Proof of (A11).
( a × b ) × ( c × d ) = a , c × d b b , c × d a = det [ a , c , d ] b det [ b , c , d ] a = det [ c , b , d ] a + det [ d , a , c ] b
The proofs of (1) and (2) start similarly. In both cases three vectors are defined as cross products of cross products of pairs of points drawn from a , b , c , a , b , c . For (1), they are cross products of cross products of a , b , c with cross products of a , b , c . For (2), they are cross products of cross products of one of a , b , c with one of a , b , c . The first step in both proofs is to apply the distributive law to the determinant of these three vectors (each a sum of two vectors) and get a sum of eight terms. For (1), all but two of these terms cancel and the proof ends. For (2) more steps are needed.
Proof of (1).
By (A11),
( a × b ) × ( a × b ) = det [ b , a , a ] b + det [ a , b , b ] a , ( b × c ) × ( b × c ) = det [ c , b , b ] c + det [ b , c , c ] b , ( c × a ) × ( c × a ) = det [ a , c , c ] a + det [ c , a , a ] c .
Then the left side of (1) is the sum of eight determinants by the distributive law (A8). Move all the scalars (the determinants) out by (A7), obtaining another sum of eight terms. Six of these eight terms cancel with each other. They are named r 1 , , r 6 in notations to the right of the affected terms. Note that r 2 = r 6 , r 4 = r 5 , and r 1 = r 3 by (A4) and (A5). What remains are the two terms on the right side of (1).
det [ ( a × b ) × ( a × b ) , ( b × c ) × ( b × c ) , ( c × a ) × ( c × a ) ] = det [ det [ b , a , a ] b + det [ a , b , b ] a , det [ c , b , b ] c + det [ b , c , c ] b , det [ a , c , c ] a + det [ c , a , a ] c ] = det [ det [ b , a , a ] b , det [ c , b , b ] c , det [ a , c , c ] a ] + det [ det [ b , a , a ] b , det [ c , b , b ] c , det [ c , a , a ] c ] + det [ det [ b , a , a ] b , det [ b , c , c ] b , det [ a , c , c ] a ] + det [ det [ b , a , a ] b , det [ b , c , c ] b , det [ c , a , a ] c ] + det [ det [ a , b , b ] a , det [ c , b , b ] c , det [ a , c , c ] a ] + det [ det [ a , b , b ] a , det [ c , b , b ] c , det [ c , a , a ] c ] + det [ det [ a , b , b ] a , det [ b , c , c ] b , det [ a , c , c ] a ] + det [ det [ a , b , b ] a , det [ b , c , c ] b , det [ c , a , a ] c ] = det [ b , a , a ] det [ c , b , b ] det [ a , c , c ] det [ b , c , a ] + det [ b , a , a ] det [ c , b , b ] det [ c , a , a ] det [ b , c , c ] = r 1 + det [ b , a , a ] det [ b , c , c ] det [ a , c , c ] det [ b , b , a ] = r 2 + det [ b , a , a ] det [ b , c , c ] det [ c , a , a ] det [ b , b , c ] = r 3 + det [ a , b , b ] det [ c , b , b ] det [ a , c , c ] det [ a , c , a ] = r 4 + det [ a , b , b ] det [ c , b , b ] det [ c , a , a ] det [ a , c , c ] = r 5 + det [ a , b , b ] det [ b , c , c ] det [ a , c , c ] det [ a , b , a ] = r 6 + det [ a , b , b ] det [ b , c , c ] det [ c , a , a ] det [ a , b , c ] = det [ a , b , b ] det [ b , c , c ] det [ c , a , a ] det [ a , b , c ] + det [ b , a , a ] det [ a , c , c ] det [ c , b , b ] det [ a , b , c ] .
Proof of (2).
Define three vectors and use (A11).
p = ( a × b ) × ( a × b ) = det [ b , a , a ] b + det [ a , b , b ] a , q = ( b × c ) × ( b × c ) = det [ c , b , b ] c + det [ b , c , c ] b . r = ( c × a ) × ( c × a ) = det [ a , c , c ] a + det [ c , a , a ] c ,
The left side of (2) is det [ p , q , r ] , equal by (A8) to the sum of eight determinants. Six of them are zero by (A3) because two of their argument vectors are proportional. Move two determinants out of the remaining sum of two terms by (A7), obtaining another sum of two terms. These share the determinant det [ a , b , c ] , which can be factored out. The remaining factor is the sum of two products of three determinants. This factor can be recast first as a determinant of a matrix with zeroes on the diagonal, then as a determinant of inner products, and finally as a product of the determinant det [ a , b , c ] with the determinant of three cross products, as required to leave the desired right hand side of (2).
det [ p , q , r ] = det [ det [ a , b , b ] a + det [ b , a , a ] b , det [ b , c , c ] b + det [ c , b , b ] c , det [ c , a , a ] c + det [ a , c , c ] a ] = det [ det [ a , b , b ] a , det [ b , c , c ] b , det [ c , a , a ] c ] + det [ det [ a , b , b ] a , det [ b , c , c ] b , det [ a , c , c ] a ] = 0 + det [ det [ a , b , b ] a , det [ c , b , b ] c , det [ c , a , a ] c ] = 0 + det [ det [ a , b , b ] a , det [ c , b , b ] c , det [ a , c , c ] a ] = 0 + det [ det [ b , a , a ] b , det [ b , c , c ] b , det [ c , a , a ] c ] = 0 + det [ det [ b , a , a ] b , det [ b , c , c ] b , det [ a , c , c ] a ] = 0 + det [ det [ b , a , a ] b , det [ c , b , b ] c , det [ c , a , a ] c ] = 0 + det [ det [ b , a , a ] b , det [ c , b , b ] c , det [ a , c , c ] a ] = det [ a , b , b ] det [ b , c , c ] det [ c , a , a ] det [ a , b , c ] + det [ b , a , a ] det [ c , b , b ] det [ a , c , c ] det [ b , c , a ] = ( det [ a , b , b ] det [ b , c , c ] det [ c , a , a ] + det [ b , a , a ] det [ c , b , b ] det [ a , c , c ] ) det [ a , b , c ] = 0 det [ a , b , b ] det [ a , c , c ] det [ b , a , a ] 0 det [ b , c , c ] det [ c , a , a ] det [ c , b , b ] 0 det [ a , b , c ] by def . of det = a , a × a a , b × b a , c × c b , a × a b , b × b b , c × c c , a × a c , b × b c , c × c det [ a , b , c ] = det a b c det [ a × a , b × b , c × c ] det [ a , b , c ] = det [ a × a , b × b , c × c ] det [ a , b , c ] det [ a , b , c ]

References

  1. Schützenberger, M.P. Sur certains axiomes de la théorie des structures. C. R. Acad. Sci. Paris 1945, 221, 218–220. [Google Scholar]
  2. Jónsson, B. On the representation of lattices. Math. Scand. 1953, 1, 193–206. [Google Scholar] [CrossRef] [Green Version]
  3. Jónsson, B. The class of Arguesian lattices is self-dual. Algebra Universalis 1972, 2, 396. [Google Scholar] [CrossRef]
  4. Monk, G.S. Desargues’ law and the representation of primary lattices. Pac. J. Math. 1969, 30, 175–186. [Google Scholar] [CrossRef] [Green Version]
  5. Jónsson, B.; Monk, G.S. Representations of primary Arguesian lattices. Pac. J. Math. 1969, 30, 95–139. [Google Scholar] [CrossRef] [Green Version]
  6. Jónsson, B. Representations of relatively complemented modular lattices. Trans. Am. Math. Soc. 1962, 103, 272–302. [Google Scholar] [CrossRef]
  7. Jónsson, B. Extensions of von Neumann’s coordinatization theorem. In Proceedings of the Symposia in Pure Mathematics; American Mathematical Society: Providence, RI, USA, 1961; Volume II, pp. 65–70. [Google Scholar]
  8. Jónsson, B. Arguesian lattices of dimension n ≤ 4. Math. Scand. 1959, 7, 133–145. [Google Scholar] [CrossRef] [Green Version]
  9. Jónsson, B. Modular lattices and Desargues’ theorem. Math. Scand. 1954, 2, 295–314. [Google Scholar] [CrossRef] [Green Version]
  10. Haiman, M. Arguesian lattices which are not type-1. Algebra Universalis 1991, 28, 128–137. [Google Scholar] [CrossRef]
  11. Haiman, M.D. Arguesian lattices which are not linear. Bull. Am. Math. Soc. (New Ser.) 1987, 16, 121–123. [Google Scholar] [CrossRef] [Green Version]
  12. Haiman, M. Two notes on the Arguesian identity. Algebra Universalis 1985, 21, 167–171. [Google Scholar] [CrossRef]
  13. Haiman, M. Linear lattice proof theory: An overview. In Universal Algebra and Lattice Theory; Charleston, S.C., Ed.; Lecture Notes in Mathematics; Springer: Berlin, Germany, 1985; Volume 1149, pp. 129–141. [Google Scholar] [CrossRef]
  14. Haiman, M. Proof theory for linear lattices. Adv. Math. 1985, 58, 209–242. [Google Scholar] [CrossRef] [Green Version]
  15. Finberg, D.; Mainetti, M.; Rota, G.C. The logic of commuting equivalence relations. In Logic and Algebra (Pontignano, 1994); Lecture Notes in Pure and Applied Mathematics; Dekker: New York, NY, USA, 1996; Volume 180, pp. 69–96. [Google Scholar]
  16. Day, A.; Herrmann, C.; Jónsson, B.; Nation, J.B.; Pickering, D. Small non-Arguesian lattices. Algebra Universalis 1994, 31, 66–94. [Google Scholar] [CrossRef]
  17. Nation, J.B.; Pickering, D.A. Arguesian lattices whose skeleton is a chain. Algebra Universalis 1987, 24, 91–100. [Google Scholar] [CrossRef]
  18. Pickering, D. A self-dual Arguesian inequality. Algebra Universalis 1986, 22, 99. [Google Scholar] [CrossRef]
  19. Day, A.; Pickering, D. A note on the Arguesian lattice identity. Studia Sci. Math. Hung. 1984, 19, 303–305. [Google Scholar]
  20. Day, A.; Pickering, D. The coordinatization of Arguesian lattices. Trans. Am. Math. Soc. 1983, 278, 507–522. [Google Scholar] [CrossRef]
  21. Jónsson, B. Lattice-theoretic approach to projective and affine geometry. In The Axiomatic Method. With Special Reference to Geometry and Physics, Proceedings of the International Symposium, Berkeley, CA, USA, 26 December–4 January 1957; Henkin, L., Suppes, P., Tarski, A., Eds.; Studies in Logic and the Foundations of Mathematics; North-Holland Publishing Co.: Amsterdam, The Netherlands, 1959; pp. 188–203. [Google Scholar]
  22. Jónsson, B. Representation of modular lattices and of relation algebras. Trans. Am. Math. Soc. 1959, 92, 449–464. [Google Scholar] [CrossRef]
  23. Doubilet, P.; Rota, G.C.; Stein, J. On the foundations of combinatorial theory. IX. Combinatorial methods in invariant theory. Stud. Appl. Math. 1974, 53, 185–216. [Google Scholar] [CrossRef]
  24. Barnabei, M.; Brini, A.; Rota, G.C. On the exterior calculus of invariant theory. J. Algebra 1985, 96, 120–160. [Google Scholar] [CrossRef] [Green Version]
  25. Fuchs, L.; Théry, L. A formalization of Grassmann-Cayley algebra in Coq and its application to theorem proving in projective geometry. In Automated Deduction in Geometry; Lecture Notes in Computer Science; Springer: Heidelberg, Germany, 2011; Volume 6877, pp. 51–67. [Google Scholar] [CrossRef] [Green Version]
  26. Hawrylycz, M. A geometric identity for Pappus’ theorem. Proc. Nat. Acad. Sci. USA 1994, 91, 2909. [Google Scholar] [CrossRef] [Green Version]
  27. Li, H.; Wu, Y. Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. II. Conic geometry. J. Symb. Comput. 2003, 36, 763–809. [Google Scholar] [CrossRef] [Green Version]
  28. Li, H.; Wu, Y. Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. I. Incidence geometry. J. Symb. Comput. 2003, 36, 717–762. [Google Scholar] [CrossRef] [Green Version]
  29. Hawrylycz, M. Arguesian identities in invariant theory. Adv. Math. 1996, 122, 1–48. [Google Scholar] [CrossRef] [Green Version]
  30. Hawrylycz, M.J. Geometric Identities in Invariant Theory. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA USA, 1995. [Google Scholar]
  31. Hawrylycz, M. Invariant theory and the projective plane. In Invariant Methods in Discrete and Computational Geometry (Curaçao, 1994); Kluwer Academic Publishers: Dordrecht, The Netherlands, 1995; pp. 141–166. [Google Scholar]
  32. Hawrylycz, M. Geometric identities, invariant theory, and a theorem of Bricard. J. Algebra 1994, 169, 287–297. [Google Scholar] [CrossRef] [Green Version]
  33. Mainetti, M.; Yan, C.H. Geometric identities in lattice theory. J. Comb. Theory Ser. A 2000, 91, 411–450. [Google Scholar] [CrossRef] [Green Version]
  34. Mainetti, M.; Yan, C.H. Arguesian identities in linear lattices. Adv. Math. 1999, 144, 50–93. [Google Scholar] [CrossRef] [Green Version]
  35. Mainetti, M. Studies in Projective Combinatorics. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 1998. [Google Scholar]
  36. Mainetti, M.; Yan, C.H. Graphical operations on projective spaces. Ann. Comb. 1998, 2, 243–289. [Google Scholar] [CrossRef]
  37. Yan, C.H. Arguesian identities in the congruence variety of abelian groups. Adv. Math. 2000, 150, 36–79. [Google Scholar] [CrossRef] [Green Version]
  38. Yan, C.H. Distributive laws for commuting equivalence relations. Discret. Math. 1998, 181, 295–298. [Google Scholar] [CrossRef] [Green Version]
  39. Rota, G.C. The many lives of lattice theory. Not. Am. Math. Soc. 1997, 44, 1440–1445. [Google Scholar]
  40. Ryan, P.J. Euclidean and Non-Euclidean Geometry; An Analytical Approach; Cambridge University Press: Cambridge, UK, 1986; p. xviii+215. [Google Scholar] [CrossRef]
  41. Maddux, R.D. Lecture Notes: Math 436 Geometry; Iowa State University: Ames, IA, USA, 1997; pp. 1–43. [Google Scholar]
  42. Pambuccian, V.; Schacht, C. The axiomatic destiny of the theorems of Pappus and Desargues. In Geometry in History; Springer: Cham, Switzerland, 2019; pp. 355–399. [Google Scholar]
  43. Marchisotto, E.A. The theorem of Pappus: A bridge between algebra and geometry. Am. Math. Mon. 2002, 109, 497–516. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Maddux, R.D. Identities Generalizing the Theorems of Pappus and Desargues. Symmetry 2021, 13, 1382. https://doi.org/10.3390/sym13081382

AMA Style

Maddux RD. Identities Generalizing the Theorems of Pappus and Desargues. Symmetry. 2021; 13(8):1382. https://doi.org/10.3390/sym13081382

Chicago/Turabian Style

Maddux, Roger D. 2021. "Identities Generalizing the Theorems of Pappus and Desargues" Symmetry 13, no. 8: 1382. https://doi.org/10.3390/sym13081382

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop