claimroutineinferred_dep
Expected harmonic rank drop per level
Expected harmonic rank drop per level is at most
per-level cost summed over the depth
Statement (paper)
With , for every one has , and consequently the unconditional bound holds.
In plain English
With the drop in harmonic rank at level , one has . Taking expectations gives .
Why it's here
This is the per-level cost estimate: the block-kernel lemma limits how much rank can be lost at a generic level, and the nongeneric indicator accounts for the exceptional case. The fresh-isomorphism claim gives , which turns the conditional bound into the uniform per level. Summing over levels then shows the rank survives with good probability in the next claim.
Classified routine:
A per-level expected-cost calculation that combines the block-kernel lemma (rank loss at generic levels) with the genericity bound from the preceding claim. It is bookkeeping inside the proof of the full-lift detection proposition.
Uses
Used by
Sources
PaperOpen
- Section
- §3.4 Linear lifts and loss of rank
- Page
- —
- Label
—- Line
sections/02-latent.tex:579
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Expected harmonic rank drop per level" rests on lem:latent-block-kernel
- infoinferred_depoutline: "Expected harmonic rank drop per level" rests on claim-prop-latent-full-lift-detection-1