The Latent: Finite Sufficient Representations of Smooth Systems

Read full text
Authors: Tamás Nagy
Cited by: 2

Abstract

We define the Latent of a smooth system as the basis-free element of a graded Hilbert tensor algebra that completely characterizes the system's distributional, dynamic, and functional properties. Key results: 35 theorems/propositions. Maturity: Draft. Includes formal verification (Lean 4 / Platonic kernel). Part of The Latent research program. Related papers in this program: Dark Matter, Degenerate Cc, Fin Bellman, Fin Extended Bellman, Gt Latent Game Theory, Hodge Conjecture, Latent Mollification Bridge, Meta Ricci Flow Spectral Compression.

Fields of Study & Subjects

Formal Methods in Verification semigroups and automata theory Logic programming and type systems

Publication details

Publication date
18 March 2026
Language
EN