A set equipped with a single binary operation that is associative, has an identity element, and in which every element has an inverse under that operation.

Principle

A group organizes elements by closure under a binary law together with associativity, a neutral element, and two-sided invertibility, enabling solution of binary equations and symmetry operations.

Demonstration

The integers Z under addition form a group: addition is associative, 0 is the identity, and each integer n has inverse −n; this explains solvability of equations like a+x=b by x=b−a.

Misapplication

Calling a structure a group when some elements lack inverses (for example, the natural numbers under addition) or when the operation is nonassociative; such misuse hides failures of cancellation and inverse-based constructions.

Consequence

When a structure is a group, every equation a·x=b has a unique solution x=a^{-1}·b, cancellation laws hold, and one obtains a rich theory of subgroups, quotient groups, homomorphisms, and group actions.

Reversal

Removing invertibility yields a monoid (identity but not all inverses); removing identity yields a semigroup; changing associativity gives nonassociative algebraic systems like loops or quasigroups.

Boundary

Applies only to sets with a single associative binary operation and two-sided inverses for every element; excludes multi-operator structures where the group axioms hold only for a subset, nonassociative magmas, and partial operations.

Semantic Tension

Group vs Abelian group: a group may be noncommutative; group vs monoid: a group requires inverses; group vs groupoid: a group has a single object or global composition domain while a groupoid allows many objects and partial composition.

Synthesis

A group is the algebraic structure in which an associative binary law, an identity, and universal invertibility combine to make solutions to binary equations and to formalize symmetry and reversible transformations.