A scheme for congruence semidistributivity (Q4824445)

A lattice \(L\) is \(\wedge\)-semidistributive if it satisfies the following implication for all \(x,y,z\in L:\) \[ SD_{\wedge }:x\wedge y=x\wedge z\Rightarrow x\wedge (y\vee z)=x\wedge y. \] More generally, for \(n\geq 2,\) \(M\subseteq \{0,1,\dots,n-1\}\) such that \(\left| M\right| \geq 2\), let the generalized meet semidistributive law \(SD_{\wedge }(n,M)\) for lattices be defined as follows: \[ \begin{multlined} SD_{\wedge}(n,M) : \text{ for all }x,y_{0},y_{1},\dots,y_{n-1},\\ x\wedge y_{0}=x\wedge y_{1}=\dots=x\wedge y_{n-1} \Rightarrow x\wedge y_{0}=x\wedge \Bigl(\bigwedge_{I\subseteq M} \bigvee_{i\in I}y_{i}\Bigr). \end{multlined} \] In this paper a diagrammatic statement is developed for the generalized semidistributive law in case of single algebras assuming that their congruences are permutable. Without permutable congruences, a diagrammatic statement is developed for the \(\wedge\)-semidistributive law.