Desargues theorem, dynamics, and hyperplane arrangements (Q5955162)

From MaRDI portal
scientific article; zbMATH DE number 1703290
Language Label Description Also known as
English
Desargues theorem, dynamics, and hyperplane arrangements
scientific article; zbMATH DE number 1703290

    Statements

    Desargues theorem, dynamics, and hyperplane arrangements (English)
    0 references
    31 October 2002
    0 references
    Let \(P\) be the real or complex projective plane. The author generalizes Desargues theorem in the following way. A PolyPoint is a cyclically ordered finite set of points in \(P\). If a PolyPoint consists of \(n\) points then it is called an {\(n\)-Point}. PolyLines and {\(n\)-Lines} are defined dually. For some \(n\)-Point \(p\) a \(k\)-diagonal of \(p\), where \(k\) is not a multiple of \(n\), is a line going through the \(j\)th and the \((j+k)\)th points of \(p\) for some \(j\). The set of all \(k\)-diagonals of \(p\) inherit a cyclic order from \(p\) thus comprising an \(n\)-Line. Of course, the dual statement for \(n\)-Lines is also true. Now let \(n\geq 3\). If for two \(n\)-Points \(X=(x_1,x_3,\dots,x_{2n-1})\) and \(Y=(y_1,y_3,\dots,y_{2n-1})\) the points \(z_j = x_{j-1}x_{j+1} \cap y_{j-1}y_{j+1}\) are defined for any \(j\), the resulting \(n\)-Point \(Z=(z_2,z_4,\dots,z_{2n})\) is written as \(Z=X*Y\) and is called the offspring of \(X\) and \(Y\). A sequence \((A_1,A_3,\dots,A_{2m-1})\) of \(n\)-Points \(A_i\) is called a PlyChain or an \(m\)-chain. Starting with some \(m\)-chain \(A_1=(A_{1,1},A_{1,3},\dots,A_{1,2m-1})\) the author recursively defines PolyChains \(A_{j+1}= (A_{j+1,j+1},A_{j+1,j+3},\dots,A_{j+1,2m-(j+1)})\) for \(j=0,\dots,g\), in case \(A_{j}= (A_{j,j}\), \(A_{j,j+2},\dots,A_{j,2m-j)})\) exists, by setting \(A_{j+1,k}=A_{j,k-1}*A_{j,k+1}\), provided the operation \(*\) is defined on (\(A_{j,k-1},A_{j,k+1})\). This progression is called the mating process on \(A_1\). If \(g=m-1\) the mating process on \(A_1\) is well defined and the \(n\)-Point \(A_{m,m}\) is called the final offspring of \(A_1\). Two \(n\)-Points \(X\) and \(Y\) are said to be compatible, if the \(n\) lines \(x_1y_1,\dots, x_{2n-1}y_{2n-1}\) are concurrent. The PolyChain \(A_1\) is called special, if \(A_{1,j-1}\) and \(A_{1,j+1}\) are compatible for all \(j\). The generalization of Desargues theorem now reads as follows: Let \(A\) be an \((n-1)\)-Chain of \(n\)-Points. If the mating process on \(A\) is well defined, then the final offspring of \(A\) consists of collinear points. The case \(n=3\) involves \(6\) points, arranged into two triangles. Thus it is a restatement of Desargues theorem. The proof of the theorem contains many nice ideas and utilizes special kinds of hyperplanes which are then projected onto \(P\).
    0 references
    Desargues theorem
    0 references
    projective geometry
    0 references
    hyperplane arrangements
    0 references

    Identifiers