Induct through heavy entropy-decreasing choices, retaining raw moment at least tau^t after t steps. The raw moment of each new set multiplies by k times its marginal probability, hence by at least tau since k≥1. If every admissible set above the final moment floor remained expensive, r steps would force negative entropy. Conditioning invariants supply the bounded costs and exact mass of the resulting sparse set.