Skip to content

Distributivity

A universal compatibility law between two operations, equating action on a combined operand with the combination of separate actions, with distinct left and right forms when order matters.

Version
v1 · 2026-09-28 · History
Domain-specific #
9022
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Abstract Algebra → Mathematics

Core Idea

Distributivity specifies how one operation passes through another. The familiar arithmetic law expands multiplication across addition, but the abstraction applies to any typed operations for which the two sides are defined and universally equal.

In noncommutative systems, operand position matters: left-distributive and right-distributive laws must be stated separately. Logical conjunction and disjunction can distribute mutually, while other operation pairs fail. One example can illustrate the law but cannot establish its universal scope.

How would you explain it like I'm…

Share It With Every Part

You have 3 party bags, and each bag has 2 candies and 1 sticker. You can count what is in one bag and multiply by 3, or count all the candies and all the stickers separately; either way you get the same total. That 'share it out to each part' rule is distributivity, and it does not work for every pair of math actions.

The Spreading-Out Rule

Distributivity is a rule about how two math operations work together. For example, 3 × (2 + 1) equals 3 × 2 + 3 × 1: the multiplying 'spreads out' over each part of the adding. This works for every choice of numbers, not just this one. But not every pair of operations has this rule; addition doesn't spread over multiplication, for example, since 3 + (2 × 1) is not the same as (3 + 2) × (3 + 1). And showing it works for one example isn't enough to prove it always works.

One Operation Through Another

Distributivity describes how one operation passes through another. The familiar case is multiplication over addition: a × (b + c) = a × b + a × c for all numbers a, b, c. The idea applies beyond numbers to any operations where both sides make sense and are always equal. When order matters (the operations aren't commutative, as with matrix multiplication), you must check separately whether it distributes from the left, a × (b + c), or from the right, (b + c) × a. In logic, AND distributes over OR and OR also distributes over AND, but many pairs of operations don't distribute at all. A single example can illustrate the rule but can't prove it holds in general.

 

Distributivity is a law relating two operations: an operation * distributes over an operation + when a * (b + c) = (a * b) + (a * c) holds universally for all typed elements for which both sides are defined. The arithmetic case, multiplication over addition, is the familiar instance, but the abstraction applies to any compatible pair of operations. In noncommutative settings operand position matters, so left distributivity, as above, and right distributivity, (b + c) * a = (b * a) + (c * a), are distinct properties that must each be stated and verified. Some pairs distribute mutually, as conjunction and disjunction do in Boolean logic, while many others fail; addition, for instance, does not distribute over multiplication in ordinary arithmetic. Because it is a universal equation, a single worked example can illustrate but never establish the law; it requires proof over the whole domain.

Structural Signature

Sig role-phrases:

  • Carrier set — Provides elements on which both operations are closed. It is carrier. Counterfactual: Cross-typed actions require a separately typed distributive law.
  • Inner operation + — Combines two terms before the outer operation acts. It is operand structure. Counterfactual: Changing the inner operation changes the law under test.
  • **Outer operation *** — Acts on the combined term and is compared with repeated action. It is operator. Counterfactual: A unary map requires the homomorphism formulation instead.
  • Left law — Requires x(y+z)=xy+x*z. It is identity. Counterfactual: It does not imply the right law without extra symmetry.
  • Right law — Requires (y+z)x=yx+z*x. It is identity. Counterfactual: Noncommutative examples can satisfy only one side.
  • Equality semantics — Fixes algebraic, logical, or semantic equivalence under which both expressions agree. It is validity. Counterfactual: Approximate numerical resemblance is not an algebraic law.

What It Is Not

  • It is not associativity.
  • It is not commutativity.
  • It is not a numerical approximation.
  • It is not established by checking a few examples.
  • Closest near-miss. Associativity rebrackets repeated uses of one operation; distributivity relates two different operations by expanding or factoring across the inner one.

Scope of Application

  • Algebraic structures. Defines rings, semirings, lattices, and related systems.
  • Symbolic manipulation. Justifies expansion, factoring, and normalization.
  • Logic. Relates conjunction and disjunction under a semantic system.
  • Linear maps. Expresses preservation of addition and scalar combinations.
  • Computing. Supports program transformations when operational side conditions also hold.

Clarity

Name carrier types, operations, operand order, equality notion, and quantification domain. Prove the relevant side universally or provide a counterexample; do not infer right distributivity from left without commutativity or another theorem.

Manages Complexity

The relation compresses many local expansions into one algebraic compatibility law. It reveals which expressions can be transformed without changing value and which assumptions—closure, side, type, and equality—are load-bearing.

Abstract Reasoning

  1. Type the carrier and both operations.
  2. Write left and right candidate equations separately.
  3. Verify all expressions are defined and closed.
  4. Prove equality for arbitrary operands or locate a counterexample.
  5. Use commutativity only when established to merge the side conditions.
  6. Track numerical or operational consequences separately from formal equality.

Knowledge Transfer

The transferable cargo is homomorphic interaction between composition rules. It transfers across algebra and logic when types and equality are preserved; it stops at metaphorical distribution of resources or one-case arithmetic coincidence.

Examples

Applied / In Practice

Matrix multiplication distributes on both sides over matrix addition even though multiplication is generally noncommutative.

Mapped back: carrier → matrices; outer → multiplication; inner → addition.

Applied / In Practice

In classical Boolean algebra, conjunction distributes over disjunction and disjunction distributes over conjunction.

Mapped back: operations → and/or; equivalence → truth-functional.

Applied / In Practice

Integer exponentiation does not distribute over addition: (a+b)^2 generally differs from a2+b2.

Mapped back: outer → squaring; law → fails.

Structural Tensions

T1 — Compact Factored Form versus Expanded Form. The two forms are equal yet expose different computational and conceptual structure.

Diagnostic: Which representation supports the next operation?

T2 — One-Sided Validity versus Two-Sided Assumption. Noncommutativity makes left and right laws independent.

Diagnostic: Which operand position is being distributed?

T3 — Formal Identity versus Implementation Cost. Algebraic equivalence does not guarantee equal numerical stability or evaluation expense.

Diagnostic: Is the task symbolic validity or computational choice?

Structural–Framed Character

Distributivity is hybrid: structurally an operation-compatibility identity and framed by the algebraic carrier, side convention, and equality semantics.

Structural Core vs. Domain Accent

The core is an outer operation preserving combination in one argument. Algebra supplies binary operations, closure, universal identities, commutativity, rings, semirings, lattices, Boolean laws, expansion, and factoring.

  • Approved root. Principle of Distributivity is a lexical near-match with a different allocation sense, so the frozen root is retained.

  • Related — associative law, commutative law, homomorphism, semiring, lattice, Boolean algebra, and bilinearity. These supply neighboring laws and stronger forms.

Neighborhood in Abstraction Space

Distributivity sits in a crowded region of the domain-specific corpus (30th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Formal Systems & Discrete Structures (18 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Associativity. Tell: Associativity changes grouping within one operation; distributivity relates two operations.
  • Commutativity. Tell: Commutativity swaps operand order; it can collapse left/right cases but is not the distributive law.
  • Principle of Distributivity. Tell: That social or allocation principle is not the algebraic operation identity.
  • Linearity. Tell: Linearity combines additivity with scalar compatibility and is a specialized distributive behavior of maps.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Distributive_property (revision 1369824603).
  • Preserved source candidate: http://mathonline.wikidot.com/distributivity-of-binary-operations
  • Preserved source candidate: http://www.wtamu.edu/academic/anns/mps/math/mathlab/beg_algebra/beg_alg_tut28_multpoly.htm
  • Preserved source candidate: https://archive.org/details/relationalmethod00jips
  • Preserved source candidate: https://archive.org/details/relationalmethod00jips/page/n16
  • Preserved source candidate: http://www.cut-the-knot.org/Curriculum/Arithmetic/DistributiveLaw.shtml

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.