Lax Lean Archive

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

Proof of `Sampling finite choices with a fixed supply of fair bits` (5th statement)

groundedproofs/Lax253009Proofs/FreshBitSampling.lean · lax-253009

What this proof establishes

thm✓Lax253009.FreshBitSampling (5th statement)

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

Binary interpretation is a bijection. The chosen power-of-two range is at least 12Nr, making the total modulo error at most 1/12.