A binary operation * on a set satisfies the medial (or entropic) law if for all elements a,b,c,d one has (a*b)*(c*d) = (a*c)*(b*d). This identity forces a pairwise interchangeability in double products and is central to the structure theory of medial quasigroups and semigroups.

Principle

The law prescribes that mixing of two independent binary products can be reordered by exchanging middle terms: the operation behaves affinely in each factor so that pairwise pairings commute at the level of pairs rather than individual factors.

Demonstration

Simple demonstration: in any abelian group with operation + the medial law holds because (a+b)+(c+d) = (a+c)+(b+d) by associativity and commutativity; this shows abelian groups (and their affine images) provide canonical medial examples.

Misapplication

Assuming the medial law implies full commutativity or associativity of the underlying operation is incorrect; one can have nonassociative medial quasigroups, so using mediality to reorder arbitrary parenthesizations or to deduce elementwise commutativity is a misuse.

Consequence

Mediality leads to strong structural conclusions: many medial quasigroups are affine over abelian groups (Toyoda–Bruck type theorems), which allows linear representations, decomposition theorems, and simplification of functional equations on the structure.

Reversal

The opposite case is a non-medial operation where double products are order-sensitive and no uniform pairwise interchange holds, preventing affine-linear representations and obstructing the known classification theorems.

Boundary

Applies to binary operations on sets (semigroups, quasigroups, loops); it presumes closure and well-defined binary product and is not meaningful for n-ary operations without adaptation. It does not require existence of identity or inverses unless specified.

Semantic Tension

Tension exists with ordinary commutativity: commutativity of * implies mediality in associative settings, but mediality can hold without commutativity or associativity; thus they overlap but are distinct structural constraints.

Synthesis

The medial law is an equational constraint making double products interchangeable in a pairwise fashion; it places a structure between full commutative-associative behavior and unconstrained nonassociative operations, often allowing an affine reduction to abelian-group data.