joinsemidistributivity

Join-semidistributivity is a property found in certain algebraic structures, particularly lattices and related ordered algebraic structures. It describes a specific interaction between two fundamental operations, often denoted as join (or supremum, often symbolized by '∨') and meet (or infimum, often symbolized by '∧').

In a lattice, join-semidistributivity states that for any elements a, b, and c, the expression a ∨ (b ∧ c) is related to (a ∨ b) ∧ (a ∨ c) in a particular way. Specifically, if a lattice is join-semidistributive, then for all a, b, c, it holds that a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c). This is the dual of the distributive law, which states a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c).

Many important algebraic structures exhibit join-semidistributivity. For example, distributive lattices are both join-semidistributive and meet-semidistributive (and thus distributive in the usual sense). However, there are lattices that are join-semidistributive but not meet-semidistributive, and vice versa. These structures are important for understanding the nuances of order and operations within algebraic systems. The property has implications in areas like theoretical computer science, logic, and abstract algebra.