Skip to content

Algebraic Structure & Composition Laws

Primes about the axioms that govern how operations compose, covering associativity, commutativity, closure, identity elements, and the algebraic hierarchy from semigroup to monoid to group, illustrated by set union.

8 primes in this family — primes that sit near one another in abstraction space (k-means over structural-signature embeddings). Each is shown with its short description.

  • Associativity — Grouping does not affect result.
  • Closure — Ensures operations remain within a set.
  • Commutativity — Order of inputs does not affect output.
  • Group — A set with an associative operation, identity, and inverses — reversible composable transformations.
  • Identity Element — A distinguished input leaves every compatible element unchanged under a stated operation, supplying the do-nothing case that makes empty composition possible.
  • Monoid — Equip a set with one closed associative binary operation and a two-sided identity, creating the exact algebraic tier whose neutral element makes empty products and folds well-defined while still withholding inverses.
  • Semigroup — The minimal algebraic species — a set with one closed, associative binary operation and nothing more — whose lone axiom certifies that any finite product is parenthesization-independent, so a sequential reduction can be split, reassociated, and run in parallel without changing the answer.
  • Union — The elements belonging to at least one of several collections — everything that is in any of them.