|
|
|
|
congruence relation on an algebraic system
|
(Definition)
|
|
|
Let be an algebraic system. A congruence relation, or simply a congruence
on 
- is an equivalence relation on
; if
we write
, and
- respects every
-ary operator on : if is an -ary operator on (
), and for any
,
, we have
 implies 
For example, and
are both congruence relations on . is called the trivial congruence (on ). A proper congruence relation is one not equal to .
Remarks.
-
is a congruence relation on if and only if
is an equivalence relation on and a subalgebra of the product .
- The set of congruences of an algebraic system is a complete lattice. The meet is the usual set intersection. The join (of an arbitrary number of congruences) is the join of the underlying equivalence relations. This join corresponds to the subalgebra (of
) generated by the union of the underlying sets of the congruences. The lattice of congruences on is denoted by
.
- (restriction) If
is a congruence on and is a subalgebra of , then
defined by
is a congruence on . The equivalence of
is obvious. For any -ary operator inherited from 's , if
, then
. Since both
and
are in ,
as well.
is the congruence restricted to .
- (extension) Again, let
be a congruence on and a subalgebra of . Define
by
and . In other words,
iff
for some . We assert that
is a subalgebra of . If is an -ary operator on and
, then
, so
. Since
,
. Therefore,
is a subalgebra. Because
, we call it the extension of by
.
- Let
be a subset of . The smallest congruence
on such that
for all is called the congruence generated by .
is often written
. When is a singleton
, then we call
a principal congruence, and denote it by
.
Given an algebraic structure and a congruence relation
on , we can construct a new -algebra
, as follows: elements of
are of the form , where . We set
![$\displaystyle [a]=[b]$ $\displaystyle [a]=[b]$](http://images.planetmath.org:8080/cache/objects/8594/l2h/img96.png) iff 
Furthermore, for each -ary operator on , define
by
It is easy to see that
is a well-defined operator on
. The -algebra thus constructed is called the quotient algebra of over
.
Remark. The bracket
is in fact an epimorphism, with kernel
. This means that every congruence of an algebraic system is the kernel of some homomorphism from . is usually written
to signify its association with
.
- 1
- G. Grätzer: Universal Algebra, 2nd Edition, Springer, New York (1978).
|
"congruence relation on an algebraic system" is owned by CWoo. [ full author list (3) ]
|
|
(view preamble)
See Also: congruence, congruence, congruence in algebraic number field, polynomial congruence
| Also defines: |
congruence, congruence relation, quotient algebra, proper congruence, trivial congruence, non-trivial congruence, congruence restricted to a subalgebra, extension of a subalgebra by a congruence, principal congruence, congruence generated by |
|
|
Cross-references: homomorphism, kernel, epimorphism, well-defined, singleton, subset, iff, extension, restricted, obvious, equivalence, restriction, lattice of congruences, union, generated by, number, join, intersection, meet, complete lattice, congruences, subalgebra, operator, equivalence relation, algebraic system
There are 17 references to this entry.
This is version 30 of congruence relation on an algebraic system, born on 2006-11-29, modified 2008-08-12.
Object id is 8594, canonical name is CongruenceRelationOnAnAlgebraicSystem.
Accessed 4310 times total.
Classification:
| AMS MSC: | 08A30 (General algebraic systems :: Algebraic structures :: Subalgebras, congruence relations) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|