Our goals of database design with functional dependencies are:
- Dependency preservation
find a = find b, ,
In general, a functional dependency of the form α → β is trivial if β ⊆ α
if is a subset of
We shall use the notation to denote the closure of the set F, that is, the set of all functional dependencies that can be inferred given the set F. contains all of the functional dependencies in F.