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 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.
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
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 and the
quotient modules of
representation theory into a common framework.
Compatible relation
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.
Quotient algebras and homomorphisms
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 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 ...
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
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(
) 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''.
Congruence lattice
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
.
Maltsev conditions
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 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,
quasigroups (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 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 (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
*
Congruence lattice problem
*
Lattice of subgroups
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