File size: 2,926 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 | import Mathlib
import OAI.Computability.MaxCut.Model
namespace OAI
/-!
Scalar parameter selection for the v2 repetition rate.
These results concern powers of real numbers only. In particular, they do not
assert a parallel-repetition theorem for games. The exponent depends only on
the gap and the desired error; no alphabet or logical dimension occurs here.
-/
namespace MaxCutGames.Repetition
/-- The scalar rate appearing in the alphabet-independent repetition estimate. -/
noncomputable def dsRate (gap : β) : β := 1 - gap ^ 2 / 16
theorem dsRate_nonneg {gap : β} (hgapβ : 0 β€ gap) (hgapβ : gap β€ 1) :
0 β€ dsRate gap := by
dsimp [dsRate]
nlinarith
theorem dsRate_lt_one {gap : β} (hgap : 0 < gap) : dsRate gap < 1 := by
dsimp [dsRate]
nlinarith [sq_pos_of_pos hgap]
/-- A scalar contraction admits a strictly positive exponent for every positive
target error. This lemma makes no assertion about any game value. -/
theorem exists_positive_power_lt {rate error : β}
(hrateβ : 0 β€ rate) (hrateβ : rate < 1) (herror : 0 < error) :
β n : β, 1 β€ n β§ rate ^ n < error := by
have ht := tendsto_pow_atTop_nhds_zero_of_lt_one hrateβ hrateβ
obtain β¨n, hnβ© := (ht.eventually (gt_mem_nhds herror)).exists
refine β¨n + 1, Nat.succ_le_succ (Nat.zero_le n), ?_β©
calc
rate ^ (n + 1) = rate ^ n * rate := pow_succ _ _
_ β€ rate ^ n := mul_le_of_le_one_right (pow_nonneg hrateβ n) hrateβ.le
_ < error := hn
/-- Select the repetition count before choosing any alphabet. -/
theorem exists_dsRate_pow_le {gap error : β}
(hgapβ : 0 < gap) (hgapβ : gap < 1) (herror : 0 < error) :
β n : β, 1 β€ n β§ dsRate gap ^ n β€ error := by
obtain β¨n, hn, hboundβ© := exists_positive_power_lt
(dsRate_nonneg hgapβ.le hgapβ.le) (dsRate_lt_one hgapβ) herror
exact β¨n, hn, hbound.leβ©
theorem dsRate_one_div_eight_hundred :
dsRate (1 / 800) = 1 - (1 : β) / 10240000 := by
norm_num [dsRate]
theorem dsRate_one_div_fifteen :
dsRate (1 / 15) = 1 - (1 : β) / 3600 := by
norm_num [dsRate]
/-- The final soundness exponent depends only on `error`, even when the later
construction chooses its alphabet after this exponent. -/
theorem exists_final_repetition_count {error : β} (herror : 0 < error) :
β n : β, 1 β€ n β§ (1 - (1 : β) / 10240000) ^ n β€ error := by
simpa only [dsRate_one_div_eight_hundred] using
exists_dsRate_pow_le (gap := (1 / 800 : β)) (by norm_num) (by norm_num) herror
/-- The preliminary constant-gap specialization of the same scalar rate. -/
theorem exists_preliminary_repetition_count {error : β} (herror : 0 < error) :
β n : β, 1 β€ n β§ (1 - (1 : β) / 3600) ^ n β€ error := by
simpa only [dsRate_one_div_fifteen] using
exists_dsRate_pow_le (gap := (1 / 15 : β)) (by norm_num) (by norm_num) herror
end MaxCutGames.Repetition
end OAI
|