Download data/lean/OAI/Computability/UniqueGames/Analysis/DyadicError.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.23 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/UniqueGames/Analysis/DyadicError.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/UniqueGames/Analysis/DyadicError.lean
-
curl -L -o DyadicError.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/UniqueGames/Analysis/DyadicError.lean
5.23 kB
| import Mathlib.Algebra.BigOperators.Ring.Finset | |
| import Mathlib.Algebra.Order.BigOperators.Ring.Finset | |
| import Mathlib.Basic.Real.Basic | |
| import Mathlib.Tactic.Linarith | |
| import Mathlib.Tactic.NormNum | |
| import Mathlib.Tactic.Ring | |
| namespace OAI | |
| section | |
| noncomputable section | |
| open scoped BigOperators | |
| namespace UniqueGamesTheorem.Appendix.DyadicError | |
| private theorem pow_le_one_aux (q : β) (hq0 : 0 β€ q) (hq1 : q β€ 1) (n : β) : | |
| q^n β€ 1 := by | |
| induction n with | |
| | zero => simp | |
| | succ n ih => | |
| rw [pow_succ] | |
| exact (mul_le_mul_of_nonneg_right ih hq0).trans (by simpa using hq1) | |
| private theorem pow_antitone_aux (q : β) (hq0 : 0 β€ q) (hq1 : q β€ 1) | |
| (a b : β) (hab : a β€ b) : q^b β€ q^a := by | |
| have hb : a + (b-a) = b := | |
| (Nat.add_comm a (b-a)).trans (Nat.sub_add_cancel hab) | |
| calc | |
| q^b = q^(a+(b-a)) := congrArg (fun n : β => q^n) hb.symm | |
| _ = q^a * q^(b-a) := by rw [pow_add] | |
| _ β€ q^a * 1 := mul_le_mul_of_nonneg_left | |
| (pow_le_one_aux q hq0 hq1 (b-a)) (pow_nonneg hq0 a) | |
| _ = q^a := mul_one _ | |
| theorem half_power_le_quarter (d n : β) (hd : 1 β€ d) : | |
| (1/2 : β)^(3*d*n) β€ (1/4 : β)^n := by | |
| have h3 : 2 β€ 3*d := le_trans (by decide : 2 β€ 3) | |
| (by simpa using Nat.mul_le_mul_left 3 hd) | |
| have hexp : 2*n β€ 3*d*n := Nat.mul_le_mul_right n h3 | |
| calc | |
| (1/2 : β)^(3*d*n) β€ (1/2 : β)^(2*n) := | |
| pow_antitone_aux (1/2) (by norm_num) (by norm_num) _ _ hexp | |
| _ = (1/4 : β)^n := by | |
| rw [pow_mul] | |
| congr 1 | |
| norm_num | |
| def quarterSum (n : β) : β := β i β Finset.range n, (1/4 : β)^i | |
| theorem quarterSum_nonneg (n : β) : 0 β€ quarterSum n := by | |
| unfold quarterSum | |
| exact Finset.sum_nonneg (fun i _ => pow_nonneg (by norm_num : (0:β)β€1/4) i) | |
| theorem quarterSum_residual (n : β) : | |
| quarterSum n + (4/3 : β)*(1/4 : β)^n = 4/3 := by | |
| induction n with | |
| | zero => norm_num [quarterSum] | |
| | succ n ih => | |
| have hstep : quarterSum (n+1) = quarterSum n + (1/4 : β)^n := by | |
| exact Finset.sum_range_succ _ _ | |
| rw [hstep, pow_succ] | |
| nlinarith | |
| theorem quarterSum_le (n : β) : quarterSum n β€ (4/3 : β) := by | |
| have hp : (0 : β) β€ (1/4 : β)^n := pow_nonneg (by norm_num) n | |
| have h := quarterSum_residual n | |
| nlinarith | |
| def quarterError (n : β) : β := | |
| β i β Finset.range n, β j β Finset.range n, | |
| if i=0 β§ j=0 then 0 else (1/4 : β)^(i+j) | |
| theorem quarterError_add_one (n : β) (hn : 0 < n) : | |
| quarterError n + 1 = (quarterSum n)^2 := by | |
| have h0 : (0 : β) β Finset.range n := Finset.mem_range.mpr hn | |
| have hpair (i j : β) : | |
| (if i=0 β§ j=0 then (0:β) else (1/4 : β)^(i+j)) + | |
| (if i=0 β§ j=0 then (1:β) else 0) = | |
| (1/4 : β)^i * (1/4 : β)^j := by | |
| by_cases hi : i=0 <;> by_cases hj : j=0 <;> simp [hi,hj,pow_add] | |
| have hsum : quarterError n + | |
| (β i β Finset.range n, β j β Finset.range n, | |
| if i=0 β§ j=0 then (1:β) else 0) = | |
| β i β Finset.range n, β j β Finset.range n, | |
| (1/4 : β)^i * (1/4 : β)^j := by | |
| unfold quarterError | |
| rw [β Finset.sum_add_distrib] | |
| apply Finset.sum_congr rfl | |
| intro i _ | |
| rw [β Finset.sum_add_distrib] | |
| apply Finset.sum_congr rfl | |
| intro j _ | |
| exact hpair i j | |
| have hinner (i : β) : | |
| (β j β Finset.range n, if i=0 β§ j=0 then (1:β) else 0) = | |
| if i=0 then 1 else 0 := by | |
| by_cases hi : i=0 | |
| Β· simp [hi,h0] | |
| Β· simp [hi] | |
| have hdelta : (β i β Finset.range n, β j β Finset.range n, | |
| if i=0 β§ j=0 then (1:β) else 0) = 1 := by | |
| simp_rw [hinner] | |
| simp [h0] | |
| have hproduct : (β i β Finset.range n, β j β Finset.range n, | |
| (1/4 : β)^i * (1/4 : β)^j) = (quarterSum n)^2 := by | |
| simp only [quarterSum,pow_two,Finset.sum_mul,Finset.mul_sum] | |
| exact Finset.sum_comm | |
| rw [hdelta,hproduct] at hsum | |
| exact hsum | |
| theorem quarterError_le_seven_ninths (n : β) (hn : 0 < n) : | |
| quarterError n β€ (7/9 : β) := by | |
| have hbound := quarterSum_le n | |
| have hnonneg := quarterSum_nonneg n | |
| have hsq := mul_le_mul hbound hbound hnonneg (by norm_num : (0:β)β€4/3) | |
| have hid := quarterError_add_one n hn | |
| nlinarith | |
| def dyadicError (d : β) : β := | |
| β i β Finset.range (d+1), β j β Finset.range (d+1), | |
| if i=0 β§ j=0 then 0 else (1/2 : β)^(3*d*(i+j)) | |
| theorem dyadicError_le_quarterError (d : β) (hd : 1 β€ d) : | |
| dyadicError d β€ quarterError (d+1) := by | |
| unfold dyadicError quarterError | |
| apply Finset.sum_le_sum | |
| intro i _ | |
| apply Finset.sum_le_sum | |
| intro j _ | |
| by_cases hzero : i=0 β§ j=0 | |
| Β· simp [hzero] | |
| Β· simp only [hzero] | |
| exact half_power_le_quarter d (i+j) hd | |
| theorem dyadicError_le_seven_ninths (d : β) (hd : 1 β€ d) : | |
| dyadicError d β€ (7/9 : β) := | |
| (dyadicError_le_quarterError d hd).trans | |
| (quarterError_le_seven_ninths (d+1) (Nat.succ_pos d)) | |
| theorem finite_dyadic_error_le_one (d : β) (hd : 1 β€ d) : | |
| (β i β Finset.range (d+1), β j β Finset.range (d+1), | |
| if i=0 β§ j=0 then 0 else (1/2 : β)^(3*d*(i+j))) β€ 1 := by | |
| change dyadicError d β€ 1 | |
| exact (dyadicError_le_seven_ninths d hd).trans (by norm_num) | |
| end UniqueGamesTheorem.Appendix.DyadicError | |
| end | |
| end | |
| end OAI | |