Arith / CONCEPT
Union Conditioning on One Common Regular Subtree
A uniform regular subtree obeys a height-independent lower bound for hitting an arbitrary leaf set after conditioning on a surviving prefix.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES3
PROOF DEPTH14
DOCUMENT LINKS1
A surviving prefix retains a fixed fraction of every leaf-union probability
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
- A Common Embedding for All Prefix Eventsstructural-affinity · Closed
- Actual Distortion Chains and Conditional Convex Comparisonstructural-affinity · Closed
- Actual Odd Covers Force Average Charge after a Correlated Headstructural-affinity · Closed
- Adjacent Prime-Height Profile Exchangestructural-affinity · Closed
- Arith: Arithmetic Coordinatesstructural-affinity · Closed
- Arith: Capped Gain Treesstructural-affinity · Closed
- Arith: Cylindersstructural-affinity · Closed
- Arith: Distortion Chainstructural-affinity · Closed
- Arith: Probabilitystructural-affinity · Closed
- Edge Transposition Generationstructural-affinity · Closed
- Exact Laws on Pure-Prefix Survivorsstructural-affinity · Closed
- Finite coordinate-clique avoidancestructural-affinity · Closed
- Rendezvous vector systemsstructural-affinity · Closed
- The quantum gap in hypercube rendezvousstructural-affinity · Closed
- The spectral gap of a connected Hamming-weight gate patternstructural-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