Semigroup: A semigroup is a nonempty set S equipped with an associative binary operation *. It must satisfy closure and associativity. An identity element is not required.
Monoid: A monoid is a semigroup with an identity element e satisfying e * a = a * e = a for every a ∈ S. Associativity remains part of the definition.
Group: A group is a monoid in which every element a has an inverse a^(-1) satisfying a * a^(-1) = a^(-1) * a = e.
Abelian group: A group is abelian if its operation is also commutative: a * b = b * a for every a, b in the group.
Logical relationship: Every group is a monoid, and every monoid is a semigroup. The reverse implications do not hold in general.
Examples of semigroups: The positive integers under addition form a semigroup because addition is closed and associative, but the identity 0 is not in the set.
Examples of monoids: The nonnegative integers under addition form a monoid with identity 0. They do not form a group because positive integers do not have additive inverses within the set.
Examples of groups: The integers under addition form a group because every integer n has inverse -n.
Noncommutative groups: Not every group is abelian. For example, the group of invertible square matrices under multiplication is generally noncommutative when the matrix size is at least two.
Why the hierarchy matters: The hierarchy helps identify which theorems can be applied. A result requiring only associativity may hold in semigroups, while a theorem using inverses requires a group or another suitable structure.
Semigroups, Monoids and Groups
Semigroups, monoids and groups are algebraic structures defined by progressively stronger conditions on a binary operation. A semigroup requires associativity, a monoid adds an identity element, and a group further requires every element to possess an inverse.
Semigroup ⊇ Monoid ⊇ Group (by increasing axiomatic requirements)
Explanation
Example or application
A worked example has not yet been added.
Comparison
| Structure | Closure | Associativity | Identity | Inverses | Commutativity |
|---|---|---|---|---|---|
Semigroup | Required | Required | Not required | Not required | Not required |
Monoid | Required | Required | Required | Not required | Not required |
Group | Required | Required | Required | Every element has an inverse | Not required |
Abelian group | Required | Required | Required | Every element has an inverse | Required |
Examples
| Name | Structure | Explanation |
|---|---|---|
Positive integers under addition | Semigroup | Addition is closed and associative, but zero is not included as an identity. |
Nonnegative integers under addition | Monoid | Zero is the identity, but positive elements do not have additive inverses within the set. |
Integers under addition | Abelian group | Every integer has an additive inverse and addition is commutative. |
Invertible n × n matrices | Group under multiplication | The identity matrix and inverse matrices exist, but multiplication is generally noncommutative for n ≥ 2. |
Common Mistakes
Assuming every semigroup has an identity.
Assuming every monoid is a group.
Assuming every group is abelian.
Forgetting that associativity is required in all three structures.
Using an inverse that does not belong to the underlying set.
Related Concepts
Binary Operations
Associativity
Identity Elements
Inverse Elements
Groups
Abelian Groups
Learning Outcomes
Define semigroups, monoids and groups.
Compare their defining axioms.
Classify simple algebraic systems.
Explain the relationship between these structures.
Distinguish groups from abelian groups.
Learning Guide
Core Idea
Semigroups, monoids and groups are algebraic structures defined by progressively stronger conditions on a binary operation. A semigroup requires associativity, a monoid adds an identity element, and a group further requires every element to possess an inverse.
Worked Example
Name: Positive integers under addition
Structure: Semigroup
Explanation: Addition is closed and associative, but zero is not included as an identity.
Name: Nonnegative integers under addition
Structure: Monoid
Explanation: Zero is the identity, but positive elements do not have additive inverses within the set.
How To Study
Write the formal definition and identify every object, operation, and hypothesis.
Work through the supplied example one step at a time; explain why each step is valid.
Check the listed properties and compare the example with at least one common mistake.
Try the self-check questions without looking at the answers, then explain the reasoning aloud or in writing.
Self Check
| Question | Answer |
|---|---|
In your own words, what is semigroups, monoids and groups? | Semigroups, monoids and groups are algebraic structures defined by progressively stronger conditions on a binary operation. A semigroup requires associativity, a monoid adds an identity element, and a group further requires every element to possess an inverse. |
What definition, condition, or property should you check first when solving a problem about semigroups, monoids and groups? | Start from the formal definition and identify its hypotheses. In particular, check: Semigroup: A semigroup is a nonempty set S equipped with an associative binary operation *. |
How is semigroups, monoids and groups connected to the wider study of abstract algebra? | It belongs to Sets, operations and basic structures. It connects naturally with Binary Operations, Associativity, Identity Elements, Inverse Elements. |
Mastery Checklist
I can state the definition of semigroups, monoids and groups accurately.
I can identify the assumptions and notation used in a problem.
I can explain at least one example and justify each important step.
I can recognize a common mistake and explain why it is incorrect.
Key Properties
The concept is governed by its formal definition: Semigroups, monoids and groups are algebraic structures defined by progressively stronger conditions on a binary operation. A semigroup requires associativity, a monoid adds an identity element, and a group further requires every element to possess an inverse.
The assumptions in a theorem or definition must be checked before using the result.
Applications
Provides a foundational tool for later topics in sets, operations and basic structures.
Supports precise mathematical reasoning, proof construction and the comparison of algebraic structures.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Standard introductory abstract-algebra definitions; no specific external reference has been independently verified.