Fourier / CONCEPT
Finite Graph Probability Lifts
Finite graph vertex laws are classified by positive-fiber anchor laws, with a unique flip-invariant lift.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
Every realizable label has one lift per anchor
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
- A Rank-Three Protocol Beyond Balanced Deletionstructural-affinity · Closed
- Binary Simple Graph Cycle Spacesstructural-affinity · Closed
- Cyclic Cayley Measure Weak Limitstructural-affinity · Closed
- Edge Connectivity and Binary Gradient Decodingstructural-affinity · Closed
- Edge Connectivity and Binary Gradient Weightstructural-affinity · Closed
- Epsilon Stopping and Pair-Evidence Completionstructural-affinity · Closed
- Exact Boolean Budgets at Low Cycle Rankstructural-affinity · Closed
- General Equivariant Escape Probabilitystructural-affinity · Closed
- ModuleCat Homology of a Binary Graph Cycle Spacestructural-affinity · Closed
- Output and State Randomness Separationstructural-affinity · Closed
- Single-Sample Law Nonimplicationstructural-affinity · Closed
- Transitive Invariant Distributionstructural-affinity · Closed
- Uniform Equivariant Escape Probabilitystructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance