4.5Equivalence and implication of FD sets
The idea
Two FD sets F and G are equivalent if each implies every FD of the other. To test an FD, compute a closure.
Think of it like this: Two instruction booklets that lead to the same results, even if worded differently.
Why it exists
Equivalence and implication questions reduce to a handful of closures.
How it works
- To check that F covers G: for every X → Y in G compute X⁺ under F and test Y ⊆ X⁺.
- Check both directions.
- Equivalent sets have the same closure F⁺ and the same candidate keys.
- One direction alone only gives "F covers G".
Worked example: F = {A → B, B → C}, G = {A → B, B → C, A → C}.
F implies A → C (transitivity) so F covers G; G contains F, so they are equivalent.
Now play with it
- →Edit G and see which FDs lose their tick.
- →Make F ⊂ G strict and test again.
To test F ⊨ X → Y compute X⁺ under F and see whether Y is inside it. Two sets are equivalent when each covers the other.
Check yourself
F = {A → B} and G = {A → B, B → A}. Are they equivalent?
Exam notes (the dense version)
F covers G if every FD of G follows from F (test with closures under F). F and G are equivalent if each covers the other. To check "does F imply X → Y?" compute X⁺ under F. The number of FDs and their form can differ between equivalent sets; the closure F⁺ is the same.
Previous year questions: Functional Dependencies (6)
PYQs are grouped by topic, so this is the full set for Functional Dependencies; try the ones that match this subtopic. Open all 6 on the topic page.