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.

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. Inclusion test: Require two defined operations on compatible carriers and universal equality for all admissible operands on the claimed side or sides. Exclusion test: Exclude one checked numerical instance, linear approximation, multiplication of notation without closure, and the allocation principle called distributivity in other disciplines. Nearest boundary: Associativity rebrackets repeated uses of one operation; distributivity relates two different operations by expanding or factoring across the inner one. Exit condition: The identity fails when equality holds only for selected values or only on an unstated side. Common misclassifications: It is not associativity. It is not commutativity. It is not a numerical approximation. It is not established by checking a few examples. Nearest named distinctions: Associativity: Associativity changes grouping within one operation; distributivity relates two operations. Commutativity: Commutativity swaps operand order; it can collapse left/right cases but is not the distributive law. Principle of Distributivity: That social or allocation principle is not the algebraic operation identity. Linearity: Linearity combines additivity with scalar compatibility and is a specialized distributive behavior of maps.

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¶

Type the carrier and both operations.
Write left and right candidate equations separately.
Verify all expressions are defined and closed.
Prove equality for arbitrary operands or locate a counterexample.
Use commutativity only when established to merge the side conditions.
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.

Neighborhood in Abstraction Space¶

Distributivity sits in a crowded region of the domain-specific corpus (30^th 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