← 🔗 Functional Dependencies
Subtopic 5 of 5

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

  1. To check that F covers G: for every X → Y in G compute X⁺ under F and test Y ⊆ X⁺.
  2. Check both directions.
  3. Equivalent sets have the same closure F⁺ and the same candidate keys.
  4. 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.
Does F imply each FD of G? (F covers G)
A → B ✓ implied
B → C ✓ implied
A → C ✓ implied
Does G imply each FD of F? (G covers F)
A → B ✓ implied
B → C ✓ implied
F ≡ G ?yes, equivalent
F implies A->C?yes

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?

Remember: Equivalent = each covers the other, tested with closures.
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.