Quantum / CONCEPT
Finite Word Observable Algebra
Bounded readout pullbacks form exactly the complex algebra of realized finite words.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH11
DOCUMENT LINKS1
Finite pullbacks are functions on realized words
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Cascade Completionstructural-affinity · Closed
- Family-Indexed Product Completionstructural-affinity · Closed
- Finite Observation Refinement Boundstructural-affinity · Closed
- Graded Prediction Shiftstructural-affinity · Closed
- Independent Product Completionstructural-affinity · Closed
- Least Invariant Observable Algebrastructural-affinity · Closed
- Observation-Word and Completion Information Decompositionstructural-affinity · Closed
- Predictive Sufficiency Descentstructural-affinity · Closed
- Stable Relations and Observable Algebra Closurestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance