Search results
Results From The WOW.Com Content Network
If the operation outside the parentheses (in this case, the multiplication) is commutative, then left-distributivity implies right-distributivity and vice versa, and one talks simply of distributivity. One example of an operation that is "only" right-distributive is division, which is not commutative: =.
such that one of these properties suffices to define distributivity for lattices. Typical examples of distributive lattice are totally ordered sets, Boolean algebras, and Heyting algebras. Every finite distributive lattice is isomorphic to a lattice of sets, ordered by inclusion (Birkhoff's representation theorem).
Finally distributivity entails several other pleasant properties. For example, an element of a distributive lattice is meet-prime if and only if it is meet-irreducible, though the latter is in general a weaker property. By duality, the same is true for join-prime and join-irreducible elements. [7]
For example, the following is an equivalent law that avoids the use of choice functions [citation needed]. For any set S of sets, we define the set S # to be the set of all subsets X of the complete lattice that have non-empty intersection with all members of S. We then can define complete distributivity via the statement
Now applying the distributivity of the geometric version of the dot product gives ... For example: [10] [11] Mechanical work is the dot product of force and ...
For example, the position and the linear momentum in the -direction of a particle are represented by the operators and , respectively (where is the reduced Planck constant). This is the same example except for the constant − i ℏ {\displaystyle -i\hbar } , so again the operators do not commute and the physical meaning is that the position ...
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet).
To investigate the left distributivity of set subtraction over unions or intersections, consider how the sets involved in (both of) De Morgan's laws are all related: () = = () always holds (the equalities on the left and right are De Morgan's laws) but equality is not guaranteed in general (that is, the containment might be strict).