Fourth Normal Form¶
A relational schema is in 4NF when every nontrivial multivalued dependency that holds on it has a superkey as its determinant.
Core Idea¶
A relational schema is in fourth normal form (4NF) when every nontrivial multivalued dependency \(X\twoheadrightarrow Y\) that holds on it has \(X\) as a superkey. The test catches redundant independent multivalued associations that functional-dependency normal forms can miss. Fagin proved 4NF is strictly stronger than BCNF and that schemata can be decomposed into 4NF without information loss.
Scope of Application¶
In Fagin's original T(EMPLOYEE, CHILD, SALARY, YEAR), Gauss's two children Gwendolyn and Greta are each paired with the salary-history facts ($40K, 1975) and ($50K, 1976). The history is repeated, but SALARY and YEAR remain a single paired fact. T has no nontrivial FDs and is in BCNF; EMPLOYEE ↠ CHILD is a nontrivial MVD with non-superkey determinant, so it is not 4NF. The two projections T1(EMPLOYEE, CHILD) and T2(EMPLOYEE, SALARY, YEAR) give two rows apiece for Gauss and join to the same four source combinations. An Employee–Skill–Language analogy works only if skills and languages likewise vary independently for every intended state.
Clarity¶
At fixed \(X\), an MVD says relevant \(Y\) choices can recombine with the remaining attributes. A dependency is trivial if \(Y\subseteq X\) or \(X\cup Y\) covers the entire schema. If teacher and textbook are actually paired for each course, splitting them into independent course lists would invent false combinations.
Manages Complexity¶
4NF turns “this table repeats combinations” into a precise superkey-and-MVD test. The formal condition itself has no universal intrinsic two-sided tradeoff: costs of query performance or cross-table constraint enforcement arise in a particular implementation, not in the truth of the 4NF predicate. A table sample cannot establish its underlying MVD by appearance alone.
Abstract Reasoning¶
Declare schema semantics and keys, establish all true MVDs, discard trivial ones, and test each determinant for superkey status. For a violation, decompose only if the MVD justifies a lossless join; check other constraints separately.
Knowledge Transfer¶
The criterion works across relational domains, but the truth of a multivalued dependency depends on each domain's facts. Its portable skeleton is a universal determinant-adequacy test; its exact tuple-swap, superkey and lossless-join machinery make it a domain-specific relational identity, not a generic prime for reducing repetition. Formal 4NF implies BCNF and the condition-level 3NF predicate, but the full live Third Normal Form body also describes violation-driven decomposition, which a 4NF schema need not undergo. With no live BCNF intermediate and no suitable strict parent, this entry is a missing-intermediate-gated unparented root.
Relationships to Other Abstractions¶
Current abstraction Fourth Normal Form Domain-specific
Foundational — no parent edges in the catalog.
Children (1) — more specific cases that build on this
-
Essential Tuple Normal Form Domain-specific is a kind of Fourth Normal Form
An ETNF schema satisfies the 4NF dependency condition, but a 4NF schema need not be ETNF.
Neighborhood in Abstraction Space¶
Fourth Normal Form sits in a sparse region of the domain-specific corpus (92nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Recursive Construction Schemes (8 abstractions)
Nearest neighbors
- Essential Tuple Normal Form — 0.84
- Second Normal Form — 0.80
- Relational Model — 0.79
- Third normal form — 0.78
- Schröder–Bernstein Property — 0.77
Computed from structural-signature embeddings · 2026-10-08