Additional Inference Rules: Union, Decomposition, Pseudotransitivity
You'll learn: How to use three powerful derived rules—Union, Decomposition, and Pseudotransitivity—to reason about functional dependencies more efficiently than using only Armstrong's axioms.
Why These Rules Matter
In the previous lesson, you learned Armstrong's axioms (Reflexivity, Augmentation, Transitivity) as the foundation for reasoning about functional dependencies. While complete, these three axioms can be tedious to apply repeatedly. Fortunately, we can derive additional inference rules that act as shortcuts, making our work faster and clearer.
The Three Derived Rules
Union Rule
If A → B and A → C, then A → BC.
Plain English: If attribute A determines B and A determines C, then A determines both B and C together. Think of it like: "If knowing your employee ID tells me your name AND your department separately, then it tells me both at once."
Decomposition Rule
If A → BC, then A → B and A → C.
Plain English: If A determines a combined set BC, you can split it into separate dependencies. This is Union's reverse. "If your student ID determines your name-and-major together, it determines each individually."
Pseudotransitivity Rule
If A → B and BC → D, then AC → D.
Plain English: A variation of transitivity where the middle step needs an extra attribute. "If employee ID determines department, and department-plus-year determines budget, then employee-ID-plus-year determines budget."
How They Help
These rules let you derive new functional dependencies without multiple applications of Armstrong's axioms. They're especially useful when normalizing databases—you can quickly determine what dependencies exist without lengthy proofs.
Key Takeaway: Union, Decomposition, and Pseudotransitivity are derived rules that streamline functional dependency reasoning, making database design analysis faster and more intuitive while remaining logically sound.