claimroutineinferred_dep
Rank survives and leaf is detected
Rank survives levels with probability ≥ 1/2, then the leaf is detected
combines into the 1/4 detection bound
Statement (paper)
With , one has , hence . Conditional on any surviving rank , the independent uniform symbol in at the leaf is detected with probability , and such a detection yields some with .
In plain English
With , the expected total drop in harmonic rank over levels is at most , so the rank is still positive at depth with probability at least . Given positive rank , the leaf symbol is detected with probability , and detection gives some with .
Why it's here
Summing the per-level bound over levels gives the expected total drop, and Markov's inequality shows the rank cannot reach zero with probability above . Combining this survival probability of at least with detection probability at least at the leaf yields the lower bound in the parent proposition.
Classified routine:
Direct consequence of the preceding per-level bound : summing over levels with linearity of expectation and applying Markov's inequality, then the elementary fact that a uniform symbol is detected with probability by a rank- linear map.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §3.4 Linear lifts and loss of rank
- Page
- —
- Label
—- Line
sections/02-latent.tex:600
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Rank survives with probability half, leaf detection" rests on claim-prop-latent-full-lift-detection-2