# The Equivalence Theorem: First-Class Relationships for Structurally Complete Database Systems

arXiv: https://arxiv.org/abs/2603.13603 · HTML: https://mlsanity.com/paper/2603.13603/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 6 of its 32 references that are in the map.
- First posted on arXiv 13 Mar 2026.

## Builds on (most cited first, 6 of 6)

- [Knowledge Graphs](https://mlsanity.com/paper/2003.02320/) (2020)
- [HyperGraphRAG: Retrieval-Augmented Generation via Hypergraph-Structured Knowledge Representation](https://mlsanity.com/paper/2503.21322/) (2025)
- [PG-Schema: Schemas for Property Graphs](https://mlsanity.com/paper/2211.10962/) (2022)
- [Graph Pattern Matching in GQL and SQL/PGQ](https://mlsanity.com/paper/2112.06217/) (2021)
- [GPC: A Pattern Calculus for Property Graphs](https://mlsanity.com/paper/2210.16580/) (2022)
- [Toward Better Temporal Structures for Geopolitical Events Forecasting](https://mlsanity.com/paper/2601.00430/) (2026)

## Abstract (arXiv)

We prove The Equivalence Theorem: structurally complete knowledge representation requires exactly four mutually entailing capabilities -- n-ary relationships with attributes, temporal validity, uncertainty quantification, and causal relationships between relationships -- collectively equivalent to treating relationships as first-class objects. Any system implementing one capability necessarily requires all four; any system missing one cannot achieve structural completeness. This result is constructive: we exhibit an Attributed Temporal Causal Hypergraph (ATCH) framework satisfying all four conditions simultaneously. The theorem yields a strict expressiveness hierarchy -- SQL < LPG < TypeDB < ATCH -- with witness queries that are structurally inexpressible at each lower level. We establish computational complexity bounds showing NP-completeness for general queries but polynomial-time tractability for practical query classes (acyclic patterns, bounded-depth causal chains, windowed temporal queries). As direct corollaries, we derive solutions to classical AI problems: the Frame Problem (persistence by default from temporal validity), conflict resolution (contradictions as unresolved metadata with hidden variable discovery), and common sense reasoning (defaults with causal inhibitors). A prototype PostgreSQL extension in C validates practical feasibility within the established complexity bounds.