A Universal Axiom for Embedded Systems
Any subsystem S embedded within a total system T can characterize T only up to isomorphism of its accessible fragment — never the whole.
Let C be a category, S a proper full subcategory, and T an object not in S. The Yoneda Constraint states:
The restricted presheaf Hom(—, T)|_S determines T|_S up to isomorphism, but does not determine T up to isomorphism in C.
Compressed:
d is at runtime if and only if d depends on information outside the subsystem's Yoneda image.
In plain language: An embedded observer knows its world through its relationships. The Yoneda lemma guarantees these relationships determine the observer. They do not determine the world.
| Domain | System T | Subsystem S | What S Can't Access | Name |
|---|---|---|---|---|
| Physics | Universe | Observer | Pre-geometric substrate | Measurement Boundary Problem |
| Logic | Arithmetic | Formal system | Godel sentences | Incompleteness Theorems |
| Category Theory | CCC | Point-surjective map | Fixed-point-free endomorphisms | SRIP / Lawvere |
| Epistemology | Reality | Embedded observer | Epistemic remainder | Embedded Observer Constraint |
| Compilers | 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 |
Every row has the same categorical structure: a proper inclusion S into C, a restricted Yoneda presheaf, and a non-zero Kan extension deficit.
The Yoneda Constraint: A Universal Axiom for Embedded Systems
- Read Online (HTML) — with rendered math via MathJax
- Download PDF
- LaTeX Source
23 pages, 45+ references. Peer-reviewed via Gemini.
- Theorem 3.2 (Yoneda Constraint): The restricted Yoneda presheaf of a proper subsystem has non-zero Kan extension deficit.
- Theorem 8.4 (Bootstrap Paradox): No self-hosting compiler for a Turing-complete language can compile all programs using only features it can compile.
- Theorem 12.1 (Impossibility of Complete Self-Knowledge): For any system S with sufficient internal structure, there exists information about S that S cannot derive about itself.
This paper is the capstone of the YonedaAI research program:
| Paper | What It Proves | How It Connects |
|---|---|---|
| Measurement Paradox | Emergent observers can't probe pre-geometric substrate | Yoneda Constraint on measurement categories |
| Godel Meets Spacetime | Emergence incompleteness via diagonal construction | Yoneda Constraint as incompleteness |
| SRIP | Unified self-reference limitation via Lawvere | Yoneda Constraint is SRIP applied to embeddings |
| Embedded Observer | Observer's measurement algebra doesn't separate points | Yoneda Constraint on epistemic horizons |
| JAPL Bootstrap | Self-hosted compiler can only compile a subset | Yoneda Constraint on compiler self-reference |
| Minimal Runtime Axiom | Runtime = epistemic deficit of the type system | Yoneda Constraint on static analysis |
yoneda-constraint/
papers/
latex/yoneda-constraint-universal.tex # LaTeX source
pdf/yoneda-constraint-universal.pdf # Compiled PDF
reviews/
review.md # Peer review feedback
docs/
index.html # Landing page
paper.html # Readable HTML paper
og-image.png # Social media image
yoneda-constraint-universal.pdf # PDF (for web serving)
Matthew Long The YonedaAI Collaboration YonedaAI Research Collective Chicago, IL [email protected]
All rights reserved. For academic use and citation, please contact the authors.