Boolean Algebra — Laws, Theorems & Simplification

Reduce a logic expression like $AB + A\overline{B}$ and the whole answer turns out to be just $A$. Boolean algebra is the system that lets you make that kind of collapse safely, using laws like complement, distributive, absorption, and De Morgan's theorems.

In one common notation, $x + y$ means OR, $xy$ means AND, and $\overline{x}$ means NOT $x$. Some books write NOT as $x'$, but the underlying rules are the same.

The Laws And What Each Symbol Means

Ordinary algebra works with numbers. Boolean algebra works with statements or binary variables that can take only two values: true/false or $1/0$. Here are the laws that appear most often when you simplify an expression.

Identity laws

$$x + 0 = x, \qquad x \cdot 1 = x$$

Adding false changes nothing, and AND with true changes nothing.

Null laws

$$x + 1 = 1, \qquad x \cdot 0 = 0$$

If an OR already contains true, the whole result is true. If an AND contains false, the whole result is false.

Idempotent laws

$$x + x = x, \qquad x \cdot x = x$$

Complement laws

$$x + \overline{x} = 1, \qquad x \cdot \overline{x} = 0$$

A variable and its opposite cover every case in OR, but never overlap in AND.

Commutative and associative laws

$$x + y = y + x, \qquad xy = yx$$ $$(x + y) + z = x + (y + z), \qquad (xy)z = x(yz)$$

Distributive laws

$$x(y + z) = xy + xz$$ $$x + yz = (x + y)(x + z)$$

The second form often feels less familiar, but it is a standard Boolean identity and shows up in factoring.

Absorption laws

$$x + xy = x, \qquad x(x + y) = x$$

De Morgan's theorems

$$\overline{x + y} = \overline{x}\,\overline{y}, \qquad \overline{xy} = \overline{x} + \overline{y}$$

When NOT passes through parentheses, OR and AND switch roles.

Why These Laws Hold: The Two-Value Reason

Every Boolean law is true for one reason: each variable can only be $0$ or $1$, so you can check a law by testing both cases.

Take the idempotent law $x + x = x$. If $x = 1$, then $1 + 1 = 1$ (OR of true with true is true). If $x = 0$, then $0 + 0 = 0$. Both cases match $x$, so the law holds. This is also why $x + x = 2x$ from ordinary algebra is meaningless here: there is no "$2$" in a system with only two values.

The same two-case reasoning explains the complement law. Whatever $x$ is, exactly one of $x$ and $\overline{x}$ equals $1$. So $x + \overline{x}$ always contains a true term, giving $1$, while $x \cdot \overline{x}$ always contains a false term, giving $0$. Once you see that a law is just an exhaustive check over $0$ and $1$, the whole table stops feeling like memorization.

Worked Example: Simplify $AB + A\overline{B}$

Start with

$$F = AB + A\overline{B}$$

Factor out the shared $A$:

$$F = A(B + \overline{B})$$

Now use the complement law:

$$F = A \cdot 1$$

Then use the identity law:

$$F = A$$

So $AB + A\overline{B} = A$. Intuitively, if $A = 1$, then either $B = 1$ or $\overline{B} = 1$, so one term must be true. If $A = 0$, both terms are false. The whole expression depends only on $A$.

Practice: Try It Yourself

Simplify $(A + B)(A + \overline{B})$ using the laws above. Expect it to collapse more than it first appears.

Check your work: distribute to get $AA + A\overline{B} + BA + B\overline{B}$. Then $AA = A$, $B\overline{B} = 0$, and the rest factors back down. The result simplifies to $A$. You can confirm it by building a truth table and checking that the simplified form matches every row.

Watch These Traps When Simplifying

One common trap is importing ordinary algebra habits. For example, $x + x = 2x$ is not a Boolean rule; the correct result is $x$.

Another trap is applying a law without checking the notation. In many texts, $+$ means OR, not arithmetic addition, and writing variables next to each other means AND.

Students also misuse De Morgan's theorems by negating each variable but forgetting to switch OR and AND. Both parts matter.

Where Boolean Algebra Is Used

Boolean algebra is central in digital logic, where variables represent on/off or true/false states. It is used to simplify circuit designs, write cleaner logical conditions in software, and reason about search filters or database queries.

If the variables are not binary or the operations are ordinary arithmetic, Boolean laws do not apply directly. The two-value setting is the condition that makes the whole system work.