Boolean Algebra Laws and Theorems

Fundamental Principles of Boolean Algebra Laws

Boolean algebra is a branch of mathematical logic and algebra that operates on binary variables and logical values. The fundamental operations involved in Boolean algebra are logical disjunction, represented as the OR form (addition), and logical conjunction, represented as the AND form (multiplication). These operations act upon the set of binary truth values, which are defined by the logical constants $0$ and $1$, where $0$ represents false or low logical state and $1$ represents true or high logical state.

Every Boolean law demonstrates a fundamental property of duality. The principle of duality establishes that any valid Boolean identity remains valid when the logical operators are interchanged between OR and AND, and the logical constants are interchanged between $0$ and $1$. Understanding both the OR form and the AND form of these algebraic laws is essential for simplifying complex digital circuits, minimizing gate counts, and manipulating logical functions.

Identity Laws in Boolean Algebra

The Identity Laws state that operating a Boolean variable with a specific identity constant leaves the original logical value of the variable unchanged.

In the OR form, performing a logical OR operation between a Boolean variable $A$ and the binary constant $0$ evaluates to the variable $A$ itself. This identity is expressed as $0 + A = A$. In this context, $0$ functions as the identity element for the OR operation because adding $0$ to any signal does not alter its state.

In the AND form, performing a logical AND operation between a Boolean variable $A$ and the binary constant $1$ yields the variable $A$ itself. This identity is expressed as $1A = A$ or $1 \times A = A$. Here, $1$ serves as the identity element for the AND operation because multiplying any signal by $1$ preserves its original logical value.

Null Laws in Boolean Algebra

The Null Laws, also referred to as the Dominance Laws or Annihilator Laws, define conditions where a fixed binary constant dominates and overrides the value of a Boolean variable.

In the OR form, performing an OR operation between a Boolean variable $A$ and the binary constant $1$ forces the result to $1$, regardless of whether $A$ is $0$ or $1$. This law is written as $1 + A = 1$. The constant $1$ dominates the OR operation.

In the AND form, performing an AND operation between a Boolean variable $A$ and the binary constant $0$ forces the output to $0$, irrespective of the value of variable $A$. This law is expressed as $0A = 0$ or $0 \times A = 0$. The constant $0$ acts as the nullifying element for the AND operation.

Idempotent Laws in Boolean Algebra

The Idempotent Laws describe the interaction of a Boolean variable with itself across logical operations. Combining duplicate inputs does not change the logical outcome or add new information.

In the OR form, performing an OR operation between variable $A$ and itself results in variable $A$. The mathematical representation is $A + A = A$. In physical circuit realization, connecting two inputs of an OR gate to the same signal $A$ produces an output identical to signal $A$

In the AND form, performing an AND operation between variable $A$ and itself results in variable $A$. The mathematical representation is $AA = A$ or $A \times A = A$. Feeding the same signal $A$ into both inputs of an AND gate yields an output equal to $A$

Inverse Laws in Boolean Algebra

The Inverse Laws, also known as the Complementarity Laws, govern the interaction between a Boolean variable and its complement or inverted state. The complement of variable $A$ is represented as $\overline{A}$ or $A'$.

In the OR form, performing an OR operation between variable $A$ and its logical complement $\overline{A}$ always yields the constant $1$. The law is expressed as $A + \overline{A} = 1$ (or written as $A + A = 1$ when denoting complementary pairs). Because one of the two inputs must always be $1$, the logical OR output is permanently true.

In the AND form, performing an AND operation between variable $A$ and its logical complement $\overline{A}$ always yields the constant $0$. The law is expressed as $A\overline{A} = 0$ or $A \times \overline{A} = 0$ (or written as $AA = 0$ when representing complementary inputs). Because one of the two inputs is guaranteed to be $0$, the logical AND output is permanently false.

Commutative Laws in Boolean Algebra

The Commutative Laws dictate that the order in which two Boolean variables are evaluated does not affect the output of the logical operation. The operands can be transposed freely across the logical operator.

In the OR form, changing the position of variables $A$ and $B$ in a logical addition statement maintains logical equivalence, expressed as $A + B = B + A$

In the AND form, changing the sequence of variables $A$ and $B$ in a logical multiplication statement yields the same logical equivalence, written as $AB = BA$ or $A \times B = B \times A$

Associative Laws in Boolean Algebra

The Associative Laws specify that when three or more Boolean variables are combined using the same logical operation, the grouping of the variables does not alter the ultimate result. Parentheses can be regrouped without affecting the logical output.

In the OR form, grouping variable $B$ and variable $C$ before performing an OR operation with variable $A$ yields the same result as grouping variable $A$ and variable $B$ before performing an OR operation with variable $C$. This is expressed mathematically as $A + (B + C) = (A + B) + C$

In the AND form, grouping variable $B$ and variable $C$ prior to ANDing with variable $A$ is logically identical to grouping variable $A$ and variable $B$ prior to ANDing with variable $C$. The expression is written as $(AB)C = A(BC)$ or $(A \times B) \times C = A \times (B \times C)$

Distributive Laws in Boolean Algebra

The Distributive Laws detail how one Boolean operation distributes across another operation contained within parentheses. Boolean algebra exhibits dual distribution, meaning AND distributes over OR, and OR distributes over AND.

In the OR form, logical addition distributes over logical multiplication. The expression $A + BC$ expands into $(A + B)(A + C)$. This unique dual distributive property allows complex logic sums to be factored into product-of-sums representations.

In the AND form, logical multiplication distributes over logical addition in a manner identical to elementary algebra. The expression $A(B + C)$ expands into $AB + AC$ or $A \times B + A \times C$

Absorption Laws in Boolean Algebra

The Absorption Laws describe specific Boolean algebraic structures where a redundant variable term is absorbed into a primary variable, simplifying the overall logical expression.

In the AND form, evaluating the expression $A(A + B)$ simplifies directly to $A$. Expanding the expression gives $AA + AB = A + AB = A(1 + B) = A(1) = A$, demonstrating that the secondary variable $B$ is fully absorbed.

In the OR form, evaluating the expression $A + AB$ simplifies directly to $A$. Factoring out variable $A$ yields $A(1 + B) = A(1) = A$. Thus, both forms allow terms containing redundant variables to be eliminated from digital logic expressions.

De Morgan's Theorems in Boolean Algebra

De Morgan's Theorems provide mathematical equivalence relations for complementing compound logical expressions, allowing conversions between AND operations and OR operations.

The first theorem addresses the negation of a logical product (AND form). The complement of a product of variables is equal to the sum of their individual complements. This is expressed as $\overline{AB} = \overline{A} + \overline{B}$ (or expressed in simplified notation as $AB = A + B$ when negations are implicitly assigned across the expression).

The second theorem addresses the negation of a logical sum (OR form). The complement of a sum of variables is equal to the product of their individual complements. This is expressed as $\overline{A + B} = \overline{A} \times \overline{B}$ (or written in concise form as $A + B = A \cdot B$).

Transpose Theorem in Boolean Algebra

The Transpose Theorem, also known as the Transposition Theorem, provides an advanced algebraic identity used to factorize or simplify sum-of-products expressions that contain complementary terms.

The theorem establishes that the sum-of-products expression $AB + \overline{A}C$ is equivalent to the product-of-sums expression $(A + C)(\overline{A} + B)$. In concise variable notation, this relation is expressed as $AB + AC = (A + C)(A + B)$, where the variables represent complementary branches across dual logical networks.

To prove this equivalence, expanding the product $(A + C)(\overline{A} + B)$ yields $A\overline{A} + AB + \overline{A}C + BC$. Applying the Inverse Law $A\overline{A} = 0$ reduces the expression to $0 + AB + \overline{A}C + BC = AB + \overline{A}C + BC$. Multiplying $BC$ by $(A + \overline{A}) = 1$ gives $AB + \overline{A}C + ABC + \overline{A}BC$. Grouping terms yields $AB(1 + C) + \overline{A}C(1 + B)$. Applying the Null Law $1 + C = 1$ and $1 + B = 1$ leaves $AB(1) + \overline{A}C(1) = AB + \overline{A}C$, completing the mathematical proof.