Distributivity: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
m (typo)
imported>Richard Pinch
m (→‎Examples: link)
Line 19: Line 19:
** In [[set theory]], [[intersection]] distributes over [[union]] and union distributes over intersection;
** In [[set theory]], [[intersection]] distributes over [[union]] and union distributes over intersection;
** In [[propositional logic]], [[conjunction]] (logical and) distributes over [[disjunction]] (logical or)  and disjunction distributes over conjunction;
** In [[propositional logic]], [[conjunction]] (logical and) distributes over [[disjunction]] (logical or)  and disjunction distributes over conjunction;
** In a [[Boolean algebra]], [[join]] distributes over [[meet]] and meet distributes over join.
** In a [[distributive lattice]], [[join]] distributes over [[meet]] and meet distributes over join.

Revision as of 13:31, 30 November 2008

In algebra, distributivity is a property of two binary operations which generalises the relationship between addition and multiplication in elementary algebra known as "multiplying out". For these elementary operations it is also known as the distributive law, expressed as

Formally, let and be binary operations on a set X. We say that left distributes over , or is left distributive, if

and right distributes over , or is right distributive, if

The laws are of course equivalent if the operation is commutative.

Examples