Outline of algebraic structures

In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither varieties nor quasivarieties, called nonvarieties below, are included among the algebraic structures by tradition.

Other web lists of algebraic structures, organized more or less alphabetically, include Jipsen and PlanetMath. These lists mention many structures not included below, and may present more information about some structures than is presented here.

Contents

Generalities

An algebraic structure consists of one or two sets closed under some operations, functions, and relations, satisfying a number of axioms, including none. This definition of an algebraic structure should not be taken as restrictive. Anything that satisfies the axioms defining a structure is an instance of that structure, regardless of how many other axioms that instance happens to satisfy. For example, all groups are also semigroups and magmas.

Structures are listed below in approximate order of increasing complexity as follows:

  • Structures that are varieties precede those that are not;
  • Simple structures built on one underlying set S precede composite structures built on two;
  • If A and B are the two underlying sets making up a composite structure, that structure may include functions of the form AxAB or AxBA.
  • Structures are then ordered by the number and arities of the operations they contain. The heap, a group-like structure, is the only structure mentioned in this entry requiring an operation whose arity exceeds 2.

If structure B is under structure A and more indented, then A is interpretable in B, meaning that all theorems of A are theorems of B. The converse is usually not the case.

A structure is trivial if the cardinality of S is less than 2, and is otherwise nontrivial.

Varieties

Identities are equations formulated using only the operations the structure allows, and variables that are tacitly universally quantified over a set that is part of the definition of the structure. Hence identities contain no sentential connectives, existentially quantified variables, or relations of any kind other than equality and the operations the structure allows.

If the axioms defining an algebraic structure are all identities--or can be recast as identities--the structure is a variety (not to be confused with algebraic variety in the sense of algebraic geometry). Nonidentities can often be recast as identities. For example, any lattice inequality of the form α≤β can always be recast as the identity α∧β=α.

An important result is that given any variety C and any underlying set X, the free object F(X)∈C exists.

Simple structures

No binary operation.

  • Set: a degenerate algebraic structure having no operations.
  • Pointed set: S has one or more distinguished elements. While pointed sets are near-trivial, they lead to discrete spaces, which are not.
    • Bipointed set: S has exactly two distinguished elements.
  • Unary system: S and a single unary operation over S.
  • Pointed unary system: a unary system with S a pointed set.

Group-like structures

Group-like structures
Totality Associativity Identity Inverses
Group Yes Yes Yes Yes
Monoid Yes Yes Yes No
Semigroup Yes Yes No No
Loop Yes No Yes Yes
Quasigroup Yes No No No
Magma Yes No No No
Groupoid No Yes Yes Yes
Category No Yes Yes No
Semicategory No Yes No No

See magma for a list of the many properties that a group-like structures may possess. The diagram to the right summarizes the defining properties of:

  • The better-known group-like structures, from the least (magmas) to the most restrictive (groups);
  • The related notions of category and groupoid.

All group-like structures feature a primary (and often unique) binary or ternary operation, which usually (e.g., for semigroups and hoops) associates. This operation will nearly always be denoted here by concatenation, and when it is binary, will be called "group product." If group product associates, brackets are not required to resolve the order of operation. When group product does not associate (e.g., quasigroups, semiheaps, loops, implication algebras), an embedded period indicates the grouping. Examples: xy.z, x.yz.

For Steiner magmas, abelian groups, logic algebras, bands, equivalence algebras, and hoops, group product also commutes. Commutativity may be added to any group-like structure for which it is not already the case.

Groups, logic algebras, lattices, and loops feature a unary operation, denoted here by enclosure in parentheses.

For monoids, loops, and sloops, S is a pointed set.

One binary operation.

  • Magma or groupoid: S is closed under a single binary operation.
    • Steiner magma: A commutative magma satisfying x.xy = y.
      • Squag: an idempotent Steiner magma.[1]
      • Sloop: a Steiner magma with distinguished element 1, such that xx = 1.
    • Equivalential algebra: a magma satisfying xx.y=y, xy.z.z=xy, and xy.xzz.xzz=xy.[2]
    • Implicational calculus: a magma satisfying xy.x=x, x.yz=y.xz, and xy.y=yx.x.[3]
    • Equivalence algebra: an idempotent magma satisfying xy.x=x, x.yz=xy.xz, and xy.z.y.x = xz.y.x.[4]
    • Semigroup: an associative magma.
    • Order (algebra): an idempotent magma satisfying yx=xy.x, xy=xy.y, x:xy.z=x.yz, and xy.z.y=xz.y. Hence idempotence holds in the following wide sense. For any subformula x of formula z: (i) all but one instance of x may be erased; (ii) x may be duplicated at will anywhere in z.
      • Band: an associative order algebra, and an idempotent semigroup.
        • Rectangular band: a band satisfying the axiom xyz = xz.
        • Normal band: a band satisfying the axiom xyzx = xzyx.
The following two structures form a bridge connecting magmas and lattices:
  • Lattice: a semilattice with a unary operation, dualization, denoted (x) and satisfying the absorption law, x(xy) = (x(xy)) = x. xx = x is now provable.


Two binary operations.

  • Rack: Infix ◅ and ▻ denote the two operations. The axioms are x▻(yz) = (x▻y)▻(x▻z), (z◅y)◅x = (z◅x)◅(y◅x), (x▻y)◅x = y, and x▻(y◅x) = y. A simpler but nonequational way of stating an important fact about racks is that ∀x,yS, there exists a unique z such that x▻z = y. Asserting this makes redundant the operation denoted by ◅.
    • Quandle: Either of the rack operations is idempotent.
  • Hoop: a commutative monoid with a second binary operation, denoted by infix →, satisfying the axioms x→.yz = xy.→z, xx = 1, and xy.x = yx.y.


Three binary operations. In addition to group product, quasigroups feature 2 binary operations denoted by infix "/" and "\". These added operations permit axiomatizing the defining property of quasigroups, cancellation, by means of identities alone.

  • Quasigroup: a cancellative magma. A quasigroup satisfies the axioms y = x(x\y) = x\(xy) = (y/x)x = (yx)/x. The following equivalent but nonvariety definition may be more intuitive. S is a quasigroup iffx,yS, ∃a,bS, such that xa = y and bx = y.
    • Loop: a unital quasigroup. Every element of S has, provably, a unique left and right inverse.
      • Bol loop: A loop satisfying either a.b.ac = a.ba.c (left) or ca.b.a = c.ab.a (right).
      • Group: an associative loop.


The following diagram summarizes two possible paths from magma to group.

Magma to Group.svg

NOTE:


One ternary operation, heap product, denoted xyz:

  • Semiheap: S is closed under heap product, which para-associates: vwx.yz = v.wxy.z = vw.xyz.
    • Idempotent semiheap: A semiheap satisfying xxx = x.
      • Generalized heap: An idempotent semiheap satisfying yy.zzx = zz.yyx and xyy.zz = xzz.yy.
    • Heap: A semiheap satisfying yyx = xyy = x.
      • Group: A heap with distinguished element 1. The group product of x and y is defined as x1y, and the group inverse of x is defined as 1x1.

Lattice-like structures

The binary operations meet and join, which characterize nearly all structures in this section, are idempotent, by assumption or proof. Latticoids are the only lattice-like structure that do not associate. N.B. "Lattice" is also employed in a number of group-theoretic contexts, including to refer to a discrete subgroup of the real vector space Rn that spans Rn.

Some concepts from order theory that recur in lattice theory:

One binary operation, one of meet or join, and denoted by concatenation. The two structures below are also magmas; see the preceding section.

  • Semilattice: the binary operation commutes and associates. Also a partially ordered set closed under one of pairwise greatest lower bound or least upper bound.
    • Lattice: a semilattice with a unary operation, dualization, denoted by enclosure within a pair of brackets. If xy denotes meet, (xy) denotes join, and vice versa. The binary and unary operations interact via a form of the absorption law, x(xy) = x = (x(xy)).

Two binary operations, meet (infix ∧) and join (infix ∨). Duality means that interchanging all meets and joins preserves truth.

  • Latticoid: meet and join commute but do not associate.
  • Skew lattice: meet and join associate but do not commute.
  • Lattice: a commutative skew lattice, an associative latticoid, and both a meet and join semilattice. Meet and join interact via the absorption law: x∧(xy) = x. Also a partially ordered set closed under pairwise greatest lower bound and least upper bound.
    • Bounded lattice: a lattice with two distinguished elements, the greatest (1) and the least element (0), such that x∨1=1 and x∨0=x. Dualizing requires interchanging 0 and 1. A bounded lattice is a pointed set.
    • Involutive lattice: a lattice with a unary operation, denoted by postfix ', and satisfying x"=x and (xy)' = x'y' .
    • Relatively complemented lattice:
    • Complemented lattice: a lattice with a unary operation, complementation, denoted by postfix ', such that xx' = 0 and 1=0'. 0 and 1 bound S.
      • Orthocomplemented lattice: a complemented lattice satisfying x" = x and xy=yy'x' = x' (complementation is order reversing).
        • Orthomodular lattice: an ortholattice such that (xy) → (x ∨ (xy) = y) holds.
      • De Morgan algebra: a complemented lattice satisfying x" = x and (xy)' = x'y' . Also a bounded involutive lattice.
    • Modular lattice: a lattice satisfying the modular identity, x∨(y∧(xz)) = (xy)∧(xz).
      • Metric lattice:
      • Projective lattice:
      • Arguesian lattice: a modular lattice satisfying the identity .
      • Distributive lattice: a lattice in which each of meet and join distributes over the other. Distributive lattices are modular, but the converse need not hold.
        • Boolean algebra: a complemented distributive lattice. Either of meet or join can be defined in terms of the other and complementation.
          • Boolean algebra with operators: a Boolean algebra with one or more added operations, usually unary. Let a postfix * denote any added unary operation. Then 0* = 0 and (xy)* = x*∨y*. More generally, all added operations (a) evaluate to 0 if any argument is 0, and (b) are join preserving, i.e., distribute over join.
            • Modal algebra: a Boolean algebra with a single added operator, the modal operator.
              • Derivative algebra: a modal algebra whose added unary operation, the derivative operator, satisfies x**∨x*∨x = x*∨x.
              • Interior algebra: a modal algebra whose added unary operation, the interior operator, satisfies x*∨x = x and x** = x*. The dual is a closure algebra.
                • Monadic Boolean algebra: a closure algebra whose added unary operation, the existential quantifier, denoted by prefix ∃, satisfies the axiom ∃(∃x)' = (∃x)'. The dual operator, ∀x := (∃x' )' is the universal quantifier.
Three structures whose intended interpretations are first order logic:
  • Polyadic algebra: a monadic Boolean algebra with a second unary operation, denoted by prefixed S. I is an index set, J,KI. ∃ maps each J into the quantifier ∃(J). S maps II transformations into Boolean endomorphisms on S. σ, τ range over possible transformations; δ is the identity transformation. The axioms are: ∃(∅)a=a, ∃(JK) = ∃(J)∃(K), S(δ)a = a, S(σ)S(τ) = S(στ), S(σ)∃(J) = S(τ)∃(J) (∀iI-J, such that σii), and ∃(J)S(τ) = S(τ)∃(τ-1J) (τ injective).[7]
  • Relation algebra: S, the Cartesian square of some set, is a:
Converse is an involution and distributes over composition so that (AB)\breve{\ } = B\breve{\ }A\breve{\ }. Converse and composition each distribute over join.[8]

Three binary operations:

  • Boolean semigroup: a Boolean algebra with an added binary operation that associates, distributes over join, and is annihilated by 0.
  • Implicative lattice: a distributive lattice with a third binary operation, implication, that distributes left and right over each of meet and join.
  • Brouwerian algebra: a distributive lattice with a greatest element and a third binary operation, denoted by infix " ' ", satisfying ((xy)≤z)∧(yx)' z.
  • Heyting algebra: a Brouwerian algebra with a least element, whose third binary operation, now called relative pseudo-complement, satisfies the identities x'x=1, x(x'y) = xy, x' (yz) = (x'y)(x'z), and (xy)'z = (x'z)(y'z). In pointless topology, a Heyting algebra is called a frame.

Four or more binary operations:

  • Residuated semilattice: a semilattice under meet or join, a monoid under product, and two further binary operations, residuation, satisfying the axioms .


The following Hasse diagram illustrates some pathways from a very general concept, partially ordered sets, to the oldest and most researched lattice, Boolean algebra. This diagram reveals some of the hierarchical structure linking a number of important types of lattices, not all discussed above because some are not varieties. This diagram consists of a number of links of the form AB, each meaning that structure A is included in structure B.

Lattice v4.png

Lattice ordered structures

S includes distinguished elements and is closed under additional operations, so that the axioms for a semigroup, monoid, group, or a ring are satisfied.

Ring-like structures

Two binary operations, addition and multiplication. That multiplication has a 0 is either an axiom or a theorem.

  • Shell: Multiplication has left/right identity element of 1, and a zero element, 0, which is also the left/right identity element for addition.
  • Ringoid: multiplication distributes over addition.
    • Nonassociative ring: a ringoid that is an abelian group under addition.
      • Lie ring: a nonassociative ring whose multiplication anticommutes and satisfies the Jacobi identity.
      • Jordan ring: a nonassociative ring whose multiplication commutes and satisfies the Jordan identity.
    • Newman algebra: a ringoid that is also a shell. There is a unary operation, inverse, denoted by a postfix "'", such that x+x'=1 and xx'=0. The following are provable: inverse is unique, x"=x, addition commutes and associates, and multiplication commutes and is idempotent.
    • Semiring: a ringoid that is also a shell. Addition and multiplication associate, addition commutes.
      • Commutative semiring: a semiring whose multiplication commutes.
    • Rng: a ringoid that is an Abelian group under addition and 0, and a semigroup under multiplication.

N.B. The above definitions of rng, ring, and semiring do not command universal assent:

  • Some employ "ring" to denote what is here called a rng, and call a ring in the above sense a "ring with identity";
  • Some define a semiring as having no identity elements.

Modules and algebras

These structures feature a set R whose elements are scalars, denoted by Greek letters, and a set S whose members are denoted by Latin letters. For every ring R, there is a corresponding variety of R-modules.

  • Monoid ring: R is a ring and S is a monoid.
  • Module: S is an abelian group with operators, each unary operator indexed by R. The operators are scalar multiplication RxSS, which commutes, associates, is unital, and distributes over module and scalar addition. If only the pre(post)multiplication of module elements by scalars is defined, the result is a left (right) module.
    • Comodule: the dual of a module.
    • Vector space: A module such that R is a field.
    • Algebra over a ring (also R-algebra): a module where R is a commutative ring. There is a second binary operation over S, called multiplication and denoted by concatenation, which distributes over module addition and is bilinear: α(xy) = (αx)y = xy).
      • Algebra over a field: An algebra over a ring whose R is a field.
        • Associative algebra: an algebra over a field or ring, whose vector multiplication associates.
          • Coalgebra: the dual of a unital associative algebra.
          • Commutative algebra: an associative algebra whose vector multiplication commutes.
          • Incidence algebra: an associative algebra such that the elements of S are the functions f [a,b]: [a,b]→R, where [a,b] is an arbitrary closed interval of a locally finite poset. Vector multiplication is defined as a convolution of functions.
        • Jordan algebra: an algebra over a field whose vector multiplication commutes, may or may not associate, and satisfies the Jordan identity.
        • Lie algebra: an algebra over a field satisfying the Jacobi identity. The vector multiplication, the Lie bracket denoted [u,v], anticommutes, usually does not associate, and is nilpotent.
          • Kac-Moody algebra: a Lie algebra, usually infinite-dimensional, definable by generators and relations through a generalized Cartan matrix.
            • Generalized Kac-Moody algebra: a Kac-Moody algebra whose simple roots may be imaginary.
            • Affine Lie algebra: a Kac-Moody algebra whose generalized Cartan matrix is positive semi-definite and has corank 1.

Quasivarieties

A quasivariety is a variety with one or more axioms that are quasiidentities. Let Greek letters be metavariables denoting identities. A quasiidentity then takes the form (α1∧,...,∧αn) → β.

Magmas

A magma (sometimes called "groupoid", or "algebra of type (2)") is a set equipped with a binary operation.

Cancellative

  • Semigroup: a semigroup satisfying the added axioms xa=yax=y, and bx=byx=y.
  • Monoid: a unital cancellative semigroup.

Combinatory logic

The elements of S are higher order functions, and concatenation denotes the binary operation of function composition.

  • BCI algebra: a magma with distinguished element 0, satisfying the identities (xy.xz)zy = 0, (x.xy)y = 0, xx=0, xy=yx=0 → x=y, and x0 = 0 → x=0.
    • BCK algebra: a BCI algebra satisfying the identity x0 = x. xy, defined as xy=0, induces a partial order with 0 as least element.
  • Combinatory logic: A combinator concatenates upper case letters. Terms concatenate combinators and lower case letters. Concatenation is left and right cancellative. '=' is an equivalence relation over terms. The axioms are Sxyz = xz.yz and Kxy = x; these implicitly define the primitive combinators S and K. The distinguished elements I and 1, defined as I=SK.K and 1=S.KI, have the provable properties Ix=x and 1xy=xy. Combinatory logic has the expressive power of set theory.[9]

Graphs

One set, V a finite set of vertices, and a binary relation EV2, adjacency, consisting of edges. No operations.

  • Directed graph: E is irreflexive.
    • Graph algebra:
    • Directed acyclic graph: A directed graph with no path whose endpoints are the same element of V.
    • Graph: A directed graph such that E is symmetric. Dropping the requirement that E be irreflexive makes loops possible.
      • Connected graph: A graph such that a path connects any two vertices.
        • Tree: a connected graph with no cycles.
        • Cycle graph: a connected graph consisting of a single cycle.
        • Complete graph: a connected graph such that the shortest path between any two vertices includes no other vertex. Hence for any two vertices x and y, (x,y) and (y,x) are both elements of E.
          • Tournament: A complete graph such that only one of (x,y) and (y,x) is an element of E.

Lattices

  • Semimodular lattice:
  • Kleene lattice: a bounded distributive lattice with a unary involution, denoted by postfix ', satisfying the axioms (x∨y)' = x'∨y', x" = x, and (x∧x')∨(y∨y') = y∨y'.
  • Semidistributive lattice: a lattice satisfying the axiom (xy = xz)→(xy=x∧(yz)), and dually.

Ring-like

Universal classes

  • Integral domain: A commutative ring such that (xy=0)→((x=0)∨(y=0)). Also a domain whose multiplication commutes.
  • Integral relation algebra: a relation algebra such that (xy=0)→((x=0)∨(y=0)).

Partial order for nonlattices

If the partial order relation ≤ is added to a structure other than a lattice, the result is a partially ordered structure. These are discussed in Birkhoff (1967: chpts. 13-15, 17) using a differing terminology. Examples include:

Nonvarieties

Nonvarieties cannot be axiomatized solely with identities and quasiidentities. Many nonidentities are of three very simple kinds:

  1. The requirement that S (or R or K) be a "nontrivial" ring, namely one such that S≠{0}, 0 being the additive identity element. The nearest thing to an identity implying S≠{0} is the nonidentity 0≠1, which requires that the additive and multiplicative identities be distinct.
  2. Axioms involving multiplication, holding for all members of S (or R or K) except 0. In order for an algebraic structure to be a variety, the domain of each operation must be an entire underlying set; there can be no partial operations.
  3. "0 is not the successor of anything," included in nearly all arithmetics.

Most of the classic results of universal algebra do not hold for nonvarieties. For example, neither the free field over any set nor the direct product of integral domains exists. Nevertheless, nonvarieties often retain an undoubted algebraic flavor.

There are whole classes of axiomatic formal systems not included in this section, e.g., logics, topological spaces, and this exclusion is in some sense arbitrary. Many of the nonvarieties below were included because of their intrinsic interest and importance, either by virtue of their foundational nature (Peano arithmetic), ubiquity (the real field), or richness (e.g., fields, normed vector spaces). Also, a great deal of theoretical physics can be recast using the nonvarieties called multilinear algebras.

No operations. Functions or relations may be present:

Arithmetics

If the name of a structure in this section includes the word "arithmetic," the structure features one or both of the binary operations addition and multiplication. If both operations are included, the recursive identity defining multiplication usually links them. Arithmetics necessarily have infinite models.

  • Cegielski arithmetic[10]: A commutative cancellative monoid under multiplication. 0 annihilates multiplication, and xy=1 if and only if x and y are both 1. Other axioms and one axiom schema govern order, exponentiation, divisibility, and primality; consult Smorynski. Adding the successor function and its axioms as per Dedekind algebra render addition recursively definable, resulting in a system with the expressive power of Robinson arithmetic.

In the structures below, addition and multiplication, if present, are recursively defined by means of an injective operation called successor, denoted by prefix σ. 0 is the axiomatic identity element for addition, and annihilates multiplication. Both axioms hold for semirings.

Arithmetics above this line are decidable. Those below are incompletable.

  • Peano arithmetic: Robinson arithmetic with an axiom schema of induction. The semiring axioms for N (other than x+0=x and x0=0, included in the recursive definitions of addition and multiplication) are now theorems.
    • Primitive recursive arithmetic: A Dedekind algebra with recursively defined addition, multiplication, exponentiation, and other primitive recursive operations as desired. A rule of induction replaces the axiom of induction. The background logic lacks quantification and thus is not first-order logic.
    • Skolem arithmetic (Boolos and Jeffrey 2002: 73-76): Not an algebraic structure because there is no fixed set of operations of fixed adicity. Skolem arithmetic is a Dedekind algebra with projection functions, indexed by n, whose arguments are functions and that return the nth argument of a function. The identity function is the projection function whose arguments are all unary operations. Composite operations of any adicity, including addition and multiplication, may be constructed using function composition and primitive recursion. Mathematical induction becomes a theorem.

The following arithmetics lack a connection between addition and multiplication. They are the simplest arithmetics capable of expressing all primitive recursive functions.

  • Baby Arithmetic[12]: Because there is no universal quantification, there are axiom schemes but no axioms. [n] denotes n consecutive applications of successor to 0. Addition and multiplication are defined by the schemes [n]+[p] = [n+p] and [n][p] = [np].
    • R[13]: Baby arithmetic plus the binary relations "=" and "≤". These relations are governed by the schemes [n]=[p] ↔ n=p, (x≤[n])→(x=0)∨,...,∨(x=[n]), and (x≤[n])∨([n]≤x).

Lattices that are not varieties

Two sets, Φ and D.

  • Information algebra: D is a lattice, and Φ is a commutative monoid under combination, an idempotent operation. The operation of focussing, f: ΦxD→Φ satisfies the axiom f(f(φ,x),y)=f(φ,xy) and distributes over combination. Every element of Φ has an identity element in D under focussing.

Field-like structures

Two binary operations, addition and multiplication. S is nontrivial, i.e., S≠{0}. S-0 is S with 0 removed.

  • Division ring (also skew field, sfield): a ring such that S-0 is a group under multiplication.
    • Field: a division ring whose multiplication commutes. Recapitulating: S is an abelian group under addition and 0, S-0 is an abelian group under multiplication and 1≠0, and multiplication distributes over addition. x0 = 0 is a theorem.
      • Algebraically closed field: a field such that all polynomial equations whose coefficients are elements of S have all roots in S. This field is the complex numbers.
      • Ordered field: a field whose S is totally ordered by '≤', so that (ab)→(a+cb+c) and (0≤a,b)→ (0≤ab).
        • Real closed field: an ordered real field such that for every element x of S, there exists a y such that x = y2 or -y2. All polynomial equations of odd degree and whose coefficients are elements of S, have at least one root that in S.
        • Real field: a Dedekind complete ordered field.

The following field-like structures are not varieties for reasons in addition to S≠{0}:

Vector spaces that are not varieties

The following composite structures are extensions of vector spaces that are not varieties. Two sets: M is a set of vectors and R is a set of scalars.

Three binary operations.

Structures that build on the notion of vector space:

Multilinear algebras

Four binary operations. Two sets, V and K:

  1. The members of V are multivectors (including vectors), denoted by lower case Latin letters. V is an abelian group under multivector addition, and a monoid under outer product. The outer product goes under various names, and is multilinear in principle but usually bilinear. The outer product defines the multivectors recursively starting from the vectors. Thus the members of V have a "degree" (see graded algebra below). Multivectors may have an inner product as well, denoted uv: V×VK, that is symmetric, linear, and positive definite; see inner product space above.
  2. The properties and notation of K are the same as those of R above, except that K may have -1 as a distinguished member. K is usually the real field, as multilinear algebras are designed to describe physical phenomena without complex numbers.
  3. The scalar multiplication of scalars and multivectors, V×KV, has the same properties as module scalar multiplication.
  • Symmetric algebra: a unital commutative algebra with vector multiplication.
  • Universal enveloping algebra: Given a Lie algebra L over K, the "most general" unital associative K-algebra A, such that the Lie algebra AL contains L.
  • Graded algebra: an associative algebra with unital outer product. The members of V have a directram decomposition resulting in their having a "degree," with vectors having degree 1. If u and v have degree i and j, respectively, the outer product of u and v is of degree i+j. V also has a distinguished member 0 for each possible degree. Hence all members of V having the same degree form an Abelian group under addition.
    • Tensor algebra: A graded algebra such that V includes all finite iterations of a binary operation over V, called the tensor product. All multilinear algebras can be seen as special cases of tensor algebra.
      • Exterior algebra (also Grassmann algebra): a graded algebra whose anticommutative outer product, denoted by infix ∧, is called the exterior product. V has an orthonormal basis. v1v2 ∧ ... ∧ vk = 0 if and only if v1, ..., vk are linearly dependent. Multivectors also have an inner product.
        • Clifford algebra: an exterior algebra with a symmetric bilinear form Q: V×VK. The special case Q=0 yields an exterior algebra. The exterior product is written 〈u,v〉. Usually, 〈ei,ei〉 = -1 (usually) or 1 (otherwise).
        • Geometric algebra: an exterior algebra whose exterior (called geometric) product is denoted by concatenation. The geometric product of parallel multivectors commutes, that of orthogonal vectors anticommutes. The product of a scalar with a multivector commutes. vv yields a scalar.
          • Grassmann-Cayley algebra: a geometric algebra without an inner product.

Structures with topologies or manifolds

These algebraic structures are not varieties, because the underlying set either has a topology or is a manifold, characteristics that are not algebraic in nature. This added structure must be compatible in some sense, however, with the algebraic structure. The case of when the added structure is partial order is discussed above, under varieties.

Topology:

Manifold:

Categories

Let there be two classes:

  • O whose elements are objects, and
  • M whose elements are morphisms defined over O.

Let x and y be any two elements of M. Then there exist:

Category: Composition associates (if defined), and x has left and right identity elements, the domain and codomain of x, respectively, so that d(x)x = x = xc(x). Letting φ stand for one of c or d, and γ stand for the other, then φ(γ(x)) = γ(x). If O has but one element, the associated category is a monoid.

  • Groupoid: Two equivalent definitions.
    • Category theory: A small category in which every morphism is an isomorphism. Equivalently, a category such that every element x of M, x(a,b), has an inverse x(b,a); see diagram in section 2.2.
    • Algebraic definition: A group whose product is a partial function. Group product associates in that if ab and bc are both defined, then ab.c=a.bc. (a)a and a(a) are always defined. Also, ab.(b) = a, and (a).ab = b.

Unclassified

Examples

Recurring underlying sets: N=natural numbers; Z=integers; Q=rational numbers; R=real numbers; C=complex numbers.

Arithmetics

Group-like structures

Also see examples of groups, list of small groups, and list of finite simple groups.

Lattices

Ring-like structures

  • N is a commutative semiring under addition and multiplication.
  • The set R[X] of all polynomials over some coefficient ring R is a ring.
  • 2x2 matrices under matrix addition and multiplication form a ring.
  • If n is a positive integer, then the set Zn = Z/nZ of integers modulo n (the additive cyclic group of order n ) forms a ring having n elements (see modular arithmetic).

Field-like structures

Lie groups: See table of Lie groups and list of simple Lie groups.

See also

Notes

  1. ^ Wolfram, Steven (2002) A New Kind of Science, p. 1171.
  2. ^ Słomczyńska, Katarzyna (2008) "Free equivalential algebras", Annals of Pure and Applied Logic 155: 86-96
  3. ^ Wolfram, Steven (2002) A New Kind of Science, p. 803.
  4. ^ Jezek, J., and Ralph McKenzie (2001) "The Variety Generated by Equivalence Algebras," Algebra Universalis 45: 212, Prop. 1.1.
  5. ^ Wolfram, Steven (2002) A New Kind of Science, p. 803.
  6. ^ McCune, William (1993) "Single Axioms for Groups and Abelian Groups with Various Operations," Journal of Automated Reasoning 10:1-13.
  7. ^ Pp. 26-28, 251, of Paul Halmos (1962) Algebraic Logic. Chelsea.
  8. ^ Givant, Steven, 2006, "The calculus of relations as a foundation for mathematics," Journal of Automated Reasoning 37: 277-322.
  9. ^ Raymond Smullyan (1994) Diagonalization and Self-Reference. Oxford Univ. Press: chpt. 18.
  10. ^ Smorynski (1991).
  11. ^ Potter (2004: 90).
  12. ^ Machover, M., 1996. Sets, Logic, and their Limitations. Cambridge Univ. Press: 10.9.
  13. ^ Alfred Tarski, Andrej Mostowski, and Raphael Robinson, 1953. Undecidable Theories. North-Holland: 53.
  14. ^ Birkhoff and MacLane (1979: 369).
  15. ^ Cohn, Paul, 1965. Universal Algebra, chpt. VII.1.
  16. ^ Lewis (1991).

References

  • Garrett Birkhoff, 1967. Lattice Theory, 3rd ed, AMS Colloquium Publications Vol. 25. American Mathematical Society.
  • --------, and Saunders MacLane, 1999 (1967). Algebra, 2nd ed. New York: Chelsea.
  • George Boolos and Richard Jeffrey, 1980. Computability and Logic, 2nd ed. Cambridge Univ. Press.
  • Dummit, David S., and Foote, Richard M., 2004. Abstract Algebra, 3rd ed. John Wiley and Sons.
  • Grätzer, George, 1978. Universal Algebra, 2nd ed. Springer.
  • David K. Lewis, 1991. Part of Classes. Blackwell.
  • Michel, Anthony N., and Herget, Charles J., 1993 (1981). Applied Algebra and Functional Analysis. Dover.
  • Potter, Michael, 2004. Set Theory and its Philosophy, 2nd ed. Oxford Univ. Press.
  • Smorynski, Craig, 1991. Logical Number Theory I. Springer-Verlag.

A monograph available free online:

External links


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Outline of science — The following outline is provided as an overview of and topical guide to science: Science – in the broadest sense refers to any system of objective knowledge. In a more restricted sense, science refers to a system of acquiring knowledge based on… …   Wikipedia

  • Outline of combinatorics — See also: Index of combinatorics articles The following outline is presented as an overview of and topical guide to combinatorics: Combinatorics – branch of mathematics concerning the study of finite or countable discrete structures. Contents 1… …   Wikipedia

  • Algebra — This article is about the branch of mathematics. For other uses, see Algebra (disambiguation). Algebra is the branch of mathematics concerning the study of the rules of operations and relations, and the constructions and concepts arising from… …   Wikipedia

  • Abstract algebra — This article is about the branch of mathematics. For the Swedish band, see Abstrakt Algebra. The permutations of Rubik s Cube have a group structure; the group is a fundamental concept within abstract algebra. Abstract algebra is the subject area …   Wikipedia

  • Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… …   Wikipedia

  • Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

  • Structure (mathematical logic) — In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations which are defined on it. Universal algebra studies structures that generalize the algebraic structures such as… …   Wikipedia

  • Discrete mathematics — For the mathematics journal, see Discrete Mathematics (journal). Graphs like this are among the objects studied by discrete mathematics, for their interesting mathematical properties, their usefulness as models of real world problems, and their… …   Wikipedia

  • mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… …   Universalium

  • Areas of mathematics — Mathematics has become a vastly diverse subject over history, and there is a corresponding need to categorize the different areas of mathematics. A number of different classification schemes have arisen, and though they share some similarities,… …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.