Universal algebra
Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures in general, not specific types of algebraic structures.
≈ 5 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures in general, not specific types of algebraic structures. For instance, rather than considering groups or rings as the object of study this is the subject of group theory and ring theory in universal algebra, the object of study is the possible types of algebraic structures and their relationships.
Collections (classes) of algebraic structures are often defined by axioms, which in universal algebra often take the form of identities, or equational laws. An example is the associative axiom for a binary operation, which is given by the equation x ∗ (y ∗ z) = (x ∗ y) ∗ z. The axiom is intended to hold for all elements x, y, and z of the set A. A collection of algebraic structures defined by identities is called a variety or equational class.
Restricting one's study to varieties rules out: quantification, including universal quantification (∀) except before an equation, and existential quantification (∃) logical connectives other than conjunction (∧) relations other than equality, in particular inequalities, both and order relations The study of equational classes can be seen as a special branch of model theory, typically dealing with structures having operations only (i.e. the type can have symbols for functions but not for relations other than equality), and in which the language used to talk about these structures uses equations only. Not all algebraic structures in a wider sense fall into this scope.
For example, ordered groups involve an ordering relation, so would not fall within this scope. The class of fields is not an equational class because there is no type (or "signature") in which all field laws can be written as equations (inverses of elements are defined for all non-zero elements in a field, so inversion cannot be added to the type).
One advantage of this restriction is that the structures studied in universal algebra can be defined in any category that has finite products. For example, a topological group is just a group in the category of topological spaces.
Associativity (as in the previous section): x ∗ (y ∗ z) = (x ∗ y) ∗ z; formally: ∀x,y,z. x∗(y∗z)=(x∗y)∗z. Identity element: There exists an element e such that for each element x, one has e ∗ x = x = x ∗ e; formally: ∃e ∀x. e∗x=x=x∗e. Inverse element: The identity element is easily seen to be unique, and is usually denoted by e. Then for each x, there exists an element i such that x ∗ i = e = i ∗ x; formally: ∀x ∃i. x∗i=e=i∗x. (Some authors also use the "closure" axiom that x ∗ y belongs to A whenever x and y do, but here this is already implied by calling ∗ a binary operation.) This definition of a group does not immediately fit the point of view of universal algebra, because the axioms of the identity element and inversion are not stated purely in terms of equational laws which hold universally "for all ..." elements, but also involve the existential quantifier "there exists ...".
The group axioms can be phrased as universally quantified equations by specifying, in addition to the binary operation ∗, a nullary operation e and a unary operation ~, with ~x usually written as x −1 . The axioms become: Associativity: . Identity element: .
Inverse element: . To summarize, the usual definition has: a single binary operation (signature (2)) 1 equational law (associativity) 2 quantified laws (identity and inverse) while the universal algebra definition has: 3 operations: one binary, one unary, and one nullary (signature ) 3 equational laws (associativity, identity, and inverse) no quantified laws (except outermost universal quantifiers, which are universally implied for all variables in varieties) A key point is that the extra operations do not add information, but follow uniquely from the usual definition of a group.
Although the usual definition did not uniquely specify the identity element e, an easy exercise shows that it is unique, as is the inverse of each element. The universal algebra point of view is well adapted to category theory.
For example, when defining a group object in category theory, where the object in question may not be a set, one must use equational laws (which make sense in general categories), rather than quantified laws (which refer to individual elements). Further, the inverse and identity are specified as morphisms in the category.
For example, in a topological group, the inverse must not only exist element-wise, but must give a continuous mapping (a morphism). Some authors also require the identity map to be a closed inclusion (a cofibration).
A homomorphism between two algebras A and B is a function from the set A to the set B such that, for every operation f A of A and corresponding f B of B (of arity, say, n), h(f A (x 1 , ..., x n )) = f B (h(x 1 ), ..., h(x n )). (Sometimes the subscripts on f are taken off when it is clear from context which algebra the function is from.) For example, if e is a constant (nullary operation), then h(e A ) = e B . If ~ is a unary operation, then h(~x) = ~h(x). If ∗ is a binary operation, then h(x ∗ y) = h(x) ∗ h(y). And so on.
A few of the things that can be done with homomorphisms, as well as definitions of certain special kinds of homomorphisms, are listed under Homomorphism. In particular, we can take the homomorphic image of an algebra, h(A). A subalgebra of A is a subset of A that is closed under all the operations of A. A product of some set of algebraic structures is the cartesian product of the sets with the operations defined coordinatewise.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1378512483 under CC BY-SA 4.0; modifications have been made.