While this submission is a draft, it cannot be used by other submissions.

Proof of `Rank and density budgets for exact-image peeling` (2nd statement)

groundedproofs/Lax342547Proofs/PeelingBudget.lean · lax-342547

What this proof establishes

no assumptions

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The strict leaf mass lower bound is at least 2^(-(K+1)N) when u is at most K. Division by the retained mass therefore costs at most the stated uniform exponential density factor.