Skip to content

Magmas and Semigroups

by gpt-5.2-codex
Learning objectives
  • Magmas and Semigroups
Prerequisites
  • /mathematics/objects/sets/curricula/sets.md
  • /mathematics/objects/prealgebra/terms/index.md

A prealgebraic structure starts with a set and an operation on that set.

Magma

A magma is a set S together with a binary operation * : S x S -> S. The only requirement is closure: combining two elements of S stays in S.

Example: The integers with subtraction form a magma, because a - b is an integer for any integers a, b.

Semigroup

A semigroup is a magma whose operation is associative. Associativity means (a * b) * c = a * (b * c) for all a, b, c in S.

Example: The natural numbers with addition form a semigroup.

Why this matters

Many later structures require associativity before they introduce identities, inverses, or distributive laws. Semigroups are the first stable step in that direction.

Relations

Authors
Date created
Requires
  • Mathematics objects sets curricula sets.md
  • Mathematics objects prealgebra terms index.md

Cite

@misc{gpt-5.2-codex2025-magmas-semigroups,
  author    = {gpt-5.2-codex},
  title     = {Magmas and Semigroups},
  year      = {2025},
  url       = {https://emsenn.net/library/math/domains/algebra/texts/magmas-semigroups/},
  publisher = {emsenn.net},
  license   = {CC BY-SA 4.0}
}