File size: 4,273 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 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 | import Mathlib
import OAI.Probability.SKBarriers.Dynamics.Crossing
namespace OAI
section
noncomputable section
open scoped BigOperators
open MeasureTheory ProbabilityTheory Filter Set
namespace SK.Analytic
structure GreedyRecord (n : β) where
refs : β β Config n
time : β
kept : Finset β
def greedyRun {n : β} (base : β β Config n)
(pick : β β (β β Config n) β β β Config n)
(x : β β Config n) (r : β β β) (b : β) (m : β) : β β GreedyRecord n
| 0 => β¨base,0,β
β©
| j+1 =>
let s := greedyRun base pick x r b m j
let w := pick j s.refs s.time
β¨Function.update s.refs j w,
if j=0 then firstCrossing (fun k => overlap w (x k)) (r j) m
else lastCrossing (fun k => overlap w (x k)) (r j) s.time,
insert j (s.kept\s.kept.filter (fun i => b < |overlap (s.refs i) w|))β©
def greedyReference {n : β} (base : β β Config n)
(pick : β β (β β Config n) β β β Config n)
(x : β β Config n) (r : β β β) (b : β) (m j : β) : Config n :=
pick j (greedyRun base pick x r b m j).refs (greedyRun base pick x r b m j).time
theorem greedyRun_predictable {n : β} (base : β β Config n)
(pick : β β (β β Config n) β β β Config n)
(x : β β Config n) (r s : β β β) (b : β) (m j : β)
(h : β i < j, r i=s i) : greedyRun base pick x r b m j=greedyRun base pick x s b m j := by
induction j with
| zero => rfl
| succ j ih =>
have hp := ih (fun i hi => h i (by omega))
simp only [greedyRun,hp,h j (by omega)]
theorem greedyReference_predictable {n : β} (base : β β Config n)
(pick : β β (β β Config n) β β β Config n)
(x : β β Config n) (r s : β β β) (b : β) (m j : β)
(h : β i < j, r i=s i) : greedyReference base pick x r b m j=greedyReference base pick x s b m j := by
unfold greedyReference
rw [greedyRun_predictable base pick x r s b m j h]
theorem greedyRun_refs {n : β} (base : β β Config n)
(pick : β β (β β Config n) β β β Config n)
(x : β β Config n) (r : β β β) (b : β) (m j i : β) (hi : i < j) :
(greedyRun base pick x r b m j).refs i=greedyReference base pick x r b m i := by
induction j with
| zero => omega
| succ j ih =>
by_cases he : i=j
Β· subst i
simp only [greedyRun,Function.update_self]
rfl
Β· simpa only [greedyRun,Function.update_of_ne he] using ih (by omega)
theorem greedyRun_range {n : β} (base : β β Config n)
(pick : β β (β β Config n) β β β Config n)
(x : β β Config n) (r : β β β) (b : β) (m j : β) :
β i β (greedyRun base pick x r b m j).kept, i < j := by
induction j with
| zero => simp [greedyRun]
| succ j ih =>
intro i hi
simp only [greedyRun,Finset.mem_insert] at hi
rcases hi with rfl | hi
Β· omega
Β· have := ih i (Finset.mem_sdiff.mp hi).1
omega
def bankPick {n : β} (pool : β β Finset (Config n)) (fallback : β β Config n)
(B : β) (x : β β Config n) (t q : β)
(j : β) (v : β β Config n) (u : β) : Config n :=
if h : β w β pool j, q β€ overlap w (x u) β§
β i, j/B*B β€ i β i < j β |overlap (v i) w| β€ 3*t
then h.choose else fallback j
theorem bankPick_mem {n : β} (pool : β β Finset (Config n)) (fallback : β β Config n)
(hf : β j, fallback j β pool j) (B : β) (x : β β Config n) (t q : β)
(j : β) (v : β β Config n) (u : β) : bankPick pool fallback B x t q j v u β pool j := by
unfold bankPick
split_ifs with h
Β· exact h.choose_spec.1
Β· exact hf j
theorem bankPick_spec {n : β} (pool : β β Finset (Config n)) (fallback : β β Config n)
(B : β) (x : β β Config n) (t q : β)
(j : β) (v : β β Config n) (u : β)
(h : β w β pool j, q β€ overlap w (x u) β§
β i, j/B*B β€ i β i < j β |overlap (v i) w| β€ 3*t) :
q β€ overlap (bankPick pool fallback B x t q j v u) (x u) β§
β i, j/B*B β€ i β i < j β |overlap (v i) (bankPick pool fallback B x t q j v u)| β€ 3*t := by
rw [bankPick,dite_eq_left h]
exact h.choose_spec.2
end SK.Analytic
end
end
end OAI
|