In wikipedia BCNF definition is as follows
A relational schema R is in Boyce–Codd normal form if and only if for every one of its dependencies X → Y, at least one of the following conditions hold:
X → Y is a trivial functional dependency (Y ⊆ X)
X is a superkey for schema R
I am wondering , why it is defined as "Superkey" instead of a "minimal Superkey".
Consider a relation schema R(A,B,C,D,E) ,let (A,B) be a key(its minimal). Then AB->CDE, holds (also no other nontrivial functional dependecies are present,as per the definition of schema, in this particular example). Also (A,B,C) is a superkey. ABC->DE also holds but its trivial. My doubt is, if we only specify the condition for minimal superkey , condition for superkey is already implied isn't it ? In all the BCNF example problem I did, to check if a schema is in BCNF. If the LHS of all non trivial functional dependencies present, is a "key". Then the schema is in BCNF. If it is holding for a key ,then its true for all the superkeys based on that key , isn't it ?