Boolean Algebra — Laws, Theorems & Simplification

Boolean algebra is the system used to combine and simplify true/false expressions. If you are trying to reduce a logic expression such as $AB + A\overline{B}$, the main tools are 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.

What Boolean Algebra 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$.

That changes the rules. In Boolean algebra,

$$x + x = x \quad \text{and} \quad xx = x$$

Both identities say the same thing: repeating a condition does not create a new outcome. If a switch is already on, saying "on OR on" does not change anything.

Boolean Algebra Laws You Actually Use

These are the laws that appear most often when you simplify a Boolean 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$$

Repeating the same variable does not change the expression.

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)$$

These let you reorder or regroup terms without changing the result.

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$$

These are especially useful when an expression looks longer than it really is.

De Morgan's theorems

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

These tell you how a negation moves across OR and AND. When NOT passes through parentheses, OR and AND switch roles.

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$.

Common Boolean Algebra Mistakes

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

Another mistake 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 system work.

Try a Similar Simplification

Try simplifying $(A + B)(A + \overline{B})$. If you use the laws above carefully, it collapses more than it first appears. If you want to go one step further, build a truth table and check that the simplified form matches every row.