syntactic congruence


Let S be a semigroupPlanetmathPlanetmath and let X⊆S. The relationMathworldPlanetmathPlanetmathPlanetmath

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 morphismMathworldPlanetmathPlanetmath ϕ: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 isomorphicPlanetmathPlanetmathPlanetmath to the cyclic groupMathworldPlanetmath of order three.

It is straightforward that ≡X is an equivalence relationMathworldPlanetmath and X is union of classes of ≡X. To prove that it is a congruencePlanetmathPlanetmathPlanetmathPlanetmathPlanetmath, let s1,s2,t1,t2∈S satisfy s1≡Xs2 and t1≡Xt2. Let l,r∈S be arbitrary. Then l⁢s1⁢t1⁢r∈X iff l⁢s2⁢t1⁢r∈X because s1≡Xs2, and l⁢s2⁢t1⁢r∈X iff l⁢s2⁢t2⁢r∈X because t1≡Xt2. Then s1⁢t1≡Xs2⁢t2 since l and r are arbitrary.

The syntactic congruence is both left- and right-invariant, i.e., if s1≡Xs2, then t⁢s1≡Xt⁢s2 and s1⁢t≡Xs2⁢t 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, l⁢s⁢r⁢χ⁢l⁢t⁢r. However, X is union of classes of χ, therefore l⁢s⁢r and l⁢t⁢r 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