Universal algebra
Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples ("models") of algebraic structures. For instance, rather than take particular groups as the object of study, in universal algebra one takes the class of groups as an object of study.
Contents
Basic idea
In universal algebra, an algebra (or algebraic structure) is a set A together with a collection of operations on A. An nary operation on A is a function that takes n elements of A and returns a single element of A. Thus, a 0ary operation (or nullary operation) can be represented simply as an element of A, or a constant, often denoted by a letter like a. A 1ary operation (or unary operation) is simply a function from A to A, often denoted by a symbol placed in front of its argument, like ~x. A 2ary operation (or binary operation) is often denoted by a symbol placed between its arguments, like x ∗ y. Operations of higher or unspecified arity are usually denoted by function symbols, with the arguments placed in parentheses and separated by commas, like f(x,y,z) or f(x_{1},...,x_{n}). Some researchers allow infinitary operations, such as where J is an infinite index set, thus leading into the algebraic theory of complete lattices. One way of talking about an algebra, then, is by referring to it as an algebra of a certain type , where is an ordered sequence of natural numbers representing the arity of the operations of the algebra.
It is also possible to define an algebra via the relations in the algebra instead of the operations. Birkhoff's theorem states that the two definitions are equivalent, i.e., there is a Galois connection between relational and operational structures. This connection can be easily illustrated on the case of lattices, where the algebraic structure can be given by the operations join and meet or by introducing a partial order relation. The relational point of view is useful in computational problems, in particular for the constraint satisfaction problem (CSP).
Equations
After the operations have been specified, the nature of the algebra can be further limited 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.
Varieties
A collection of algebraic structures defined by identities is called a variety or equational class. Some authors consider varieties to be the main focus of universal algebra.^{[citation needed]}
Restricting one's study to varieties rules out:

quantification, including universal quantification (), except before an equation, and existential quantification ()
 Predicate logic in particular is ruled out
 All relations except equality, in particular inequalities, both a ≠ b 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 nonzero 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.
Examples
Most of the usual algebraic systems of mathematics are examples of varieties, but not always in an obvious way – the usual definitions often involve quantification or inequalities.
Groups
To see how this works, let's consider the definition of a group. Normally a group is defined in terms of a single binary operation ∗, subject to these axioms:
 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, e ∗ x = x = x ∗ e; formally: ∃e ∀x. e∗x=x=x∗e.
 Inverse element: It can easily be seen that the identity element is unique. If this unique identity element is 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 an axiom called "closure", stating that x ∗ y belongs to the set A whenever x and y do. But from a universal algebraist's point of view, that is already implied by calling ∗ a binary operation.)
This definition of a group is problematic from the point of view of universal algebra. The reason is that the axioms of the identity element and inversion are not stated purely in terms of equational laws but also have clauses involving the phrase "there exists ... such that ...". This is inconvenient; the list of group properties can be simplified to universally quantified equations by adding a nullary operation e and a unary operation ~ in addition to the binary operation ∗. Then list the axioms for these three operations as follows:
 Associativity: x ∗ (y ∗ z) = (x ∗ y) ∗ z.
 Identity element: e ∗ x = x = x ∗ e; formally: ∀x. e∗x=x=x∗e.
 Inverse element: x ∗ (~x) = e = (~x) ∗ x formally: ∀x. x∗~x=e=~x∗x.
(Of course, we usually write "x^{−1}" instead of "~x", which shows that the notation for operations of low arity is not always as given in the second paragraph.)
What has changed is that in the usual definition there are:
 a single binary operation (signature (2))
 1 equational law (associativity)
 2 quantified laws (identity and inverse)
...while in the universal algebra definition there are
 3 operations: one binary, one unary, and one nullary (signature (2,1,0))
 3 equational laws (associativity, identity, and inverse)
 no quantified laws (except for outermost universal quantifiers which are allowed in varieties)
It is important to check that this really does capture the definition of a group. The reason that it might not is that specifying one of these universal groups might give more information than specifying one of the usual kind of group. After all, nothing in the usual definition said that the identity element e was unique; if there is another identity element e', then it is ambiguous which one should be the value of the nullary operator e. Proving that it is unique is a common beginning exercise in classical group theory textbooks. The same thing is true of inverse elements. So, the universal algebraist's definition of a group is equivalent to the usual definition.
At first glance this is simply a technical difference, replacing quantified laws with equational laws. However, it has immediate practical consequences – 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), and cannot use quantified laws (which do not make sense, as objects in general categories do not have elements). Further, the perspective of universal algebra insists not only that the inverse and identity exist, but that they be maps in the category. The basic example is a topological group – not only must the inverse exist elementwise, but the inverse map must be continuous (some authors also require the identity map to be a closed inclusion, hence cofibration, again referring to properties of the map).
Other examples
Most algebraic structures are examples of universal algebras.
 Rings, semigroup, quasigroup, groupoid, magma, loop, and others.
 Vector spaces or modules over a fixed field or rings are universal algebras. The operations, in this case, are addition and, for each element of the field or ring, scalar multiplication by this element.
Examples of relational algebras include semilattices, lattices or Boolean algebras.
Basic constructions
We assume that the type, , has been fixed. Then there are three basic constructions in universal algebra: homomorphic image, subalgebra, and product.
A homomorphism between two algebras A and B is a function h: A → B 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 the entry 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.
Some basic theorems
 The isomorphism theorems, which encompass the isomorphism theorems of groups, rings, modules, etc.
 Birkhoff's HSP Theorem, which states that a class of algebras is a variety if and only if it is closed under homomorphic images, subalgebras, and arbitrary direct products.
Motivations and applications
This section does not cite any sources. (April 2010) (Learn how and when to remove this template message) 
In addition to its unifying approach, universal algebra also gives deep theorems and important examples and counterexamples. It provides a useful framework for those who intend to start the study of new classes of algebras. It can enable the use of methods invented for some particular classes of algebras to other classes of algebras, by recasting the methods in terms of universal algebra (if possible), and then interpreting these as applied to other classes. It has also provided conceptual clarification; as J.D.H. Smith puts it, "What looks messy and complicated in a particular framework may turn out to be simple and obvious in the proper general one."
In particular, universal algebra can be applied to the study of monoids, rings, and lattices. Before universal algebra came along, many theorems (most notably the isomorphism theorems) were proved separately in all of these fields, but with universal algebra, they can be proven once and for all for every kind of algebraic system.
The 1956 paper by Higgins referenced below has been well followed up for its framework for a range of particular algebraic systems, while his 1963 paper is notable for its discussion of algebras with operations which are only partially defined, typical examples for this being categories and groupoids. This leads on to the subject of higherdimensional algebra which can be defined as the study of algebraic theories with partial operations whose domains are defined under geometric conditions. Notable examples of these are various forms of higherdimensional categories and groupoids.
Constraint satisfaction problem
Universal algebra provides a natural language for the constraint satisfaction problem (CSP). CSP refers to an important class of computational problems where given a relational algebra and an existential sentence over this algebra, the question is to find out whether can be satisfied in . The algebra is often fixed so that refers to the problem whose instance is only the existential sentence .
It is proved that every computational problem can be formulated as for some algebra .
For example, the ncoloring problem can be stated as CSP of the algebra , i.e., an algebra with elemenents and a single relation inequality.
The dichotomy conjecture (proved in April 2017) states that if is a finite algebra, then is either P or NPcomplete.^{[1]}
Generalizations
Universal algebra has also been studied using the techniques of category theory. In this approach, instead of writing a list of operations and equations obeyed by those operations, one can describe an algebraic structure using categories of a special sort, known as Lawvere theories or more generally algebraic theories. Alternatively, one can describe algebraic structures using monads. The two approaches are closely related, with each having their own advantages.^{[2]} In particularly, every Lawvere theory gives a monad on the category of sets, while any 'finitary' monad on the category of sets arises from a Lawvere theory. However, a monad describes algebraic structures within one particular category (for example the category of sets), while algebraic theories describe structure within any of a large class of categories (namely those having finite products).
A more recent development in category theory is operad theory – an operad is a set of operations, similar to a universal algebra, but restricted in that equations are only allowed between expressions with the variables, with no duplication or omission of variables allowed. Thus, rings can be described as the socalled 'algebras' of some operad, but not groups, since the law duplicates the variable g on the left side and omits it on the right side. At first this may seem to be a troublesome restriction, but the payoff is that operads have certain advantages: for example, one can hybridize the concepts of ring and vector space to obtain the concept of associative algebra, but one cannot form a similar hybrid of the concepts of group and vector space.
Another development is partial algebra where the operators can be partial functions. Certain partial functions can also be handled by a generalization of Lawvere theories known as essentially algebraic theories.^{[3]}
Another generalization of universal algebra is model theory, which is sometimes described as "universal algebra + logic".^{[4]}
History
In Alfred North Whitehead's book A Treatise on Universal Algebra, published in 1898, the term universal algebra had essentially the same meaning that it has today. Whitehead credits William Rowan Hamilton and Augustus De Morgan as originators of the subject matter, and James Joseph Sylvester with coining the term itself.^{[5]}^{:v}
At the time structures such as Lie algebras and hyperbolic quaternions drew attention to the need to expand algebraic structures beyond the associatively multiplicative class. In a review Alexander Macfarlane wrote: "The main idea of the work is not unification of the several methods, nor generalization of ordinary algebra so as to include them, but rather the comparative study of their several structures." At the time George Boole's algebra of logic made a strong counterpoint to ordinary number algebra, so the term "universal" served to calm strained sensibilities.
Whitehead's early work sought to unify quaternions (due to Hamilton), Grassmann's Ausdehnungslehre, and Boole's algebra of logic. Whitehead wrote in his book:
 "Such algebras have an intrinsic value for separate detailed study; also they are worthy of comparative study, for the sake of the light thereby thrown on the general theory of symbolic reasoning, and on algebraic symbolism in particular. The comparative study necessarily presupposes some previous separate study, comparison being impossible without knowledge."^{[5]}
Whitehead, however, had no results of a general nature. Work on the subject was minimal until the early 1930s, when Garrett Birkhoff and Øystein Ore began publishing on universal algebras. Developments in metamathematics and category theory in the 1940s and 1950s furthered the field, particularly the work of Abraham Robinson, Alfred Tarski, Andrzej Mostowski, and their students (Brainerd 1967).
In the period between 1935 and 1950, most papers were written along the lines suggested by Birkhoff's papers, dealing with free algebras, congruence and subalgebra lattices, and homomorphism theorems. Although the development of mathematical logic had made applications to algebra possible, they came about slowly; results published by Anatoly Maltsev in the 1940s went unnoticed because of the war. Tarski's lecture at the 1950 International Congress of Mathematicians in Cambridge ushered in a new period in which modeltheoretic aspects were developed, mainly by Tarski himself, as well as C.C. Chang, Leon Henkin, Bjarni Jónsson, Roger Lyndon, and others.
In the late 1950s, Edward Marczewski^{[6]} emphasized the importance of free algebras, leading to the publication of more than 50 papers on the algebraic theory of free algebras by Marczewski himself, together with Jan Mycielski, Władysław Narkiewicz, Witold Nitka, J. Płonka, S. Świerczkowski, K. Urbanik, and others.
Starting with William Lawvere's thesis in 1963, techniques from category theory have become important in universal algebra.^{[7]}
See also
Footnotes
 ^ Zhuk, Dmitriy (2017). "The Proof of CSP Dichotomy Conjecture". arXiv:1704.01914 [cs.cc].
 ^ Hyland, Martin; Power, John (2007), The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads (PDF)
 ^ Essentially algebraic theory in nLab
 ^ C.C. Chang and H. Jerome Keisler (1990). Model Theory. Studies in Logic and the Foundation of Mathematics. 73 (3rd ed.). North Holland. p. 1. ISBN 0444880542.
 ^ ^{a} ^{b} George Grätzer (1968). M.H. Stone and L. Nirenberg and S.S. Chern, ed. Universal Algebra (1st ed.). Van Nostrand Co., Inc.
 ^ Marczewski, E. "A general scheme of the notions of independence in mathematics." Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 6 (1958), 731–736.
 ^ Lawvere, William F. (1964), Functorial Semantics of Algebraic Theories (PhD Thesis)
References
 Bergman, George M., 1998. An Invitation to General Algebra and Universal Constructions (pub. Henry Helson, 15 the Crescent, Berkeley CA, 94708) 398 pp. ISBN 0965521141.
 Birkhoff, Garrett, 1946. Universal algebra. Comptes Rendus du Premier Congrès Canadien de Mathématiques, University of Toronto Press, Toronto, pp. 310–326.
 Brainerd, Barron, Aug–Sep 1967. Review of Universal Algebra by P. M. Cohn. American Mathematical Monthly, 74(7): 878–880.
 Burris, Stanley N., and H.P. Sankappanavar, 1981. A Course in Universal Algebra SpringerVerlag. ISBN 3540905782 Free online edition.
 Cohn, Paul Moritz, 1981. Universal Algebra. Dordrecht, Netherlands: D.Reidel Publishing. ISBN 9027712131 (First published in 1965 by Harper & Row)
 Freese, Ralph, and Ralph McKenzie, 1987. Commutator Theory for Congruence Modular Varieties, 1st ed. London Mathematical Society Lecture Note Series, 125. Cambridge Univ. Press. ISBN 0521348323. Free online second edition.
 Grätzer, George, 1968. Universal Algebra D. Van Nostrand Company, Inc.
 Higgins, P. J. Groups with multiple operators. Proc. London Math. Soc. (3) 6 (1956), 366–416.
 Higgins, P.J., Algebras with a scheme of operators. Mathematische Nachrichten (27) (1963) 115–132.
 Hobby, David, and Ralph McKenzie, 1988. The Structure of Finite Algebras American Mathematical Society. ISBN 0821834002. Free online edition.
 Jipsen, Peter, and Henry Rose, 1992. Varieties of Lattices, Lecture Notes in Mathematics 1533. Springer Verlag. ISBN 0387563148. Free online edition.
 Pigozzi, Don. General Theory of Algebras. Free online edition.
 Smith, J.D.H., 1976. Mal'cev Varieties, SpringerVerlag.
 Whitehead, Alfred North, 1898. A Treatise on Universal Algebra, Cambridge. (Mainly of historical interest.)
External links
 Algebra Universalis—a journal dedicated to Universal Algebra.