Loading AI tools
Branch of finite geometry From Wikipedia, the free encyclopedia
Galois geometry (named after the 19th-century French mathematician Évariste Galois) is the branch of finite geometry that is concerned with algebraic and analytic geometry over a finite field (or Galois field).[1] More narrowly, a Galois geometry may be defined as a projective space over a finite field.[2]
Objects of study include affine and projective spaces over finite fields and various structures that are contained in them. In particular, arcs, ovals, hyperovals, unitals, blocking sets, ovoids, caps, spreads and all finite analogues of structures found in non-finite geometries. Vector spaces defined over finite fields play a significant role, especially in construction methods.
Although the generic notation of projective geometry is sometimes used, it is more common to denote projective spaces over finite fields by PG(n, q), where n is the "geometric" dimension (see below), and q is the order of the finite field (or Galois field) GF(q), which must be an integer that is a prime or prime power.
The geometric dimension in the above notation refers to the system whereby lines are 1-dimensional, planes are 2-dimensional, points are 0-dimensional, etc. The modifier, sometimes the term projective instead of geometric is used, is necessary since this concept of dimension differs from the concept used for vector spaces (that is, the number of elements in a basis). Normally having two different concepts with the same name does not cause much difficulty in separate areas due to context, but in this subject both vector spaces and projective spaces play important roles and confusion is highly likely. The vector space concept is at times referred to as the algebraic dimension.[3]
Let V = V(n + 1, q) denote the vector space of (algebraic) dimension n + 1 defined over the finite field GF(q). The projective space PG(n, q) consists of all the positive (algebraic) dimensional vector subspaces of V. An alternate way to view the construction is to define the points of PG(n, q) as the equivalence classes of the non-zero vectors of V under the equivalence relation whereby two vectors are equivalent if one is a scalar multiple of the other. Subspaces are then built up from the points using the definition of linear independence of sets of points.
A vector subspace of algebraic dimension d + 1 of V is a (projective) subspace of PG(n, q) of geometric dimension d. The projective subspaces are given common geometric names; points, lines, planes and solids are the 0,1,2 and 3-dimensional subspaces, respectively. The whole space is an n-dimensional subspace and an (n − 1)-dimensional subspace is called a hyperplane (or prime).
The number of vector subspaces of algebraic dimension d in vector space V(n, q) is given by the Gaussian binomial coefficient,
Therefore, the number of k dimensional projective subspaces in PG(n, q) is given by
Thus, for example, the number of lines (k = 1) in PG(3,2) is
It follows that the total number of points (k = 0) of P = PG(n, q) is
This also equals the number of hyperplanes of P.
The number of lines through a point of P can be calculated to be and this is also the number of hyperplanes through a fixed point.[4]
Let U and W be subspaces of the Galois geometry P = PG(n, q). The intersection U ∩ W is a subspace of P, but the set theoretic union may not be. The join of these subspaces, denoted by <U, W>, is the smallest subspace of P that contains both U and W. The dimensions of the join and intersection of these two subspaces are related by the formula,
With respect to a fixed basis, every vector in V is uniquely represented by an (n + 1)-tuple of elements of GF(q). A projective point is an equivalence class of vectors, so there are many different coordinates (of the vectors) that correspond to the same point. However, these are all related to one another since each is a non-zero scalar multiple of the others. This gives rise to the concept of homogeneous coordinates used to represent the points of a projective space.
Gino Fano was an early writer in the area of Galois geometries. In his article of 1892,[5] on proving the independence of his set of axioms for projective n-space,[6] among other things, he considered the consequences of having a fourth harmonic point be equal to its conjugate. This leads to a configuration of seven points and seven lines contained in a finite three-dimensional space with 15 points, 35 lines and 15 planes, in which each line contained only three points.[5]: 114 All the planes in this space consist of seven points and seven lines and are now known as Fano planes. Fano went on to describe Galois geometries of arbitrary dimension and prime orders.
George Conwell gave an early application of Galois geometry in 1910 when he characterized a solution of Kirkman's schoolgirl problem as a partition of sets of skew lines in PG(3,2), the three-dimensional projective geometry over the Galois field GF(2).[7] Similar to methods of line geometry in space over a field of characteristic 0, Conwell used Plücker coordinates in PG(5,2) and identified the points representing lines in PG(3,2) as those on the Klein quadric.
In 1955 Beniamino Segre characterized the ovals for q odd. Segre's theorem states that in a Galois geometry of odd order (that is, a projective plane defined over a finite field of odd characteristic) every oval is a conic. This result is often credited with establishing Galois geometries as a significant area of research. At the 1958 International Mathematical Congress Segre presented a survey of results in Galois geometry known up to that time.
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
![{\displaystyle \left[{\begin{matrix}n\\d\end{matrix}}\right]_{q}={\frac {(q^{n}-1)(q^{n}-q)\cdots (q^{n}-q^{d-1})}{(q^{d}-1)(q^{d}-q)\cdots (q^{d}-q^{d-1})}}.}](http://wikimedia.org/api/rest_v1/media/math/render/svg/dad40c07409387b38aad64e11b5ea7cb4d852436)
![{\displaystyle \left[{\begin{matrix}n+1\\k+1\end{matrix}}\right]_{q}={\frac {(q^{n+1}-1)(q^{n+1}-q)\cdots (q^{n+1}-q^{k})}{(q^{k+1}-1)(q^{k+1}-q)\cdots (q^{k+1}-q^{k})}}.}](http://wikimedia.org/api/rest_v1/media/math/render/svg/1df9bcb577341ff84e410d8f0f439a4b2602a52e)
![{\displaystyle \left[{\begin{matrix}4\\2\end{matrix}}\right]_{2}={\frac {(2^{4}-1)(2^{4}-2)}{(2^{2}-1)(2^{2}-2)}}={\frac {(15)(14)}{(3)(2)}}=35.}](http://wikimedia.org/api/rest_v1/media/math/render/svg/11360f91d8d69a939485f90410bd7af558cf85bd)
![{\displaystyle \left[{\begin{matrix}n+1\\1\end{matrix}}\right]_{q}={\frac {(q^{n+1}-1)}{(q-1)}}=q^{n}+q^{n-1}+\cdots +q+1.}](http://wikimedia.org/api/rest_v1/media/math/render/svg/72bf67ee929a0c9ebc71890be1d1af761e83876e)
