View source for Polygon (over a monoid)

''$R$-polygon, operand''

A non-empty set with a [[monoid]] of operators. More precisely, a non-empty set $A$ is called a left polygon over a monoid $R$ if for any $\lambda \in R$ and $a \in A$ the product $\lambda a \in A$ is defined, such that
$$
\lambda (\mu a) = (\lambda\mu) a
$$
and
$$
1a = a
$$
for any $\lambda, \mu \in R$, $a \in A$. A right polygon is defined similarly. Specifying an $R$-polygon $A$ is equivalent to specifying a homomorphism $\phi$ from the monoid $R$ into the monoid of mappings of the set $A$ into itself that transforms 1 to the identity mapping. Here $\lambda a = b$ if and only if
$$
\phi(\lambda)a = b \ .
$$
In particular, each non-empty set may be considered as a polygon over the monoid of its mappings into itself. Therefore, polygons are closely related to the representation of semi-groups by transformations: cf. [[Transformation semi-group]].

If $A$ is a [[universal algebra]] whose signature $\Omega$ contains only unary operations, then $A$ can be converted into a polygon over the free monoid $F$ generated by $\Omega$ by putting
$$
f_1 \cdots f_n a = f_1(\cdots(f_n(a)\cdots)
$$

for any $f_i \in \Omega$, $a \in A$. If $\Omega$ is the set of input signals for an automaton having set of states $A$, then $A$ is similarly transformed into an $F$-polygon (cf. [[Automata, algebraic theory of]]).

A mapping $\phi$ of an $R$-polygon $A$ into an $R$-polygon $B$ is called a homomorphism if $\phi(\lambda a) = \lambda \phi(a)$ for any $\lambda \in R$ and $a \in A$. For $A=B$ one arrives at the definition of an endomorphism. All endomorphisms of a polygon $A$ form a monoid, and $A$ can be considered as a polygon over it.

An [[equivalence relation]] $\theta$ on an $R$-polygon $A$ is called a congruence if $(a,b) \in \theta$ implies $\lambda a,\lambda b) \in \theta$ for any $\lambda \in R$. The set of congruence classes of $\theta$ is naturally transformed into an $R$-polygon, called a quotient polygon of the polygon $A$ and denoted by $A/\theta$. If $A$ is a polygon over $R$, then in $R$ one can define a relation $\mathop{Ann} A$ by putting $(\lambda,\mu) \in \mathop{Ann} A$  if $\lambda a = \mu a$ for all $a \in A$. The relation $\mathop{Ann} A$ is a congruence on the monoid $R$, and $A$ is transformed in a natural fashion into a polygon over the quotient monoid $R/\mathop{Ann} A$. If the polygon $A$ arose from a certain automaton, then this transition is equivalent to identifying identically acting sequences of input signals. In universal algebra one considers the usual constructions of direct and subdirect product, but in addition in polygon theory one may consider a [[wreath product]] construction important in the algebraic theory of automata. The free product (or co-product) of polygons coincides with their disjoint union.

A polygon may be regarded as a non-additive analogue of a module over a ring, which serves as a rich source of problems in the theory of polygons. In particular, a relationship has been established between polygons and radicals in semi-groups (cf. [[Radical in a class of semi-groups]]), and studies have been made on the relation between the properties of a monoid and those of polygons over them. For example, all left $R$-polygons are projective if and only if $R$ is a one-element group, while the injectivity of all polygons over a commutative monoid $R$ is equivalent to the presence in $R$ of a [[zero element]] and the generation of all its ideals by [[idempotent]]s (see [[Homological classification of rings]]).

If $R$ is a monoid with zero 0, one can define an $R$-polygon with zero as a [[pointed set]] $A$ which is an $R$-polygon where the distinguished point $u \in A$ satisfies $0a=u$ for all $a\in A$. The theory of polygons with zero has some special features.

Every polygon can be considered as a [[functor]] from a one-object category into the category of sets.

====References====
<table>
<TR><TD valign="top">[1]</TD> <TD valign="top">  M.A. Arbib (ed.) , ''Algebraic theory of machines, languages and semigroups'' , Acad. Press  (1968)</TD></TR>
<TR><TD valign="top">[2]</TD> <TD valign="top">  A.H. Clifford,   G.B. Preston,   "Algebraic theory of semi-groups" , '''2''' , Amer. Math. Soc.  (1967)</TD></TR>
<TR><TD valign="top">[3]</TD> <TD valign="top">  L.A. Skornyakov,   "Generalizations of modules" , ''Modules'' , '''3''' , Novosibirsk  (1973)  pp. 22–27  (In Russian)</TD></TR>
<TR><TD valign="top">[4]</TD> <TD valign="top">  L.A. Skornyakov,   A.V. Mikhalev,   "Modules"  ''Itogi Nauk. i Tekhn. Alg. Topol. Geom.'' , '''14'''  (1976)  pp. 57–190  (In Russian)</TD></TR>
</table>

====Comments====
In the West, left polygons over a monoid $M$ are usually called $M$-sets; the term  "operand"  is also in use. The category of all $M$-sets ($M$ fixed) forms a [[topos]]; but for this it is essential not to exclude (as above) the empty $M$-set.

Without assuming commutativity as above, the monoids all of whose non-empty left polygons (or, all of whose pointed left polygons) are injective have a few characterizations, which are reviewed in [[#References|[a3]]]. As noted above, there are no non-trivial monoids all of whose left polygons are projective, but the perfect monoids, defined (like perfect rings, cf. [[Perfect ring]]) by every left polygon having a projective covering, are non-trivial; see [[#References|[a1]]], [[#References|[a2]]].

====References====
<table>
<TR><TD valign="top">[a1]</TD> <TD valign="top">  J. Fountain,   "Perfect semigroups"  ''Proc. Edinburgh Math. Soc.'' , '''20'''  (1976)  pp. 87–93</TD></TR>
<TR><TD valign="top">[a2]</TD> <TD valign="top">  J. Isbell,   "Perfect monoids"  ''Semigroup Forum'' , '''2'''  (1971)  pp. 95–118</TD></TR>
<TR><TD valign="top">[a3]</TD> <TD valign="top">  R.W. Yoh,   "Congruence relations on left canonic semigroups"  ''Semigroup Forum''  (1977)  pp. 175–183</TD></TR>
<TR><TD valign="top">[a4]</TD> <TD valign="top">  S. Eilenberg,   "Automata, languages and machines" , Acad. Press  (1974)</TD></TR>
</table>

====Comments====
The terms ''monoid action'' or ''monoid act'', or ''action'' of a monoid on a set are also common, as is ''act'' for the set acted on; see [[#References|[b1]]].

====References====
<table>
<TR><TD valign="top">[b1]</TD> <TD valign="top">  Mati Kilp, Ulrich Knauer, Alexander V. Mikhalev, ''Monoids, Acts and Categories: With Applications to Wreath Products and Graphs'', Walter de Gruyter (2000) ISBN 3110812908</TD></TR>
</table>

{{TEX|done}}