syntactic congruence
Let S be a semigroup and let X⊆S.
The relation
s1≡Xs2iff∀l,r∈S(ls1r∈Xiffls2r∈X) | (1) |
is called the syntactic congruence of X.
The quotient S/≡X is called the syntactic semigroup of X,
and the natural morphism ϕ:S→S/≡X
is called the syntactic morphism of X.
If S is a monoid, then S/≡X is also a monoid,
called the syntactic monoid of X.
As an example,
if S=(ℕ,+) and
X={n∈ℕ∣∃k∈ℕ∣n=3k},
then m≡Xn if mmod3=nmod3,
and the syntactic monoid is isomorphic to the cyclic group
of order three.
It is straightforward that ≡X
is an equivalence relation and X is union of classes of ≡X.
To prove that it is a congruence
, let s1,s2,t1,t2∈S
satisfy s1≡Xs2 and t1≡Xt2.
Let l,r∈S be arbitrary.
Then ls1t1r∈X iff ls2t1r∈X because s1≡Xs2,
and ls2t1r∈X iff ls2t2r∈X because t1≡Xt2.
Then s1t1≡Xs2t2 since l and r are arbitrary.
The syntactic congruence is both left- and right-invariant, i.e., if s1≡Xs2, then ts1≡Xts2 and s1t≡Xs2t for any t.
The syntactic congruence is maximal in the following sense:
-
•
if χ is a congruence over S and X is union of classes of χ,
-
•
then sχt implies s≡Xt.
In fact, let l,r∈S: since sχt and χ is a congruence, lsrχltr. However, X is union of classes of χ, therefore lsr and ltr are either both in X or both outside X. This is true for all l,r∈S, thus s≡Xt.
Title | syntactic congruence |
---|---|
Canonical name | SyntacticCongruence |
Date of creation | 2013-03-22 18:52:08 |
Last modified on | 2013-03-22 18:52:08 |
Owner | Ziosilvio (18733) |
Last modified by | Ziosilvio (18733) |
Numerical id | 6 |
Author | Ziosilvio (18733) |
Entry type | Definition |
Classification | msc 68Q70 |
Classification | msc 20M35 |
Defines | syntactic semigroup |
Defines | syntactic monoid |
Defines | syntactic morphism |
Defines | maximality property of syntactic congruence |