Skip to main content

Commutative and associative laws; A+A'B = A+B

Short answer

Commutative: A+B = B+A, AB = BA. Associative: A+(B+C) = (A+B)+C, A(BC) = (AB)C. Using distributive law, A + A'B = (A+A')(A+B) = 1·(A+B) = A+B.

Describe commutative and associative laws of Boolean algebra with examples and simplify A+A'B = A+B.

Commutative laws

The order of variables in an OR or AND operation does not change the result.

  • A+B=B+AA + B = B + A
  • A⋅B=B⋅AA \cdot B = B \cdot A

Example: Aˉ+C=C+Aˉ\bar A + C = C + \bar A; with A = 1, B = 0: 1⋅0=0⋅1=01 \cdot 0 = 0 \cdot 1 = 0. In hardware, swapping the inputs of an AND or OR gate does not change its output.

Associative laws

The grouping of variables in an OR or AND operation does not change the result.

  • A+(B+C)=(A+B)+CA + (B + C) = (A + B) + C
  • A⋅(B⋅C)=(A⋅B)⋅CA \cdot (B \cdot C) = (A \cdot B) \cdot C

Example: with A = 1, B = 0, C = 1: 1⋅(0⋅1)=01 \cdot (0 \cdot 1) = 0 and (1⋅0)⋅1=0(1 \cdot 0) \cdot 1 = 0. So a 3-input AND can be built from two 2-input AND gates in any order.

Proof of A+AˉB=A+BA + \bar A B = A + B

Using the distributive law X+YZ=(X+Y)(X+Z)X + YZ = (X + Y)(X + Z):

A+AˉB=(A+Aˉ)(A+B)=1⋅(A+B)=A+B\begin{aligned} A + \bar A B &= (A + \bar A)(A + B) \\ &= 1 \cdot (A + B) \\ &= A + B \end{aligned}

Truth-table check:

ABAˉB\bar A BA+AˉBA + \bar A BA+BA + B
00000
01111
10011
11011

✓ Answer checked by Claude Opus 5.5 (high effort)

All Digital Logic chapter 2 questions →