Boolean Algebra Laws

Boolean algebra is the mathematical system that lets us manipulate logic expressions with the same confidence we bring to ordinary algebra. Just as $2(x + 3) = 2x + 6$2(x+3)=2x+6 rewrites an arithmetic expression without changing its value, the Boolean laws let us rewrite a logic expression into an equivalent one that may be far cheaper to build. For OCR H446 you must know the standard laws — identity, null, idempotent, complement, commutative, associative, distributive and absorption — and apply them in worked manipulations, naming each law as you go.

A word of caution before we start: Boolean algebra looks like ordinary algebra but is not identical to it. Some familiar rules carry over (commutativity, associativity, one distributive law), some have a surprising extra form (OR distributes over AND — there is no arithmetic analogue of that), and some are unique to Booleans entirely (idempotency: $A + A = A$A+A=A, not $2A$2A). Treat the symbols with respect and check every instinct against the truth table.

Why this is not just paper algebra

It is tempting to see these laws as an abstract exercise, but every manipulation has a physical consequence. A Boolean expression is a blueprint for a circuit: each AND becomes an AND gate, each OR an OR gate, each overbar an inverter. When a law lets you rewrite a six-term expression as a two-term one, you have just deleted four or five physical gates from the chip. Fewer gates means a smaller die (cheaper to manufacture), less switching activity (lower power and heat), and a shorter critical path (a circuit that can be clocked faster). In a processor with billions of gates, the cumulative effect of disciplined simplification is enormous. So when you "state the law used", you are documenting an engineering decision, not performing a ritual — the algebra is the design tool that turns a correct circuit into a good one.

---

Spec Mapping

This lesson covers the algebraic-laws strand of OCR H446 section 1.4.3 (Boolean algebra):

• Knowing and applying the identity, null (annihilation), idempotent, complement (inverse), commutative, associative, distributive and absorption laws, together with double negation.
• Using these laws to manipulate and rearrange Boolean expressions, justifying each step by naming the law applied.
• Recognising that an equivalent expression with fewer terms corresponds to a circuit with fewer gates.

It builds on truth tables (used here to prove each law) and feeds directly into the De Morgan's and simplification lessons, where these laws are deployed in combination.

---

Why Learn the Laws?

• Simplify expressions so the resulting circuit uses fewer gates — cutting cost, power and propagation delay.
• Prove equivalences between expressions that look different but compute the same function.
• Transform an expression into a target form (e.g. sum of products, or NAND-only) for implementation.
• Earn exam marks: a great many 1.4.3 questions are "simplify this, stating each law used".

Every law below can be — and here mostly is — verified by a small truth table, which is what makes Boolean algebra rigorous rather than a bag of tricks.

It also helps to know how the laws are grouped before meeting them one by one. Four of them — identity, null, idempotent and complement — describe how a variable interacts with a constant or with itself/its negation; they are the workhorses that make terms disappear or collapse to a constant. Three of them — commutative, associative, distributive — are structural: they let you reorder, regroup and expand/factor without changing the function, opening up the patterns the first four can then exploit. Absorption and double negation are derived shortcuts that bundle several of the others into a single recognisable move. Holding this map in mind stops the laws feeling like an arbitrary list and tells you, in any given problem, which kind of move to reach for: structural laws to expose a pattern, constant laws to eliminate it.

---

Notation

Symbol	Meaning
$A \cdot B$A⋅B (or $AB$AB)	logical AND
$A + B$A+B	logical OR
$\overline{A}$A (or $A'$A′)	logical NOT / complement
$1$1	TRUE (logic high)
$0$0	FALSE (logic low)

We use the overbar for NOT and the dot for AND throughout — the OCR house notation.

---

Identity Laws

Combining a variable with the identity element for an operation leaves it unchanged. For AND the identity is 1; for OR it is 0:

$A \cdot 1 = A \qquad A + 0 = A$A⋅1=AA+0=A

The intuition: ANDing with 1 cannot remove the variable's effect (the output tracks A), and ORing with 0 adds nothing. For example, $(A \cdot 1) + 0 = A$(A⋅1)+0=A.

---

Null Laws (Annihilation)

Combining a variable with the annihilating element forces a constant. For AND that element is 0; for OR it is 1:

$A \cdot 0 = 0 \qquad A + 1 = 1$A⋅0=0A+1=1

If any input to an AND is permanently 0, the whole product is 0 regardless of the other inputs; if any input to an OR is permanently 1, the whole sum is 1. This is why a single stuck-at fault can dominate a circuit. The null laws are also a powerful simplification accelerator: the moment any manipulation produces an $A \cdot 0$A⋅0 or an $A + 1$A+1 anywhere in an expression, that entire sub-expression vanishes to a constant and often takes a large branch of the would-be circuit with it. Always scan for an emergent 0 inside an AND, or an emergent 1 inside an OR, after every step.

---

Idempotent Laws

Combining a variable with itself returns the same variable:

$A \cdot A = A \qquad A + A = A$A⋅A=AA+A=A

There is no arithmetic counterpart — $A + A$A+A is not $2A$2A here, because there is no 2. A direct consequence is that repeating a term is redundant: $A + A + A = A$A+A+A=A. (This is also the trick that turns one NAND or NOR into an inverter, as seen in the logic-gates lesson.) Idempotency is the law you reach for when an intermediate step duplicates a term — for instance, after multiplying out brackets you might find $A \cdot A$A⋅A or two copies of the same product; idempotency quietly merges them, keeping the expression from bloating. Beginners often miss it precisely because it does nothing dramatic on its own; its value is as the housekeeping step that lets the showier laws (complement, absorption) then fire.

---

Complement (Inverse) Laws

Combining a variable with its complement forces a constant, because exactly one of $A$A, $\overline{A}$A is 1 at any time:

$A \cdot \overline{A} = 0 \qquad A + \overline{A} = 1$A⋅A=0A+A=1

Verification: if $A = 1$A=1 then $\overline{A} = 0$A=0, so $A \cdot \overline{A} = 1 \cdot 0 = 0$A⋅A=1⋅0=0; if $A = 0$A=0 then $\overline{A} = 1$A=1, so $A \cdot \overline{A} = 0 \cdot 1 = 0$A⋅A=0⋅1=0. Either way the product is 0. The complement laws are the single most powerful simplification target — spotting an $X + \overline{X}$X+X or $X \cdot \overline{X}$X⋅X pattern usually unlocks the whole problem. The reason they are so productive is that they introduce a constant, and constants are what the identity and null laws feed on: $B + \overline{B}$B+B becomes 1, which an identity law then strips away ($A \cdot 1 = A$A⋅1=A); $B \cdot \overline{B}$B⋅B becomes 0, which a null or identity law then propagates. In nearly every multi-step simplification the decisive move is engineering a complement pair — usually by factoring with the distributive law — so that a variable can be annihilated. Train yourself to ask, at each step, "can I create an $X + \overline{X}$X+X or $X \cdot \overline{X}$X⋅X here?"

---

Double Negation Law

$\overline{\overline{A}} = A$A=A

Inverting twice returns the original value. Two inversion bubbles in series on a wire cancel — useful both algebraically and when reading circuits.

---

Commutative Laws

The order of operands does not matter:

$A \cdot B = B \cdot A \qquad A + B = B + A$A⋅B=B⋅AA+B=B+A

This matches ordinary algebra and lets you reorder terms freely to expose a pattern. It sounds trivial, but it is doing real work in a proof: when you spot that $A \cdot \overline{B} + \overline{B} \cdot C$A⋅B+B⋅C shares the factor $\overline{B}$B, you are silently using commutativity to line the factor up on the same side of each product before factoring. Physically it reflects that a two-input gate does not care which wire enters which terminal — the AND of A and B is the same component whichever way round you label the inputs.

---

Associative Laws

The grouping of operands (for a single repeated operator) does not matter:

$(A \cdot B) \cdot C = A \cdot (B \cdot C)$(A⋅B)⋅C=A⋅(B⋅C)

$(A + B) + C = A + (B + C)$(A+B)+C=A+(B+C)

So a chain of ANDs, or a chain of ORs, may be bracketed any way you like. Practically, this is what lets a hardware "3-input AND" be built from two 2-input ANDs without changing the logic — a routine necessity, because real logic families cap the fan-in of a single gate. The associative law also justifies building a wide AND or OR as a balanced tree of two-input gates: an 8-input AND can be five gates arranged in three levels (deep but each gate small) rather than one impractical 8-input device, and the choice of grouping affects the propagation delay without ever affecting the logical result. One caution worth repeating: associativity applies only when the operator is the same throughout — you cannot regroup across a mix of AND and OR; that territory belongs to precedence and the distributive law.

---

Distributive Laws

These let you expand or factor, like multiplying out brackets — but Boolean algebra has two distributive laws where arithmetic has one:

$A \cdot (B + C) = (A \cdot B) + (A \cdot C)$A⋅(B+C)=(A⋅B)+(A⋅C)

$A + (B \cdot C) = (A + B) \cdot (A + C)$A+(B⋅C)=(A+B)⋅(A+C)

The first mirrors arithmetic ($a(b+c) = ab + ac$a(b+c)=ab+ac) and is the one you will use most when factoring out a common variable to expose a complement pair. The second has no arithmetic analogue — OR distributing over AND only works in Boolean algebra, and it is the one candidates most often forget. It is the engine behind the $A + \overline{A} \cdot B = A + B$A+A⋅B=A+B identity used later, and it is the move that converts between sum-of-products and product-of-sums forms. A reliable habit: whenever you see two OR-bracketed factors that share a term, suspect the second distributive law — it usually lets you pull that shared term outside and collapse the rest with the complement law.

Expanding: $A \cdot (B + C) = (A \cdot B) + (A \cdot C)$A⋅(B+C)=(A⋅B)+(A⋅C).

Factoring: $(X \cdot Y) + (X \cdot Z) = X \cdot (Y + Z)$(X⋅Y)+(X⋅Z)=X⋅(Y+Z) — pulling out the common factor X.

---

Absorption Laws

The absorption laws remove a redundant term entirely:

$A + (A \cdot B) = A \qquad A \cdot (A + B) = A$A+(A⋅B)=AA⋅(A+B)=A

Proof of $A + (A \cdot B) = A$A+(A⋅B)=A:

A	B	$A \cdot B$A⋅B	$A + (A \cdot B)$A+(A⋅B)
0	0	0	0
0	1	0	0
1	0	0	1
1	1	1	1

The final column equals A, so the law holds. Intuitively: if A is already 1 the whole thing is 1; if A is 0 then $A \cdot B$A⋅B is 0 too — so B never affects the result.

Proof of $A \cdot (A + B) = A$A⋅(A+B)=A:

A	B	$A + B$A+B	$A \cdot (A + B)$A⋅(A+B)
0	0	0	0
0	1	1	0
1	0	1	1
1	1	1	1

Again the output column matches A. Absorption is easy to overlook in an exam yet often collapses a long expression in a single step, so train your eye to spot the $A + A\cdot B$A+A⋅B and $A \cdot (A + B)$A⋅(A+B) shapes.

---

Complete Reference Table

Law	AND form	OR form
Identity	$A \cdot 1 = A$A⋅1=A	$A + 0 = A$A+0=A
Null	$A \cdot 0 = 0$A⋅0=0	$A + 1 = 1$A+1=1
Idempotent	$A \cdot A = A$A⋅A=A	$A + A = A$A+A=A
Complement	$A \cdot \overline{A} = 0$A⋅A=0	$A + \overline{A} = 1$A+A=1
Commutative	$A \cdot B = B \cdot A$A⋅B=B⋅A	$A + B = B + A$A+B=B+A
Associative	$(A \cdot B) \cdot C = A \cdot (B \cdot C)$(A⋅B)⋅C=A⋅(B⋅C)	$(A + B) + C = A + (B + C)$(A+B)+C=A+(B+C)
Distributive	$A \cdot (B + C) = A \cdot B + A \cdot C$A⋅(B+C)=A⋅B+A⋅C	$A + (B \cdot C) = (A + B) \cdot (A + C)$A+(B⋅C)=(A+B)⋅(A+C)
Absorption	$A \cdot (A + B) = A$A⋅(A+B)=A	$A + (A \cdot B) = A$A+(A⋅B)=A
Double negation	$\overline{\overline{A}} = A$A=A	—

---

Worked Example 1: Factor, Complement, Identity

Simplify $A \cdot B + A \cdot \overline{B}$A⋅B+A⋅B.