Combinatorics / CONCEPT
SupplierGraph
The necessary finite typed-walk and real flow interface is a licensed source transplant from elazarg/multitubes at commit 20d22aa7ca67f9843e5adf9edf173403a2f4033a. The original proof source is identified in the Lean license notice. These helpers are consumed by the real layered local-law theorem; no new mathematical novelty is attributed to the supplier.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS0
length concat
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
- Finite Farkas Alternativesstructural-affinity · Closed
- Finite occurrence cycles yield a natural epoch potentialstructural-affinity · Closed
- LayeredFlowstructural-affinity · Closed
- Original coordinates of a passing native image modestructural-affinity · Closed
- PositiveCircuitSupplierstructural-affinity · Closed
- Refuting the binary detection threshold conjecturestructural-affinity · Closed
- SupplierDualstructural-affinity · Closed
- The labelled circle action and balanced negative incidencestructural-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