math / data /lean /OAI /Combinatorics /BalancedRyser /Probability /FiniteKernelPotential.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.65 kB
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Tactic
namespace OAI
open scoped BigOperators
namespace Balanced.FiniteKernelPotential
noncomputable section
variable {X : Type*} [Fintype X]
def advance (K : X β†’ X β†’ ℝ) (w : X β†’ ℝ) (y : X) : ℝ :=
βˆ‘ x, w x * K x y
def weights (K : β„• β†’ X β†’ X β†’ ℝ) (wβ‚€ : X β†’ ℝ) : β„• β†’ X β†’ ℝ
| 0 => wβ‚€
| t + 1 => advance (K t) (weights K wβ‚€ t)
@[simp] theorem weights_zero (K : β„• β†’ X β†’ X β†’ ℝ) (wβ‚€ : X β†’ ℝ) :
weights K wβ‚€ 0 = wβ‚€ := rfl
@[simp] theorem weights_succ (K : β„• β†’ X β†’ X β†’ ℝ) (wβ‚€ : X β†’ ℝ) (t : β„•) :
weights K wβ‚€ (t + 1) = advance (K t) (weights K wβ‚€ t) := rfl
theorem advance_nonneg (K : X β†’ X β†’ ℝ) (w : X β†’ ℝ)
(hK : βˆ€ x y, 0 ≀ K x y) (hw : βˆ€ x, 0 ≀ w x) (y : X) :
0 ≀ advance K w y := by
apply Finset.sum_nonneg
intro x hx
exact mul_nonneg (hw x) (hK x y)
theorem weights_nonneg (K : β„• β†’ X β†’ X β†’ ℝ) (wβ‚€ : X β†’ ℝ)
(hK : βˆ€ t x y, 0 ≀ K t x y) (hwβ‚€ : βˆ€ x, 0 ≀ wβ‚€ x)
(t : β„•) (x : X) : 0 ≀ weights K wβ‚€ t x := by
induction t generalizing x with
| zero => exact hwβ‚€ x
| succ t ih =>
exact advance_nonneg (K t) (weights K wβ‚€ t) (hK t)
ih x
theorem advance_pairing (K : X β†’ X β†’ ℝ) (w Ξ¦ : X β†’ ℝ) :
βˆ‘ y, advance K w y * Ξ¦ y = βˆ‘ x, w x * βˆ‘ y, K x y * Ξ¦ y := by
simp only [advance, Finset.sum_mul, Finset.mul_sum, mul_assoc]
exact Finset.sum_comm
theorem advance_potential_le (K : X β†’ X β†’ ℝ) (w Ξ¦ Ξ¨ : X β†’ ℝ)
(hw : βˆ€ x, 0 ≀ w x)
(hstep : βˆ€ x, βˆ‘ y, K x y * Ξ¨ y ≀ Ξ¦ x) :
βˆ‘ y, advance K w y * Ξ¨ y ≀ βˆ‘ x, w x * Ξ¦ x := by
rw [advance_pairing]
apply Finset.sum_le_sum
intro x hx
exact mul_le_mul_of_nonneg_left (hstep x) (hw x)
theorem expected_potential_le (K : β„• β†’ X β†’ X β†’ ℝ) (wβ‚€ : X β†’ ℝ)
(Ξ¦ : β„• β†’ X β†’ ℝ)
(hK : βˆ€ t x y, 0 ≀ K t x y) (hwβ‚€ : βˆ€ x, 0 ≀ wβ‚€ x)
(hstep : βˆ€ t x, βˆ‘ y, K t x y * Ξ¦ (t + 1) y ≀ Ξ¦ t x)
(T : β„•) :
βˆ‘ y, weights K wβ‚€ T y * Ξ¦ T y ≀ βˆ‘ x, wβ‚€ x * Ξ¦ 0 x := by
induction T with
| zero => exact le_rfl
| succ T ih =>
exact (advance_potential_le (K T) (weights K wβ‚€ T) (Ξ¦ T) (Ξ¦ (T + 1))
(weights_nonneg K wβ‚€ hK hwβ‚€ T) (hstep T)).trans ih
theorem payoff_le (K : β„• β†’ X β†’ X β†’ ℝ) (wβ‚€ : X β†’ ℝ)
(Ξ¦ : β„• β†’ X β†’ ℝ) (payoff : X β†’ ℝ)
(hK : βˆ€ t x y, 0 ≀ K t x y) (hwβ‚€ : βˆ€ x, 0 ≀ wβ‚€ x)
(hstep : βˆ€ t x, βˆ‘ y, K t x y * Ξ¦ (t + 1) y ≀ Ξ¦ t x)
(T : β„•) (hpayoff : βˆ€ x, payoff x ≀ Ξ¦ T x) :
βˆ‘ y, weights K wβ‚€ T y * payoff y ≀ βˆ‘ x, wβ‚€ x * Ξ¦ 0 x := by
calc
_ ≀ βˆ‘ y, weights K wβ‚€ T y * Ξ¦ T y := by
apply Finset.sum_le_sum
intro y hy
exact mul_le_mul_of_nonneg_left (hpayoff y) (weights_nonneg K wβ‚€ hK hwβ‚€ T y)
_ ≀ _ := expected_potential_le K wβ‚€ Ξ¦ hK hwβ‚€ hstep T
def pointMass [DecidableEq X] (xβ‚€ : X) (x : X) : ℝ := if x = xβ‚€ then 1 else 0
omit [Fintype X] in
theorem pointMass_nonneg [DecidableEq X] (xβ‚€ x : X) :
0 ≀ pointMass xβ‚€ x := by unfold pointMass; split_ifs <;> norm_num
@[simp] theorem pointMass_pairing [DecidableEq X] (xβ‚€ : X) (f : X β†’ ℝ) :
βˆ‘ x, pointMass xβ‚€ x * f x = f xβ‚€ := by simp [pointMass]
theorem pointMass_potential_le [DecidableEq X]
(K : β„• β†’ X β†’ X β†’ ℝ) (xβ‚€ : X) (Ξ¦ : X β†’ ℝ)
(hK : βˆ€ t x y, 0 ≀ K t x y)
(hstep : βˆ€ t x, βˆ‘ y, K t x y * Ξ¦ y ≀ Ξ¦ x) (T : β„•) :
βˆ‘ y, weights K (pointMass xβ‚€) T y * Ξ¦ y ≀ Ξ¦ xβ‚€ := by
simpa using expected_potential_le K (pointMass xβ‚€) (fun _ => Ξ¦) hK
(pointMass_nonneg xβ‚€) hstep T
theorem pointMass_payoff_le [DecidableEq X]
(K : β„• β†’ X β†’ X β†’ ℝ) (xβ‚€ : X) (Ξ¦ payoff : X β†’ ℝ)
(hK : βˆ€ t x y, 0 ≀ K t x y)
(hstep : βˆ€ t x, βˆ‘ y, K t x y * Ξ¦ y ≀ Ξ¦ x)
(T : β„•) (hpayoff : βˆ€ x, payoff x ≀ Ξ¦ x) :
βˆ‘ y, weights K (pointMass xβ‚€) T y * payoff y ≀ Ξ¦ xβ‚€ := by
simpa using payoff_le K (pointMass xβ‚€) (fun _ => Ξ¦) payoff hK
(pointMass_nonneg xβ‚€) hstep T hpayoff
theorem weights_eq_of_recurrence (K : β„• β†’ X β†’ X β†’ ℝ) (w : β„• β†’ X β†’ ℝ)
(hrec : βˆ€ t y, w (t + 1) y = βˆ‘ x, w t x * K t x y) (T : β„•) :
weights K (w 0) T = w T := by
induction T with
| zero => rfl
| succ T ih =>
funext y
simp only [weights_succ, advance, ih]
exact (hrec T y).symm
theorem evolution_payoff_le (K : β„• β†’ X β†’ X β†’ ℝ) (w : β„• β†’ X β†’ ℝ)
(Ξ¦ : β„• β†’ X β†’ ℝ) (payoff : X β†’ ℝ)
(hrec : βˆ€ t y, w (t + 1) y = βˆ‘ x, w t x * K t x y)
(hK : βˆ€ t x y, 0 ≀ K t x y) (hwβ‚€ : βˆ€ x, 0 ≀ w 0 x)
(hstep : βˆ€ t x, βˆ‘ y, K t x y * Ξ¦ (t + 1) y ≀ Ξ¦ t x)
(T : β„•) (hpayoff : βˆ€ x, payoff x ≀ Ξ¦ T x) :
βˆ‘ y, w T y * payoff y ≀ βˆ‘ x, w 0 x * Ξ¦ 0 x := by
rw [← weights_eq_of_recurrence K w hrec T]
exact payoff_le K (w 0) Ξ¦ payoff hK hwβ‚€ hstep T hpayoff
theorem pointMass_event_le [DecidableEq X]
(K : β„• β†’ X β†’ X β†’ ℝ) (xβ‚€ : X) (Ξ¦ : X β†’ ℝ)
(hK : βˆ€ t x y, 0 ≀ K t x y)
(hstep : βˆ€ t x, βˆ‘ y, K t x y * Ξ¦ y ≀ Ξ¦ x)
(T : β„•) (E : X β†’ Prop) [DecidablePred E]
(hE : βˆ€ x, (if E x then (1 : ℝ) else 0) ≀ Ξ¦ x) :
(βˆ‘ y, if E y then weights K (pointMass xβ‚€) T y else 0) ≀ Ξ¦ xβ‚€ := by
simpa only [mul_ite, mul_one, mul_zero] using
pointMass_payoff_le K xβ‚€ Ξ¦ (fun x => if E x then 1 else 0) hK hstep T hE
end
end Balanced.FiniteKernelPotential
end OAI