Let R be a schema that is not in BCNF. Let α → β be the functional dependency that causes a violation of BCNF.
Prove that decomposing R into (α ∪ β) and (R − (β − α)) is lossless.