The smallest congruence relation on an algebra that contains a specified pair or set of elements; equivalently the congruence generated by those elements under reflexivity, symmetry, transitivity and compatibility with the algebraic operations.

Principle

Form the least equivalence relation compatible with every operation which identifies the chosen generators; closure under the algebra's operations produces the principal congruence.

Demonstration

In a group, the principal congruence generated by the pair (a,b) is the kernel of the homomorphism that sends a to b, equivalently the normal subgroup generated by a b^{-1}. For a universal algebra, one constructs the congruence as the transitive, compatible closure of the set {(a,b)}.

Misapplication

Treating the principal congruence as merely the equivalence closure of a pair without enforcing compatibility with operations can produce relations that are not congruences and that fail to descend to well-defined quotient algebras.

Consequence

Identifying the principal congruence yields the canonical quotient in which the specified elements become equal; it is the basic building block for kernels of homomorphisms and for describing generated congruences.

Reversal

The trivial congruence (only identical pairs) and the universal congruence (all pairs) bound the extremes; inverting the generation process yields the notion of maximal congruences that avoid identifying a given pair.

Boundary

Applies in algebraic structures where congruences (equivalence relations compatible with operations) are defined; it does not directly apply to plain relational structures without algebraic operations or to constructions that require additional closure conditions (e.g., topological closures).

Semantic Tension

Nearby notions include ‘equivalence closure’ (ignores operation compatibility) and ‘congruence lattice generated by a set’ (a global, multi-generator perspective); principal congruence is the minimal congruence generated by a specific pair or finite set.

Synthesis

A principal congruence is the minimal, operation-compatible equivalence relation produced by forcing specified elements to be equal, and it characterizes the smallest quotient algebra realizing that identification.