A ternary term m(x,y,z) in the language of a variety satisfying the identities m(x,x,y)=y and m(x,y,y)=x; the existence of such a term characterizes varieties whose congruences permute (Mal'cev varieties).

Principle

A single ternary operation with the two defining identities provides a syntactic witness that any two congruences commute under relational composition, because the term mediates switches between equivalent representatives.

Demonstration

In the variety of groups one can take m(x,y,z)=x y^{-1} z; indeed m(x,x,y)=x x^{-1} y=y and m(x,y,y)=x y^{-1} y=x, and group congruences (normal subgroups) permute accordingly.

Misapplication

Assuming a binary operation with similar-looking identities suffices, or assuming the mere existence of a binary commutator implies a Maltsev term; both miss the specific ternary identities required to force congruence permutability.

Consequence

If a variety admits a Maltsev term then congruences permute and many structural results follow: equations simplify, certain decomposition theorems hold, and congruence identities become tractable.

Reversal

Absence of any Maltsev term indicates the variety may exhibit nonpermutable congruences and more complicated congruence lattices; the inverse property is the presence of a term witnessing nonpermutability (e.g., Day terms in distributive contexts).

Boundary

The notion presupposes a variety (an equational class) and terms in its language; it does not apply to arbitrary relational structures or to statements about permutability definable only semantically without term operations.

Semantic Tension

Related concepts include 'Mal'cev variety' (the global class property) and 'Maltsev operation' as a specific term; tension arises with other term conditions (e.g., congruence distributivity or modularity) that give different commutation behaviors.

Synthesis

A Maltsev term is a ternary symbolic operation satisfying two involutive identities whose presence is the algebraic certificate that congruences in the variety permute, yielding group-like congruence behavior.