The Yoneda Constraint

A Universal Axiom for Embedded Systems

The Universal Axiom

Any subsystem \(S\) embedded within a total system \(T\) can characterize \(T\) only up to isomorphism of its accessible fragment -- never the whole.

\(S\) knows \(T\) only through \(\mathrm{Hom}(S, T|_S, -)\), which determines \((S, T|_S)\) up to isomorphism but not \(T\) itself.

Seven Instances, One Principle

The Yoneda Constraint manifests identically across seven foundational domains. Each row is the same theorem in a different category.

Domain System \(T\) Subsystem \(S\) Inaccessible Name
Physics Universe Observer Pre-geometric substrate Measurement Boundary Problem
Logic Arithmetic Formal system Godel sentences Incompleteness
Category Theory CCC Point-surjective map Fixed-point-free endomorphisms Lawvere / SRIP
Epistemology Reality Embedded observer Epistemic remainder Embedded Observer Constraint
Compiler Theory Full language Self-hosted compiler Unsupported features Bootstrap Paradox
Type Theory Decision space Type system \(\omega\)-dependent decisions Minimal Runtime Axiom
AI Environment Agent Unmodeled dynamics Alignment Problem

Three Key Theorems

Theorem 3.2
The Yoneda Constraint

If \(\mathcal{S}\) is a proper full subcategory of \(\mathcal{C}\) and \(T \in \mathrm{Ob}(\mathcal{C}) \setminus \mathrm{Ob}(\mathcal{S})\), then the restricted presheaf \(T|_\mathcal{S}\) does not determine \(T\) up to isomorphism. The Kan extension deficit \(\Delta(\mathcal{S}, T) = \mathrm{coker}(\eta : \mathsf{y}(T) \to \mathrm{Lan}_i(\mathsf{y}(T)|_\mathcal{S}))\) is non-trivial.

Theorem 3.5
Universality via Lawvere

In any cartesian closed category with a truth-value object \(\Omega\) admitting a fixed-point-free endomorphism, the self-representation map \(\rho : A \to \Omega^A\) cannot be point-surjective. The non-image elements constitute the Yoneda deficit.

Theorem 12.1
Impossibility of Complete Self-Knowledge

For any system \(S\) with sufficient internal structure, there exists information about \(S\)-in-context that \(S\) cannot derive about itself. This strictly generalizes Godel's incompleteness to all systems with the categorical structure of a proper embedding.

"An embedded observer knows its world through its relationships. The Yoneda lemma guarantees these relationships determine the observer. They do not determine the world."