In
mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, a quotient algebra is the result of
partition
Partition may refer to:
Computing Hardware
* Disk partitioning, the division of a hard disk drive
* Memory partition, a subdivision of a computer's memory, usually for use by a single job
Software
* Partition (database), the division of a ...
ing the elements of an
algebraic structure
In mathematics, an algebraic structure 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 multiplication), and a finite set of ...
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, ring, or vector space) that is compatible with the structure in the sense that algebraic operations done wi ...
.
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.
Each equivalence relation ...
that is additionally ''compatible'' with all the
operations
Operation or Operations may refer to:
Arts, entertainment and media
* ''Operation'' (game), a battery-operated board game that challenges dexterity
* Operation (music), a term used in musical set theory
* ''Operations'' (magazine), Multi-Man ...
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 a ...
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 rings 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 examp ...
s of
group theory, the
quotient space
Quotient space may refer to a quotient set when the sets under consideration are considered as spaces. In particular:
*Quotient space (topology), in case of topological spaces
* Quotient space (linear algebra), in case of vector spaces
*Quotient ...
s 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 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 a ...
es. 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
Arity () is the number of arguments or operands taken by a function, operation or relation in logic, mathematics, and computer science. In mathematics, arity may also be named ''rank'', but this word can have many other meanings in mathematics. In ...
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 is a visual representation of something. It can be two-dimensional, three-dimensional, or somehow otherwise feed into the visual system to convey information. An image can be an artifact, such as a photograph or other two-dimensiona ...
h(
) and
The two are
isomorphic
In mathematics, an isomorphism is a structure-preserving mapping 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 them. The word is ...
, a result known as the ''homomorphic image theorem'' or as the
first isomorphism theorem for universal algebra. Formally, let
be a
surjective
In mathematics, a surjective function (also known as surjection, or onto function) is a function that every element can be mapped from element so that . In other words, every element of the function's codomain is the image of one element of i ...
homomorphism. Then, there exists a unique isomorphism ''g'' from
onto
such that ''g''
composed
Composition or Compositions may refer to:
Arts and literature
*Composition (dance), practice and teaching of choreography
*Composition (language), in literature and rhetoric, producing a work in spoken tradition and written discourse, to include v ...
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
In mathematics, a binary relation associates elements of one set, called the ''domain'', with elements of another set, called the ''codomain''. A binary relation over Set (mathematics), sets and is a new set of ordered pairs consisting of ele ...
''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
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.
, then their join (in the congruence lattice) is equal to their composition:
. An algebra is called ''
congruence permutable In universal algebra, a congruence-permutable algebra is an algebra whose congruences commute under composition. This symmetry has several equivalent characterizations, which lend to the analysis of such algebras. Many familiar varieties of algebra ...
'' 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 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 (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