The decision process of determining whether two words in the generators of a presented algebraic structure represent the same element in the quotient defined by the relations; equivalently, deciding whether a given word represents the identity.

Principle

Reduce words using defining relations to a canonical or normal form when possible, or apply decision procedures (rewriting systems, Knuth–Bendix, Todd–Coxeter, group-specific algorithms) that either yield equality or certify inequivalence; decidability depends on the class of presentations.

Demonstration

In a free group on generators a and b, the word problem reduces by cancelling adjacent inverse pairs: to decide if aba^{-1}b^{-1} equals the identity, systematically cancel aa^{-1} and bb^{-1} until no cancellations remain, concluding identity if the empty word is reached.

Misapplication

Treating syntactic equality (literally identical symbol sequences) as group equality without reducing relations, or assuming decidability for arbitrary finitely presented groups — many presentations yield undecidable word problems in general.

Consequence

A correct decision procedure either provides an algorithm to compute normal forms and thus solve equality queries, or establishes undecidability in the class; solvable word problems permit effective computation in the quotient, such as membership checks and homomorphism testing.

Reversal

Contrast with the conjugacy problem (deciding whether two elements are conjugate) or the isomorphism problem (deciding isomorphism of presented structures); reversing the question swaps equality under relations for equivalence under a different relation type.

Boundary

Scope limited by the class of algebraic structures and presentations: free groups, finite groups, and many special classes have decidable word problems; arbitrary finitely presented groups may have undecidable word problems; computational resources and termination are practical limits.

Semantic Tension

Word problem versus identity of formal languages or syntactic equality: the word problem is semantic (equality in the quotient given relations), whereas syntactic identity ignores relations; it also competes conceptually with conjugacy and membership problems as central decision tasks in algebra.

Synthesis

Word problem solving reduces the question of equality under defining relations to algorithmic reduction to normal forms or application of decision procedures; it is the fundamental algorithmic test of equality in presented algebraic systems, whose solvability depends on both algebraic class and chosen computational method.