File size: 2,197 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
import OAI.Probability.SATComputability.DeletionMean
import OAI.Probability.SATComputability.DyadicBlocks

namespace OAI

namespace FixedClauseThreshold.Computability

open DilutedSpinGlass MeasureTheory
open scoped BigOperators

theorem sixth_fifth_power_le_sum (d : β„•) :
    (d : ℝ)^(6/5 : ℝ) ≀
      (6/5 : ℝ) * βˆ‘ j ∈ Finset.range d, ((j : ℝ)+1)^(1/5 : ℝ) := by
  have hm : MonotoneOn (fun x : ℝ => x^(1/5 : ℝ)) (Set.Icc 0 (0+(d : ℝ))) := by
    intro x hx y _ hxy
    exact Real.rpow_le_rpow hx.1 hxy (by norm_num)
  have h := hm.integral_le_sum
  simp only [zero_add, Nat.cast_add, Nat.cast_one] at h
  rw [integral_rpow (Or.inl (by norm_num : (-1 : ℝ) < 1/5))] at h
  norm_num at h
  nlinarith

theorem finite_fractional_moment {Ξ© : Type*} [Fintype Ξ©] (P : FiniteLaw Ξ©)
    (f : Ξ© β†’ ℝ) (hf : βˆ€ Ο‰, 0 ≀ f Ο‰) :
    P.expect (fun Ο‰ => (f Ο‰)^(1/5 : ℝ)) ≀ (P.expect f)^(1/5 : ℝ) := by
  exact (Real.concaveOn_rpow (by norm_num : (0 : ℝ) ≀ 1/5)
    (by norm_num : (1/5 : ℝ) ≀ 1)).le_map_sum
      (fun Ο‰ _ => P.nonneg Ο‰) P.total (fun Ο‰ _ => hf Ο‰)

theorem reverse_interval_sum (A B : β„•) (hAB : A ≀ B) (f : β„• β†’ ℝ) :
    (βˆ‘ t ∈ Finset.Ico A B, f (B-t)) =
      βˆ‘ j ∈ Finset.range (B-A), f (j+1) := by
  rw [Finset.sum_Ico_eq_sum_range, ← Finset.sum_range_reflect]
  apply Finset.sum_congr rfl
  intro j hj
  congr 1
  have hj' := Finset.mem_range.mp hj
  omega

theorem discrete_delay_moment {A B M : β„•} (hAB : A ≀ B) (hBM : B ≀ M) :
    ((B-A : β„•) : ℝ)^(6/5 : ℝ) ≀ (6/5 : ℝ) *
      βˆ‘ t ∈ Finset.range M,
        if A ≀ t ∧ t < B then ((B-t : β„•) : ℝ)^(1/5 : ℝ) else 0 := by
  have he : (βˆ‘ t ∈ Finset.range M,
      if A ≀ t ∧ t < B then ((B-t : β„•) : ℝ)^(1/5 : ℝ) else 0) =
      βˆ‘ t ∈ Finset.Ico A B, ((B-t : β„•) : ℝ)^(1/5 : ℝ) := by
    rw [← Finset.sum_filter]
    congr 1
    ext t
    simp only [Finset.mem_filter, Finset.mem_range, Finset.mem_Ico]
    omega
  rw [he, reverse_interval_sum A B hAB (fun j => (j : ℝ)^(1/5 : ℝ))]
  simpa only [Nat.cast_add, Nat.cast_one] using sixth_fifth_power_le_sum (B-A)

end FixedClauseThreshold.Computability

end OAI