Observation / CONCEPT
Characteristic-Polynomial Saturation of Power Traces
Cayley-Hamilton bounds the recurrence depth of every matrix power trace.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS1
The first dimension-many traces determine all later traces
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Bounded Integer CRT Completenessstructural-affinity · Closed
- Finite CRT Joinstructural-affinity · Closed
- Finite Functional-Graph Fitting Decompositionstructural-affinity · Closed
- Integer Recovery And Structure Separationstructural-affinity · Closed
- Kernel Towers Recover Nilpotent Block Profilesstructural-affinity · Closed
- Power Traces Do Not Determine Similaritystructural-affinity · Closed
- Retained Residue Recovery Criterionstructural-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