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

Proof of `Mass and density costs of splitting by metadata and images` (2nd statement)

groundedproofs/Lax342547Proofs/SplitTrimming.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 record count is at most 2^(a n + u N). Multiplying by the cutoff 2^(-(u+1)N) leaves the exact metadata cost 2^(a n - N).