Definition:Generator of Monoid
(Redirected from Definition:Finitely Generated Monoid)
Jump to navigation
Jump to search
![]() | This page has been identified as a candidate for refactoring of medium complexity. In particular: This properly defines Definition:Generator of Submonoid. We require this to be rewritten so as to be for the more abstract notion whereby there is not necessarily a monoid for it to be a submonoid of. Until this has been finished, please leave {{Refactor}} in the code.
New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code. |
Definition
Let $\struct {M, \circ}$ be a monoid.
Let $S \subseteq M$.
Let $H$ be the smallest submonoid of $M$ such that $S \subseteq H$.
Then:
- $S$ is a generator of $\struct {H, \circ}$
- $S$ generates $\struct {H, \circ}$
- $\struct {H, \circ}$ is the submonoid of $\struct {M, \circ}$ generated by $S$.
This is written $H = \gen S$.
If $S$ is a singleton, for example $S = \set x$, then we can (and usually do) write $H = \gen x$ for $H = \gen {\set x}$.
Also known as
Some sources refer to such an $S$ as a set of generators of $H$, but this terminology is misleading, as it can be interpreted to mean that each of the elements of $S$ is itself a generator of $H$ independently of the other elements.