
related topics 
{math, number, function} 
{theory, work, human} 
{work, book, publish} 
{style, bgcolor, rowspan} 

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 theory of groups" as an object of study.
Contents
Basic idea
From the point of view of 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.
Equations
Full article ▸


related documents 
Naive Bayes classifier 
Brouwer fixed point theorem 
Tree automaton 
Rootfinding algorithm 
Shell sort 
Symmetric matrix 
Pell's equation 
Analytic function 
Tangent space 
Fundamental theorem of arithmetic 
Scientific notation 
Delaunay triangulation 
Uniform convergence 
Selection sort 
Arithmetic 
Orthogonality 
Embedding 
Octonion 
Burnside's problem 
Curve 
MathML 
Befunge 
Finite state machine 
Sufficiency (statistics) 
Tensor 
Polish notation 
Binomial theorem 
Analytic continuation 
Total order 
Affine transformation 
