Cayley-Dickson Algebras and Finite Geometry

Abstract

Given a 2N-dimensional Cayley-Dickson algebra, where 3 ≤ N ≤ 6, we first observe that the multiplication table of its imaginary units ea, 1 ≤ a ≤ 2N -1, is encoded in the properties of the projective space PG(N-1,2) if one regards these imaginary units as points and distinguished triads of them \ea, eb, ec\, 1 ≤ a < b <c ≤ 2N -1 and eaeb = ec, as lines. This projective space is seen to feature two distinct kinds of lines according as a+b = c or a+b ≠ c. Consequently, it also exhibits (at least two) different types of points in dependence on how many lines of either kind pass through each of them. In order to account for such partition of the PG(N-1,2), the concept of Veldkamp space of a finite point-line incidence structure is employed. The corresponding point-line incidence structure is found to be a binomial (N+1 2N-1, N+1 33)-configuration CN; in particular, C3 (octonions) is isomorphic to the Pasch (62,43)-configuration, C4 (sedenions) is the famous Desargues (103)-configuration, C5 (32-nions) coincides with the Cayley-Salmon (154,203)-configuration found in the well-known Pascal mystic hexagram and C6 (64-nions) is identical with a particular (215,353)-configuration that can be viewed as four triangles in perspective from a line where the points of perspectivity of six pairs of them form a Pasch configuration. We also draw attention to a remarkable nesting pattern formed by these configurations, where CN-1 occurs as a geometric hyperplane of CN. Finally, a brief examination of the structure of generic CN leads to a conjecture that CN is isomorphic to a combinatorial Grassmannian of type G2(N+1).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…