In either case, the distributive property can be described in words as:
To multiply a sum (or difference) by a factor, each summand (or minuend and subtrahend) is multiplied by this factor and the resulting products are added (or subtracted).
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:
$(a\pm b)\div c=a\div c\pm b\div c.$
In this case, left-distributivity does not apply:
$a\div (b\pm c)\neq a\div b\pm a\div c$
The distributive laws are among the axioms for rings (like the ring of integers) and fields (like the field of rational numbers). Here multiplication is distributive over addition, but addition is not distributive over multiplication. Examples of structures with two operations that are each distributive over the other are Boolean algebras such as the algebra of sets or the switching algebra.
Multiplying sums can be put into words as follows: When a sum is multiplied by a sum, multiply each summand of a sum with each summand of the other sum (keeping track of signs) then add up all of the resulting products.
ExamplesEdit
Real numbersEdit
In the following examples, the use of the distributive law on the set of real numbers $\mathbb {R}$ is illustrated. When multiplication is mentioned in elementary mathematics, it usually refers to this kind of multiplication. From the point of view of algebra, the real numbers form a field, which ensures the validity of the distributive law.
First example (mental and written multiplication)
During mental arithmetic, distributivity is often used unconsciously:
Thus, to calculate $6\cdot 16$ in one's head, one first multiplies $6\cdot 10$ and $6\cdot 6$ and add the intermediate results. Written multiplication is also based on the distributive law.
for all $l\times m$-matrices $A,B$ and $m\times n$-matrices $C,$ as well as
$A\cdot (B+C)=A\cdot B+A\cdot C$
for all $l\times m$-matrices $A$ and $m\times n$-matrices $B,C.$
Because the commutative property does not hold for matrix multiplication, the second law does not follow from the first law. In this case, they are two different laws.
For real numbers, addition distributes over the maximum operation, and also over the minimum operation:
$a+\max(b,c)=\max(a+b,a+c)\quad {\text{ and }}\quad a+\min(b,c)=\min(a+b,a+c).$
For binomial multiplication, distribution is sometimes referred to as the FOIL Method^{[2]} (First terms $ac,$ Outer $ad,$ Inner $bc,$ and Last $bd$) such as: $(a+b)\cdot (c+d)=ac+ad+bc+bd.$
In standard truth-functional propositional logic, distribution^{[3]}^{[4]} in logical proofs uses two valid rules of replacement to expand individual occurrences of certain logical connectives, within some formula, into separate applications of those connectives across subformulas of the given formula. The rules are
where "$\Leftrightarrow$", also written $\,\equiv ,\,$ is a metalogicalsymbol representing "can be replaced in a proof with" or "is logically equivalent to".
Truth functional connectivesEdit
Distributivity is a property of some logical connectives of truth-functional propositional logic. The following logical equivalences demonstrate that distributivity is a property of particular connectives. The following are truth-functional tautologies.
${\begin{alignedat}{13}&(P&&\;\land &&(Q\lor R))&&\;\Leftrightarrow \;&&((P\land Q)&&\;\lor (P\land R))&&\quad {\text{ Distribution of }}&&{\text{ conjunction }}&&{\text{ over }}&&{\text{ disjunction }}\\&(P&&\;\lor &&(Q\land R))&&\;\Leftrightarrow \;&&((P\lor Q)&&\;\land (P\lor R))&&\quad {\text{ Distribution of }}&&{\text{ disjunction }}&&{\text{ over }}&&{\text{ conjunction }}\\&(P&&\;\land &&(Q\land R))&&\;\Leftrightarrow \;&&((P\land Q)&&\;\land (P\land R))&&\quad {\text{ Distribution of }}&&{\text{ conjunction }}&&{\text{ over }}&&{\text{ conjunction }}\\&(P&&\;\lor &&(Q\lor R))&&\;\Leftrightarrow \;&&((P\lor Q)&&\;\lor (P\lor R))&&\quad {\text{ Distribution of }}&&{\text{ disjunction }}&&{\text{ over }}&&{\text{ disjunction }}\\&(P&&\to &&(Q\to R))&&\;\Leftrightarrow \;&&((P\to Q)&&\to (P\to R))&&\quad {\text{ Distribution of }}&&{\text{ implication }}&&{\text{ }}&&{\text{ }}\\&(P&&\to &&(Q\leftrightarrow R))&&\;\Leftrightarrow \;&&((P\to Q)&&\leftrightarrow (P\to R))&&\quad {\text{ Distribution of }}&&{\text{ implication }}&&{\text{ over }}&&{\text{ equivalence }}\\&(P&&\to &&(Q\land R))&&\;\Leftrightarrow \;&&((P\to Q)&&\;\land (P\to R))&&\quad {\text{ Distribution of }}&&{\text{ implication }}&&{\text{ over }}&&{\text{ conjunction }}\\&(P&&\;\lor &&(Q\leftrightarrow R))&&\;\Leftrightarrow \;&&((P\lor Q)&&\leftrightarrow (P\lor R))&&\quad {\text{ Distribution of }}&&{\text{ disjunction }}&&{\text{ over }}&&{\text{ equivalence }}\\\end{alignedat}}$
In approximate arithmetic, such as floating-point arithmetic, the distributive property of multiplication (and division) over addition may fail because of the limitations of arithmetic precision. For example, the identity $1/3+1/3+1/3=(1+1+1)/3$ fails in decimal arithmetic, regardless of the number of significant digits. Methods such as banker's rounding may help in some cases, as may increasing the precision used, but ultimately some calculation errors are inevitable.
A semiring has two binary operations, commonly denoted $\,+\,$ and $\,*,$ and requires that $\,*\,$ must distribute over $\,+.$
A ring is a semiring with additive inverses.
A lattice is another kind of algebraic structure with two binary operations, $\,\land {\text{ and }}\lor .$
If either of these operations distributes over the other (say $\,\land \,$ distributes over $\,\lor$), then the reverse also holds ($\,\lor \,$ distributes over $\,\land \,$), and the lattice is called distributive. See also Distributivity (order theory).
A Boolean algebra can be interpreted either as a special kind of ring (a Boolean ring) or a special kind of distributive lattice (a Boolean lattice). Each interpretation is responsible for different distributive laws in the Boolean algebra.
Similar structures without distributive laws are near-rings and near-fields instead of rings and division rings. The operations are usually defined to be distributive on the right but not on the left.
GeneralizationsEdit
In several mathematical areas, generalized distributivity laws are considered. This may involve the weakening of the above conditions or the extension to infinitary operations. Especially in order theory one finds numerous important variants of distributivity, some of which include infinitary operations, such as the infinite distributive law; others being defined in the presence of only one binary operation, such as the according definitions and their relations are given in the article distributivity (order theory). This also includes the notion of a completely distributive lattice.
In the presence of an ordering relation, one can also weaken the above equalities by replacing $\,=\,$ by either $\,\leq \,$ or $\,\geq .$ Naturally, this will lead to meaningful concepts only in some situations. An application of this principle is the notion of sub-distributivity as explained in the article on interval arithmetic.
In category theory, if $(S,\mu ,\nu )$ and $\left(S^{\prime },\mu ^{\prime },\nu ^{\prime }\right)$ are monads on a category $C,$ a distributive law$S.S^{\prime }\to S^{\prime }.S$ is a natural transformation$\lambda :S.S^{\prime }\to S^{\prime }.S$ such that $\left(S^{\prime },\lambda \right)$ is a lax map of monads$S\to S$ and $(S,\lambda )$ is a colax map of monads$S^{\prime }\to S^{\prime }.$ This is exactly the data needed to define a monad structure on $S^{\prime }.S$: the multiplication map is $S^{\prime }\mu .\mu ^{\prime }S^{2}.S^{\prime }\lambda S$ and the unit map is $\eta ^{\prime }S.\eta .$ See: distributive law between monads.
The ubiquitous identity that relates inverses to the binary operation in any group, namely $(xy)^{-1}=y^{-1}x^{-1},$ which is taken as an axiom in the more general context of a semigroup with involution, has sometimes been called an antidistributive property (of inversion as a unary operation).^{[5]}
In the context of a near-ring, which removes the commutativity of the additively written group and assumes only one-sided distributivity, one can speak of (two-sided) distributive elements but also of antidistributive elements. The latter reverse the order of (the non-commutative) addition; assuming a left-nearring (i.e. one which all elements distribute when multiplied on the left), then an antidistributive element $a$ reverses the order of addition when multiplied to the right: $(x+y)a=ya+xa.$^{[6]}
In the study of propositional logic and Boolean algebra, the term antidistributive law is sometimes used to denote the interchange between conjunction and disjunction when implication factors over them:^{[7]}
^Chris Brink; Wolfram Kahl; Gunther Schmidt (1997). Relational Methods in Computer Science. Springer. p. 4. ISBN 978-3-211-82971-4.
^Celestina Cotti Ferrero; Giovanni Ferrero (2002). Nearrings: Some Developments Linked to Semigroups and Groups. Kluwer Academic Publishers. pp. 62 and 67. ISBN 978-1-4613-0267-4.
^Eric C.R. Hehner (1993). A Practical Theory of Programming. Springer Science & Business Media. p. 230. ISBN 978-1-4419-8596-5.
External linksEdit
Look up distributivity in Wiktionary, the free dictionary.
A demonstration of the Distributive Law for integer arithmetic (from cut-the-knot)