KNOWPIA
WELCOME TO KNOWPIA

In mathematics, a **quotient algebra** is the result of partitioning the elements of an algebraic structure using a congruence relation.
Quotient algebras are also called **factor algebras**. Here, the congruence relation must be an equivalence relation that is additionally *compatible* with all the operations of the algebra, in the formal sense described below.
Its equivalence classes 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.^{[1]}

The idea of the quotient algebra abstracts into one common notion the quotient structure of quotient rings of ring theory, quotient groups of group theory, the quotient spaces of linear algebra and the quotient modules of representation theory into a common framework.

Let *A* be the set of the elements of an algebra , 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 for implies for any with . An equivalence relation compatible with all the operations of an algebra is called a congruence with respect to this algebra.

Any equivalence relation *E* in a set *A* partitions this set in equivalence classes. The set of these equivalence classes is usually called the quotient set, and denoted *A*/*E*. For an algebra , it is straightforward to define the operations induced on the elements of *A*/*E* if *E* is a congruence. Specifically, for any operation of arity in (where the superscript simply denotes that it is an operation in , and the subscript enumerates the functions in and their arities) define as , where denotes the equivalence class of generated by *E* ("*x* modulo *E*").

For an algebra , given a congruence *E* on , the algebra is called the *quotient algebra* (or *factor algebra*) of modulo *E*. There is a natural homomorphism from to mapping every element to its equivalence class. In fact, every homomorphism *h* determines a congruence relation via the kernel of the homomorphism, .

Given an algebra , a homomorphism *h* thus defines two algebras homomorphic to , the image h( ) and The two are isomorphic, a result known as the *homomorphic image theorem* or as the first isomorphism theorem for universal algebra. Formally, let be a surjective homomorphism. Then, there exists a unique isomorphism *g* from onto such that *g* composed with the natural homomorphism induced by equals *h*.

For every algebra on the set *A*, the identity relation on A, and are trivial congruences. An algebra with no other congruences is called *simple*.

Let be the set of congruences on the algebra . Because congruences are closed under intersection, we can define a meet operation: by simply taking the intersection of the congruences .

On the other hand, congruences are not closed under union. However, we can define the closure of any binary relation *E*, with respect to a fixed algebra , such that it is a congruence, in the following way: . Note that the closure of a binary relation is a congruence and thus depends on the operations in , not just on the carrier set. Now define as .

For every algebra , with the two operations defined above forms a lattice, called the *congruence lattice* of .

If two congruences *permute* (commute) with the composition of relations as operation, i.e. , then their join (in the congruence lattice) is equal to their composition: . 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 *q*(*x*, *y*, *z*) such that *q*(*x*, *y*, *y*) ≈ *x* ≈ *q*(*y*, *y*, *x*); 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 *q* = *xy*^{−1}*z*), rings, quasigroups (take *q* = (x / (y \ y))(y \ z)), complemented lattices, Heyting algebras 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^{[2]} (thus called congruence-distributive varieties), while in 1969 Alan Day did the same for varieties having congruence lattices that are modular.^{[3]} 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.^{[4]}

**^**A. G. Kurosh, Lectures on General Algebra, Translated from the Russian edition (Moscow, 1960), Chelsea, New York, 1963.**^**Jonnson, Bjarni (1967). "Algebras Whose Congruence Lattices are Distributive".*Mathematica Scandinavica*.**21**: 110. doi:10.7146/math.scand.a-10850.**^**Day, Alan (1969). "A Characterization of Modularity for Congruence Lattices of Algebras".*Canadian Mathematical Bulletin*.**12**(2): 167–173. doi:10.4153/CMB-1969-016-6. S2CID 120602601.**^**Keith Kearnes; Emil W. Kiss (2013).*The Shape of Congruence Lattices*. American Mathematical Soc. p. 4. ISBN 978-0-8218-8323-5.

- Klaus Denecke; Shelly L. Wismath (2009).
*Universal algebra and coalgebra*. World Scientific. pp. 14–17. ISBN 978-981-283-745-5. - Purna Chandra Biswal (2005).
*Discrete mathematics and graph theory*. PHI Learning Pvt. Ltd. p. 215. ISBN 978-81-203-2721-4. - Clifford Bergman (2011).
*Universal Algebra: Fundamentals and Selected Topics*. CRC Press. pp. 122–124, 137 (Maltsev varieties). ISBN 978-1-4398-5129-6.