Misplaced Pages

Maximal semilattice quotient

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Maximal semilattice quotient" – news · newspapers · books · scholar · JSTOR (May 2024)

In abstract algebra, a branch of mathematics, a maximal semilattice quotient is a commutative monoid derived from another commutative monoid by making certain elements equivalent to each other.

Every commutative monoid can be endowed with its algebraic preordering ≤ . By definition, x≤ y holds, if there exists z such that x+z=y. Further, for x, y in M, let x y {\displaystyle x\propto y} hold, if there exists a positive integer n such that x≤ ny, and let x y {\displaystyle x\asymp y} hold, if x y {\displaystyle x\propto y} and y x {\displaystyle y\propto x} . The binary relation {\displaystyle \asymp } is a monoid congruence of M, and the quotient monoid M / {\displaystyle M/{\asymp }} is the maximal semilattice quotient of M.

This terminology can be explained by the fact that the canonical projection p from M onto M / {\displaystyle M/{\asymp }} is universal among all monoid homomorphisms from M to a (∨,0)-semilattice, that is, for any (∨,0)-semilattice S and any monoid homomorphism f: M→ S, there exists a unique (∨,0)-homomorphism g : M / S {\displaystyle g\colon M/{\asymp }\to S} such that f=gp.

If M is a refinement monoid, then M / {\displaystyle M/{\asymp }} is a distributive semilattice.

References

  • A.H. Clifford and G.B. Preston, The Algebraic Theory of Semigroups. Vol. I. Mathematical Surveys, No. 7, American Mathematical Society, Providence, R.I. 1961. xv+224 p.


Stub icon

This algebra-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: