Quantum / CONCEPT
Stationary Gram Rank
A finite occupation recurrence bounds the nullity of a normalized positive semidefinite matrix.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES3
PROOF DEPTH3
DOCUMENT LINKS1
The finite-box rank bound
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
- Bounded Time Slicesstructural-affinity · Closed
- Capacity Box One-Bit Rigiditystructural-affinity · Closed
- Charged Polynomial Fock Irreducibilitystructural-affinity · Closed
- Head Occupation Gram Constructionstructural-affinity · Closed
- Occupancy Word Sectorsstructural-affinity · Closed
- Physical Gram Necessitystructural-affinity · Closed
- Physical Residual Memoriesstructural-affinity · Closed
- Rectangular Polynomial Nullitystructural-affinity · Closed
- Sequential Register Circuitstructural-affinity · Closed
- Stationary Occupation Attainmentstructural-affinity · Closed
- The 5040 time slice and its uniform Fisher lawstructural-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