src/HOL/Probability/Probability_Measure.thy
author haftmann
Sun Mar 16 18:09:04 2014 +0100 (2014-03-16)
changeset 56166 9a241bc276cd
parent 54418 3b8e33d1a39a
child 56993 e5366291d6aa
permissions -rw-r--r--
normalising simp rules for compound operators
hoelzl@42148
     1
(*  Title:      HOL/Probability/Probability_Measure.thy
hoelzl@42067
     2
    Author:     Johannes Hölzl, TU München
hoelzl@42067
     3
    Author:     Armin Heller, TU München
hoelzl@42067
     4
*)
hoelzl@42067
     5
hoelzl@42148
     6
header {*Probability measure*}
hoelzl@42067
     7
hoelzl@42148
     8
theory Probability_Measure
hoelzl@47694
     9
  imports Lebesgue_Measure Radon_Nikodym
hoelzl@35582
    10
begin
hoelzl@35582
    11
hoelzl@45777
    12
locale prob_space = finite_measure +
hoelzl@47694
    13
  assumes emeasure_space_1: "emeasure M (space M) = 1"
hoelzl@38656
    14
hoelzl@45777
    15
lemma prob_spaceI[Pure.intro!]:
hoelzl@47694
    16
  assumes *: "emeasure M (space M) = 1"
hoelzl@45777
    17
  shows "prob_space M"
hoelzl@45777
    18
proof -
hoelzl@45777
    19
  interpret finite_measure M
hoelzl@45777
    20
  proof
hoelzl@47694
    21
    show "emeasure M (space M) \<noteq> \<infinity>" using * by simp 
hoelzl@45777
    22
  qed
hoelzl@45777
    23
  show "prob_space M" by default fact
hoelzl@38656
    24
qed
hoelzl@38656
    25
hoelzl@40859
    26
abbreviation (in prob_space) "events \<equiv> sets M"
hoelzl@47694
    27
abbreviation (in prob_space) "prob \<equiv> measure M"
hoelzl@47694
    28
abbreviation (in prob_space) "random_variable M' X \<equiv> X \<in> measurable M M'"
wenzelm@53015
    29
abbreviation (in prob_space) "expectation \<equiv> integral\<^sup>L M"
hoelzl@35582
    30
hoelzl@47694
    31
lemma (in prob_space) prob_space_distr:
hoelzl@47694
    32
  assumes f: "f \<in> measurable M M'" shows "prob_space (distr M M' f)"
hoelzl@47694
    33
proof (rule prob_spaceI)
hoelzl@47694
    34
  have "f -` space M' \<inter> space M = space M" using f by (auto dest: measurable_space)
hoelzl@47694
    35
  with f show "emeasure (distr M M' f) (space (distr M M' f)) = 1"
hoelzl@47694
    36
    by (auto simp: emeasure_distr emeasure_space_1)
hoelzl@43339
    37
qed
hoelzl@43339
    38
hoelzl@40859
    39
lemma (in prob_space) prob_space: "prob (space M) = 1"
hoelzl@47694
    40
  using emeasure_space_1 unfolding measure_def by (simp add: one_ereal_def)
hoelzl@41981
    41
hoelzl@41981
    42
lemma (in prob_space) prob_le_1[simp, intro]: "prob A \<le> 1"
hoelzl@41981
    43
  using bounded_measure[of A] by (simp add: prob_space)
hoelzl@41981
    44
hoelzl@47694
    45
lemma (in prob_space) not_empty: "space M \<noteq> {}"
hoelzl@47694
    46
  using prob_space by auto
hoelzl@41981
    47
hoelzl@47694
    48
lemma (in prob_space) measure_le_1: "emeasure M X \<le> 1"
hoelzl@47694
    49
  using emeasure_space[of M X] by (simp add: emeasure_space_1)
hoelzl@42950
    50
hoelzl@43339
    51
lemma (in prob_space) AE_I_eq_1:
hoelzl@47694
    52
  assumes "emeasure M {x\<in>space M. P x} = 1" "{x\<in>space M. P x} \<in> sets M"
hoelzl@47694
    53
  shows "AE x in M. P x"
hoelzl@43339
    54
proof (rule AE_I)
hoelzl@47694
    55
  show "emeasure M (space M - {x \<in> space M. P x}) = 0"
hoelzl@47694
    56
    using assms emeasure_space_1 by (simp add: emeasure_compl)
hoelzl@43339
    57
qed (insert assms, auto)
hoelzl@43339
    58
hoelzl@40859
    59
lemma (in prob_space) prob_compl:
hoelzl@41981
    60
  assumes A: "A \<in> events"
hoelzl@38656
    61
  shows "prob (space M - A) = 1 - prob A"
hoelzl@41981
    62
  using finite_measure_compl[OF A] by (simp add: prob_space)
hoelzl@35582
    63
hoelzl@47694
    64
lemma (in prob_space) AE_in_set_eq_1:
hoelzl@47694
    65
  assumes "A \<in> events" shows "(AE x in M. x \<in> A) \<longleftrightarrow> prob A = 1"
hoelzl@47694
    66
proof
hoelzl@47694
    67
  assume ae: "AE x in M. x \<in> A"
hoelzl@47694
    68
  have "{x \<in> space M. x \<in> A} = A" "{x \<in> space M. x \<notin> A} = space M - A"
immler@50244
    69
    using `A \<in> events`[THEN sets.sets_into_space] by auto
hoelzl@47694
    70
  with AE_E2[OF ae] `A \<in> events` have "1 - emeasure M A = 0"
hoelzl@47694
    71
    by (simp add: emeasure_compl emeasure_space_1)
hoelzl@47694
    72
  then show "prob A = 1"
hoelzl@47694
    73
    using `A \<in> events` by (simp add: emeasure_eq_measure one_ereal_def)
hoelzl@47694
    74
next
hoelzl@47694
    75
  assume prob: "prob A = 1"
hoelzl@47694
    76
  show "AE x in M. x \<in> A"
hoelzl@47694
    77
  proof (rule AE_I)
hoelzl@47694
    78
    show "{x \<in> space M. x \<notin> A} \<subseteq> space M - A" by auto
hoelzl@47694
    79
    show "emeasure M (space M - A) = 0"
hoelzl@47694
    80
      using `A \<in> events` prob
hoelzl@47694
    81
      by (simp add: prob_compl emeasure_space_1 emeasure_eq_measure one_ereal_def)
hoelzl@47694
    82
    show "space M - A \<in> events"
hoelzl@47694
    83
      using `A \<in> events` by auto
hoelzl@47694
    84
  qed
hoelzl@47694
    85
qed
hoelzl@47694
    86
hoelzl@47694
    87
lemma (in prob_space) AE_False: "(AE x in M. False) \<longleftrightarrow> False"
hoelzl@47694
    88
proof
hoelzl@47694
    89
  assume "AE x in M. False"
hoelzl@47694
    90
  then have "AE x in M. x \<in> {}" by simp
hoelzl@47694
    91
  then show False
hoelzl@47694
    92
    by (subst (asm) AE_in_set_eq_1) auto
hoelzl@47694
    93
qed simp
hoelzl@47694
    94
hoelzl@47694
    95
lemma (in prob_space) AE_prob_1:
hoelzl@47694
    96
  assumes "prob A = 1" shows "AE x in M. x \<in> A"
hoelzl@47694
    97
proof -
hoelzl@47694
    98
  from `prob A = 1` have "A \<in> events"
hoelzl@47694
    99
    by (metis measure_notin_sets zero_neq_one)
hoelzl@47694
   100
  with AE_in_set_eq_1 assms show ?thesis by simp
hoelzl@47694
   101
qed
hoelzl@47694
   102
hoelzl@50098
   103
lemma (in prob_space) AE_const[simp]: "(AE x in M. P) \<longleftrightarrow> P"
hoelzl@50098
   104
  by (cases P) (auto simp: AE_False)
hoelzl@50098
   105
hoelzl@50098
   106
lemma (in prob_space) AE_contr:
hoelzl@50098
   107
  assumes ae: "AE \<omega> in M. P \<omega>" "AE \<omega> in M. \<not> P \<omega>"
hoelzl@50098
   108
  shows False
hoelzl@50098
   109
proof -
hoelzl@50098
   110
  from ae have "AE \<omega> in M. False" by eventually_elim auto
hoelzl@50098
   111
  then show False by auto
hoelzl@50098
   112
qed
hoelzl@50098
   113
hoelzl@43339
   114
lemma (in prob_space) expectation_less:
hoelzl@43339
   115
  assumes [simp]: "integrable M X"
hoelzl@49786
   116
  assumes gt: "AE x in M. X x < b"
hoelzl@43339
   117
  shows "expectation X < b"
hoelzl@43339
   118
proof -
hoelzl@43339
   119
  have "expectation X < expectation (\<lambda>x. b)"
hoelzl@47694
   120
    using gt emeasure_space_1
hoelzl@43340
   121
    by (intro integral_less_AE_space) auto
hoelzl@43339
   122
  then show ?thesis using prob_space by simp
hoelzl@43339
   123
qed
hoelzl@43339
   124
hoelzl@43339
   125
lemma (in prob_space) expectation_greater:
hoelzl@43339
   126
  assumes [simp]: "integrable M X"
hoelzl@49786
   127
  assumes gt: "AE x in M. a < X x"
hoelzl@43339
   128
  shows "a < expectation X"
hoelzl@43339
   129
proof -
hoelzl@43339
   130
  have "expectation (\<lambda>x. a) < expectation X"
hoelzl@47694
   131
    using gt emeasure_space_1
hoelzl@43340
   132
    by (intro integral_less_AE_space) auto
hoelzl@43339
   133
  then show ?thesis using prob_space by simp
hoelzl@43339
   134
qed
hoelzl@43339
   135
hoelzl@43339
   136
lemma (in prob_space) jensens_inequality:
hoelzl@43339
   137
  fixes a b :: real
hoelzl@49786
   138
  assumes X: "integrable M X" "AE x in M. X x \<in> I"
hoelzl@43339
   139
  assumes I: "I = {a <..< b} \<or> I = {a <..} \<or> I = {..< b} \<or> I = UNIV"
hoelzl@43339
   140
  assumes q: "integrable M (\<lambda>x. q (X x))" "convex_on I q"
hoelzl@43339
   141
  shows "q (expectation X) \<le> expectation (\<lambda>x. q (X x))"
hoelzl@43339
   142
proof -
wenzelm@46731
   143
  let ?F = "\<lambda>x. Inf ((\<lambda>t. (q x - q t) / (x - t)) ` ({x<..} \<inter> I))"
hoelzl@49786
   144
  from X(2) AE_False have "I \<noteq> {}" by auto
hoelzl@43339
   145
hoelzl@43339
   146
  from I have "open I" by auto
hoelzl@43339
   147
hoelzl@43339
   148
  note I
hoelzl@43339
   149
  moreover
hoelzl@43339
   150
  { assume "I \<subseteq> {a <..}"
hoelzl@43339
   151
    with X have "a < expectation X"
hoelzl@43339
   152
      by (intro expectation_greater) auto }
hoelzl@43339
   153
  moreover
hoelzl@43339
   154
  { assume "I \<subseteq> {..< b}"
hoelzl@43339
   155
    with X have "expectation X < b"
hoelzl@43339
   156
      by (intro expectation_less) auto }
hoelzl@43339
   157
  ultimately have "expectation X \<in> I"
hoelzl@43339
   158
    by (elim disjE)  (auto simp: subset_eq)
hoelzl@43339
   159
  moreover
hoelzl@43339
   160
  { fix y assume y: "y \<in> I"
hoelzl@43339
   161
    with q(2) `open I` have "Sup ((\<lambda>x. q x + ?F x * (y - x)) ` I) = q y"
haftmann@56166
   162
      by (auto intro!: cSup_eq_maximum convex_le_Inf_differential image_eqI [OF _ y] simp: interior_open simp del: Sup_image_eq Inf_image_eq) }
hoelzl@43339
   163
  ultimately have "q (expectation X) = Sup ((\<lambda>x. q x + ?F x * (expectation X - x)) ` I)"
hoelzl@43339
   164
    by simp
hoelzl@43339
   165
  also have "\<dots> \<le> expectation (\<lambda>w. q (X w))"
hoelzl@51475
   166
  proof (rule cSup_least)
hoelzl@43339
   167
    show "(\<lambda>x. q x + ?F x * (expectation X - x)) ` I \<noteq> {}"
hoelzl@43339
   168
      using `I \<noteq> {}` by auto
hoelzl@43339
   169
  next
hoelzl@43339
   170
    fix k assume "k \<in> (\<lambda>x. q x + ?F x * (expectation X - x)) ` I"
hoelzl@43339
   171
    then guess x .. note x = this
hoelzl@43339
   172
    have "q x + ?F x * (expectation X  - x) = expectation (\<lambda>w. q x + ?F x * (X w - x))"
hoelzl@47694
   173
      using prob_space by (simp add: X)
hoelzl@43339
   174
    also have "\<dots> \<le> expectation (\<lambda>w. q (X w))"
hoelzl@43339
   175
      using `x \<in> I` `open I` X(2)
hoelzl@49786
   176
      apply (intro integral_mono_AE integral_add integral_cmult integral_diff
hoelzl@49786
   177
                lebesgue_integral_const X q)
hoelzl@49786
   178
      apply (elim eventually_elim1)
hoelzl@49786
   179
      apply (intro convex_le_Inf_differential)
hoelzl@49786
   180
      apply (auto simp: interior_open q)
hoelzl@49786
   181
      done
hoelzl@43339
   182
    finally show "k \<le> expectation (\<lambda>w. q (X w))" using x by auto
hoelzl@43339
   183
  qed
hoelzl@43339
   184
  finally show "q (expectation X) \<le> expectation (\<lambda>x. q (X x))" .
hoelzl@43339
   185
qed
hoelzl@43339
   186
hoelzl@50001
   187
subsection  {* Introduce binder for probability *}
hoelzl@50001
   188
hoelzl@50001
   189
syntax
hoelzl@50001
   190
  "_prob" :: "pttrn \<Rightarrow> logic \<Rightarrow> logic \<Rightarrow> logic" ("('\<P>'(_ in _. _'))")
hoelzl@50001
   191
hoelzl@50001
   192
translations
hoelzl@50001
   193
  "\<P>(x in M. P)" => "CONST measure M {x \<in> CONST space M. P}"
hoelzl@50001
   194
hoelzl@50001
   195
definition
hoelzl@50001
   196
  "cond_prob M P Q = \<P>(\<omega> in M. P \<omega> \<and> Q \<omega>) / \<P>(\<omega> in M. Q \<omega>)"
hoelzl@50001
   197
hoelzl@50001
   198
syntax
hoelzl@50001
   199
  "_conditional_prob" :: "pttrn \<Rightarrow> logic \<Rightarrow> logic \<Rightarrow> logic \<Rightarrow> logic" ("('\<P>'(_ in _. _ \<bar>/ _'))")
hoelzl@50001
   200
hoelzl@50001
   201
translations
hoelzl@50001
   202
  "\<P>(x in M. P \<bar> Q)" => "CONST cond_prob M (\<lambda>x. P) (\<lambda>x. Q)"
hoelzl@50001
   203
hoelzl@50001
   204
lemma (in prob_space) AE_E_prob:
hoelzl@50001
   205
  assumes ae: "AE x in M. P x"
hoelzl@50001
   206
  obtains S where "S \<subseteq> {x \<in> space M. P x}" "S \<in> events" "prob S = 1"
hoelzl@50001
   207
proof -
hoelzl@50001
   208
  from ae[THEN AE_E] guess N .
hoelzl@50001
   209
  then show thesis
hoelzl@50001
   210
    by (intro that[of "space M - N"])
hoelzl@50001
   211
       (auto simp: prob_compl prob_space emeasure_eq_measure)
hoelzl@50001
   212
qed
hoelzl@50001
   213
hoelzl@50001
   214
lemma (in prob_space) prob_neg: "{x\<in>space M. P x} \<in> events \<Longrightarrow> \<P>(x in M. \<not> P x) = 1 - \<P>(x in M. P x)"
hoelzl@50001
   215
  by (auto intro!: arg_cong[where f=prob] simp add: prob_compl[symmetric])
hoelzl@50001
   216
hoelzl@50001
   217
lemma (in prob_space) prob_eq_AE:
hoelzl@50001
   218
  "(AE x in M. P x \<longleftrightarrow> Q x) \<Longrightarrow> {x\<in>space M. P x} \<in> events \<Longrightarrow> {x\<in>space M. Q x} \<in> events \<Longrightarrow> \<P>(x in M. P x) = \<P>(x in M. Q x)"
hoelzl@50001
   219
  by (rule finite_measure_eq_AE) auto
hoelzl@50001
   220
hoelzl@50001
   221
lemma (in prob_space) prob_eq_0_AE:
hoelzl@50001
   222
  assumes not: "AE x in M. \<not> P x" shows "\<P>(x in M. P x) = 0"
hoelzl@50001
   223
proof cases
hoelzl@50001
   224
  assume "{x\<in>space M. P x} \<in> events"
hoelzl@50001
   225
  with not have "\<P>(x in M. P x) = \<P>(x in M. False)"
hoelzl@50001
   226
    by (intro prob_eq_AE) auto
hoelzl@50001
   227
  then show ?thesis by simp
hoelzl@50001
   228
qed (simp add: measure_notin_sets)
hoelzl@50001
   229
hoelzl@50098
   230
lemma (in prob_space) prob_Collect_eq_0:
hoelzl@50098
   231
  "{x \<in> space M. P x} \<in> sets M \<Longrightarrow> \<P>(x in M. P x) = 0 \<longleftrightarrow> (AE x in M. \<not> P x)"
hoelzl@50098
   232
  using AE_iff_measurable[OF _ refl, of M "\<lambda>x. \<not> P x"] by (simp add: emeasure_eq_measure)
hoelzl@50098
   233
hoelzl@50098
   234
lemma (in prob_space) prob_Collect_eq_1:
hoelzl@50098
   235
  "{x \<in> space M. P x} \<in> sets M \<Longrightarrow> \<P>(x in M. P x) = 1 \<longleftrightarrow> (AE x in M. P x)"
hoelzl@50098
   236
  using AE_in_set_eq_1[of "{x\<in>space M. P x}"] by simp
hoelzl@50098
   237
hoelzl@50098
   238
lemma (in prob_space) prob_eq_0:
hoelzl@50098
   239
  "A \<in> sets M \<Longrightarrow> prob A = 0 \<longleftrightarrow> (AE x in M. x \<notin> A)"
hoelzl@50098
   240
  using AE_iff_measurable[OF _ refl, of M "\<lambda>x. x \<notin> A"]
hoelzl@50098
   241
  by (auto simp add: emeasure_eq_measure Int_def[symmetric])
hoelzl@50098
   242
hoelzl@50098
   243
lemma (in prob_space) prob_eq_1:
hoelzl@50098
   244
  "A \<in> sets M \<Longrightarrow> prob A = 1 \<longleftrightarrow> (AE x in M. x \<in> A)"
hoelzl@50098
   245
  using AE_in_set_eq_1[of A] by simp
hoelzl@50098
   246
hoelzl@50001
   247
lemma (in prob_space) prob_sums:
hoelzl@50001
   248
  assumes P: "\<And>n. {x\<in>space M. P n x} \<in> events"
hoelzl@50001
   249
  assumes Q: "{x\<in>space M. Q x} \<in> events"
hoelzl@50001
   250
  assumes ae: "AE x in M. (\<forall>n. P n x \<longrightarrow> Q x) \<and> (Q x \<longrightarrow> (\<exists>!n. P n x))"
hoelzl@50001
   251
  shows "(\<lambda>n. \<P>(x in M. P n x)) sums \<P>(x in M. Q x)"
hoelzl@50001
   252
proof -
hoelzl@50001
   253
  from ae[THEN AE_E_prob] guess S . note S = this
hoelzl@50001
   254
  then have disj: "disjoint_family (\<lambda>n. {x\<in>space M. P n x} \<inter> S)"
hoelzl@50001
   255
    by (auto simp: disjoint_family_on_def)
hoelzl@50001
   256
  from S have ae_S:
hoelzl@50001
   257
    "AE x in M. x \<in> {x\<in>space M. Q x} \<longleftrightarrow> x \<in> (\<Union>n. {x\<in>space M. P n x} \<inter> S)"
hoelzl@50001
   258
    "\<And>n. AE x in M. x \<in> {x\<in>space M. P n x} \<longleftrightarrow> x \<in> {x\<in>space M. P n x} \<inter> S"
hoelzl@50001
   259
    using ae by (auto dest!: AE_prob_1)
hoelzl@50001
   260
  from ae_S have *:
hoelzl@50001
   261
    "\<P>(x in M. Q x) = prob (\<Union>n. {x\<in>space M. P n x} \<inter> S)"
hoelzl@50001
   262
    using P Q S by (intro finite_measure_eq_AE) auto
hoelzl@50001
   263
  from ae_S have **:
hoelzl@50001
   264
    "\<And>n. \<P>(x in M. P n x) = prob ({x\<in>space M. P n x} \<inter> S)"
hoelzl@50001
   265
    using P Q S by (intro finite_measure_eq_AE) auto
hoelzl@50001
   266
  show ?thesis
hoelzl@50001
   267
    unfolding * ** using S P disj
hoelzl@50001
   268
    by (intro finite_measure_UNION) auto
hoelzl@50001
   269
qed
hoelzl@50001
   270
hoelzl@54418
   271
lemma (in prob_space) prob_EX_countable:
hoelzl@54418
   272
  assumes sets: "\<And>i. i \<in> I \<Longrightarrow> {x\<in>space M. P i x} \<in> sets M" and I: "countable I" 
hoelzl@54418
   273
  assumes disj: "AE x in M. \<forall>i\<in>I. \<forall>j\<in>I. P i x \<longrightarrow> P j x \<longrightarrow> i = j"
hoelzl@54418
   274
  shows "\<P>(x in M. \<exists>i\<in>I. P i x) = (\<integral>\<^sup>+i. \<P>(x in M. P i x) \<partial>count_space I)"
hoelzl@54418
   275
proof -
hoelzl@54418
   276
  let ?N= "\<lambda>x. \<exists>!i\<in>I. P i x"
hoelzl@54418
   277
  have "ereal (\<P>(x in M. \<exists>i\<in>I. P i x)) = \<P>(x in M. (\<exists>i\<in>I. P i x \<and> ?N x))"
hoelzl@54418
   278
    unfolding ereal.inject
hoelzl@54418
   279
  proof (rule prob_eq_AE)
hoelzl@54418
   280
    show "AE x in M. (\<exists>i\<in>I. P i x) = (\<exists>i\<in>I. P i x \<and> ?N x)"
hoelzl@54418
   281
      using disj by eventually_elim blast
hoelzl@54418
   282
  qed (auto intro!: sets.sets_Collect_countable_Ex' sets.sets_Collect_conj sets.sets_Collect_countable_Ex1' I sets)+
hoelzl@54418
   283
  also have "\<P>(x in M. (\<exists>i\<in>I. P i x \<and> ?N x)) = emeasure M (\<Union>i\<in>I. {x\<in>space M. P i x \<and> ?N x})"
hoelzl@54418
   284
    unfolding emeasure_eq_measure by (auto intro!: arg_cong[where f=prob])
hoelzl@54418
   285
  also have "\<dots> = (\<integral>\<^sup>+i. emeasure M {x\<in>space M. P i x \<and> ?N x} \<partial>count_space I)"
hoelzl@54418
   286
    by (rule emeasure_UN_countable)
hoelzl@54418
   287
       (auto intro!: sets.sets_Collect_countable_Ex' sets.sets_Collect_conj sets.sets_Collect_countable_Ex1' I sets
hoelzl@54418
   288
             simp: disjoint_family_on_def)
hoelzl@54418
   289
  also have "\<dots> = (\<integral>\<^sup>+i. \<P>(x in M. P i x) \<partial>count_space I)"
hoelzl@54418
   290
    unfolding emeasure_eq_measure using disj
hoelzl@54418
   291
    by (intro positive_integral_cong ereal.inject[THEN iffD2] prob_eq_AE)
hoelzl@54418
   292
       (auto intro!: sets.sets_Collect_countable_Ex' sets.sets_Collect_conj sets.sets_Collect_countable_Ex1' I sets)+
hoelzl@54418
   293
  finally show ?thesis .
hoelzl@54418
   294
qed
hoelzl@54418
   295
hoelzl@50001
   296
lemma (in prob_space) cond_prob_eq_AE:
hoelzl@50001
   297
  assumes P: "AE x in M. Q x \<longrightarrow> P x \<longleftrightarrow> P' x" "{x\<in>space M. P x} \<in> events" "{x\<in>space M. P' x} \<in> events"
hoelzl@50001
   298
  assumes Q: "AE x in M. Q x \<longleftrightarrow> Q' x" "{x\<in>space M. Q x} \<in> events" "{x\<in>space M. Q' x} \<in> events"
hoelzl@50001
   299
  shows "cond_prob M P Q = cond_prob M P' Q'"
hoelzl@50001
   300
  using P Q
immler@50244
   301
  by (auto simp: cond_prob_def intro!: arg_cong2[where f="op /"] prob_eq_AE sets.sets_Collect_conj)
hoelzl@50001
   302
hoelzl@50001
   303
hoelzl@40859
   304
lemma (in prob_space) joint_distribution_Times_le_fst:
hoelzl@47694
   305
  "random_variable MX X \<Longrightarrow> random_variable MY Y \<Longrightarrow> A \<in> sets MX \<Longrightarrow> B \<in> sets MY
wenzelm@53015
   306
    \<Longrightarrow> emeasure (distr M (MX \<Otimes>\<^sub>M MY) (\<lambda>x. (X x, Y x))) (A \<times> B) \<le> emeasure (distr M MX X) A"
hoelzl@47694
   307
  by (auto simp: emeasure_distr measurable_pair_iff comp_def intro!: emeasure_mono measurable_sets)
hoelzl@40859
   308
hoelzl@40859
   309
lemma (in prob_space) joint_distribution_Times_le_snd:
hoelzl@47694
   310
  "random_variable MX X \<Longrightarrow> random_variable MY Y \<Longrightarrow> A \<in> sets MX \<Longrightarrow> B \<in> sets MY
wenzelm@53015
   311
    \<Longrightarrow> emeasure (distr M (MX \<Otimes>\<^sub>M MY) (\<lambda>x. (X x, Y x))) (A \<times> B) \<le> emeasure (distr M MY Y) B"
hoelzl@47694
   312
  by (auto simp: emeasure_distr measurable_pair_iff comp_def intro!: emeasure_mono measurable_sets)
hoelzl@40859
   313
hoelzl@45777
   314
locale pair_prob_space = pair_sigma_finite M1 M2 + M1: prob_space M1 + M2: prob_space M2 for M1 M2
hoelzl@41689
   315
wenzelm@53015
   316
sublocale pair_prob_space \<subseteq> P: prob_space "M1 \<Otimes>\<^sub>M M2"
hoelzl@45777
   317
proof
wenzelm@53015
   318
  show "emeasure (M1 \<Otimes>\<^sub>M M2) (space (M1 \<Otimes>\<^sub>M M2)) = 1"
hoelzl@49776
   319
    by (simp add: M2.emeasure_pair_measure_Times M1.emeasure_space_1 M2.emeasure_space_1 space_pair_measure)
hoelzl@45777
   320
qed
hoelzl@40859
   321
hoelzl@47694
   322
locale product_prob_space = product_sigma_finite M for M :: "'i \<Rightarrow> 'a measure" +
hoelzl@45777
   323
  fixes I :: "'i set"
hoelzl@45777
   324
  assumes prob_space: "\<And>i. prob_space (M i)"
hoelzl@42988
   325
hoelzl@45777
   326
sublocale product_prob_space \<subseteq> M: prob_space "M i" for i
hoelzl@42988
   327
  by (rule prob_space)
hoelzl@42988
   328
hoelzl@45777
   329
locale finite_product_prob_space = finite_product_sigma_finite M I + product_prob_space M I for M I
hoelzl@42988
   330
wenzelm@53015
   331
sublocale finite_product_prob_space \<subseteq> prob_space "\<Pi>\<^sub>M i\<in>I. M i"
hoelzl@45777
   332
proof
wenzelm@53015
   333
  show "emeasure (\<Pi>\<^sub>M i\<in>I. M i) (space (\<Pi>\<^sub>M i\<in>I. M i)) = 1"
hoelzl@47694
   334
    by (simp add: measure_times M.emeasure_space_1 setprod_1 space_PiM)
hoelzl@45777
   335
qed
hoelzl@42988
   336
hoelzl@42988
   337
lemma (in finite_product_prob_space) prob_times:
hoelzl@42988
   338
  assumes X: "\<And>i. i \<in> I \<Longrightarrow> X i \<in> sets (M i)"
wenzelm@53015
   339
  shows "prob (\<Pi>\<^sub>E i\<in>I. X i) = (\<Prod>i\<in>I. M.prob i (X i))"
hoelzl@42988
   340
proof -
wenzelm@53015
   341
  have "ereal (measure (\<Pi>\<^sub>M i\<in>I. M i) (\<Pi>\<^sub>E i\<in>I. X i)) = emeasure (\<Pi>\<^sub>M i\<in>I. M i) (\<Pi>\<^sub>E i\<in>I. X i)"
hoelzl@47694
   342
    using X by (simp add: emeasure_eq_measure)
hoelzl@47694
   343
  also have "\<dots> = (\<Prod>i\<in>I. emeasure (M i) (X i))"
hoelzl@42988
   344
    using measure_times X by simp
hoelzl@47694
   345
  also have "\<dots> = ereal (\<Prod>i\<in>I. measure (M i) (X i))"
hoelzl@47694
   346
    using X by (simp add: M.emeasure_eq_measure setprod_ereal)
hoelzl@42859
   347
  finally show ?thesis by simp
hoelzl@42859
   348
qed
hoelzl@42859
   349
hoelzl@47694
   350
section {* Distributions *}
hoelzl@42892
   351
hoelzl@47694
   352
definition "distributed M N X f \<longleftrightarrow> distr M N X = density N f \<and> 
hoelzl@47694
   353
  f \<in> borel_measurable N \<and> (AE x in N. 0 \<le> f x) \<and> X \<in> measurable M N"
hoelzl@36624
   354
hoelzl@47694
   355
lemma
hoelzl@50003
   356
  assumes "distributed M N X f"
hoelzl@50003
   357
  shows distributed_distr_eq_density: "distr M N X = density N f"
hoelzl@50003
   358
    and distributed_measurable: "X \<in> measurable M N"
hoelzl@50003
   359
    and distributed_borel_measurable: "f \<in> borel_measurable N"
hoelzl@50003
   360
    and distributed_AE: "(AE x in N. 0 \<le> f x)"
hoelzl@50003
   361
  using assms by (simp_all add: distributed_def)
hoelzl@50003
   362
hoelzl@50003
   363
lemma
hoelzl@50003
   364
  assumes D: "distributed M N X f"
hoelzl@50003
   365
  shows distributed_measurable'[measurable_dest]:
hoelzl@50003
   366
      "g \<in> measurable L M \<Longrightarrow> (\<lambda>x. X (g x)) \<in> measurable L N"
hoelzl@50003
   367
    and distributed_borel_measurable'[measurable_dest]:
hoelzl@50003
   368
      "h \<in> measurable L N \<Longrightarrow> (\<lambda>x. f (h x)) \<in> borel_measurable L"
hoelzl@50003
   369
  using distributed_measurable[OF D] distributed_borel_measurable[OF D]
hoelzl@50003
   370
  by simp_all
hoelzl@39097
   371
hoelzl@47694
   372
lemma
hoelzl@47694
   373
  shows distributed_real_measurable: "distributed M N X (\<lambda>x. ereal (f x)) \<Longrightarrow> f \<in> borel_measurable N"
hoelzl@47694
   374
    and distributed_real_AE: "distributed M N X (\<lambda>x. ereal (f x)) \<Longrightarrow> (AE x in N. 0 \<le> f x)"
hoelzl@47694
   375
  by (simp_all add: distributed_def borel_measurable_ereal_iff)
hoelzl@35977
   376
hoelzl@50003
   377
lemma
hoelzl@50003
   378
  assumes D: "distributed M N X (\<lambda>x. ereal (f x))"
hoelzl@50003
   379
  shows distributed_real_measurable'[measurable_dest]:
hoelzl@50003
   380
      "h \<in> measurable L N \<Longrightarrow> (\<lambda>x. f (h x)) \<in> borel_measurable L"
hoelzl@50003
   381
  using distributed_real_measurable[OF D]
hoelzl@50003
   382
  by simp_all
hoelzl@50003
   383
hoelzl@50003
   384
lemma
wenzelm@53015
   385
  assumes D: "distributed M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) f"
hoelzl@50003
   386
  shows joint_distributed_measurable1[measurable_dest]:
hoelzl@50003
   387
      "h1 \<in> measurable N M \<Longrightarrow> (\<lambda>x. X (h1 x)) \<in> measurable N S"
hoelzl@50003
   388
    and joint_distributed_measurable2[measurable_dest]:
hoelzl@50003
   389
      "h2 \<in> measurable N M \<Longrightarrow> (\<lambda>x. Y (h2 x)) \<in> measurable N T"
hoelzl@50003
   390
  using measurable_compose[OF distributed_measurable[OF D] measurable_fst]
hoelzl@50003
   391
  using measurable_compose[OF distributed_measurable[OF D] measurable_snd]
hoelzl@50003
   392
  by auto
hoelzl@50003
   393
hoelzl@47694
   394
lemma distributed_count_space:
hoelzl@47694
   395
  assumes X: "distributed M (count_space A) X P" and a: "a \<in> A" and A: "finite A"
hoelzl@47694
   396
  shows "P a = emeasure M (X -` {a} \<inter> space M)"
hoelzl@39097
   397
proof -
hoelzl@47694
   398
  have "emeasure M (X -` {a} \<inter> space M) = emeasure (distr M (count_space A) X) {a}"
hoelzl@50003
   399
    using X a A by (simp add: emeasure_distr)
hoelzl@47694
   400
  also have "\<dots> = emeasure (density (count_space A) P) {a}"
hoelzl@47694
   401
    using X by (simp add: distributed_distr_eq_density)
wenzelm@53015
   402
  also have "\<dots> = (\<integral>\<^sup>+x. P a * indicator {a} x \<partial>count_space A)"
hoelzl@47694
   403
    using X a by (auto simp add: emeasure_density distributed_def indicator_def intro!: positive_integral_cong)
hoelzl@47694
   404
  also have "\<dots> = P a"
hoelzl@47694
   405
    using X a by (subst positive_integral_cmult_indicator) (auto simp: distributed_def one_ereal_def[symmetric] AE_count_space)
hoelzl@47694
   406
  finally show ?thesis ..
hoelzl@39092
   407
qed
hoelzl@35977
   408
hoelzl@47694
   409
lemma distributed_cong_density:
hoelzl@47694
   410
  "(AE x in N. f x = g x) \<Longrightarrow> g \<in> borel_measurable N \<Longrightarrow> f \<in> borel_measurable N \<Longrightarrow>
hoelzl@47694
   411
    distributed M N X f \<longleftrightarrow> distributed M N X g"
hoelzl@47694
   412
  by (auto simp: distributed_def intro!: density_cong)
hoelzl@47694
   413
hoelzl@47694
   414
lemma subdensity:
hoelzl@47694
   415
  assumes T: "T \<in> measurable P Q"
hoelzl@47694
   416
  assumes f: "distributed M P X f"
hoelzl@47694
   417
  assumes g: "distributed M Q Y g"
hoelzl@47694
   418
  assumes Y: "Y = T \<circ> X"
hoelzl@47694
   419
  shows "AE x in P. g (T x) = 0 \<longrightarrow> f x = 0"
hoelzl@47694
   420
proof -
hoelzl@47694
   421
  have "{x\<in>space Q. g x = 0} \<in> null_sets (distr M Q (T \<circ> X))"
hoelzl@47694
   422
    using g Y by (auto simp: null_sets_density_iff distributed_def)
hoelzl@47694
   423
  also have "distr M Q (T \<circ> X) = distr (distr M P X) Q T"
hoelzl@47694
   424
    using T f[THEN distributed_measurable] by (rule distr_distr[symmetric])
hoelzl@47694
   425
  finally have "T -` {x\<in>space Q. g x = 0} \<inter> space P \<in> null_sets (distr M P X)"
hoelzl@47694
   426
    using T by (subst (asm) null_sets_distr_iff) auto
hoelzl@47694
   427
  also have "T -` {x\<in>space Q. g x = 0} \<inter> space P = {x\<in>space P. g (T x) = 0}"
hoelzl@47694
   428
    using T by (auto dest: measurable_space)
hoelzl@47694
   429
  finally show ?thesis
hoelzl@47694
   430
    using f g by (auto simp add: null_sets_density_iff distributed_def)
hoelzl@35977
   431
qed
hoelzl@35977
   432
hoelzl@47694
   433
lemma subdensity_real:
hoelzl@47694
   434
  fixes g :: "'a \<Rightarrow> real" and f :: "'b \<Rightarrow> real"
hoelzl@47694
   435
  assumes T: "T \<in> measurable P Q"
hoelzl@47694
   436
  assumes f: "distributed M P X f"
hoelzl@47694
   437
  assumes g: "distributed M Q Y g"
hoelzl@47694
   438
  assumes Y: "Y = T \<circ> X"
hoelzl@47694
   439
  shows "AE x in P. g (T x) = 0 \<longrightarrow> f x = 0"
hoelzl@47694
   440
  using subdensity[OF T, of M X "\<lambda>x. ereal (f x)" Y "\<lambda>x. ereal (g x)"] assms by auto
hoelzl@47694
   441
hoelzl@49788
   442
lemma distributed_emeasure:
wenzelm@53015
   443
  "distributed M N X f \<Longrightarrow> A \<in> sets N \<Longrightarrow> emeasure M (X -` A \<inter> space M) = (\<integral>\<^sup>+x. f x * indicator A x \<partial>N)"
hoelzl@50003
   444
  by (auto simp: distributed_AE
hoelzl@49788
   445
                 distributed_distr_eq_density[symmetric] emeasure_density[symmetric] emeasure_distr)
hoelzl@49788
   446
hoelzl@49788
   447
lemma distributed_positive_integral:
wenzelm@53015
   448
  "distributed M N X f \<Longrightarrow> g \<in> borel_measurable N \<Longrightarrow> (\<integral>\<^sup>+x. f x * g x \<partial>N) = (\<integral>\<^sup>+x. g (X x) \<partial>M)"
hoelzl@50003
   449
  by (auto simp: distributed_AE
hoelzl@49788
   450
                 distributed_distr_eq_density[symmetric] positive_integral_density[symmetric] positive_integral_distr)
hoelzl@49788
   451
hoelzl@47694
   452
lemma distributed_integral:
hoelzl@47694
   453
  "distributed M N X f \<Longrightarrow> g \<in> borel_measurable N \<Longrightarrow> (\<integral>x. f x * g x \<partial>N) = (\<integral>x. g (X x) \<partial>M)"
hoelzl@50003
   454
  by (auto simp: distributed_real_AE
hoelzl@47694
   455
                 distributed_distr_eq_density[symmetric] integral_density[symmetric] integral_distr)
hoelzl@47694
   456
  
hoelzl@47694
   457
lemma distributed_transform_integral:
hoelzl@47694
   458
  assumes Px: "distributed M N X Px"
hoelzl@47694
   459
  assumes "distributed M P Y Py"
hoelzl@47694
   460
  assumes Y: "Y = T \<circ> X" and T: "T \<in> measurable N P" and f: "f \<in> borel_measurable P"
hoelzl@47694
   461
  shows "(\<integral>x. Py x * f x \<partial>P) = (\<integral>x. Px x * f (T x) \<partial>N)"
hoelzl@41689
   462
proof -
hoelzl@47694
   463
  have "(\<integral>x. Py x * f x \<partial>P) = (\<integral>x. f (Y x) \<partial>M)"
hoelzl@47694
   464
    by (rule distributed_integral) fact+
hoelzl@47694
   465
  also have "\<dots> = (\<integral>x. f (T (X x)) \<partial>M)"
hoelzl@47694
   466
    using Y by simp
hoelzl@47694
   467
  also have "\<dots> = (\<integral>x. Px x * f (T x) \<partial>N)"
hoelzl@47694
   468
    using measurable_comp[OF T f] Px by (intro distributed_integral[symmetric]) (auto simp: comp_def)
hoelzl@45777
   469
  finally show ?thesis .
hoelzl@39092
   470
qed
hoelzl@36624
   471
hoelzl@49788
   472
lemma (in prob_space) distributed_unique:
hoelzl@47694
   473
  assumes Px: "distributed M S X Px"
hoelzl@49788
   474
  assumes Py: "distributed M S X Py"
hoelzl@49788
   475
  shows "AE x in S. Px x = Py x"
hoelzl@49788
   476
proof -
hoelzl@49788
   477
  interpret X: prob_space "distr M S X"
hoelzl@50003
   478
    using Px by (intro prob_space_distr) simp
hoelzl@49788
   479
  have "sigma_finite_measure (distr M S X)" ..
hoelzl@49788
   480
  with sigma_finite_density_unique[of Px S Py ] Px Py
hoelzl@49788
   481
  show ?thesis
hoelzl@49788
   482
    by (auto simp: distributed_def)
hoelzl@49788
   483
qed
hoelzl@49788
   484
hoelzl@49788
   485
lemma (in prob_space) distributed_jointI:
hoelzl@49788
   486
  assumes "sigma_finite_measure S" "sigma_finite_measure T"
hoelzl@50003
   487
  assumes X[measurable]: "X \<in> measurable M S" and Y[measurable]: "Y \<in> measurable M T"
wenzelm@53015
   488
  assumes [measurable]: "f \<in> borel_measurable (S \<Otimes>\<^sub>M T)" and f: "AE x in S \<Otimes>\<^sub>M T. 0 \<le> f x"
hoelzl@49788
   489
  assumes eq: "\<And>A B. A \<in> sets S \<Longrightarrow> B \<in> sets T \<Longrightarrow> 
wenzelm@53015
   490
    emeasure M {x \<in> space M. X x \<in> A \<and> Y x \<in> B} = (\<integral>\<^sup>+x. (\<integral>\<^sup>+y. f (x, y) * indicator B y \<partial>T) * indicator A x \<partial>S)"
wenzelm@53015
   491
  shows "distributed M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) f"
hoelzl@49788
   492
  unfolding distributed_def
hoelzl@49788
   493
proof safe
hoelzl@49788
   494
  interpret S: sigma_finite_measure S by fact
hoelzl@49788
   495
  interpret T: sigma_finite_measure T by fact
hoelzl@49788
   496
  interpret ST: pair_sigma_finite S T by default
hoelzl@47694
   497
hoelzl@49788
   498
  from ST.sigma_finite_up_in_pair_measure_generator guess F :: "nat \<Rightarrow> ('b \<times> 'c) set" .. note F = this
hoelzl@49788
   499
  let ?E = "{a \<times> b |a b. a \<in> sets S \<and> b \<in> sets T}"
wenzelm@53015
   500
  let ?P = "S \<Otimes>\<^sub>M T"
hoelzl@49788
   501
  show "distr M ?P (\<lambda>x. (X x, Y x)) = density ?P f" (is "?L = ?R")
hoelzl@49788
   502
  proof (rule measure_eqI_generator_eq[OF Int_stable_pair_measure_generator[of S T]])
hoelzl@49788
   503
    show "?E \<subseteq> Pow (space ?P)"
immler@50244
   504
      using sets.space_closed[of S] sets.space_closed[of T] by (auto simp: space_pair_measure)
hoelzl@49788
   505
    show "sets ?L = sigma_sets (space ?P) ?E"
hoelzl@49788
   506
      by (simp add: sets_pair_measure space_pair_measure)
hoelzl@49788
   507
    then show "sets ?R = sigma_sets (space ?P) ?E"
hoelzl@49788
   508
      by simp
hoelzl@49788
   509
  next
hoelzl@49788
   510
    interpret L: prob_space ?L
hoelzl@49788
   511
      by (rule prob_space_distr) (auto intro!: measurable_Pair)
hoelzl@49788
   512
    show "range F \<subseteq> ?E" "(\<Union>i. F i) = space ?P" "\<And>i. emeasure ?L (F i) \<noteq> \<infinity>"
hoelzl@49788
   513
      using F by (auto simp: space_pair_measure)
hoelzl@49788
   514
  next
hoelzl@49788
   515
    fix E assume "E \<in> ?E"
hoelzl@50003
   516
    then obtain A B where E[simp]: "E = A \<times> B"
hoelzl@50003
   517
      and A[measurable]: "A \<in> sets S" and B[measurable]: "B \<in> sets T" by auto
hoelzl@49788
   518
    have "emeasure ?L E = emeasure M {x \<in> space M. X x \<in> A \<and> Y x \<in> B}"
hoelzl@49788
   519
      by (auto intro!: arg_cong[where f="emeasure M"] simp add: emeasure_distr measurable_Pair)
wenzelm@53015
   520
    also have "\<dots> = (\<integral>\<^sup>+x. (\<integral>\<^sup>+y. (f (x, y) * indicator B y) * indicator A x \<partial>T) \<partial>S)"
hoelzl@50003
   521
      using f by (auto simp add: eq positive_integral_multc intro!: positive_integral_cong)
hoelzl@49788
   522
    also have "\<dots> = emeasure ?R E"
hoelzl@50001
   523
      by (auto simp add: emeasure_density T.positive_integral_fst_measurable(2)[symmetric]
hoelzl@49788
   524
               intro!: positive_integral_cong split: split_indicator)
hoelzl@49788
   525
    finally show "emeasure ?L E = emeasure ?R E" .
hoelzl@49788
   526
  qed
hoelzl@50003
   527
qed (auto simp: f)
hoelzl@49788
   528
hoelzl@49788
   529
lemma (in prob_space) distributed_swap:
hoelzl@49788
   530
  assumes "sigma_finite_measure S" "sigma_finite_measure T"
wenzelm@53015
   531
  assumes Pxy: "distributed M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) Pxy"
wenzelm@53015
   532
  shows "distributed M (T \<Otimes>\<^sub>M S) (\<lambda>x. (Y x, X x)) (\<lambda>(x, y). Pxy (y, x))"
hoelzl@49788
   533
proof -
hoelzl@49788
   534
  interpret S: sigma_finite_measure S by fact
hoelzl@49788
   535
  interpret T: sigma_finite_measure T by fact
hoelzl@49788
   536
  interpret ST: pair_sigma_finite S T by default
hoelzl@49788
   537
  interpret TS: pair_sigma_finite T S by default
hoelzl@49788
   538
hoelzl@50003
   539
  note Pxy[measurable]
hoelzl@49788
   540
  show ?thesis 
hoelzl@49788
   541
    apply (subst TS.distr_pair_swap)
hoelzl@49788
   542
    unfolding distributed_def
hoelzl@49788
   543
  proof safe
wenzelm@53015
   544
    let ?D = "distr (S \<Otimes>\<^sub>M T) (T \<Otimes>\<^sub>M S) (\<lambda>(x, y). (y, x))"
hoelzl@49788
   545
    show 1: "(\<lambda>(x, y). Pxy (y, x)) \<in> borel_measurable ?D"
hoelzl@50003
   546
      by auto
hoelzl@49788
   547
    with Pxy
wenzelm@53015
   548
    show "AE x in distr (S \<Otimes>\<^sub>M T) (T \<Otimes>\<^sub>M S) (\<lambda>(x, y). (y, x)). 0 \<le> (case x of (x, y) \<Rightarrow> Pxy (y, x))"
hoelzl@49788
   549
      by (subst AE_distr_iff)
hoelzl@49788
   550
         (auto dest!: distributed_AE
hoelzl@49788
   551
               simp: measurable_split_conv split_beta
hoelzl@51683
   552
               intro!: measurable_Pair)
wenzelm@53015
   553
    show 2: "random_variable (distr (S \<Otimes>\<^sub>M T) (T \<Otimes>\<^sub>M S) (\<lambda>(x, y). (y, x))) (\<lambda>x. (Y x, X x))"
hoelzl@50003
   554
      using Pxy by auto
wenzelm@53015
   555
    { fix A assume A: "A \<in> sets (T \<Otimes>\<^sub>M S)"
wenzelm@53015
   556
      let ?B = "(\<lambda>(x, y). (y, x)) -` A \<inter> space (S \<Otimes>\<^sub>M T)"
immler@50244
   557
      from sets.sets_into_space[OF A]
hoelzl@49788
   558
      have "emeasure M ((\<lambda>x. (Y x, X x)) -` A \<inter> space M) =
hoelzl@49788
   559
        emeasure M ((\<lambda>x. (X x, Y x)) -` ?B \<inter> space M)"
hoelzl@49788
   560
        by (auto intro!: arg_cong2[where f=emeasure] simp: space_pair_measure)
wenzelm@53015
   561
      also have "\<dots> = (\<integral>\<^sup>+ x. Pxy x * indicator ?B x \<partial>(S \<Otimes>\<^sub>M T))"
hoelzl@50003
   562
        using Pxy A by (intro distributed_emeasure) auto
hoelzl@49788
   563
      finally have "emeasure M ((\<lambda>x. (Y x, X x)) -` A \<inter> space M) =
wenzelm@53015
   564
        (\<integral>\<^sup>+ x. Pxy x * indicator A (snd x, fst x) \<partial>(S \<Otimes>\<^sub>M T))"
hoelzl@49788
   565
        by (auto intro!: positive_integral_cong split: split_indicator) }
hoelzl@49788
   566
    note * = this
hoelzl@49788
   567
    show "distr M ?D (\<lambda>x. (Y x, X x)) = density ?D (\<lambda>(x, y). Pxy (y, x))"
hoelzl@49788
   568
      apply (intro measure_eqI)
hoelzl@49788
   569
      apply (simp_all add: emeasure_distr[OF 2] emeasure_density[OF 1])
hoelzl@49788
   570
      apply (subst positive_integral_distr)
hoelzl@50003
   571
      apply (auto intro!: * simp: comp_def split_beta)
hoelzl@49788
   572
      done
hoelzl@49788
   573
  qed
hoelzl@36624
   574
qed
hoelzl@36624
   575
hoelzl@47694
   576
lemma (in prob_space) distr_marginal1:
hoelzl@47694
   577
  assumes "sigma_finite_measure S" "sigma_finite_measure T"
wenzelm@53015
   578
  assumes Pxy: "distributed M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) Pxy"
wenzelm@53015
   579
  defines "Px \<equiv> \<lambda>x. (\<integral>\<^sup>+z. Pxy (x, z) \<partial>T)"
hoelzl@47694
   580
  shows "distributed M S X Px"
hoelzl@47694
   581
  unfolding distributed_def
hoelzl@47694
   582
proof safe
hoelzl@47694
   583
  interpret S: sigma_finite_measure S by fact
hoelzl@47694
   584
  interpret T: sigma_finite_measure T by fact
hoelzl@47694
   585
  interpret ST: pair_sigma_finite S T by default
hoelzl@47694
   586
hoelzl@50003
   587
  note Pxy[measurable]
hoelzl@50003
   588
  show X: "X \<in> measurable M S" by simp
hoelzl@47694
   589
hoelzl@50003
   590
  show borel: "Px \<in> borel_measurable S"
hoelzl@50003
   591
    by (auto intro!: T.positive_integral_fst_measurable simp: Px_def)
hoelzl@39097
   592
wenzelm@53015
   593
  interpret Pxy: prob_space "distr M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x))"
hoelzl@50003
   594
    by (intro prob_space_distr) simp
wenzelm@53015
   595
  have "(\<integral>\<^sup>+ x. max 0 (- Pxy x) \<partial>(S \<Otimes>\<^sub>M T)) = (\<integral>\<^sup>+ x. 0 \<partial>(S \<Otimes>\<^sub>M T))"
hoelzl@47694
   596
    using Pxy
hoelzl@50003
   597
    by (intro positive_integral_cong_AE) (auto simp: max_def dest: distributed_AE)
hoelzl@49788
   598
hoelzl@47694
   599
  show "distr M S X = density S Px"
hoelzl@47694
   600
  proof (rule measure_eqI)
hoelzl@47694
   601
    fix A assume A: "A \<in> sets (distr M S X)"
hoelzl@50003
   602
    with X measurable_space[of Y M T]
wenzelm@53015
   603
    have "emeasure (distr M S X) A = emeasure (distr M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x))) (A \<times> space T)"
hoelzl@50003
   604
      by (auto simp add: emeasure_distr intro!: arg_cong[where f="emeasure M"])
wenzelm@53015
   605
    also have "\<dots> = emeasure (density (S \<Otimes>\<^sub>M T) Pxy) (A \<times> space T)"
hoelzl@47694
   606
      using Pxy by (simp add: distributed_def)
wenzelm@53015
   607
    also have "\<dots> = \<integral>\<^sup>+ x. \<integral>\<^sup>+ y. Pxy (x, y) * indicator (A \<times> space T) (x, y) \<partial>T \<partial>S"
hoelzl@47694
   608
      using A borel Pxy
hoelzl@50003
   609
      by (simp add: emeasure_density T.positive_integral_fst_measurable(2)[symmetric])
wenzelm@53015
   610
    also have "\<dots> = \<integral>\<^sup>+ x. Px x * indicator A x \<partial>S"
hoelzl@47694
   611
      apply (rule positive_integral_cong_AE)
hoelzl@49788
   612
      using Pxy[THEN distributed_AE, THEN ST.AE_pair] AE_space
hoelzl@47694
   613
    proof eventually_elim
hoelzl@49788
   614
      fix x assume "x \<in> space S" "AE y in T. 0 \<le> Pxy (x, y)"
hoelzl@47694
   615
      moreover have eq: "\<And>y. y \<in> space T \<Longrightarrow> indicator (A \<times> space T) (x, y) = indicator A x"
hoelzl@47694
   616
        by (auto simp: indicator_def)
wenzelm@53015
   617
      ultimately have "(\<integral>\<^sup>+ y. Pxy (x, y) * indicator (A \<times> space T) (x, y) \<partial>T) = (\<integral>\<^sup>+ y. Pxy (x, y) \<partial>T) * indicator A x"
hoelzl@50003
   618
        by (simp add: eq positive_integral_multc cong: positive_integral_cong)
wenzelm@53015
   619
      also have "(\<integral>\<^sup>+ y. Pxy (x, y) \<partial>T) = Px x"
hoelzl@49788
   620
        by (simp add: Px_def ereal_real positive_integral_positive)
wenzelm@53015
   621
      finally show "(\<integral>\<^sup>+ y. Pxy (x, y) * indicator (A \<times> space T) (x, y) \<partial>T) = Px x * indicator A x" .
hoelzl@47694
   622
    qed
hoelzl@47694
   623
    finally show "emeasure (distr M S X) A = emeasure (density S Px) A"
hoelzl@47694
   624
      using A borel Pxy by (simp add: emeasure_density)
hoelzl@47694
   625
  qed simp
hoelzl@47694
   626
  
hoelzl@49788
   627
  show "AE x in S. 0 \<le> Px x"
hoelzl@47694
   628
    by (simp add: Px_def positive_integral_positive real_of_ereal_pos)
hoelzl@40859
   629
qed
hoelzl@40859
   630
hoelzl@49788
   631
lemma (in prob_space) distr_marginal2:
hoelzl@49788
   632
  assumes S: "sigma_finite_measure S" and T: "sigma_finite_measure T"
wenzelm@53015
   633
  assumes Pxy: "distributed M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) Pxy"
wenzelm@53015
   634
  shows "distributed M T Y (\<lambda>y. (\<integral>\<^sup>+x. Pxy (x, y) \<partial>S))"
hoelzl@49788
   635
  using distr_marginal1[OF T S distributed_swap[OF S T]] Pxy by simp
hoelzl@49788
   636
hoelzl@49788
   637
lemma (in prob_space) distributed_marginal_eq_joint1:
hoelzl@49788
   638
  assumes T: "sigma_finite_measure T"
hoelzl@49788
   639
  assumes S: "sigma_finite_measure S"
hoelzl@49788
   640
  assumes Px: "distributed M S X Px"
wenzelm@53015
   641
  assumes Pxy: "distributed M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) Pxy"
wenzelm@53015
   642
  shows "AE x in S. Px x = (\<integral>\<^sup>+y. Pxy (x, y) \<partial>T)"
hoelzl@49788
   643
  using Px distr_marginal1[OF S T Pxy] by (rule distributed_unique)
hoelzl@49788
   644
hoelzl@49788
   645
lemma (in prob_space) distributed_marginal_eq_joint2:
hoelzl@49788
   646
  assumes T: "sigma_finite_measure T"
hoelzl@49788
   647
  assumes S: "sigma_finite_measure S"
hoelzl@49788
   648
  assumes Py: "distributed M T Y Py"
wenzelm@53015
   649
  assumes Pxy: "distributed M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) Pxy"
wenzelm@53015
   650
  shows "AE y in T. Py y = (\<integral>\<^sup>+x. Pxy (x, y) \<partial>S)"
hoelzl@49788
   651
  using Py distr_marginal2[OF S T Pxy] by (rule distributed_unique)
hoelzl@49788
   652
hoelzl@49795
   653
lemma (in prob_space) distributed_joint_indep':
hoelzl@49795
   654
  assumes S: "sigma_finite_measure S" and T: "sigma_finite_measure T"
hoelzl@50003
   655
  assumes X[measurable]: "distributed M S X Px" and Y[measurable]: "distributed M T Y Py"
wenzelm@53015
   656
  assumes indep: "distr M S X \<Otimes>\<^sub>M distr M T Y = distr M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x))"
wenzelm@53015
   657
  shows "distributed M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) (\<lambda>(x, y). Px x * Py y)"
hoelzl@49795
   658
  unfolding distributed_def
hoelzl@49795
   659
proof safe
hoelzl@49795
   660
  interpret S: sigma_finite_measure S by fact
hoelzl@49795
   661
  interpret T: sigma_finite_measure T by fact
hoelzl@49795
   662
  interpret ST: pair_sigma_finite S T by default
hoelzl@49795
   663
hoelzl@49795
   664
  interpret X: prob_space "density S Px"
hoelzl@49795
   665
    unfolding distributed_distr_eq_density[OF X, symmetric]
hoelzl@50003
   666
    by (rule prob_space_distr) simp
hoelzl@49795
   667
  have sf_X: "sigma_finite_measure (density S Px)" ..
hoelzl@49795
   668
hoelzl@49795
   669
  interpret Y: prob_space "density T Py"
hoelzl@49795
   670
    unfolding distributed_distr_eq_density[OF Y, symmetric]
hoelzl@50003
   671
    by (rule prob_space_distr) simp
hoelzl@49795
   672
  have sf_Y: "sigma_finite_measure (density T Py)" ..
hoelzl@49795
   673
wenzelm@53015
   674
  show "distr M (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x)) = density (S \<Otimes>\<^sub>M T) (\<lambda>(x, y). Px x * Py y)"
hoelzl@49795
   675
    unfolding indep[symmetric] distributed_distr_eq_density[OF X] distributed_distr_eq_density[OF Y]
hoelzl@49795
   676
    using distributed_borel_measurable[OF X] distributed_AE[OF X]
hoelzl@49795
   677
    using distributed_borel_measurable[OF Y] distributed_AE[OF Y]
hoelzl@50003
   678
    by (rule pair_measure_density[OF _ _ _ _ T sf_Y])
hoelzl@49795
   679
wenzelm@53015
   680
  show "random_variable (S \<Otimes>\<^sub>M T) (\<lambda>x. (X x, Y x))" by auto
hoelzl@49795
   681
wenzelm@53015
   682
  show Pxy: "(\<lambda>(x, y). Px x * Py y) \<in> borel_measurable (S \<Otimes>\<^sub>M T)" by auto
hoelzl@49795
   683
wenzelm@53015
   684
  show "AE x in S \<Otimes>\<^sub>M T. 0 \<le> (case x of (x, y) \<Rightarrow> Px x * Py y)"
hoelzl@51683
   685
    apply (intro ST.AE_pair_measure borel_measurable_le Pxy borel_measurable_const)
hoelzl@49795
   686
    using distributed_AE[OF X]
hoelzl@49795
   687
    apply eventually_elim
hoelzl@49795
   688
    using distributed_AE[OF Y]
hoelzl@49795
   689
    apply eventually_elim
hoelzl@49795
   690
    apply auto
hoelzl@49795
   691
    done
hoelzl@49795
   692
qed
hoelzl@49795
   693
hoelzl@47694
   694
definition
hoelzl@47694
   695
  "simple_distributed M X f \<longleftrightarrow> distributed M (count_space (X`space M)) X (\<lambda>x. ereal (f x)) \<and>
hoelzl@47694
   696
    finite (X`space M)"
hoelzl@42902
   697
hoelzl@47694
   698
lemma simple_distributed:
hoelzl@47694
   699
  "simple_distributed M X Px \<Longrightarrow> distributed M (count_space (X`space M)) X Px"
hoelzl@47694
   700
  unfolding simple_distributed_def by auto
hoelzl@42902
   701
hoelzl@47694
   702
lemma simple_distributed_finite[dest]: "simple_distributed M X P \<Longrightarrow> finite (X`space M)"
hoelzl@47694
   703
  by (simp add: simple_distributed_def)
hoelzl@42902
   704
hoelzl@47694
   705
lemma (in prob_space) distributed_simple_function_superset:
hoelzl@47694
   706
  assumes X: "simple_function M X" "\<And>x. x \<in> X ` space M \<Longrightarrow> P x = measure M (X -` {x} \<inter> space M)"
hoelzl@47694
   707
  assumes A: "X`space M \<subseteq> A" "finite A"
hoelzl@47694
   708
  defines "S \<equiv> count_space A" and "P' \<equiv> (\<lambda>x. if x \<in> X`space M then P x else 0)"
hoelzl@47694
   709
  shows "distributed M S X P'"
hoelzl@47694
   710
  unfolding distributed_def
hoelzl@47694
   711
proof safe
hoelzl@47694
   712
  show "(\<lambda>x. ereal (P' x)) \<in> borel_measurable S" unfolding S_def by simp
hoelzl@47694
   713
  show "AE x in S. 0 \<le> ereal (P' x)"
hoelzl@47694
   714
    using X by (auto simp: S_def P'_def simple_distributed_def intro!: measure_nonneg)
hoelzl@47694
   715
  show "distr M S X = density S P'"
hoelzl@47694
   716
  proof (rule measure_eqI_finite)
hoelzl@47694
   717
    show "sets (distr M S X) = Pow A" "sets (density S P') = Pow A"
hoelzl@47694
   718
      using A unfolding S_def by auto
hoelzl@47694
   719
    show "finite A" by fact
hoelzl@47694
   720
    fix a assume a: "a \<in> A"
hoelzl@47694
   721
    then have "a \<notin> X`space M \<Longrightarrow> X -` {a} \<inter> space M = {}" by auto
hoelzl@47694
   722
    with A a X have "emeasure (distr M S X) {a} = P' a"
hoelzl@47694
   723
      by (subst emeasure_distr)
hoelzl@50002
   724
         (auto simp add: S_def P'_def simple_functionD emeasure_eq_measure measurable_count_space_eq2
hoelzl@47694
   725
               intro!: arg_cong[where f=prob])
wenzelm@53015
   726
    also have "\<dots> = (\<integral>\<^sup>+x. ereal (P' a) * indicator {a} x \<partial>S)"
hoelzl@47694
   727
      using A X a
hoelzl@47694
   728
      by (subst positive_integral_cmult_indicator)
hoelzl@47694
   729
         (auto simp: S_def P'_def simple_distributed_def simple_functionD measure_nonneg)
wenzelm@53015
   730
    also have "\<dots> = (\<integral>\<^sup>+x. ereal (P' x) * indicator {a} x \<partial>S)"
hoelzl@47694
   731
      by (auto simp: indicator_def intro!: positive_integral_cong)
hoelzl@47694
   732
    also have "\<dots> = emeasure (density S P') {a}"
hoelzl@47694
   733
      using a A by (intro emeasure_density[symmetric]) (auto simp: S_def)
hoelzl@47694
   734
    finally show "emeasure (distr M S X) {a} = emeasure (density S P') {a}" .
hoelzl@47694
   735
  qed
hoelzl@47694
   736
  show "random_variable S X"
hoelzl@47694
   737
    using X(1) A by (auto simp: measurable_def simple_functionD S_def)
hoelzl@47694
   738
qed
hoelzl@42902
   739
hoelzl@47694
   740
lemma (in prob_space) simple_distributedI:
hoelzl@47694
   741
  assumes X: "simple_function M X" "\<And>x. x \<in> X ` space M \<Longrightarrow> P x = measure M (X -` {x} \<inter> space M)"
hoelzl@47694
   742
  shows "simple_distributed M X P"
hoelzl@47694
   743
  unfolding simple_distributed_def
hoelzl@47694
   744
proof
hoelzl@47694
   745
  have "distributed M (count_space (X ` space M)) X (\<lambda>x. ereal (if x \<in> X`space M then P x else 0))"
hoelzl@47694
   746
    (is "?A")
hoelzl@47694
   747
    using simple_functionD[OF X(1)] by (intro distributed_simple_function_superset[OF X]) auto
hoelzl@47694
   748
  also have "?A \<longleftrightarrow> distributed M (count_space (X ` space M)) X (\<lambda>x. ereal (P x))"
hoelzl@47694
   749
    by (rule distributed_cong_density) auto
hoelzl@47694
   750
  finally show "\<dots>" .
hoelzl@47694
   751
qed (rule simple_functionD[OF X(1)])
hoelzl@47694
   752
hoelzl@47694
   753
lemma simple_distributed_joint_finite:
hoelzl@47694
   754
  assumes X: "simple_distributed M (\<lambda>x. (X x, Y x)) Px"
hoelzl@47694
   755
  shows "finite (X ` space M)" "finite (Y ` space M)"
hoelzl@42902
   756
proof -
hoelzl@47694
   757
  have "finite ((\<lambda>x. (X x, Y x)) ` space M)"
hoelzl@47694
   758
    using X by (auto simp: simple_distributed_def simple_functionD)
hoelzl@47694
   759
  then have "finite (fst ` (\<lambda>x. (X x, Y x)) ` space M)" "finite (snd ` (\<lambda>x. (X x, Y x)) ` space M)"
hoelzl@47694
   760
    by auto
hoelzl@47694
   761
  then show fin: "finite (X ` space M)" "finite (Y ` space M)"
hoelzl@47694
   762
    by (auto simp: image_image)
hoelzl@47694
   763
qed
hoelzl@47694
   764
hoelzl@47694
   765
lemma simple_distributed_joint2_finite:
hoelzl@47694
   766
  assumes X: "simple_distributed M (\<lambda>x. (X x, Y x, Z x)) Px"
hoelzl@47694
   767
  shows "finite (X ` space M)" "finite (Y ` space M)" "finite (Z ` space M)"
hoelzl@47694
   768
proof -
hoelzl@47694
   769
  have "finite ((\<lambda>x. (X x, Y x, Z x)) ` space M)"
hoelzl@47694
   770
    using X by (auto simp: simple_distributed_def simple_functionD)
hoelzl@47694
   771
  then have "finite (fst ` (\<lambda>x. (X x, Y x, Z x)) ` space M)"
hoelzl@47694
   772
    "finite ((fst \<circ> snd) ` (\<lambda>x. (X x, Y x, Z x)) ` space M)"
hoelzl@47694
   773
    "finite ((snd \<circ> snd) ` (\<lambda>x. (X x, Y x, Z x)) ` space M)"
hoelzl@47694
   774
    by auto
hoelzl@47694
   775
  then show fin: "finite (X ` space M)" "finite (Y ` space M)" "finite (Z ` space M)"
hoelzl@47694
   776
    by (auto simp: image_image)
hoelzl@42902
   777
qed
hoelzl@42902
   778
hoelzl@47694
   779
lemma simple_distributed_simple_function:
hoelzl@47694
   780
  "simple_distributed M X Px \<Longrightarrow> simple_function M X"
hoelzl@47694
   781
  unfolding simple_distributed_def distributed_def
hoelzl@50002
   782
  by (auto simp: simple_function_def measurable_count_space_eq2)
hoelzl@47694
   783
hoelzl@47694
   784
lemma simple_distributed_measure:
hoelzl@47694
   785
  "simple_distributed M X P \<Longrightarrow> a \<in> X`space M \<Longrightarrow> P a = measure M (X -` {a} \<inter> space M)"
hoelzl@47694
   786
  using distributed_count_space[of M "X`space M" X P a, symmetric]
hoelzl@47694
   787
  by (auto simp: simple_distributed_def measure_def)
hoelzl@47694
   788
hoelzl@47694
   789
lemma simple_distributed_nonneg: "simple_distributed M X f \<Longrightarrow> x \<in> space M \<Longrightarrow> 0 \<le> f (X x)"
hoelzl@47694
   790
  by (auto simp: simple_distributed_measure measure_nonneg)
hoelzl@42860
   791
hoelzl@47694
   792
lemma (in prob_space) simple_distributed_joint:
hoelzl@47694
   793
  assumes X: "simple_distributed M (\<lambda>x. (X x, Y x)) Px"
wenzelm@53015
   794
  defines "S \<equiv> count_space (X`space M) \<Otimes>\<^sub>M count_space (Y`space M)"
hoelzl@47694
   795
  defines "P \<equiv> (\<lambda>x. if x \<in> (\<lambda>x. (X x, Y x))`space M then Px x else 0)"
hoelzl@47694
   796
  shows "distributed M S (\<lambda>x. (X x, Y x)) P"
hoelzl@47694
   797
proof -
hoelzl@47694
   798
  from simple_distributed_joint_finite[OF X, simp]
hoelzl@47694
   799
  have S_eq: "S = count_space (X`space M \<times> Y`space M)"
hoelzl@47694
   800
    by (simp add: S_def pair_measure_count_space)
hoelzl@47694
   801
  show ?thesis
hoelzl@47694
   802
    unfolding S_eq P_def
hoelzl@47694
   803
  proof (rule distributed_simple_function_superset)
hoelzl@47694
   804
    show "simple_function M (\<lambda>x. (X x, Y x))"
hoelzl@47694
   805
      using X by (rule simple_distributed_simple_function)
hoelzl@47694
   806
    fix x assume "x \<in> (\<lambda>x. (X x, Y x)) ` space M"
hoelzl@47694
   807
    from simple_distributed_measure[OF X this]
hoelzl@47694
   808
    show "Px x = prob ((\<lambda>x. (X x, Y x)) -` {x} \<inter> space M)" .
hoelzl@47694
   809
  qed auto
hoelzl@47694
   810
qed
hoelzl@42860
   811
hoelzl@47694
   812
lemma (in prob_space) simple_distributed_joint2:
hoelzl@47694
   813
  assumes X: "simple_distributed M (\<lambda>x. (X x, Y x, Z x)) Px"
wenzelm@53015
   814
  defines "S \<equiv> count_space (X`space M) \<Otimes>\<^sub>M count_space (Y`space M) \<Otimes>\<^sub>M count_space (Z`space M)"
hoelzl@47694
   815
  defines "P \<equiv> (\<lambda>x. if x \<in> (\<lambda>x. (X x, Y x, Z x))`space M then Px x else 0)"
hoelzl@47694
   816
  shows "distributed M S (\<lambda>x. (X x, Y x, Z x)) P"
hoelzl@47694
   817
proof -
hoelzl@47694
   818
  from simple_distributed_joint2_finite[OF X, simp]
hoelzl@47694
   819
  have S_eq: "S = count_space (X`space M \<times> Y`space M \<times> Z`space M)"
hoelzl@47694
   820
    by (simp add: S_def pair_measure_count_space)
hoelzl@47694
   821
  show ?thesis
hoelzl@47694
   822
    unfolding S_eq P_def
hoelzl@47694
   823
  proof (rule distributed_simple_function_superset)
hoelzl@47694
   824
    show "simple_function M (\<lambda>x. (X x, Y x, Z x))"
hoelzl@47694
   825
      using X by (rule simple_distributed_simple_function)
hoelzl@47694
   826
    fix x assume "x \<in> (\<lambda>x. (X x, Y x, Z x)) ` space M"
hoelzl@47694
   827
    from simple_distributed_measure[OF X this]
hoelzl@47694
   828
    show "Px x = prob ((\<lambda>x. (X x, Y x, Z x)) -` {x} \<inter> space M)" .
hoelzl@47694
   829
  qed auto
hoelzl@47694
   830
qed
hoelzl@47694
   831
hoelzl@47694
   832
lemma (in prob_space) simple_distributed_setsum_space:
hoelzl@47694
   833
  assumes X: "simple_distributed M X f"
hoelzl@47694
   834
  shows "setsum f (X`space M) = 1"
hoelzl@47694
   835
proof -
hoelzl@47694
   836
  from X have "setsum f (X`space M) = prob (\<Union>i\<in>X`space M. X -` {i} \<inter> space M)"
hoelzl@47694
   837
    by (subst finite_measure_finite_Union)
hoelzl@47694
   838
       (auto simp add: disjoint_family_on_def simple_distributed_measure simple_distributed_simple_function simple_functionD
hoelzl@47694
   839
             intro!: setsum_cong arg_cong[where f="prob"])
hoelzl@47694
   840
  also have "\<dots> = prob (space M)"
hoelzl@47694
   841
    by (auto intro!: arg_cong[where f=prob])
hoelzl@47694
   842
  finally show ?thesis
hoelzl@47694
   843
    using emeasure_space_1 by (simp add: emeasure_eq_measure one_ereal_def)
hoelzl@47694
   844
qed
hoelzl@42860
   845
hoelzl@47694
   846
lemma (in prob_space) distributed_marginal_eq_joint_simple:
hoelzl@47694
   847
  assumes Px: "simple_function M X"
hoelzl@47694
   848
  assumes Py: "simple_distributed M Y Py"
hoelzl@47694
   849
  assumes Pxy: "simple_distributed M (\<lambda>x. (X x, Y x)) Pxy"
hoelzl@47694
   850
  assumes y: "y \<in> Y`space M"
hoelzl@47694
   851
  shows "Py y = (\<Sum>x\<in>X`space M. if (x, y) \<in> (\<lambda>x. (X x, Y x)) ` space M then Pxy (x, y) else 0)"
hoelzl@47694
   852
proof -
hoelzl@47694
   853
  note Px = simple_distributedI[OF Px refl]
hoelzl@47694
   854
  have *: "\<And>f A. setsum (\<lambda>x. max 0 (ereal (f x))) A = ereal (setsum (\<lambda>x. max 0 (f x)) A)"
hoelzl@47694
   855
    by (simp add: setsum_ereal[symmetric] zero_ereal_def)
hoelzl@49788
   856
  from distributed_marginal_eq_joint2[OF
hoelzl@49788
   857
    sigma_finite_measure_count_space_finite
hoelzl@49788
   858
    sigma_finite_measure_count_space_finite
hoelzl@49788
   859
    simple_distributed[OF Py] simple_distributed_joint[OF Pxy],
hoelzl@47694
   860
    OF Py[THEN simple_distributed_finite] Px[THEN simple_distributed_finite]]
hoelzl@49788
   861
    y
hoelzl@49788
   862
    Px[THEN simple_distributed_finite]
hoelzl@49788
   863
    Py[THEN simple_distributed_finite]
hoelzl@47694
   864
    Pxy[THEN simple_distributed, THEN distributed_real_AE]
hoelzl@47694
   865
  show ?thesis
hoelzl@47694
   866
    unfolding AE_count_space
hoelzl@47694
   867
    apply (auto simp add: positive_integral_count_space_finite * intro!: setsum_cong split: split_max)
hoelzl@47694
   868
    done
hoelzl@47694
   869
qed
hoelzl@42860
   870
hoelzl@50419
   871
lemma distributedI_real:
hoelzl@50419
   872
  fixes f :: "'a \<Rightarrow> real"
hoelzl@50419
   873
  assumes gen: "sets M1 = sigma_sets (space M1) E" and "Int_stable E"
hoelzl@50419
   874
    and A: "range A \<subseteq> E" "(\<Union>i::nat. A i) = space M1" "\<And>i. emeasure (distr M M1 X) (A i) \<noteq> \<infinity>"
hoelzl@50419
   875
    and X: "X \<in> measurable M M1"
hoelzl@50419
   876
    and f: "f \<in> borel_measurable M1" "AE x in M1. 0 \<le> f x"
wenzelm@53015
   877
    and eq: "\<And>A. A \<in> E \<Longrightarrow> emeasure M (X -` A \<inter> space M) = (\<integral>\<^sup>+ x. f x * indicator A x \<partial>M1)"
hoelzl@50419
   878
  shows "distributed M M1 X f"
hoelzl@50419
   879
  unfolding distributed_def
hoelzl@50419
   880
proof (intro conjI)
hoelzl@50419
   881
  show "distr M M1 X = density M1 f"
hoelzl@50419
   882
  proof (rule measure_eqI_generator_eq[where A=A])
hoelzl@50419
   883
    { fix A assume A: "A \<in> E"
hoelzl@50419
   884
      then have "A \<in> sigma_sets (space M1) E" by auto
hoelzl@50419
   885
      then have "A \<in> sets M1"
hoelzl@50419
   886
        using gen by simp
hoelzl@50419
   887
      with f A eq[of A] X show "emeasure (distr M M1 X) A = emeasure (density M1 f) A"
hoelzl@50419
   888
        by (simp add: emeasure_distr emeasure_density borel_measurable_ereal
hoelzl@50419
   889
                      times_ereal.simps[symmetric] ereal_indicator
hoelzl@50419
   890
                 del: times_ereal.simps) }
hoelzl@50419
   891
    note eq_E = this
hoelzl@50419
   892
    show "Int_stable E" by fact
hoelzl@50419
   893
    { fix e assume "e \<in> E"
hoelzl@50419
   894
      then have "e \<in> sigma_sets (space M1) E" by auto
hoelzl@50419
   895
      then have "e \<in> sets M1" unfolding gen .
hoelzl@50419
   896
      then have "e \<subseteq> space M1" by (rule sets.sets_into_space) }
hoelzl@50419
   897
    then show "E \<subseteq> Pow (space M1)" by auto
hoelzl@50419
   898
    show "sets (distr M M1 X) = sigma_sets (space M1) E"
hoelzl@50419
   899
      "sets (density M1 (\<lambda>x. ereal (f x))) = sigma_sets (space M1) E"
hoelzl@50419
   900
      unfolding gen[symmetric] by auto
hoelzl@50419
   901
  qed fact+
hoelzl@50419
   902
qed (insert X f, auto)
hoelzl@50419
   903
hoelzl@50419
   904
lemma distributedI_borel_atMost:
hoelzl@50419
   905
  fixes f :: "real \<Rightarrow> real"
hoelzl@50419
   906
  assumes [measurable]: "X \<in> borel_measurable M"
hoelzl@50419
   907
    and [measurable]: "f \<in> borel_measurable borel" and f[simp]: "AE x in lborel. 0 \<le> f x"
wenzelm@53015
   908
    and g_eq: "\<And>a. (\<integral>\<^sup>+x. f x * indicator {..a} x \<partial>lborel)  = ereal (g a)"
hoelzl@50419
   909
    and M_eq: "\<And>a. emeasure M {x\<in>space M. X x \<le> a} = ereal (g a)"
hoelzl@50419
   910
  shows "distributed M lborel X f"
hoelzl@50419
   911
proof (rule distributedI_real)
hoelzl@50419
   912
  show "sets lborel = sigma_sets (space lborel) (range atMost)"
hoelzl@50419
   913
    by (simp add: borel_eq_atMost)
hoelzl@50419
   914
  show "Int_stable (range atMost :: real set set)"
hoelzl@50419
   915
    by (auto simp: Int_stable_def)
hoelzl@50419
   916
  have vimage_eq: "\<And>a. (X -` {..a} \<inter> space M) = {x\<in>space M. X x \<le> a}" by auto
hoelzl@50419
   917
  def A \<equiv> "\<lambda>i::nat. {.. real i}"
hoelzl@50419
   918
  then show "range A \<subseteq> range atMost" "(\<Union>i. A i) = space lborel"
hoelzl@50419
   919
    "\<And>i. emeasure (distr M lborel X) (A i) \<noteq> \<infinity>"
hoelzl@50419
   920
    by (auto simp: real_arch_simple emeasure_distr vimage_eq M_eq)
hoelzl@50419
   921
hoelzl@50419
   922
  fix A :: "real set" assume "A \<in> range atMost"
hoelzl@50419
   923
  then obtain a where A: "A = {..a}" by auto
wenzelm@53015
   924
  show "emeasure M (X -` A \<inter> space M) = (\<integral>\<^sup>+x. f x * indicator A x \<partial>lborel)"
hoelzl@50419
   925
    unfolding vimage_eq A M_eq g_eq ..
hoelzl@50419
   926
qed auto
hoelzl@50419
   927
hoelzl@50419
   928
lemma (in prob_space) uniform_distributed_params:
hoelzl@50419
   929
  assumes X: "distributed M MX X (\<lambda>x. indicator A x / measure MX A)"
hoelzl@50419
   930
  shows "A \<in> sets MX" "measure MX A \<noteq> 0"
hoelzl@50419
   931
proof -
hoelzl@50419
   932
  interpret X: prob_space "distr M MX X"
hoelzl@50419
   933
    using distributed_measurable[OF X] by (rule prob_space_distr)
hoelzl@50419
   934
hoelzl@50419
   935
  show "measure MX A \<noteq> 0"
hoelzl@50419
   936
  proof
hoelzl@50419
   937
    assume "measure MX A = 0"
hoelzl@50419
   938
    with X.emeasure_space_1 X.prob_space distributed_distr_eq_density[OF X]
hoelzl@50419
   939
    show False
hoelzl@50419
   940
      by (simp add: emeasure_density zero_ereal_def[symmetric])
hoelzl@50419
   941
  qed
hoelzl@50419
   942
  with measure_notin_sets[of A MX] show "A \<in> sets MX"
hoelzl@50419
   943
    by blast
hoelzl@50419
   944
qed
hoelzl@50419
   945
hoelzl@47694
   946
lemma prob_space_uniform_measure:
hoelzl@47694
   947
  assumes A: "emeasure M A \<noteq> 0" "emeasure M A \<noteq> \<infinity>"
hoelzl@47694
   948
  shows "prob_space (uniform_measure M A)"
hoelzl@47694
   949
proof
hoelzl@47694
   950
  show "emeasure (uniform_measure M A) (space (uniform_measure M A)) = 1"
hoelzl@47694
   951
    using emeasure_uniform_measure[OF emeasure_neq_0_sets[OF A(1)], of "space M"]
immler@50244
   952
    using sets.sets_into_space[OF emeasure_neq_0_sets[OF A(1)]] A
hoelzl@47694
   953
    by (simp add: Int_absorb2 emeasure_nonneg)
hoelzl@47694
   954
qed
hoelzl@47694
   955
hoelzl@47694
   956
lemma prob_space_uniform_count_measure: "finite A \<Longrightarrow> A \<noteq> {} \<Longrightarrow> prob_space (uniform_count_measure A)"
hoelzl@47694
   957
  by default (auto simp: emeasure_uniform_count_measure space_uniform_count_measure one_ereal_def)
hoelzl@42860
   958
hoelzl@35582
   959
end