Concept

Quasifield

In mathematics, a quasifield is an algebraic structure where and are binary operations on , much like a division ring, but with some weaker conditions. All division rings, and thus all fields, are quasifields. A quasifield is a structure, where and are binary operations on , satisfying these axioms: is a group is a loop, where (left distributivity) has exactly one solution for , Strictly speaking, this is the definition of a left quasifield. A right quasifield is similarly defined, but satisfies right distributivity instead. A quasifield satisfying both distributive laws is called a semifield, in the sense in which the term is used in projective geometry. Although not assumed, one can prove that the axioms imply that the additive group is abelian. Thus, when referring to an abelian quasifield, one means that is abelian. The kernel of a quasifield is the set of all elements such that: Restricting the binary operations and to , one can shown that is a division ring. One can now make a vector space of over , with the following scalar multiplication : As a finite division ring is a finite field by Wedderburn's theorem, the order of the kernel of a finite quasifield is a prime power. The vector space construction implies that the order of any finite quasifield must also be a prime power. All division rings, and thus all fields, are quasifields. A (right) near-field that is a (right) quasifield is called a "planar near-field". The smallest quasifields are abelian and unique. They are the finite fields of orders up to and including eight. The smallest quasifields that are not division rings are the four non-abelian quasifields of order nine; they are presented in and . Projective plane Given a quasifield , we define a ternary map by One can then verify that satisfies the axioms of a planar ternary ring. Associated to is its corresponding projective plane. The projective planes constructed this way are characterized as follows; the details of this relationship are given in .

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (2)
Related people (1)
Related concepts (4)
Semifield
In mathematics, a semifield is an algebraic structure with two binary operations, addition and multiplication, which is similar to a field, but with some axioms relaxed. The term semifield has two conflicting meanings, both of which include fields as a special case. In projective geometry and finite geometry (MSC 51A, 51E, 12K10), a semifield is a nonassociative division ring with multiplicative identity element. More precisely, it is a nonassociative ring whose nonzero elements form a loop under multiplication.
Planar ternary ring
In mathematics, an algebraic structure consisting of a non-empty set and a ternary mapping may be called a ternary system. A planar ternary ring (PTR) or ternary field is special type of ternary system used by Marshall Hall to construct projective planes by means of coordinates. A planar ternary ring is not a ring in the traditional sense, but any field gives a planar ternary ring where the operation is defined by . Thus, we can think of a planar ternary ring as a generalization of a field where the ternary operation takes the place of both addition and multiplication.
Near-field (mathematics)
In mathematics, a near-field is an algebraic structure similar to a division ring, except that it has only one of the two distributive laws. Alternatively, a near-field is a near-ring in which there is a multiplicative identity and every non-zero element has a multiplicative inverse. A near-field is a set together with two binary operations, (addition) and (multiplication), satisfying the following axioms: A1: is an abelian group. A2: = for all elements , , of (The associative law for multiplication).
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.