Magma → Semigroup → Monoid
Build structures by adding axioms
We build algebraic structures by stacking axioms: each level adds a property to the previous one. This produces the magma hierarchy (notes p.124-126, slides Chapter 8 Example 1.7-1.10).
Magma (Def 1.6):
- A set with a binary operation (closure).
- Just: .
Semigroup (Def 1.7): a magma + associativity:
(You can regroup without changing the result.)
Monoid (Def 1.8): a semigroup + an identity element :
Each level inherits everything from the level below. So every monoid is a semigroup; every semigroup is a magma. The arrows in a theory graph go "upward" — adding axioms.
Examples:
- is a monoid with identity 0. (Not a group because subtraction can leave .)
- is a monoid with identity 1.
- String concatenation is a monoid with empty string as identity.
Theory graph direction (notes p.196): arrows go from the GENERAL (magma) at the TOP to the SPECIFIC (ring) at the BOTTOM, with each arrow ADDING an axiom. So Magma → Semigroup → Monoid → Group → AbelGroup → Ring.
- 0.0sAlgebraic Structures Hierarchy
- 1.1sSix nodes: magma, semigroup, monoid, group, abelian, ring.
- 2.9sArrow magma -> semigroup: add closure.
- 4.0sArrow semigroup -> monoid: add associativity.
- 5.2sArrow monoid -> group: add identity.
- 6.3sArrow group -> abelian: add inverses.
- 7.5sArrow abelian -> ring: add commutativity.
- 8.7sRing is highlighted as the richest structure.
- 9.3sEach structure adds exactly one property.