Algebraic structure

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, an algebraic structure consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A of finite arity (typically binary operations), and a finite set of identities, known as axioms, that these operations must satisfy.

An algebraic structure may be based on other algebraic structures with operations and axioms involving several structures. For instance, a vector space involves a second structure called a field, and an operation called scalar multiplication between elements of the field (called scalars), and elements of the vector space (called vectors).

Abstract algebra is the name that is commonly given to the study of algebraic structures. The general theory of algebraic structures has been formalized in universal algebra. Category theory is another formalization that includes also other mathematical structures and functions between structures of the same type (homomorphisms).

In universal algebra, an algebraic structure is called an algebra;[1] this term may be ambiguous, since, in other contexts, the term algebra is reserved for specific algebraic structures that are vector spaces over a field or modules over a commutative ring.

The collection of all structures of a given type (same operations and same laws) is called a variety in universal algebra; this term is also used with a completely different meaning in algebraic geometry, as an abbreviation of algebraic variety. In category theory, the collection of all structures of a given type and homomorphisms between them form a concrete category.

Introduction[edit]

Addition and multiplication are prototypical examples of operations that combine two elements of a set to produce a third element of the same set. These operations obey several algebraic laws. For example, a + (b + c) = (a + b) + c and a(bc) = (ab)c are associative laws, and a + b = b + a and ab = ba are commutative laws. Many systems studied by mathematicians have operations that obey some, but not necessarily all, of the laws of ordinary arithmetic. For example, the possible moves of an object in three-dimensional space can be combined by performing a first move of the object, and then a second move from its new position. Such moves, formally called rigid motions, obey the associative law, but fail to satisfy the commutative law.

Sets with one or more operations that obey specific laws are called algebraic structures. When a new problem involves the same laws as such an algebraic structure, all the results that have been proved using only the laws of the structure can be directly applied to the new problem.

In full generality, algebraic structures may involve an arbitrary collection of operations, including operations that combine more than two elements (higher arity operations) and operations that take only one argument (unary operations). The examples listed below are by no means a complete list, but include the most common structures that are important enough to receive a name.

Common axioms[edit]

Equational axioms[edit]

An axiom of an algebraic structure often has the form of an identity, that is, an equation such that the two sides of the equals sign are expressions that involve operations of the algebraic structure and variables. If the variables in the identity are replaced by arbitrary elements of the algebraic structure, the equality must remain true. Here are some common examples.

Commutativity
An operation is commutative if
for every x and y in the algebraic structure.
Associativity
An operation is associative if
for every x, y and z in the algebraic structure.
Left distributivity
An operation is left distributive with respect to another operation if
for every x, y and z in the algebraic structure (the second operation is denoted here as +, because the second operation is addition in many common examples).
Right distributivity
An operation is right distributive with respect to another operation if
for every x, y and z in the algebraic structure.
Distributivity
An operation is distributive with respect to another operation if it is both left distributive and right distributive. If the operation is commutative, left and right distributivity are both equivalent to distributivity.

Existential axioms[edit]

Some common axioms contain an existential clause. In general, such a clause can be avoided by introducing further operations, and replacing the existential clause by an identity involving the new operation. More precisely, let us consider an axiom of the form "for all X there is y such that ", where X is a k-tuple of variables. Choosing a specific value of y for each value of X defines a function which can be viewed as an operation of arity k, and the axiom becomes the identity

The introduction of such auxiliary operation complicates slightly the statement of an axiom, but has some advantages. Given a specific algebraic structure, the proof that an existential axiom is satisfied consists generally of the definition of the auxiliary function, completed with straightforward verifications. Also, when computing in an algebraic structure, one generally uses explicitly the auxiliary operations. For example, in the case of numbers, the additive inverse is provided by the unary minus operation

Also, in universal algebra, a variety is a class of algebraic structures that share the same operations, and the same axioms, with the condition that all axioms are identities. What precedes shows that existential axioms of the above form are accepted in the definition of a variety.

Here are some of the most common existential axioms.

Identity element
A binary operation has an identity element if there is an element e such that
for all x in the structure. Here, the auxiliary operation is the operation of arity zero that has e as its result.
Inverse element
Given a binary operation that has an identity element e, an element x is invertible if it has an inverse element, that is, if there exists an element such that
For example, a group is an algebraic structure with a binary operation that is associative, has an identity element, and for which all elements are invertible.

Non-equational axioms[edit]

The axioms of an algebraic structure can be any first-order formula, that is a formula involving logical connectives (such as "and", "or" and "not"), and logical quantifiers () that apply to elements (not to subsets) of the structure.

Such a typical axiom is inversion in fields. This axiom cannot be reduced to axioms of preceding types. (it follows that fields do not form a variety in the sense of universal algebra.) It can be stated: "Every nonzero element of a field is invertible;" or, equivalently: the structure has a unary operation inv such that

The operation inv can be viewed either as a partial operation that is not defined for x = 0; or as an ordinary function whose value at 0 is arbitrary and must not be used.

Common algebraic structures[edit]

One set with operations[edit]

Simple structures: no binary operation:

  • Set: a degenerate algebraic structure S having no operations.
  • Pointed set: S has one or more distinguished elements, often 0, 1, or both.
  • Unary system: S and a single unary operation over S.
  • Pointed unary system: a unary system with S a pointed set.

Group-like structures: one binary operation. The binary operation can be indicated by any symbol, or with no symbol (juxtaposition) as is done for ordinary multiplication of real numbers.

Ring-like structures or Ringoids: two binary operations, often called addition and multiplication, with multiplication distributing over addition.

  • Semiring: a ringoid such that S is a monoid under each operation. Addition is typically assumed to be commutative and associative, and the monoid product is assumed to distribute over the addition on both sides, and the additive identity 0 is an absorbing element in the sense that 0 x = 0 for all x.
  • Near-ring: a semiring whose additive monoid is a (not necessarily abelian) group.
  • Ring: a semiring whose additive monoid is an abelian group.
  • Lie ring: a ringoid whose additive monoid is an abelian group, but whose multiplicative operation satisfies the Jacobi identity rather than associativity.
  • Commutative ring: a ring in which the multiplication operation is commutative.
  • Boolean ring: a commutative ring with idempotent multiplication operation.
  • Field: a commutative ring which contains a multiplicative inverse for every nonzero element.
  • Kleene algebras: a semiring with idempotent addition and a unary operation, the Kleene star, satisfying additional properties.
  • *-algebra: a ring with an additional unary operation (*) satisfying additional properties.

Lattice structures: two or more binary operations, including operations called meet and join, connected by the absorption law.[3]

  • Complete lattice: a lattice in which arbitrary meet and joins exist.
  • Bounded lattice: a lattice with a greatest element and least element.
  • Complemented lattice: a bounded lattice with a unary operation, complementation, denoted by postfix . The join of an element with its complement is the greatest element, and the meet of the two elements is the least element.
  • Modular lattice: a lattice whose elements satisfy the additional modular identity.
  • Distributive lattice: a lattice in which each of meet and join distributes over the other. Distributive lattices are modular, but the converse does not hold.
  • Boolean algebra: a complemented distributive lattice. Either of meet or join can be defined in terms of the other and complementation. This can be shown to be equivalent with the ring-like structure of the same name above.
  • Heyting algebra: a bounded distributive lattice with an added binary operation, relative pseudo-complement, denoted by infix →, and governed by the axioms:
    • x → x = 1
    • x (x → y) = x y
    • y (x → y) = y
    • x → (y z) = (x → y) (x → z)

Arithmetics: two binary operations, addition and multiplication. S is an infinite set. Arithmetics are pointed unary systems, whose unary operation is injective successor, and with distinguished element 0.

  • Robinson arithmetic. Addition and multiplication are recursively defined by means of successor. 0 is the identity element for addition, and annihilates multiplication. Robinson arithmetic is listed here even though it is a variety, because of its closeness to Peano arithmetic.
  • Peano arithmetic. Robinson arithmetic with an axiom schema of induction. Most ring and field axioms bearing on the properties of addition and multiplication are theorems of Peano arithmetic or of proper extensions thereof.

Two sets with operations[edit]

Module-like structures: composite systems involving two sets and employing at least two binary operations.

  • Group with operators: a group G with a set Ω and a binary operation Ω × GG satisfying certain axioms.
  • Module: an abelian group M and a ring R acting as operators on M. The members of R are sometimes called scalars, and the binary operation of scalar multiplication is a function R × MM, which satisfies several axioms. Counting the ring operations these systems have at least three operations.
  • Vector space: a module where the ring R is a division ring or field.
  • Graded vector space: a vector space with a direct sum decomposition breaking the space into "grades".
  • Quadratic space: a vector space V over a field F with a quadratic form on V taking values in F.

Algebra-like structures: composite system defined over two sets, a ring R and an R-module M equipped with an operation called multiplication. This can be viewed as a system with five binary operations: two operations on R, two on M and one involving both R and M.

  • Algebra over a ring (also R-algebra): a module over a commutative ring R, which also carries a multiplication operation that is compatible with the module structure. This includes distributivity over addition and linearity with respect to multiplication by elements of R. The theory of an algebra over a field is especially well developed.
  • Associative algebra: an algebra over a ring such that the multiplication is associative.
  • Nonassociative algebra: a module over a commutative ring, equipped with a ring multiplication operation that is not necessarily associative. Often associativity is replaced with a different identity, such as alternation, the Jacobi identity, or the Jordan identity.
  • Coalgebra: a vector space with a "comultiplication" defined dually to that of associative algebras.
  • Lie algebra: a special type of nonassociative algebra whose product satisfies the Jacobi identity.
  • Lie coalgebra: a vector space with a "comultiplication" defined dually to that of Lie algebras.
  • Graded algebra: a graded vector space with an algebra structure compatible with the grading. The idea is that if the grades of two elements a and b are known, then the grade of ab is known, and so the location of the product ab is determined in the decomposition.
  • Inner product space: an F vector space V with a definite bilinear form V × VF.

Four or more binary operations:

Hybrid structures[edit]

Algebraic structures can also coexist with added structure of non-algebraic nature, such as partial order or a topology. The added structure must be compatible, in some sense, with the algebraic structure.

Universal algebra[edit]

Algebraic structures are defined through different configurations of axioms. Universal algebra abstractly studies such objects. One major dichotomy is between structures that are axiomatized entirely by identities and structures that are not. If all axioms defining a class of algebras are identities, then this class is a variety (not to be confused with algebraic varieties of algebraic geometry).

Identities are equations formulated using only the operations the structure allows, and variables that are tacitly universally quantified over the relevant universe. Identities contain no connectives, existentially quantified variables, or relations of any kind other than the allowed operations. The study of varieties is an important part of universal algebra. An algebraic structure in a variety may be understood as the quotient algebra of term algebra (also called "absolutely free algebra") divided by the equivalence relations generated by a set of identities. So, a collection of functions with given signatures generate a free algebra, the term algebra T. Given a set of equational identities (the axioms), one may consider their symmetric, transitive closure E. The quotient algebra T/E is then the algebraic structure or variety. Thus, for example, groups have a signature containing two operators: the multiplication operator m, taking two arguments, and the inverse operator i, taking one argument, and the identity element e, a constant, which may be considered an operator that takes zero arguments. Given a (countable) set of variables x, y, z, etc. the term algebra is the collection of all possible terms involving m, i, e and the variables; so for example, m(i(x), m(x, m(y,e))) would be an element of the term algebra. One of the axioms defining a group is the identity m(x, i(x)) = e; another is m(x,e) = x. The axioms can be represented as trees. These equations induce equivalence classes on the free algebra; the quotient algebra then has the algebraic structure of a group.

Some structures do not form varieties, because either:

  1. It is necessary that 0 ≠ 1, 0 being the additive identity element and 1 being a multiplicative identity element, but this is a nonidentity;
  2. Structures such as fields have some axioms that hold only for nonzero members of S. For an algebraic structure to be a variety, its operations must be defined for all members of S; there can be no partial operations.

Structures whose axioms unavoidably include nonidentities are among the most important ones in mathematics, e.g., fields and division rings. Structures with nonidentities present challenges varieties do not. For example, the direct product of two fields is not a field, because , but fields do not have zero divisors.

Category theory[edit]

Category theory is another tool for studying algebraic structures (see, for example, Mac Lane 1998). A category is a collection of objects with associated morphisms. Every algebraic structure has its own notion of homomorphism, namely any function compatible with the operation(s) defining the structure. In this way, every algebraic structure gives rise to a category. For example, the category of groups has all groups as objects and all group homomorphisms as morphisms. This concrete category may be seen as a category of sets with added category-theoretic structure. Likewise, the category of topological groups (whose morphisms are the continuous group homomorphisms) is a category of topological spaces with extra structure. A forgetful functor between categories of algebraic structures "forgets" a part of a structure.

There are various concepts in category theory that try to capture the algebraic character of a context, for instance

Different meanings of "structure"[edit]

In a slight abuse of notation, the word "structure" can also refer to just the operations on a structure, instead of the underlying set itself. For example, the sentence, "We have defined a ring structure on the set ," means that we have defined ring operations on the set . For another example, the group can be seen as a set that is equipped with an algebraic structure, namely the operation .

See also[edit]

Notes[edit]

  1. ^ P.M. Cohn. (1981) Universal Algebra, Springer, p. 41.
  2. ^ Jonathan D. H. Smith (15 November 2006). An Introduction to Quasigroups and Their Representations. Chapman & Hall. ISBN 9781420010633. Retrieved 2012-08-02.
  3. ^ Ringoids and lattices can be clearly distinguished despite both having two defining binary operations. In the case of ringoids, the two operations are linked by the distributive law; in the case of lattices, they are linked by the absorption law. Ringoids also tend to have numerical models, while lattices tend to have set-theoretic models.

References[edit]

Category theory

External links[edit]