Quotient Algebra (universal Algebra)
   HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, a quotient algebra is the result of partitioning the elements of an
algebraic structure In mathematics, an algebraic structure or algebraic system consists of a nonempty set ''A'' (called the underlying set, carrier set or domain), a collection of operations on ''A'' (typically binary operations such as addition and multiplicatio ...
using a
congruence relation In abstract algebra, a congruence relation (or simply congruence) is an equivalence relation on an algebraic structure (such as a group (mathematics), group, ring (mathematics), ring, or vector space) that is compatible with the structure in the ...
. Quotient algebras are also called factor algebras. Here, the congruence relation must be an
equivalence relation In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equ ...
that is additionally ''compatible'' with all the operations of the algebra, in the formal sense described below. Its
equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements ...
es partition the elements of the given algebraic structure. The quotient algebra has these classes as its elements, and the compatibility conditions are used to give the classes an algebraic structure. The idea of the quotient algebra abstracts into one common notion the quotient structure of
quotient ring In ring theory, a branch of abstract algebra, a quotient ring, also known as factor ring, difference ring or residue class ring, is a construction quite similar to the quotient group in group theory and to the quotient space in linear algebra. ...
s of ring theory,
quotient group A quotient group or factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure (the rest of the structure is "factored out"). For ex ...
s of
group theory In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ( ...
, the quotient spaces of
linear algebra Linear algebra is the branch of mathematics concerning linear equations such as :a_1x_1+\cdots +a_nx_n=b, linear maps such as :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrix (mathemat ...
and the quotient modules of
representation theory Representation theory is a branch of mathematics that studies abstract algebra, abstract algebraic structures by ''representing'' their element (set theory), elements as linear transformations of vector spaces, and studies Module (mathematics), ...
into a common framework.


Compatible relation

Let ''A'' be the set of the elements of an algebra \mathcal, and let ''E'' be an equivalence relation on the set ''A''. The relation ''E'' is said to be ''compatible'' with (or have the ''substitution property'' with respect to) an ''n''-ary operation ''f'', if (a_i,\; b_i) \in E for 1 \le i \le n implies (f (a_1, a_2, \ldots, a_n), f (b_1, b_2, \ldots, b_n)) \in E for any a_i,\; b_i \in A with 1 \le i \le n. An equivalence relation compatible with all the operations of an algebra is called a congruence with respect to this algebra.


Quotient algebras and homomorphisms

Any equivalence relation ''E'' in a set ''A'' partitions this set in
equivalence class In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements ...
es. The set of these equivalence classes is usually called the
quotient set In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements ...
, and denoted ''A''/''E''. For an algebra \mathcal, it is straightforward to define the operations induced on the elements of ''A''/''E'' if ''E'' is a congruence. Specifically, for any operation f^_i of
arity In logic, mathematics, and computer science, arity () is the number of arguments or operands taken by a function, operation or relation. In mathematics, arity may also be called rank, but this word can have many other meanings. In logic and ...
n_i in \mathcal (where the superscript simply denotes that it is an operation in \mathcal, and the subscript i \in I enumerates the functions in \mathcal and their arities) define f^_i : (A/E)^ \to A/E as f^_i ( _1E, \ldots, _E) = ^_i(a_1,\ldots, a_)E, where E \in A/E denotes the equivalence class of x \in A generated by ''E'' ("''x'' modulo ''E''"). For an algebra \mathcal = (A, (f^_i)_), given a congruence ''E'' on \mathcal, the algebra \mathcal/E = (A/E, (f^_i)_) is called the ''quotient algebra'' (or ''factor algebra'') of \mathcal modulo ''E''. There is a natural
homomorphism In algebra, a homomorphism is a morphism, structure-preserving map (mathematics), map between two algebraic structures of the same type (such as two group (mathematics), groups, two ring (mathematics), rings, or two vector spaces). The word ''homo ...
from \mathcal to \mathcal/E mapping every element to its equivalence class. In fact, every homomorphism ''h'' determines a congruence relation via the kernel of the homomorphism, \mathop\,h = \\subseteq A^2. Given an algebra \mathcal, a homomorphism ''h'' thus defines two algebras homomorphic to \mathcal, the
image An image or picture is a visual representation. An image can be Two-dimensional space, two-dimensional, such as a drawing, painting, or photograph, or Three-dimensional space, three-dimensional, such as a carving or sculpture. Images may be di ...
h(\mathcal) and \mathcal/\mathop\,h The two are
isomorphic In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...
, a result known as the ''homomorphic image theorem'' or as the
first isomorphism theorem In mathematics, specifically abstract algebra, the isomorphism theorems (also known as Noether's isomorphism theorems) are theorems that describe the relationship among quotients, homomorphisms, and subobjects. Versions of the theorems exist for ...
for universal algebra. Formally, let h : \mathcal \to \mathcal be a
surjective In mathematics, a surjective function (also known as surjection, or onto function ) is a function such that, for every element of the function's codomain, there exists one element in the function's domain such that . In other words, for a f ...
homomorphism. Then, there exists a unique isomorphism ''g'' from \mathcal/\mathop\,h onto \mathcal such that ''g'' composed with the natural homomorphism induced by \mathop\,h equals ''h''.


Congruence lattice

For every algebra \mathcal on the set ''A'', the
identity relation In mathematics, a homogeneous relation (also called endorelation) on a set ''X'' is a binary relation between ''X'' and itself, i.e. it is a subset of the Cartesian product . This is commonly phrased as "a relation on ''X''" or "a (binary) relation ...
on A, and A \times A are trivial congruences. An algebra with no other congruences is called ''simple''. Let \mathrm(\mathcal) be the set of congruences on the algebra \mathcal. Because congruences are closed under intersection, we can define a meet operation: \wedge : \mathrm(\mathcal) \times \mathrm(\mathcal) \to \mathrm(\mathcal) by simply taking the intersection of the congruences E_1 \wedge E_2 = E_1\cap E_2. On the other hand, congruences are not closed under union. However, we can define the closure of any
binary relation In mathematics, a binary relation associates some elements of one Set (mathematics), set called the ''domain'' with some elements of another set called the ''codomain''. Precisely, a binary relation over sets X and Y is a set of ordered pairs ...
''E'', with respect to a fixed algebra \mathcal, such that it is a congruence, in the following way: \langle E \rangle_ = \bigcap \. Note that the closure of a binary relation is a congruence and thus depends on the operations in \mathcal, not just on the carrier set. Now define \vee: \mathrm(\mathcal) \times \mathrm(\mathcal) \to \mathrm(\mathcal) as E_1 \vee E_2 = \langle E_1\cup E_2 \rangle_ . For every algebra \mathcal, (\mathrm(\mathcal), \wedge, \vee) with the two operations defined above forms a lattice, called the ''congruence lattice'' of \mathcal.


Maltsev conditions

If two congruences ''permute'' (commute) with the
composition of relations In the mathematics of binary relations, the composition of relations is the forming of a new binary relation from two given binary relations ''R'' and ''S''. In the calculus of relations, the composition of relations is called relative multiplica ...
as operation, i.e. \alpha\circ\beta = \beta\circ\alpha, then their join (in the congruence lattice) is equal to their composition: \alpha\circ\beta = \alpha\vee\beta. An algebra is called '' congruence permutable'' if every pair of its congruences permutes; likewise a variety is said to be congruence-permutable if all its members are congruence-permutable algebras. In 1954, Anatoly Maltsev established the following characterization of congruence-permutable varieties: a variety is congruence permutable if and only if there exist a ternary term such that ; this is called a Maltsev term and varieties with this property are called Maltsev varieties. Maltsev's characterization explains a large number of similar results in groups (take ), rings,
quasigroup In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure that resembles a group in the sense that " division" is always possible. Quasigroups differ from groups mainly in that the associative and identity element pro ...
s (take ,
complemented lattice In the mathematics, mathematical discipline of order theory, a complemented lattice is a bounded lattice (order), lattice (with least element 0 and greatest element 1), in which every element ''a'' has a complement, i.e. an element ''b'' satisfyin ...
s,
Heyting algebra In mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0 and greatest element 1) equipped with a binary operation ''a'' → ''b'' call ...
s etc. Furthermore, every congruence-permutable algebra is congruence-modular, i.e. its lattice of congruences is modular lattice as well; the converse is not true however. After Maltsev's result, other researchers found characterizations based on conditions similar to that found by Maltsev but for other kinds of properties. In 1967 Bjarni Jónsson found the conditions for varieties having congruence lattices that are distributive (thus called congruence-distributive varieties), while in 1969 Alan Day did the same for varieties having congruence lattices that are modular. Generically, such conditions are called Maltsev conditions. This line of research led to the Pixley–Wille algorithm for generating Maltsev conditions associated with congruence identities.


See also

*
Quotient ring In ring theory, a branch of abstract algebra, a quotient ring, also known as factor ring, difference ring or residue class ring, is a construction quite similar to the quotient group in group theory and to the quotient space in linear algebra. ...
* Congruence lattice problem *
Lattice of subgroups In mathematics, the lattice of subgroups of a group G is the lattice whose elements are the subgroups of G, with the partial ordering being set inclusion. In this lattice, the join of two subgroups is the subgroup generated by their union, ...


Notes


References

* * * {{cite book, author=Clifford Bergman, title=Universal Algebra: Fundamentals and Selected Topics, year=2011, publisher=CRC Press, isbn=978-1-4398-5129-6, pages=122–124, 137 (Maltsev varieties) Universal algebra