In relational database theory, Armstrong’s Axioms are a set of three fundamental rules that describe the logical behavior of functional dependencies. These axioms are both sound and complete, meaning every valid functional dependency can be derived using them.
Armstrong’s Axioms are used to:
Derive new functional dependencies from existing ones.
Compute attribute closure.
Verify whether a dependency logically follows from a given set.
Support normalization and candidate key discovery.
The Three Basic Armstrong’s Axioms
Reflexivity Rule
If:
Y \subseteq X \Rightarrow X \to Y
then any set of attributes functionally determines its own subsets.
These are called trivial functional dependencies.
Example
If:
X = {A, B}
Y = {A}
then:
{A, B} → {A}
holds because {A} is a subset of {A, B}.
Augmentation Rule
If:
X \to Y \Rightarrow XZ \to YZ
for any attribute set Z.
This means adding the same attributes to both sides of a functional dependency preserves validity.
Example
If:
A → B
then:
{A, C} → {B, C}
also holds.
Transitivity Rule
If:
X \to Y ; \text{and} ; Y \to Z \Rightarrow X \to Z
then dependencies can be chained together.
Example
If:
A → B
B → C
then:
A → C
follows by transitivity.
Derived Rules from Armstrong’s Axioms
Using the three basic axioms, several additional useful rules can be derived.
Union Rule
If:
X \to Y ; \text{and} ; X \to Z \Rightarrow X \to YZ
then the same determinant can determine the union of attributes.
Example
If:
A → B
A → C
then:
A → BC
Decomposition Rule
If:
X \to YZ \Rightarrow X \to Y ; \text{and} ; X \to Z
then a dependency can be split into smaller dependencies.
Example
If:
A → BC
then:
A → B
A → C
Pseudotransitivity Rule
If:
X \to Y ; \text{and} ; YZ \to W \Rightarrow XZ \to W
then transitivity can be extended using additional attributes.
Example Idea
If:
A → B
BC → D
then:
AC → D
because A determines B, and together with C, it determines D.
Why Armstrong’s Axioms Matter?
Armstrong’s Axioms form the mathematical foundation of relational database theory.
They are heavily used in:
Functional dependency analysis
Attribute closure computation
Candidate key discovery
Canonical cover computation
Normalization (2NF, 3NF, BCNF)
For beginners, these axioms provide a systematic way to reason about how attributes depend on one another in a database schema.
How Armstrong’s Axioms Help in Database Design
They:
Allow derivation of all implied functional dependencies.
Help check whether a dependency logically follows from a given set.
Support normalization algorithms.
Provide the basis for dependency reasoning and schema refinement.
Summary
Armstrong’s Axioms in DBMS are three basic inference rules—Reflexivity, Augmentation, and Transitivity—that govern functional dependencies. From these axioms, other derived rules such as Union, Decomposition, and Pseudotransitivity can also be obtained. These rules are essential for closure computation, candidate key discovery, dependency analysis, and normalization in relational database design.