Download data/lean/OAI/Combinatorics/ContingencyTables/Sampling/AllSmallOuter.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.24 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/ContingencyTables/Sampling/AllSmallOuter.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/ContingencyTables/Sampling/AllSmallOuter.lean
-
curl -L -o AllSmallOuter.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/ContingencyTables/Sampling/AllSmallOuter.lean
5.24 kB
| import OAI.Combinatorics.ContingencyTables.Sampling.AllSmallBoolean | |
| import OAI.Combinatorics.ContingencyTables.Sampling.AllSmallInitialization | |
| import OAI.Combinatorics.ContingencyTables.Sampling.FirstPaperInitialization | |
| import OAI.Combinatorics.ContingencyTables.Sampling.FirstPaperBinaryParameters | |
| namespace OAI | |
| /-! # Complete finite rejection sampling when the large rectangle is empty -/ | |
| namespace ContingencyTables.SmallGraphProfiles | |
| open scoped BigOperators Classical | |
| open ResidualMixture FirstSuccess FairBits CompletionCounts | |
| noncomputable section | |
| universe u | |
| variable {I J : Type u} [Fintype I] [Fintype J] [LinearOrder I] [LinearOrder J] | |
| variable (r : I β β) (c : J β β) | |
| local notation "d" => dimensionAllowance (I := I) (J := J) | |
| local notation "s" => smallProposalBits (I := I) (J := J) | |
| local instance : DecidableEq (PaperStates r c) := Classical.decEq _ | |
| /-- Each trial reads a disjoint word; failed trials use the feasible fallback. -/ | |
| def unitOuterDraw (fallback : (z : PaperStates r c) β PaperFibre r c z) | |
| (x : PaperStates r c) (n M : β) (zβ : Table r c) | |
| (bits : Fin (M*(n*s)) β Bool) : Table r c := | |
| wordRetry (fun w => stateTrial r c (unitJointDraw r c fallback x n w)) zβ M | |
| (GridBoundary.gridWordEquiv M (n*s) bits) | |
| lemma unitOuterDraw_law (fallback : (z : PaperStates r c) β PaperFibre r c z) | |
| (x : PaperStates r c) (n M : β) (zβ : Table r c) : | |
| mapLaw (uniformLaw (Ξ± := Fin (M*(n*s)) β Bool)) | |
| (unitOuterDraw r c fallback x n M zβ)= | |
| retryLaw (mapLaw (uniformLaw (Ξ± := Fin (n*s) β Bool)) | |
| (unitJointDraw r c fallback x n)) (stateTrial r c) zβ M := by | |
| unfold unitOuterDraw | |
| rw [βmap_equiv (GridBoundary.gridWordEquiv M (n*s)),uniform_equiv] | |
| change wordRetryLaw _ _ _=_ | |
| rw [wordRetryLaw_eq,βretryLaw_map] | |
| lemma unitOuterDraw_error [Nonempty I] [Nonempty J] [Nonempty (PaperStates r c)] | |
| [Nonempty (Table r c)] (hsmall : β i j,FirstPaperPhysicalMarginal.paperSmall r c i j=true) | |
| (htotal : (β i,r i)=β j,c j) | |
| (fallback : (z : PaperStates r c) β PaperFibre r c z) | |
| (x : PaperStates r c) (n M : β) (zβ : Table r c) : | |
| (variation (mapLaw (uniformLaw (Ξ± := Fin (M*(n*s)) β Bool)) | |
| (unitOuterDraw r c fallback x n M zβ)) (uniformLaw (Ξ± := Table r c)):β) β€ | |
| Real.exp (-(M:β)/(2*(1+(d:β)^2)))+ | |
| M*(((stateBound r c+1:β):β)^(2*d)*Real.exp (-(n:β)/(d:β)^160)) := by | |
| have hd : 14 β€ d := by | |
| have hi := Fintype.card_pos (Ξ± := I) | |
| have hj := Fintype.card_pos (Ξ± := J) | |
| unfold dimensionAllowance | |
| nlinarith | |
| let p := mapLaw (uniformLaw (Ξ± := Fin (n*s) β Bool)) (unitJointDraw r c fallback x n) | |
| let q := uniformLaw (Ξ± := PaperStateJoint r c) | |
| have hj := unitJointDraw_variation r c hsmall fallback x n | |
| have hr := retryLaw_variation p q (stateTrial r c) zβ M | |
| have hi : (variation (retryLaw q (stateTrial r c) zβ M) | |
| (uniformLaw (Ξ± := Table r c)):β) β€ Real.exp (-(M:β)/(2*(1+(d:β)^2))) := by | |
| apply uniform_partial_retry_exp (StateJointSuccess r c) (originalStateSuccessEquiv r c) | |
| zβ M (2*(1+(d:β)^2)) | |
| rw [paperStateJoint_card] | |
| exact stationary_success_ratio r c htotal hd | |
| have ht := variation_triangle (retryLaw p (stateTrial r c) zβ M) | |
| (retryLaw q (stateTrial r c) zβ M) (uniformLaw (Ξ± := Table r c)) | |
| rw [unitOuterDraw_law] | |
| have hrR : (variation (retryLaw p (stateTrial r c) zβ M) | |
| (retryLaw q (stateTrial r c) zβ M):β) β€ M*(variation p q:β) := by | |
| exact_mod_cast hr | |
| have htR := (Rat.cast_le (K := β)).mpr ht | |
| simp only [Rat.cast_add] at htR | |
| exact htR.trans (by nlinarith) | |
| /-- The all-small branch reaches the same requested error as the branch | |
| with a nonempty large rectangle, using no completion-sampling oracle. -/ | |
| theorem unitOuterDraw_accuracy [Nonempty I] [Nonempty J] [Nonempty (PaperStates r c)] | |
| [Nonempty (Table r c)] (hsmall : β i j,FirstPaperPhysicalMarginal.paperSmall r c i j=true) | |
| (htotal : (β i,r i)=β j,c j) (k : β) (hk : 1 β€ k) | |
| (fallback : (z : PaperStates r c) β PaperFibre r c z) | |
| (x : PaperStates r c) (zβ : Table r c) : | |
| (variation (mapLaw (uniformLaw (Ξ± := Fin (outerTrials d k*(outerSteps d (smallBinaryLength r c) k*s)) β Bool)) | |
| (unitOuterDraw r c fallback x (outerSteps d (smallBinaryLength r c) k) (outerTrials d k) zβ)) | |
| (uniformLaw (Ξ± := Table r c)):β) β€ 1/(2:β)^k := by | |
| have hd : 14 β€ d := by | |
| have hi := Fintype.card_pos (Ξ± := I) | |
| have hj := Fintype.card_pos (Ξ± := J) | |
| unfold dimensionAllowance | |
| nlinarith | |
| have he := outer_total_error d (smallBinaryLength r c) k (stateBound r c) hd | |
| (smallBinaryLength_parameters r c).2.1 hk (smallBinaryLength_parameters r c).2.2 | |
| have hv := unitOuterDraw_error r c hsmall htotal fallback x | |
| (outerSteps d (smallBinaryLength r c) k) (outerTrials d k) zβ | |
| apply hv.trans | |
| have hn : 0 β€ (outerTrials d k:β)*(outerSteps d (smallBinaryLength r c) k+1)/ | |
| (2:β)^(outerAccuracy d (smallBinaryLength r c) k) := | |
| div_nonneg (mul_nonneg (Nat.cast_nonneg _) (by | |
| exact add_nonneg (Nat.cast_nonneg _) zero_le_one)) (le_of_lt (pow_pos (by norm_num) _)) | |
| nlinarith | |
| end | |
| end ContingencyTables.SmallGraphProfiles | |
| end OAI | |