File size: 3,848 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 74 75 76 77 78 79 | import OAI.NumberTheory.Ostmann.Arithmetic.ArithmeticPatternErrorRate
import OAI.NumberTheory.Ostmann.Arithmetic.PatternFrequencyNormSum
namespace OAI
/-! # The diagonal budget after both giant and bulk comparisons -/
namespace Ostmann
open Filter
open scoped Classical BigOperators
/-- The actual pattern sum and paired frequency sum have an absolute bulk
constant. The cutoff includes the constructed bottom reserve `2 sqrt(m)`.
The five comparison errors retain their saving after the full history count. -/
theorem arithmetic_diagonal_pattern_norm_rate (Ο : SchwartzMap β β) (n k : β)
(hk : 0 < k) (hn : n β€ k) (B Cfreq Cprior Ξ΅ : β)
(hCfreq : 0 β€ Cfreq) (hCprior : 1 β€ Cprior) (hΞ΅ : 0 < Ξ΅)
(hdepth : 8 * Cprior β€ (k : β) ^ 3) :
βαΆ L : β in atTop, let m := spectatorBulkCount k L
β D : β, 0 β€ D β§
(β q : β, q β 0 β (q : β) β€ Real.exp (2 * Cfreq * m) β
(q.divisors.card : β) β€ D) β§
β (S : Finset β€) (N V : β) (Ξ err : β),
(S.card : β) β€ Real.exp (Cfreq * m) β
(β s β S, s β 0 β§ s.natAbs β€ N) β
(N : β) β€ Real.exp (Cfreq * m) β
(V : β) β€ Real.exp (Ξ + Real.sqrt (4 * m)) β
0 β€ err β err β€ Real.exp (-Real.exp ((125 / 100000 : β) * L)) +
4 * Real.exp (-Real.exp ((2 / 1000 : β) * L)) β
let _ := sampleSetoidFintype (Bool Γ MovingSampleIndex n)
let K := ((SchwartzMap.seminorm β 0 0 Ο / Real.sqrt (Real.exp Ξ)) ^ (2 ^ n) *
B ^ (2 ^ n - 1)) ^ 2 *
((2 : β) ^ (2 ^ n * m) * 4 * 3 ^ (2 ^ n * m)) * 2 ^ (2 ^ n * m)
β R : Setoid (Bool Γ MovingSampleIndex n) β FrequencyTree (S Γ S) n β β,
(β s t, βR s tβ β€
((2 : β) ^ Fintype.card (Quotient s) *
(Real.exp (Cprior * L)) ^ (4 * n * 2 ^ n - Fintype.card (Quotient s))) *
(err + K * (frequencyLeafWeight (pairedFrequencyLeaf S V) n t *
((frequencySplitList S n t).map (pairFrequencySupportBound D)).prod))) β
ββ s, β t, R s tβ β€
Real.exp ((2 ^ n : β) * Ξ + (Real.log 12 + 1) * (2 ^ n : β) * m + Ξ΅ * m) +
5 * Real.exp (-Real.exp ((12 / 10000 : β) * L)) := by
filter_upwards [arithmetic_prime_pattern_budget_rate Ο n k hk hn B Cfreq Cprior Ξ΅
hCfreq hCprior hΞ΅ hdepth,
movingPattern_five_errors_rate n k hk Cprior Cfreq hCprior hCfreq]
with L hbudget herrors
dsimp only
obtain β¨D, hD, hdiv, hbudgetβ© := hbudget
refine β¨D, hD, hdiv, ?_β©
intro S N V Ξ err hcard hS hN hV herr herrbound R hR
have hdivN : β q : β, q β 0 β q β€ N ^ 2 β (q.divisors.card : β) β€ D := by
intro q hq hqN
apply hdiv q hq
calc
(q : β) β€ (N : β) ^ 2 := by exact_mod_cast hqN
_ β€ (Real.exp (Cfreq * spectatorBulkCount k L)) ^ 2 :=
pow_le_pow_leftβ (Nat.cast_nonneg N) hN 2
_ = Real.exp (2 * Cfreq * spectatorBulkCount k L) := by
rw [β Real.exp_nat_mul]
congr 1
ring
have hsum := pattern_frequency_norm_sum_le S n N V D (Real.exp (Cprior * L))
(((SchwartzMap.seminorm β 0 0 Ο / Real.sqrt (Real.exp Ξ)) ^ (2 ^ n) *
B ^ (2 ^ n - 1)) ^ 2 *
((2 : β) ^ (2 ^ n * spectatorBulkCount k L) * 4 * 3 ^ (2 ^ n * spectatorBulkCount k L)) *
2 ^ (2 ^ n * spectatorBulkCount k L)) err hD (Real.exp_nonneg _) (by positivity)
herr hS hdivN R hR
have hcost := hbudget N V Ξ hN hV
have he := (mul_le_mul_of_nonneg_left herrbound
(show 0 β€ ((2 : β) ^ ((4 * n * 2 ^ n) ^ 2) *
(max 2 (Real.exp (Cprior * L))) ^ (4 * n * 2 ^ n)) *
(Fintype.card (FrequencyTree (S Γ S) n) : β) by positivity)).trans (herrors S hcard)
apply hsum.trans
nlinarith only [hcost, he]
end Ostmann
end OAI
|