Answers are grounded in this paper and cite their sources.
Experimental evaluation demonstrates multivector representation of relational tables using closed-form bivector energy, indicating superior numerical precision over standard matrix methods.
Description / Abstract Part I of this work read a matrix as a network of Clifford multivectors and built phase-rotor solvers on that reading. This note asks whether the same mental model extends to the foundational object of modern data systems: the relational table. We establish the geometric ontology: Columns are basis generators (e₁, , ed). Rows are grade-1 multivectors in a Euclidean C(d, 0) Clifford algebra. Schemas are blades. Rather than asserting theoretical equivalence, we implement and empirically measure the consequences of this representation. Key Findings & Measured Results Row vs. Column Geometry (Dual vs. Primal): Which generator family is wedged decides the contraction index. The geometric product of two rows yields the classical linear kernel (xᵢ · xⱼ), providing sample–sample structure (n × n). Conversely, the product of two columns provides the feature–feature correlations (d × d) required by the normal equations. Closed-Form Bivector Energy: The total pairwise bivector energy computed in O(n² d²) has an exact closed form: E_ = 1/2 [ (tr\,G)² - GF² ] where G = X XT (or XT X). This equals the second elementary symmetric polynomial of the covariance spectrum, reducing computation to O(n d²). It is invariant to whether rows or columns are wedged, and the normalized column-wedge ratio is shown to equal PR - 1 (where PR is the participation ratio). Rectangular SVD vs. Gram Squaring: The natural "avoid squaring the condition number" route initially showed a 50--96% reconstruction error. Diagnosing this revealed a missing rectangular exact solver (rather than a flaw in the principle). Introducing direct rectangular QR reduction (solve_rectangular) resolved this, achieving machine precision (< 10⁻¹⁰) and outperforming the Gram route by three orders of magnitude on ill-conditioned features (3.3 × 10⁻⁹ vs. 1.1 × 10⁻⁶ residual). Subspace-Coupled Joint Diagonalization (Heterogeneous JADE): When multiple tables share only a subset of columns, they form a family of matrices sharing only a subset of generator axes. We formulate Subspace-Coupled JADE: a shared axis pair receives a single rotation angle computed and applied only to matrices observing both axes at their local indices. We demonstrate that the alternative—padding into a single ambient space—artificially fabricates energy on unmeasured axes. Architecture & Tabular Geometry We argue for a two-layer architecture: Discrete Layer: Relational semantics, key lookups, and schemas are rigorously maintained within a functorial data model. Geometric Layer: Clifford multivector geometry operates directly on the numeric feature substrate. Practical capabilities enabled by this geometry include: Dual/Primal Dispatch: Automatic routing based on table aspect ratio (n d vs. $d > n$). Missingness by Subspace Projectors: Robust pairwise deletion preserving multivector norms. Label-Free Domain Transfer: Orthogonal Procrustes rotor alignment across shared subspaces. Directed-Flow Diagnostics: Temporal circulation statistics utilizing bivector orientation rather than magnitude.
No takes yet. Share an insight, caveat, or question.
Artiom Kovnatsky (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: