Download data/lean/OAI/Combinatorics/LowSpaceSubsetSum/Counting/ExactWordDraw.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.36 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/LowSpaceSubsetSum/Counting/ExactWordDraw.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/LowSpaceSubsetSum/Counting/ExactWordDraw.lean
-
curl -L -o ExactWordDraw.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/LowSpaceSubsetSum/Counting/ExactWordDraw.lean
4.36 kB
| import OAI.Combinatorics.LowSpaceSubsetSum.Counting.RejectionSamplerCoupling | |
| namespace OAI | |
| /-! # Exact power-of-two draws from fair machine words | |
| These projections discard high bits, so their law is exactly uniform. | |
| The rejection sampler's independent eligible backup is absent from the | |
| bounded execution and can be integrated out without changing its law. | |
| -/ | |
| noncomputable section | |
| namespace LowSpaceSubsetSum.ExactWordDraw | |
| def low (w k : β) (x : Fin (2^w)) : Fin (2^k) := | |
| β¨x.val % 2^k, Nat.mod_lt _ (by positivity)β© | |
| def wordSplit (w k : β) (hk : k β€ w) : | |
| Fin (2^w) β Fin (2^k) Γ Fin (2^(w-k)) := | |
| (finCongr (by rw [β pow_add, Nat.sub_add_cancel hk])).trans | |
| ((finProdFinEquiv (m := 2^(w-k)) (n := 2^k)).symm.trans (Equiv.prodComm _ _)) | |
| theorem wordSplit_low (w k : β) (hk : k β€ w) (x : Fin (2^w)) : | |
| (wordSplit w k hk x).1 = low w k x := by | |
| apply Fin.ext | |
| rfl | |
| def tupleSplit (w k : β) (hk : k β€ w) (N : β) : | |
| (Fin N β Fin (2^w)) β (Fin N β Fin (2^k)) Γ (Fin N β Fin (2^(w-k))) where | |
| toFun f := (fun i => (wordSplit w k hk (f i)).1, fun i => (wordSplit w k hk (f i)).2) | |
| invFun p i := (wordSplit w k hk).symm (p.1 i, p.2 i) | |
| left_inv f := by | |
| funext i | |
| exact (wordSplit w k hk).symm_apply_apply (f i) | |
| right_inv p := by | |
| apply Prod.ext | |
| Β· funext i | |
| exact congrArg Prod.fst ((wordSplit w k hk).apply_symm_apply (p.1 i, p.2 i)) | |
| Β· funext i | |
| exact congrArg Prod.snd ((wordSplit w k hk).apply_symm_apply (p.1 i, p.2 i)) | |
| theorem uniform_tuple (w k : β) (hk : k β€ w) (N : β) | |
| (P : (Fin N β Fin (2^k)) β Prop) : | |
| (FiniteLaw.uniform : FiniteLaw (Fin N β Fin (2^w))).probability | |
| (fun f => P (fun i => low w k (f i))) = | |
| (FiniteLaw.uniform : FiniteLaw (Fin N β Fin (2^k))).probability P := by | |
| rw [FiniteLaw.uniform_probability, FiniteLaw.uniform_probability] | |
| have he := finiteUniformProbability_equiv (tupleSplit w k hk N) (fun p => P p.1) | |
| have hfun (f : Fin N β Fin (2^w)) : | |
| (tupleSplit w k hk N f).1 = fun i => low w k (f i) := by | |
| funext i | |
| exact wordSplit_low w k hk (f i) | |
| simpa only [hfun] using he.trans (finiteUniformProbability_fst P) | |
| private theorem uniform_projection {Ξ© Ξ¨ : Type} [Fintype Ξ©] [Fintype Ξ¨] | |
| [Nonempty Ξ©] [Nonempty Ξ¨] (P : Ξ© β Prop) : | |
| (FiniteLaw.uniform : FiniteLaw (Ξ© Γ Ξ¨)).probability (fun s => P s.1) = | |
| (FiniteLaw.uniform : FiniteLaw Ξ©).probability P := by | |
| rw [FiniteLaw.uniform_probability, FiniteLaw.uniform_probability] | |
| exact finiteUniformProbability_fst P | |
| theorem firstAccept_no_backup {Ξ© : Type} [Fintype Ξ©] [Nonempty Ξ©] | |
| (A : Ξ© β Prop) [DecidablePred A] [Nonempty {a : Ξ© // A a}] | |
| (N : β) (P : Option {a : Ξ© // A a} β Prop) : | |
| (firstAcceptCoupling A N).law.probability | |
| (fun s => P ((firstAcceptCoupling A N).bounded s)) = | |
| (FiniteLaw.uniform : FiniteLaw (Fin N β Ξ©)).probability | |
| (fun f => P (firstAcceptSubtype A N f)) := by | |
| change (FiniteLaw.uniform : FiniteLaw ((Fin N β Ξ©) Γ {a : Ξ© // A a})).probability | |
| (fun s => P (firstAcceptSubtype A N s.1)) = _ | |
| exact uniform_projection (Ξ¨ := {a : Ξ© // A a}) (fun f => P (firstAcceptSubtype A N f)) | |
| theorem firstAccept_words (w k : β) (hk : k β€ w) | |
| (A : Fin (2^k) β Prop) [DecidablePred A] [Nonempty {a : Fin (2^k) // A a}] | |
| (N : β) (P : Option {a : Fin (2^k) // A a} β Prop) : | |
| (firstAcceptCoupling A N).law.probability | |
| (fun s => P ((firstAcceptCoupling A N).bounded s)) = | |
| (FiniteLaw.uniform : FiniteLaw (Fin N β Fin (2^w))).probability | |
| (fun f => P (firstAcceptSubtype A N (fun i => low w k (f i)))) := by | |
| rw [firstAccept_no_backup] | |
| exact (uniform_tuple w k hk N (fun f => P (firstAcceptSubtype A N f))).symm | |
| /-- Full candidate observations may include the test and read counters. -/ | |
| theorem candidates_words (w k : β) (hk : k β€ w) | |
| (A : Fin (2^k) β Prop) [DecidablePred A] [Nonempty {a : Fin (2^k) // A a}] | |
| (N : β) (P : (Fin N β Fin (2^k)) β Prop) : | |
| (firstAcceptCoupling A N).law.probability (fun s => P s.1) = | |
| (FiniteLaw.uniform : FiniteLaw (Fin N β Fin (2^w))).probability | |
| (fun f => P (fun i => low w k (f i))) := by | |
| exact (uniform_projection (Ξ¨ := {a : Fin (2^k) // A a}) P).trans | |
| (uniform_tuple w k hk N P).symm | |
| end LowSpaceSubsetSum.ExactWordDraw | |
| end | |
| end OAI | |