The Associative, Commutative and Distributive Laws

The associative, commutative and distributive laws are three of the most important structural rules in algebra. They explain how expressions may be grouped, reordered, expanded and simplified without changing their mathematical value. These laws are used throughout arithmetic, algebra, factorisation, equation solving and mathematical proof.

Associative Law

The associative law describes how terms may be grouped when the same operation is repeated. If an operation is associative, changing the placement of the brackets does not change the final value of the expression.

For addition:

a + (b + c) = (a + b) + c

For example:

1 + (2 + 3) = (1 + 2) + 3

The associative law also applies to multiplication:

a × (b × c) = (a × b) × c

For example:

2 × (3 × 4) = (2 × 3) × 4

Subtraction is not associative because changing the grouping can change the result.

a − (b − c) ≠ (a − b) − c

For example:

1 − (2 − 3) ≠ (1 − 2) − 3

Commutative Law

The commutative law describes operations where the order of the terms may be changed without changing the result. If an operation is commutative, the operands can be swapped and the expression keeps the same value.

For addition:

a + b = b + a

For example:

4 + 7 = 7 + 4

Multiplication is also commutative:

a × b = b × a

For example:

5 × 8 = 8 × 5

Subtraction is not commutative because reversing the order usually gives a different result.

a − b ≠ b − a

For example:

9 − 2 ≠ 2 − 9

Distributive Law

The distributive law explains how multiplication works across addition or subtraction inside brackets. A factor outside a bracket may be applied to each term inside the bracket.

Multiplication distributes over addition:

a(b + c) = ab + ac

For example:

3(4 + 5) = 3 × 4 + 3 × 5

Multiplication also distributes over subtraction:

a(b − c) = ab − ac

For example:

6(8 − 3) = 6 × 8 − 6 × 3

Addition does not distribute over multiplication. In general:

a + (bc) ≠ (a + b)(a + c)

For example:

3 + (4 × 5) ≠ (3 + 4)(3 + 5)

These laws are essential because they determine which algebraic transformations are valid. The associative law controls grouping, the commutative law controls order, and the distributive law controls expansion across brackets. Together, they form a foundation for simplifying expressions, solving equations and constructing algebraic proofs.

Popular posts from this blog

A Geometric Way to Visualise sin(x + y) and cos(x + y)

Image
The angle–addition identities for sine and cosine often appear as algebraic formulas, but they can also be understood by combining two right triangles in a simple geometric construction. The calculations for the side lengths follow directly from the definitions of sine and cosine. sin(x + y) = sin x cos y + cos x sin y cos(x + y) = cos x cos y − sin x sin y Start with a right triangle of angle y and hypotenuse 1. From basic trigonometry, its horizontal and vertical sides are: cos y and sin y. Next, attach a second right triangle with angle x . Its hypotenuse is the side of length cos y from the first triangle, so its adjacent and opposite sides become: adjacent = cos x · cos y opposite = sin x · cos y Likewise, if the first triangle's vertical side sin y is used as a hypotenuse in a similar way, it contributes: adjacent = cos x · sin y opposite = sin x · sin y When the horizontal components are combined, they give the expression for cos(x + y...
Read more

The Method of Differences — A Clean Proof of the Sum of Cubes

The Method of Differences — A Clean Proof of the Sum of Cubes The method of differences is a remarkably elegant tool for evaluating finite sums. When each term of a series can be written in the form f(r+1) − f(r) , the sum “collapses” — all interior terms cancel, leaving only a boundary expression. This behaviour is called a telescoping sum . 1) Telescoping Sums Assume the general term u r can be written as: u r = f(r+1) − f(r). Then the finite sum from r = 1 to r = n becomes: Σ u r = Σ ( f(r+1) − f(r) ). To see what happens, write out a few terms: u₁ = f(2) − f(1) u₂ = f(3) − f(2) u₃ = f(4) − f(3) ⋮ uₙ = f(n+1) − f(n) When these are added, everything cancels except the first and last pieces: Σ u r = f(n+1) − f(1). This is the essence of the method: interior structure disappears, leaving just the difference between the final and initial states. 2) A Classic Application — The Sum of Cubes We will use this technique to prove the well-known ...
Read more

2×2 Orthogonal Matrix Mastery — A Generalised Construction

Image
2×2 Orthogonal Matrix Mastery — A Generalised Construction Orthogonal matrices in two dimensions reveal one of the cleanest structures in linear algebra. A 2×2 matrix is orthogonal when its columns (and rows) satisfy two conditions: They are perpendicular (their dot product is zero); They have unit length (their magnitude is one). This article presents a clear generalisation: any pair of perpendicular vectors with equal magnitude can be normalised to form an orthogonal matrix. 1. Begin with two perpendicular vectors Let the first vector be: (a, b) A perpendicular vector can be chosen as: (−b, a) Their dot products confirm orthogonality: (a, b) · (−b, a) = −ab + ab = 0 (a, −b) · (b, a) = ab − ab = 0 2. Compute their shared magnitude Both vectors have the same length: |(a, b)| = √(a² + b²) We can therefore normalise each one by dividing by √(a² + b²). 3. Form the matrix using the normalised vectors Place the two normalised vectors...
Read more