ObserverMemory / CONCEPT
Finite Functional-Graph Fitting Decomposition
A finite self-map transfer decomposes into a nilpotent transient part and its periodic core.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES2
PROOF DEPTH9
DOCUMENT LINKS1
The transfer splits into transient and periodic summands
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Backward Chain And Layer Periodicitystructural-affinity · Closed
- Backward Orbit Corestructural-affinity · Closed
- Characteristic-Polynomial Saturation of Power Tracesstructural-affinity · Closed
- Diagonal Corner Reconstructionstructural-affinity · Closed
- Finite Orbit Period Boundstructural-affinity · Closed
- Finiteness Is Not Immediate Degeneracystructural-affinity · Closed
- Identity Future and Past Gapstructural-affinity · Closed
- Itinerary Completionstructural-affinity · Closed
- Itinerary First Difference Power Lawstructural-affinity · Closed
- Kernel Towers Recover Nilpotent Block Profilesstructural-affinity · Closed
- Path Limits and Canonical Transient Branchesstructural-affinity · Closed
- Path Limits and Transient Branchesstructural-affinity · Closed
- Stable Image Periodic Corestructural-affinity · Closed
- Trace and Rank Combinatoricsstructural-affinity · Closed
- Trace-Rank Jordan Recoverystructural-affinity · Closed
- Transient Observable Filterstructural-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