- Monogenic semigroup
-
In mathematics, a monogenic semigroup is a semigroup generated by a set containing only a single element.[1] Monogenic semigroups are also called cyclic semigroups.[2]
Structure
The monogenic semigroup generated by the singleton set { a } is denoted by . The set of elements of is { a, a2, a3, ... }. There are two possibilities for the monogenic semigroup :
- a m = a n ⇒ m = n.
- There exist m ≠ n such that a m = a n.
In the former case is isomorphic to the semigroup ( {1, 2, ... }, + ) of natural numbers under addition. In such a case, is an infinite monogenic semigroup and the element a has infinite order. In the latter case let m be the smallest positive integer such that a m = a x for some positive integer x ≠ m, and let r be smallest positive integer such that a m = a m + r. The positive integer m is referred to as the index and the positive integer r as the period of the monogenic semigroup . The period and the index satisfy the following properties:
- a m = a m + r
- a m + x = a m + y if and only if m + x ≡ m + y ( mod r )
- = { a, a2, ... , a m + r − 1 }
- Ka = { am, a m + 1, ... , a m + r − 1 } is a cyclic subgroup of .
The pair ( m, r ) of positive integers determine the structure of monogenic semigroups. For every pair ( m, r ) of positive integers, there does exist a monogenic semigroup having index m and period r. The monogenic semigroup having index m and period r is denoted by M ( m, r ). The monogenic semigroup M ( 1, r ) is the cyclic group of order r.
See also
References
Categories:- Algebraic structures
- Abstract algebra
- Semigroup theory
Wikimedia Foundation. 2010.