src/HOL/Probability/Probability_Mass_Function.thy
author wenzelm
Sun Sep 13 22:56:52 2015 +0200 (2015-09-13)
changeset 61169 4de9ff3ea29a
parent 60602 37588fbe39f9
child 61424 c3658c18b7bc
permissions -rw-r--r--
tuned proofs -- less legacy;
hoelzl@58606
     1
(*  Title:      HOL/Probability/Probability_Mass_Function.thy
lp15@59667
     2
    Author:     Johannes Hölzl, TU München
Andreas@59023
     3
    Author:     Andreas Lochbihler, ETH Zurich
Andreas@59023
     4
*)
hoelzl@58606
     5
hoelzl@59000
     6
section \<open> Probability mass function \<close>
hoelzl@59000
     7
hoelzl@58587
     8
theory Probability_Mass_Function
hoelzl@59000
     9
imports
hoelzl@59000
    10
  Giry_Monad
hoelzl@59000
    11
  "~~/src/HOL/Library/Multiset"
hoelzl@58587
    12
begin
hoelzl@58587
    13
hoelzl@59664
    14
lemma AE_emeasure_singleton:
hoelzl@59664
    15
  assumes x: "emeasure M {x} \<noteq> 0" and ae: "AE x in M. P x" shows "P x"
hoelzl@59664
    16
proof -
hoelzl@59664
    17
  from x have x_M: "{x} \<in> sets M"
hoelzl@59664
    18
    by (auto intro: emeasure_notin_sets)
hoelzl@59664
    19
  from ae obtain N where N: "{x\<in>space M. \<not> P x} \<subseteq> N" "emeasure M N = 0" "N \<in> sets M"
hoelzl@59664
    20
    by (auto elim: AE_E)
hoelzl@59664
    21
  { assume "\<not> P x"
hoelzl@59664
    22
    with x_M[THEN sets.sets_into_space] N have "emeasure M {x} \<le> emeasure M N"
hoelzl@59664
    23
      by (intro emeasure_mono) auto
hoelzl@59664
    24
    with x N have False
hoelzl@59664
    25
      by (auto simp: emeasure_le_0_iff) }
hoelzl@59664
    26
  then show "P x" by auto
hoelzl@59664
    27
qed
hoelzl@59664
    28
hoelzl@59664
    29
lemma AE_measure_singleton: "measure M {x} \<noteq> 0 \<Longrightarrow> AE x in M. P x \<Longrightarrow> P x"
hoelzl@59664
    30
  by (metis AE_emeasure_singleton measure_def emeasure_empty measure_empty)
hoelzl@59664
    31
hoelzl@59494
    32
lemma ereal_divide': "b \<noteq> 0 \<Longrightarrow> ereal (a / b) = ereal a / ereal b"
hoelzl@59494
    33
  using ereal_divide[of a b] by simp
hoelzl@59494
    34
hoelzl@59052
    35
lemma (in finite_measure) countable_support:
hoelzl@58587
    36
  "countable {x. measure M {x} \<noteq> 0}"
hoelzl@59000
    37
proof cases
hoelzl@59000
    38
  assume "measure M (space M) = 0"
hoelzl@59000
    39
  with bounded_measure measure_le_0_iff have "{x. measure M {x} \<noteq> 0} = {}"
hoelzl@59000
    40
    by auto
hoelzl@59000
    41
  then show ?thesis
hoelzl@59000
    42
    by simp
hoelzl@59000
    43
next
hoelzl@59000
    44
  let ?M = "measure M (space M)" and ?m = "\<lambda>x. measure M {x}"
hoelzl@59000
    45
  assume "?M \<noteq> 0"
hoelzl@59000
    46
  then have *: "{x. ?m x \<noteq> 0} = (\<Union>n. {x. ?M / Suc n < ?m x})"
hoelzl@59000
    47
    using reals_Archimedean[of "?m x / ?M" for x]
hoelzl@59000
    48
    by (auto simp: field_simps not_le[symmetric] measure_nonneg divide_le_0_iff measure_le_0_iff)
hoelzl@59000
    49
  have **: "\<And>n. finite {x. ?M / Suc n < ?m x}"
hoelzl@58587
    50
  proof (rule ccontr)
hoelzl@59000
    51
    fix n assume "infinite {x. ?M / Suc n < ?m x}" (is "infinite ?X")
hoelzl@58587
    52
    then obtain X where "finite X" "card X = Suc (Suc n)" "X \<subseteq> ?X"
hoelzl@58606
    53
      by (metis infinite_arbitrarily_large)
lp15@59667
    54
    from this(3) have *: "\<And>x. x \<in> X \<Longrightarrow> ?M / Suc n \<le> ?m x"
hoelzl@59000
    55
      by auto
hoelzl@58587
    56
    { fix x assume "x \<in> X"
hoelzl@59000
    57
      from `?M \<noteq> 0` *[OF this] have "?m x \<noteq> 0" by (auto simp: field_simps measure_le_0_iff)
hoelzl@58587
    58
      then have "{x} \<in> sets M" by (auto dest: measure_notin_sets) }
hoelzl@58587
    59
    note singleton_sets = this
hoelzl@59000
    60
    have "?M < (\<Sum>x\<in>X. ?M / Suc n)"
lp15@59667
    61
      using `?M \<noteq> 0`
hoelzl@59000
    62
      by (simp add: `card X = Suc (Suc n)` real_eq_of_nat[symmetric] real_of_nat_Suc field_simps less_le measure_nonneg)
hoelzl@58587
    63
    also have "\<dots> \<le> (\<Sum>x\<in>X. ?m x)"
hoelzl@58587
    64
      by (rule setsum_mono) fact
hoelzl@58587
    65
    also have "\<dots> = measure M (\<Union>x\<in>X. {x})"
hoelzl@58587
    66
      using singleton_sets `finite X`
hoelzl@58587
    67
      by (intro finite_measure_finite_Union[symmetric]) (auto simp: disjoint_family_on_def)
hoelzl@59000
    68
    finally have "?M < measure M (\<Union>x\<in>X. {x})" .
hoelzl@59000
    69
    moreover have "measure M (\<Union>x\<in>X. {x}) \<le> ?M"
hoelzl@59000
    70
      using singleton_sets[THEN sets.sets_into_space] by (intro finite_measure_mono) auto
hoelzl@59000
    71
    ultimately show False by simp
hoelzl@58587
    72
  qed
hoelzl@58587
    73
  show ?thesis
hoelzl@58587
    74
    unfolding * by (intro countable_UN countableI_type countable_finite[OF **])
hoelzl@58587
    75
qed
hoelzl@58587
    76
hoelzl@59000
    77
lemma (in finite_measure) AE_support_countable:
hoelzl@59000
    78
  assumes [simp]: "sets M = UNIV"
hoelzl@59000
    79
  shows "(AE x in M. measure M {x} \<noteq> 0) \<longleftrightarrow> (\<exists>S. countable S \<and> (AE x in M. x \<in> S))"
hoelzl@59000
    80
proof
hoelzl@59000
    81
  assume "\<exists>S. countable S \<and> (AE x in M. x \<in> S)"
hoelzl@59000
    82
  then obtain S where S[intro]: "countable S" and ae: "AE x in M. x \<in> S"
hoelzl@59000
    83
    by auto
lp15@59667
    84
  then have "emeasure M (\<Union>x\<in>{x\<in>S. emeasure M {x} \<noteq> 0}. {x}) =
hoelzl@59000
    85
    (\<integral>\<^sup>+ x. emeasure M {x} * indicator {x\<in>S. emeasure M {x} \<noteq> 0} x \<partial>count_space UNIV)"
hoelzl@59000
    86
    by (subst emeasure_UN_countable)
hoelzl@59000
    87
       (auto simp: disjoint_family_on_def nn_integral_restrict_space[symmetric] restrict_count_space)
hoelzl@59000
    88
  also have "\<dots> = (\<integral>\<^sup>+ x. emeasure M {x} * indicator S x \<partial>count_space UNIV)"
hoelzl@59000
    89
    by (auto intro!: nn_integral_cong split: split_indicator)
hoelzl@59000
    90
  also have "\<dots> = emeasure M (\<Union>x\<in>S. {x})"
hoelzl@59000
    91
    by (subst emeasure_UN_countable)
hoelzl@59000
    92
       (auto simp: disjoint_family_on_def nn_integral_restrict_space[symmetric] restrict_count_space)
hoelzl@59000
    93
  also have "\<dots> = emeasure M (space M)"
hoelzl@59000
    94
    using ae by (intro emeasure_eq_AE) auto
hoelzl@59000
    95
  finally have "emeasure M {x \<in> space M. x\<in>S \<and> emeasure M {x} \<noteq> 0} = emeasure M (space M)"
hoelzl@59000
    96
    by (simp add: emeasure_single_in_space cong: rev_conj_cong)
hoelzl@59000
    97
  with finite_measure_compl[of "{x \<in> space M. x\<in>S \<and> emeasure M {x} \<noteq> 0}"]
hoelzl@59000
    98
  have "AE x in M. x \<in> S \<and> emeasure M {x} \<noteq> 0"
hoelzl@59000
    99
    by (intro AE_I[OF order_refl]) (auto simp: emeasure_eq_measure set_diff_eq cong: conj_cong)
hoelzl@59000
   100
  then show "AE x in M. measure M {x} \<noteq> 0"
hoelzl@59000
   101
    by (auto simp: emeasure_eq_measure)
hoelzl@59000
   102
qed (auto intro!: exI[of _ "{x. measure M {x} \<noteq> 0}"] countable_support)
hoelzl@59000
   103
hoelzl@59664
   104
subsection \<open> PMF as measure \<close>
hoelzl@59000
   105
hoelzl@58587
   106
typedef 'a pmf = "{M :: 'a measure. prob_space M \<and> sets M = UNIV \<and> (AE x in M. measure M {x} \<noteq> 0)}"
hoelzl@58587
   107
  morphisms measure_pmf Abs_pmf
hoelzl@58606
   108
  by (intro exI[of _ "uniform_measure (count_space UNIV) {undefined}"])
hoelzl@58606
   109
     (auto intro!: prob_space_uniform_measure AE_uniform_measureI)
hoelzl@58587
   110
hoelzl@58587
   111
declare [[coercion measure_pmf]]
hoelzl@58587
   112
hoelzl@58587
   113
lemma prob_space_measure_pmf: "prob_space (measure_pmf p)"
hoelzl@58587
   114
  using pmf.measure_pmf[of p] by auto
hoelzl@58587
   115
hoelzl@58587
   116
interpretation measure_pmf!: prob_space "measure_pmf M" for M
hoelzl@58587
   117
  by (rule prob_space_measure_pmf)
hoelzl@58587
   118
hoelzl@59000
   119
interpretation measure_pmf!: subprob_space "measure_pmf M" for M
hoelzl@59000
   120
  by (rule prob_space_imp_subprob_space) unfold_locales
hoelzl@59000
   121
hoelzl@59048
   122
lemma subprob_space_measure_pmf: "subprob_space (measure_pmf x)"
hoelzl@59048
   123
  by unfold_locales
hoelzl@59048
   124
hoelzl@58587
   125
locale pmf_as_measure
hoelzl@58587
   126
begin
hoelzl@58587
   127
hoelzl@58587
   128
setup_lifting type_definition_pmf
hoelzl@58587
   129
hoelzl@58587
   130
end
hoelzl@58587
   131
hoelzl@58587
   132
context
hoelzl@58587
   133
begin
hoelzl@58587
   134
hoelzl@58587
   135
interpretation pmf_as_measure .
hoelzl@58587
   136
hoelzl@58587
   137
lemma sets_measure_pmf[simp]: "sets (measure_pmf p) = UNIV"
lp15@59667
   138
  by transfer blast
hoelzl@58587
   139
hoelzl@59048
   140
lemma sets_measure_pmf_count_space[measurable_cong]:
hoelzl@59048
   141
  "sets (measure_pmf M) = sets (count_space UNIV)"
hoelzl@59000
   142
  by simp
hoelzl@59000
   143
hoelzl@58587
   144
lemma space_measure_pmf[simp]: "space (measure_pmf p) = UNIV"
hoelzl@58587
   145
  using sets_eq_imp_space_eq[of "measure_pmf p" "count_space UNIV"] by simp
hoelzl@58587
   146
hoelzl@59048
   147
lemma measure_pmf_in_subprob_algebra[measurable (raw)]: "measure_pmf x \<in> space (subprob_algebra (count_space UNIV))"
hoelzl@59048
   148
  by (simp add: space_subprob_algebra subprob_space_measure_pmf)
hoelzl@59048
   149
hoelzl@58587
   150
lemma measurable_pmf_measure1[simp]: "measurable (M :: 'a pmf) N = UNIV \<rightarrow> space N"
hoelzl@58587
   151
  by (auto simp: measurable_def)
hoelzl@58587
   152
hoelzl@58587
   153
lemma measurable_pmf_measure2[simp]: "measurable N (M :: 'a pmf) = measurable N (count_space UNIV)"
hoelzl@58587
   154
  by (intro measurable_cong_sets) simp_all
hoelzl@58587
   155
hoelzl@59664
   156
lemma measurable_pair_restrict_pmf2:
hoelzl@59664
   157
  assumes "countable A"
hoelzl@59664
   158
  assumes [measurable]: "\<And>y. y \<in> A \<Longrightarrow> (\<lambda>x. f (x, y)) \<in> measurable M L"
hoelzl@59664
   159
  shows "f \<in> measurable (M \<Otimes>\<^sub>M restrict_space (measure_pmf N) A) L" (is "f \<in> measurable ?M _")
hoelzl@59664
   160
proof -
hoelzl@59664
   161
  have [measurable_cong]: "sets (restrict_space (count_space UNIV) A) = sets (count_space A)"
hoelzl@59664
   162
    by (simp add: restrict_count_space)
hoelzl@58587
   163
hoelzl@59664
   164
  show ?thesis
hoelzl@59664
   165
    by (intro measurable_compose_countable'[where f="\<lambda>a b. f (fst b, a)" and g=snd and I=A,
hoelzl@59664
   166
                                            unfolded pair_collapse] assms)
hoelzl@59664
   167
        measurable
hoelzl@59664
   168
qed
hoelzl@58587
   169
hoelzl@59664
   170
lemma measurable_pair_restrict_pmf1:
hoelzl@59664
   171
  assumes "countable A"
hoelzl@59664
   172
  assumes [measurable]: "\<And>x. x \<in> A \<Longrightarrow> (\<lambda>y. f (x, y)) \<in> measurable N L"
hoelzl@59664
   173
  shows "f \<in> measurable (restrict_space (measure_pmf M) A \<Otimes>\<^sub>M N) L"
hoelzl@59664
   174
proof -
hoelzl@59664
   175
  have [measurable_cong]: "sets (restrict_space (count_space UNIV) A) = sets (count_space A)"
hoelzl@59664
   176
    by (simp add: restrict_count_space)
hoelzl@59000
   177
hoelzl@59664
   178
  show ?thesis
hoelzl@59664
   179
    by (intro measurable_compose_countable'[where f="\<lambda>a b. f (a, snd b)" and g=fst and I=A,
hoelzl@59664
   180
                                            unfolded pair_collapse] assms)
hoelzl@59664
   181
        measurable
hoelzl@59664
   182
qed
hoelzl@59664
   183
hoelzl@59664
   184
lift_definition pmf :: "'a pmf \<Rightarrow> 'a \<Rightarrow> real" is "\<lambda>M x. measure M {x}" .
hoelzl@59664
   185
hoelzl@59664
   186
lift_definition set_pmf :: "'a pmf \<Rightarrow> 'a set" is "\<lambda>M. {x. measure M {x} \<noteq> 0}" .
hoelzl@59664
   187
declare [[coercion set_pmf]]
hoelzl@58587
   188
hoelzl@58587
   189
lemma AE_measure_pmf: "AE x in (M::'a pmf). x \<in> M"
hoelzl@58587
   190
  by transfer simp
hoelzl@58587
   191
hoelzl@58587
   192
lemma emeasure_pmf_single_eq_zero_iff:
hoelzl@58587
   193
  fixes M :: "'a pmf"
hoelzl@58587
   194
  shows "emeasure M {y} = 0 \<longleftrightarrow> y \<notin> M"
hoelzl@58587
   195
  by transfer (simp add: finite_measure.emeasure_eq_measure[OF prob_space.finite_measure])
hoelzl@58587
   196
hoelzl@58587
   197
lemma AE_measure_pmf_iff: "(AE x in measure_pmf M. P x) \<longleftrightarrow> (\<forall>y\<in>M. P y)"
hoelzl@59664
   198
  using AE_measure_singleton[of M] AE_measure_pmf[of M]
hoelzl@59664
   199
  by (auto simp: set_pmf.rep_eq)
hoelzl@59664
   200
hoelzl@59664
   201
lemma countable_set_pmf [simp]: "countable (set_pmf p)"
hoelzl@59664
   202
  by transfer (metis prob_space.finite_measure finite_measure.countable_support)
hoelzl@59664
   203
hoelzl@59664
   204
lemma pmf_positive: "x \<in> set_pmf p \<Longrightarrow> 0 < pmf p x"
hoelzl@59664
   205
  by transfer (simp add: less_le measure_nonneg)
hoelzl@59664
   206
hoelzl@59664
   207
lemma pmf_nonneg: "0 \<le> pmf p x"
hoelzl@59664
   208
  by transfer (simp add: measure_nonneg)
hoelzl@59664
   209
hoelzl@59664
   210
lemma pmf_le_1: "pmf p x \<le> 1"
hoelzl@59664
   211
  by (simp add: pmf.rep_eq)
hoelzl@58587
   212
hoelzl@58587
   213
lemma set_pmf_not_empty: "set_pmf M \<noteq> {}"
hoelzl@58587
   214
  using AE_measure_pmf[of M] by (intro notI) simp
hoelzl@58587
   215
hoelzl@58587
   216
lemma set_pmf_iff: "x \<in> set_pmf M \<longleftrightarrow> pmf M x \<noteq> 0"
hoelzl@58587
   217
  by transfer simp
hoelzl@58587
   218
hoelzl@59664
   219
lemma set_pmf_eq: "set_pmf M = {x. pmf M x \<noteq> 0}"
hoelzl@59664
   220
  by (auto simp: set_pmf_iff)
hoelzl@59664
   221
hoelzl@59664
   222
lemma emeasure_pmf_single:
hoelzl@59664
   223
  fixes M :: "'a pmf"
hoelzl@59664
   224
  shows "emeasure M {x} = pmf M x"
hoelzl@59664
   225
  by transfer (simp add: finite_measure.emeasure_eq_measure[OF prob_space.finite_measure])
hoelzl@59664
   226
Andreas@60068
   227
lemma measure_pmf_single: "measure (measure_pmf M) {x} = pmf M x"
Andreas@60068
   228
using emeasure_pmf_single[of M x] by(simp add: measure_pmf.emeasure_eq_measure)
Andreas@60068
   229
hoelzl@59000
   230
lemma emeasure_measure_pmf_finite: "finite S \<Longrightarrow> emeasure (measure_pmf M) S = (\<Sum>s\<in>S. pmf M s)"
hoelzl@59000
   231
  by (subst emeasure_eq_setsum_singleton) (auto simp: emeasure_pmf_single)
hoelzl@59000
   232
Andreas@59023
   233
lemma measure_measure_pmf_finite: "finite S \<Longrightarrow> measure (measure_pmf M) S = setsum (pmf M) S"
hoelzl@59425
   234
  using emeasure_measure_pmf_finite[of S M] by(simp add: measure_pmf.emeasure_eq_measure)
Andreas@59023
   235
hoelzl@59000
   236
lemma nn_integral_measure_pmf_support:
hoelzl@59000
   237
  fixes f :: "'a \<Rightarrow> ereal"
hoelzl@59000
   238
  assumes f: "finite A" and nn: "\<And>x. x \<in> A \<Longrightarrow> 0 \<le> f x" "\<And>x. x \<in> set_pmf M \<Longrightarrow> x \<notin> A \<Longrightarrow> f x = 0"
hoelzl@59000
   239
  shows "(\<integral>\<^sup>+x. f x \<partial>measure_pmf M) = (\<Sum>x\<in>A. f x * pmf M x)"
hoelzl@59000
   240
proof -
hoelzl@59000
   241
  have "(\<integral>\<^sup>+x. f x \<partial>M) = (\<integral>\<^sup>+x. f x * indicator A x \<partial>M)"
hoelzl@59000
   242
    using nn by (intro nn_integral_cong_AE) (auto simp: AE_measure_pmf_iff split: split_indicator)
hoelzl@59000
   243
  also have "\<dots> = (\<Sum>x\<in>A. f x * emeasure M {x})"
hoelzl@59000
   244
    using assms by (intro nn_integral_indicator_finite) auto
hoelzl@59000
   245
  finally show ?thesis
hoelzl@59000
   246
    by (simp add: emeasure_measure_pmf_finite)
hoelzl@59000
   247
qed
hoelzl@59000
   248
hoelzl@59000
   249
lemma nn_integral_measure_pmf_finite:
hoelzl@59000
   250
  fixes f :: "'a \<Rightarrow> ereal"
hoelzl@59000
   251
  assumes f: "finite (set_pmf M)" and nn: "\<And>x. x \<in> set_pmf M \<Longrightarrow> 0 \<le> f x"
hoelzl@59000
   252
  shows "(\<integral>\<^sup>+x. f x \<partial>measure_pmf M) = (\<Sum>x\<in>set_pmf M. f x * pmf M x)"
hoelzl@59000
   253
  using assms by (intro nn_integral_measure_pmf_support) auto
hoelzl@59000
   254
lemma integrable_measure_pmf_finite:
hoelzl@59000
   255
  fixes f :: "'a \<Rightarrow> 'b::{banach, second_countable_topology}"
hoelzl@59000
   256
  shows "finite (set_pmf M) \<Longrightarrow> integrable M f"
hoelzl@59000
   257
  by (auto intro!: integrableI_bounded simp: nn_integral_measure_pmf_finite)
hoelzl@59000
   258
hoelzl@59000
   259
lemma integral_measure_pmf:
hoelzl@59000
   260
  assumes [simp]: "finite A" and "\<And>a. a \<in> set_pmf M \<Longrightarrow> f a \<noteq> 0 \<Longrightarrow> a \<in> A"
hoelzl@59000
   261
  shows "(\<integral>x. f x \<partial>measure_pmf M) = (\<Sum>a\<in>A. f a * pmf M a)"
hoelzl@59000
   262
proof -
hoelzl@59000
   263
  have "(\<integral>x. f x \<partial>measure_pmf M) = (\<integral>x. f x * indicator A x \<partial>measure_pmf M)"
hoelzl@59000
   264
    using assms(2) by (intro integral_cong_AE) (auto split: split_indicator simp: AE_measure_pmf_iff)
hoelzl@59000
   265
  also have "\<dots> = (\<Sum>a\<in>A. f a * pmf M a)"
hoelzl@59000
   266
    by (subst integral_indicator_finite_real) (auto simp: measure_def emeasure_measure_pmf_finite)
hoelzl@59000
   267
  finally show ?thesis .
hoelzl@59000
   268
qed
hoelzl@59000
   269
hoelzl@59000
   270
lemma integrable_pmf: "integrable (count_space X) (pmf M)"
hoelzl@59000
   271
proof -
hoelzl@59000
   272
  have " (\<integral>\<^sup>+ x. pmf M x \<partial>count_space X) = (\<integral>\<^sup>+ x. pmf M x \<partial>count_space (M \<inter> X))"
hoelzl@59000
   273
    by (auto simp add: nn_integral_count_space_indicator set_pmf_iff intro!: nn_integral_cong split: split_indicator)
hoelzl@59000
   274
  then have "integrable (count_space X) (pmf M) = integrable (count_space (M \<inter> X)) (pmf M)"
hoelzl@59000
   275
    by (simp add: integrable_iff_bounded pmf_nonneg)
hoelzl@59000
   276
  then show ?thesis
Andreas@59023
   277
    by (simp add: pmf.rep_eq measure_pmf.integrable_measure disjoint_family_on_def)
hoelzl@59000
   278
qed
hoelzl@59000
   279
hoelzl@59000
   280
lemma integral_pmf: "(\<integral>x. pmf M x \<partial>count_space X) = measure M X"
hoelzl@59000
   281
proof -
hoelzl@59000
   282
  have "(\<integral>x. pmf M x \<partial>count_space X) = (\<integral>\<^sup>+x. pmf M x \<partial>count_space X)"
hoelzl@59000
   283
    by (simp add: pmf_nonneg integrable_pmf nn_integral_eq_integral)
hoelzl@59000
   284
  also have "\<dots> = (\<integral>\<^sup>+x. emeasure M {x} \<partial>count_space (X \<inter> M))"
hoelzl@59000
   285
    by (auto intro!: nn_integral_cong_AE split: split_indicator
hoelzl@59000
   286
             simp: pmf.rep_eq measure_pmf.emeasure_eq_measure nn_integral_count_space_indicator
hoelzl@59000
   287
                   AE_count_space set_pmf_iff)
hoelzl@59000
   288
  also have "\<dots> = emeasure M (X \<inter> M)"
hoelzl@59000
   289
    by (rule emeasure_countable_singleton[symmetric]) (auto intro: countable_set_pmf)
hoelzl@59000
   290
  also have "\<dots> = emeasure M X"
hoelzl@59000
   291
    by (auto intro!: emeasure_eq_AE simp: AE_measure_pmf_iff)
hoelzl@59000
   292
  finally show ?thesis
hoelzl@59000
   293
    by (simp add: measure_pmf.emeasure_eq_measure)
hoelzl@59000
   294
qed
hoelzl@59000
   295
hoelzl@59000
   296
lemma integral_pmf_restrict:
hoelzl@59000
   297
  "(f::'a \<Rightarrow> 'b::{banach, second_countable_topology}) \<in> borel_measurable (count_space UNIV) \<Longrightarrow>
hoelzl@59000
   298
    (\<integral>x. f x \<partial>measure_pmf M) = (\<integral>x. f x \<partial>restrict_space M M)"
hoelzl@59000
   299
  by (auto intro!: integral_cong_AE simp add: integral_restrict_space AE_measure_pmf_iff)
hoelzl@59000
   300
hoelzl@58587
   301
lemma emeasure_pmf: "emeasure (M::'a pmf) M = 1"
hoelzl@58587
   302
proof -
hoelzl@58587
   303
  have "emeasure (M::'a pmf) M = emeasure (M::'a pmf) (space M)"
hoelzl@58587
   304
    by (intro emeasure_eq_AE) (simp_all add: AE_measure_pmf)
hoelzl@58587
   305
  then show ?thesis
hoelzl@58587
   306
    using measure_pmf.emeasure_space_1 by simp
hoelzl@58587
   307
qed
hoelzl@58587
   308
Andreas@59490
   309
lemma emeasure_pmf_UNIV [simp]: "emeasure (measure_pmf M) UNIV = 1"
Andreas@59490
   310
using measure_pmf.emeasure_space_1[of M] by simp
Andreas@59490
   311
Andreas@59023
   312
lemma in_null_sets_measure_pmfI:
Andreas@59023
   313
  "A \<inter> set_pmf p = {} \<Longrightarrow> A \<in> null_sets (measure_pmf p)"
Andreas@59023
   314
using emeasure_eq_0_AE[where ?P="\<lambda>x. x \<in> A" and M="measure_pmf p"]
Andreas@59023
   315
by(auto simp add: null_sets_def AE_measure_pmf_iff)
Andreas@59023
   316
hoelzl@59664
   317
lemma measure_subprob: "measure_pmf M \<in> space (subprob_algebra (count_space UNIV))"
hoelzl@59664
   318
  by (simp add: space_subprob_algebra subprob_space_measure_pmf)
hoelzl@59664
   319
hoelzl@59664
   320
subsection \<open> Monad Interpretation \<close>
hoelzl@59664
   321
hoelzl@59664
   322
lemma measurable_measure_pmf[measurable]:
hoelzl@59664
   323
  "(\<lambda>x. measure_pmf (M x)) \<in> measurable (count_space UNIV) (subprob_algebra (count_space UNIV))"
hoelzl@59664
   324
  by (auto simp: space_subprob_algebra intro!: prob_space_imp_subprob_space) unfold_locales
hoelzl@59664
   325
hoelzl@59664
   326
lemma bind_measure_pmf_cong:
hoelzl@59664
   327
  assumes "\<And>x. A x \<in> space (subprob_algebra N)" "\<And>x. B x \<in> space (subprob_algebra N)"
hoelzl@59664
   328
  assumes "\<And>i. i \<in> set_pmf x \<Longrightarrow> A i = B i"
hoelzl@59664
   329
  shows "bind (measure_pmf x) A = bind (measure_pmf x) B"
hoelzl@59664
   330
proof (rule measure_eqI)
hoelzl@59664
   331
  show "sets (measure_pmf x \<guillemotright>= A) = sets (measure_pmf x \<guillemotright>= B)"
hoelzl@59664
   332
    using assms by (subst (1 2) sets_bind) (auto simp: space_subprob_algebra)
hoelzl@59664
   333
next
hoelzl@59664
   334
  fix X assume "X \<in> sets (measure_pmf x \<guillemotright>= A)"
hoelzl@59664
   335
  then have X: "X \<in> sets N"
hoelzl@59664
   336
    using assms by (subst (asm) sets_bind) (auto simp: space_subprob_algebra)
hoelzl@59664
   337
  show "emeasure (measure_pmf x \<guillemotright>= A) X = emeasure (measure_pmf x \<guillemotright>= B) X"
hoelzl@59664
   338
    using assms
hoelzl@59664
   339
    by (subst (1 2) emeasure_bind[where N=N, OF _ _ X])
hoelzl@59664
   340
       (auto intro!: nn_integral_cong_AE simp: AE_measure_pmf_iff)
hoelzl@59664
   341
qed
hoelzl@59664
   342
hoelzl@59664
   343
lift_definition bind_pmf :: "'a pmf \<Rightarrow> ('a \<Rightarrow> 'b pmf ) \<Rightarrow> 'b pmf" is bind
hoelzl@59664
   344
proof (clarify, intro conjI)
hoelzl@59664
   345
  fix f :: "'a measure" and g :: "'a \<Rightarrow> 'b measure"
hoelzl@59664
   346
  assume "prob_space f"
hoelzl@59664
   347
  then interpret f: prob_space f .
hoelzl@59664
   348
  assume "sets f = UNIV" and ae_f: "AE x in f. measure f {x} \<noteq> 0"
hoelzl@59664
   349
  then have s_f[simp]: "sets f = sets (count_space UNIV)"
hoelzl@59664
   350
    by simp
hoelzl@59664
   351
  assume g: "\<And>x. prob_space (g x) \<and> sets (g x) = UNIV \<and> (AE y in g x. measure (g x) {y} \<noteq> 0)"
hoelzl@59664
   352
  then have g: "\<And>x. prob_space (g x)" and s_g[simp]: "\<And>x. sets (g x) = sets (count_space UNIV)"
hoelzl@59664
   353
    and ae_g: "\<And>x. AE y in g x. measure (g x) {y} \<noteq> 0"
hoelzl@59664
   354
    by auto
hoelzl@59664
   355
hoelzl@59664
   356
  have [measurable]: "g \<in> measurable f (subprob_algebra (count_space UNIV))"
hoelzl@59664
   357
    by (auto simp: measurable_def space_subprob_algebra prob_space_imp_subprob_space g)
lp15@59667
   358
hoelzl@59664
   359
  show "prob_space (f \<guillemotright>= g)"
hoelzl@59664
   360
    using g by (intro f.prob_space_bind[where S="count_space UNIV"]) auto
lp15@59667
   361
  then interpret fg: prob_space "f \<guillemotright>= g" .
hoelzl@59664
   362
  show [simp]: "sets (f \<guillemotright>= g) = UNIV"
hoelzl@59664
   363
    using sets_eq_imp_space_eq[OF s_f]
hoelzl@59664
   364
    by (subst sets_bind[where N="count_space UNIV"]) auto
hoelzl@59664
   365
  show "AE x in f \<guillemotright>= g. measure (f \<guillemotright>= g) {x} \<noteq> 0"
hoelzl@59664
   366
    apply (simp add: fg.prob_eq_0 AE_bind[where B="count_space UNIV"])
hoelzl@59664
   367
    using ae_f
hoelzl@59664
   368
    apply eventually_elim
hoelzl@59664
   369
    using ae_g
hoelzl@59664
   370
    apply eventually_elim
hoelzl@59664
   371
    apply (auto dest: AE_measure_singleton)
hoelzl@59664
   372
    done
hoelzl@59664
   373
qed
hoelzl@59664
   374
hoelzl@59664
   375
lemma ereal_pmf_bind: "pmf (bind_pmf N f) i = (\<integral>\<^sup>+x. pmf (f x) i \<partial>measure_pmf N)"
hoelzl@59664
   376
  unfolding pmf.rep_eq bind_pmf.rep_eq
hoelzl@59664
   377
  by (auto simp: measure_pmf.measure_bind[where N="count_space UNIV"] measure_subprob measure_nonneg
hoelzl@59664
   378
           intro!: nn_integral_eq_integral[symmetric] measure_pmf.integrable_const_bound[where B=1])
hoelzl@59664
   379
hoelzl@59664
   380
lemma pmf_bind: "pmf (bind_pmf N f) i = (\<integral>x. pmf (f x) i \<partial>measure_pmf N)"
hoelzl@59664
   381
  using ereal_pmf_bind[of N f i]
hoelzl@59664
   382
  by (subst (asm) nn_integral_eq_integral)
hoelzl@59664
   383
     (auto simp: pmf_nonneg pmf_le_1
hoelzl@59664
   384
           intro!: nn_integral_eq_integral[symmetric] measure_pmf.integrable_const_bound[where B=1])
hoelzl@59664
   385
hoelzl@59664
   386
lemma bind_pmf_const[simp]: "bind_pmf M (\<lambda>x. c) = c"
hoelzl@59664
   387
  by transfer (simp add: bind_const' prob_space_imp_subprob_space)
hoelzl@59664
   388
hoelzl@59665
   389
lemma set_bind_pmf[simp]: "set_pmf (bind_pmf M N) = (\<Union>M\<in>set_pmf M. set_pmf (N M))"
lp15@59667
   390
  unfolding set_pmf_eq ereal_eq_0(1)[symmetric] ereal_pmf_bind
hoelzl@59664
   391
  by (auto simp add: nn_integral_0_iff_AE AE_measure_pmf_iff set_pmf_eq not_le less_le pmf_nonneg)
hoelzl@59664
   392
hoelzl@59664
   393
lemma bind_pmf_cong:
hoelzl@59664
   394
  assumes "p = q"
hoelzl@59664
   395
  shows "(\<And>x. x \<in> set_pmf q \<Longrightarrow> f x = g x) \<Longrightarrow> bind_pmf p f = bind_pmf q g"
hoelzl@59664
   396
  unfolding `p = q`[symmetric] measure_pmf_inject[symmetric] bind_pmf.rep_eq
hoelzl@59664
   397
  by (auto simp: AE_measure_pmf_iff Pi_iff space_subprob_algebra subprob_space_measure_pmf
hoelzl@59664
   398
                 sets_bind[where N="count_space UNIV"] emeasure_bind[where N="count_space UNIV"]
hoelzl@59664
   399
           intro!: nn_integral_cong_AE measure_eqI)
hoelzl@59664
   400
hoelzl@59664
   401
lemma bind_pmf_cong_simp:
hoelzl@59664
   402
  "p = q \<Longrightarrow> (\<And>x. x \<in> set_pmf q =simp=> f x = g x) \<Longrightarrow> bind_pmf p f = bind_pmf q g"
hoelzl@59664
   403
  by (simp add: simp_implies_def cong: bind_pmf_cong)
hoelzl@59664
   404
hoelzl@59664
   405
lemma measure_pmf_bind: "measure_pmf (bind_pmf M f) = (measure_pmf M \<guillemotright>= (\<lambda>x. measure_pmf (f x)))"
hoelzl@59664
   406
  by transfer simp
hoelzl@59664
   407
hoelzl@59664
   408
lemma nn_integral_bind_pmf[simp]: "(\<integral>\<^sup>+x. f x \<partial>bind_pmf M N) = (\<integral>\<^sup>+x. \<integral>\<^sup>+y. f y \<partial>N x \<partial>M)"
hoelzl@59664
   409
  using measurable_measure_pmf[of N]
hoelzl@59664
   410
  unfolding measure_pmf_bind
hoelzl@59664
   411
  apply (subst (1 3) nn_integral_max_0[symmetric])
hoelzl@59664
   412
  apply (intro nn_integral_bind[where B="count_space UNIV"])
hoelzl@59664
   413
  apply auto
hoelzl@59664
   414
  done
hoelzl@59664
   415
hoelzl@59664
   416
lemma emeasure_bind_pmf[simp]: "emeasure (bind_pmf M N) X = (\<integral>\<^sup>+x. emeasure (N x) X \<partial>M)"
hoelzl@59664
   417
  using measurable_measure_pmf[of N]
hoelzl@59664
   418
  unfolding measure_pmf_bind
hoelzl@59664
   419
  by (subst emeasure_bind[where N="count_space UNIV"]) auto
lp15@59667
   420
hoelzl@59664
   421
lift_definition return_pmf :: "'a \<Rightarrow> 'a pmf" is "return (count_space UNIV)"
hoelzl@59664
   422
  by (auto intro!: prob_space_return simp: AE_return measure_return)
hoelzl@59664
   423
hoelzl@59664
   424
lemma bind_return_pmf: "bind_pmf (return_pmf x) f = f x"
hoelzl@59664
   425
  by transfer
hoelzl@59664
   426
     (auto intro!: prob_space_imp_subprob_space bind_return[where N="count_space UNIV"]
hoelzl@59664
   427
           simp: space_subprob_algebra)
hoelzl@59664
   428
hoelzl@59665
   429
lemma set_return_pmf[simp]: "set_pmf (return_pmf x) = {x}"
hoelzl@59664
   430
  by transfer (auto simp add: measure_return split: split_indicator)
hoelzl@59664
   431
hoelzl@59664
   432
lemma bind_return_pmf': "bind_pmf N return_pmf = N"
hoelzl@59664
   433
proof (transfer, clarify)
hoelzl@59664
   434
  fix N :: "'a measure" assume "sets N = UNIV" then show "N \<guillemotright>= return (count_space UNIV) = N"
hoelzl@59664
   435
    by (subst return_sets_cong[where N=N]) (simp_all add: bind_return')
hoelzl@59664
   436
qed
hoelzl@59664
   437
hoelzl@59664
   438
lemma bind_assoc_pmf: "bind_pmf (bind_pmf A B) C = bind_pmf A (\<lambda>x. bind_pmf (B x) C)"
hoelzl@59664
   439
  by transfer
hoelzl@59664
   440
     (auto intro!: bind_assoc[where N="count_space UNIV" and R="count_space UNIV"]
hoelzl@59664
   441
           simp: measurable_def space_subprob_algebra prob_space_imp_subprob_space)
hoelzl@59664
   442
hoelzl@59664
   443
definition "map_pmf f M = bind_pmf M (\<lambda>x. return_pmf (f x))"
hoelzl@59664
   444
hoelzl@59664
   445
lemma map_bind_pmf: "map_pmf f (bind_pmf M g) = bind_pmf M (\<lambda>x. map_pmf f (g x))"
hoelzl@59664
   446
  by (simp add: map_pmf_def bind_assoc_pmf)
hoelzl@59664
   447
hoelzl@59664
   448
lemma bind_map_pmf: "bind_pmf (map_pmf f M) g = bind_pmf M (\<lambda>x. g (f x))"
hoelzl@59664
   449
  by (simp add: map_pmf_def bind_assoc_pmf bind_return_pmf)
hoelzl@59664
   450
hoelzl@59664
   451
lemma map_pmf_transfer[transfer_rule]:
hoelzl@59664
   452
  "rel_fun op = (rel_fun cr_pmf cr_pmf) (\<lambda>f M. distr M (count_space UNIV) f) map_pmf"
hoelzl@59664
   453
proof -
hoelzl@59664
   454
  have "rel_fun op = (rel_fun pmf_as_measure.cr_pmf pmf_as_measure.cr_pmf)
hoelzl@59664
   455
     (\<lambda>f M. M \<guillemotright>= (return (count_space UNIV) o f)) map_pmf"
lp15@59667
   456
    unfolding map_pmf_def[abs_def] comp_def by transfer_prover
hoelzl@59664
   457
  then show ?thesis
hoelzl@59664
   458
    by (force simp: rel_fun_def cr_pmf_def bind_return_distr)
hoelzl@59664
   459
qed
hoelzl@59664
   460
hoelzl@59664
   461
lemma map_pmf_rep_eq:
hoelzl@59664
   462
  "measure_pmf (map_pmf f M) = distr (measure_pmf M) (count_space UNIV) f"
hoelzl@59664
   463
  unfolding map_pmf_def bind_pmf.rep_eq comp_def return_pmf.rep_eq
hoelzl@59664
   464
  using bind_return_distr[of M f "count_space UNIV"] by (simp add: comp_def)
hoelzl@59664
   465
hoelzl@58587
   466
lemma map_pmf_id[simp]: "map_pmf id = id"
hoelzl@58587
   467
  by (rule, transfer) (auto simp: emeasure_distr measurable_def intro!: measure_eqI)
hoelzl@58587
   468
hoelzl@59053
   469
lemma map_pmf_ident[simp]: "map_pmf (\<lambda>x. x) = (\<lambda>x. x)"
hoelzl@59053
   470
  using map_pmf_id unfolding id_def .
hoelzl@59053
   471
hoelzl@58587
   472
lemma map_pmf_compose: "map_pmf (f \<circ> g) = map_pmf f \<circ> map_pmf g"
lp15@59667
   473
  by (rule, transfer) (simp add: distr_distr[symmetric, where N="count_space UNIV"] measurable_def)
hoelzl@58587
   474
hoelzl@59000
   475
lemma map_pmf_comp: "map_pmf f (map_pmf g M) = map_pmf (\<lambda>x. f (g x)) M"
hoelzl@59000
   476
  using map_pmf_compose[of f g] by (simp add: comp_def)
hoelzl@59000
   477
hoelzl@59664
   478
lemma map_pmf_cong: "p = q \<Longrightarrow> (\<And>x. x \<in> set_pmf q \<Longrightarrow> f x = g x) \<Longrightarrow> map_pmf f p = map_pmf g q"
hoelzl@59664
   479
  unfolding map_pmf_def by (rule bind_pmf_cong) auto
hoelzl@59664
   480
hoelzl@59664
   481
lemma pmf_set_map: "set_pmf \<circ> map_pmf f = op ` f \<circ> set_pmf"
hoelzl@59665
   482
  by (auto simp add: comp_def fun_eq_iff map_pmf_def)
hoelzl@59664
   483
hoelzl@59665
   484
lemma set_map_pmf[simp]: "set_pmf (map_pmf f M) = f`set_pmf M"
hoelzl@59664
   485
  using pmf_set_map[of f] by (auto simp: comp_def fun_eq_iff)
hoelzl@58587
   486
hoelzl@59002
   487
lemma emeasure_map_pmf[simp]: "emeasure (map_pmf f M) X = emeasure M (f -` X)"
hoelzl@59664
   488
  unfolding map_pmf_rep_eq by (subst emeasure_distr) auto
hoelzl@59002
   489
hoelzl@59002
   490
lemma nn_integral_map_pmf[simp]: "(\<integral>\<^sup>+x. f x \<partial>map_pmf g M) = (\<integral>\<^sup>+x. f (g x) \<partial>M)"
hoelzl@59664
   491
  unfolding map_pmf_rep_eq by (intro nn_integral_distr) auto
hoelzl@59002
   492
Andreas@59023
   493
lemma ereal_pmf_map: "pmf (map_pmf f p) x = (\<integral>\<^sup>+ y. indicator (f -` {x}) y \<partial>measure_pmf p)"
hoelzl@59664
   494
proof (transfer fixing: f x)
Andreas@59023
   495
  fix p :: "'b measure"
Andreas@59023
   496
  presume "prob_space p"
Andreas@59023
   497
  then interpret prob_space p .
Andreas@59023
   498
  presume "sets p = UNIV"
Andreas@59023
   499
  then show "ereal (measure (distr p (count_space UNIV) f) {x}) = integral\<^sup>N p (indicator (f -` {x}))"
Andreas@59023
   500
    by(simp add: measure_distr measurable_def emeasure_eq_measure)
Andreas@59023
   501
qed simp_all
Andreas@59023
   502
Andreas@59023
   503
lemma nn_integral_pmf: "(\<integral>\<^sup>+ x. pmf p x \<partial>count_space A) = emeasure (measure_pmf p) A"
Andreas@59023
   504
proof -
Andreas@59023
   505
  have "(\<integral>\<^sup>+ x. pmf p x \<partial>count_space A) = (\<integral>\<^sup>+ x. pmf p x \<partial>count_space (A \<inter> set_pmf p))"
Andreas@59023
   506
    by(auto simp add: nn_integral_count_space_indicator indicator_def set_pmf_iff intro: nn_integral_cong)
Andreas@59023
   507
  also have "\<dots> = emeasure (measure_pmf p) (\<Union>x\<in>A \<inter> set_pmf p. {x})"
Andreas@59023
   508
    by(subst emeasure_UN_countable)(auto simp add: emeasure_pmf_single disjoint_family_on_def)
Andreas@59023
   509
  also have "\<dots> = emeasure (measure_pmf p) ((\<Union>x\<in>A \<inter> set_pmf p. {x}) \<union> {x. x \<in> A \<and> x \<notin> set_pmf p})"
Andreas@59023
   510
    by(rule emeasure_Un_null_set[symmetric])(auto intro: in_null_sets_measure_pmfI)
Andreas@59023
   511
  also have "\<dots> = emeasure (measure_pmf p) A"
Andreas@59023
   512
    by(auto intro: arg_cong2[where f=emeasure])
Andreas@59023
   513
  finally show ?thesis .
Andreas@59023
   514
qed
Andreas@59023
   515
Andreas@60068
   516
lemma map_return_pmf [simp]: "map_pmf f (return_pmf x) = return_pmf (f x)"
hoelzl@59664
   517
  by transfer (simp add: distr_return)
hoelzl@59664
   518
hoelzl@59664
   519
lemma map_pmf_const[simp]: "map_pmf (\<lambda>_. c) M = return_pmf c"
hoelzl@59664
   520
  by transfer (auto simp: prob_space.distr_const)
hoelzl@59664
   521
Andreas@60068
   522
lemma pmf_return [simp]: "pmf (return_pmf x) y = indicator {y} x"
hoelzl@59664
   523
  by transfer (simp add: measure_return)
hoelzl@59664
   524
hoelzl@59664
   525
lemma nn_integral_return_pmf[simp]: "0 \<le> f x \<Longrightarrow> (\<integral>\<^sup>+x. f x \<partial>return_pmf x) = f x"
hoelzl@59664
   526
  unfolding return_pmf.rep_eq by (intro nn_integral_return) auto
hoelzl@59664
   527
hoelzl@59664
   528
lemma emeasure_return_pmf[simp]: "emeasure (return_pmf x) X = indicator X x"
hoelzl@59664
   529
  unfolding return_pmf.rep_eq by (intro emeasure_return) auto
hoelzl@59664
   530
hoelzl@59664
   531
lemma return_pmf_inj[simp]: "return_pmf x = return_pmf y \<longleftrightarrow> x = y"
hoelzl@59664
   532
  by (metis insertI1 set_return_pmf singletonD)
hoelzl@59664
   533
hoelzl@59665
   534
lemma map_pmf_eq_return_pmf_iff:
hoelzl@59665
   535
  "map_pmf f p = return_pmf x \<longleftrightarrow> (\<forall>y \<in> set_pmf p. f y = x)"
hoelzl@59665
   536
proof
hoelzl@59665
   537
  assume "map_pmf f p = return_pmf x"
hoelzl@59665
   538
  then have "set_pmf (map_pmf f p) = set_pmf (return_pmf x)" by simp
hoelzl@59665
   539
  then show "\<forall>y \<in> set_pmf p. f y = x" by auto
hoelzl@59665
   540
next
hoelzl@59665
   541
  assume "\<forall>y \<in> set_pmf p. f y = x"
hoelzl@59665
   542
  then show "map_pmf f p = return_pmf x"
hoelzl@59665
   543
    unfolding map_pmf_const[symmetric, of _ p] by (intro map_pmf_cong) auto
hoelzl@59665
   544
qed
hoelzl@59665
   545
hoelzl@59664
   546
definition "pair_pmf A B = bind_pmf A (\<lambda>x. bind_pmf B (\<lambda>y. return_pmf (x, y)))"
hoelzl@59664
   547
hoelzl@59664
   548
lemma pmf_pair: "pmf (pair_pmf M N) (a, b) = pmf M a * pmf N b"
hoelzl@59664
   549
  unfolding pair_pmf_def pmf_bind pmf_return
hoelzl@59664
   550
  apply (subst integral_measure_pmf[where A="{b}"])
hoelzl@59664
   551
  apply (auto simp: indicator_eq_0_iff)
hoelzl@59664
   552
  apply (subst integral_measure_pmf[where A="{a}"])
hoelzl@59664
   553
  apply (auto simp: indicator_eq_0_iff setsum_nonneg_eq_0_iff pmf_nonneg)
hoelzl@59664
   554
  done
hoelzl@59664
   555
hoelzl@59665
   556
lemma set_pair_pmf[simp]: "set_pmf (pair_pmf A B) = set_pmf A \<times> set_pmf B"
hoelzl@59664
   557
  unfolding pair_pmf_def set_bind_pmf set_return_pmf by auto
hoelzl@59664
   558
hoelzl@59664
   559
lemma measure_pmf_in_subprob_space[measurable (raw)]:
hoelzl@59664
   560
  "measure_pmf M \<in> space (subprob_algebra (count_space UNIV))"
hoelzl@59664
   561
  by (simp add: space_subprob_algebra) intro_locales
hoelzl@59664
   562
hoelzl@59664
   563
lemma nn_integral_pair_pmf': "(\<integral>\<^sup>+x. f x \<partial>pair_pmf A B) = (\<integral>\<^sup>+a. \<integral>\<^sup>+b. f (a, b) \<partial>B \<partial>A)"
hoelzl@59664
   564
proof -
hoelzl@59664
   565
  have "(\<integral>\<^sup>+x. f x \<partial>pair_pmf A B) = (\<integral>\<^sup>+x. max 0 (f x) * indicator (A \<times> B) x \<partial>pair_pmf A B)"
hoelzl@59664
   566
    by (subst nn_integral_max_0[symmetric])
hoelzl@59665
   567
       (auto simp: AE_measure_pmf_iff intro!: nn_integral_cong_AE)
hoelzl@59664
   568
  also have "\<dots> = (\<integral>\<^sup>+a. \<integral>\<^sup>+b. max 0 (f (a, b)) * indicator (A \<times> B) (a, b) \<partial>B \<partial>A)"
hoelzl@59664
   569
    by (simp add: pair_pmf_def)
hoelzl@59664
   570
  also have "\<dots> = (\<integral>\<^sup>+a. \<integral>\<^sup>+b. max 0 (f (a, b)) \<partial>B \<partial>A)"
hoelzl@59664
   571
    by (auto intro!: nn_integral_cong_AE simp: AE_measure_pmf_iff)
hoelzl@59664
   572
  finally show ?thesis
hoelzl@59664
   573
    unfolding nn_integral_max_0 .
hoelzl@59664
   574
qed
hoelzl@59664
   575
hoelzl@59664
   576
lemma bind_pair_pmf:
hoelzl@59664
   577
  assumes M[measurable]: "M \<in> measurable (count_space UNIV \<Otimes>\<^sub>M count_space UNIV) (subprob_algebra N)"
hoelzl@59664
   578
  shows "measure_pmf (pair_pmf A B) \<guillemotright>= M = (measure_pmf A \<guillemotright>= (\<lambda>x. measure_pmf B \<guillemotright>= (\<lambda>y. M (x, y))))"
hoelzl@59664
   579
    (is "?L = ?R")
hoelzl@59664
   580
proof (rule measure_eqI)
hoelzl@59664
   581
  have M'[measurable]: "M \<in> measurable (pair_pmf A B) (subprob_algebra N)"
hoelzl@59664
   582
    using M[THEN measurable_space] by (simp_all add: space_pair_measure)
hoelzl@59664
   583
hoelzl@59664
   584
  note measurable_bind[where N="count_space UNIV", measurable]
hoelzl@59664
   585
  note measure_pmf_in_subprob_space[simp]
hoelzl@59664
   586
hoelzl@59664
   587
  have sets_eq_N: "sets ?L = N"
hoelzl@59664
   588
    by (subst sets_bind[OF sets_kernel[OF M']]) auto
hoelzl@59664
   589
  show "sets ?L = sets ?R"
hoelzl@59664
   590
    using measurable_space[OF M]
hoelzl@59664
   591
    by (simp add: sets_eq_N space_pair_measure space_subprob_algebra)
hoelzl@59664
   592
  fix X assume "X \<in> sets ?L"
hoelzl@59664
   593
  then have X[measurable]: "X \<in> sets N"
hoelzl@59664
   594
    unfolding sets_eq_N .
hoelzl@59664
   595
  then show "emeasure ?L X = emeasure ?R X"
hoelzl@59664
   596
    apply (simp add: emeasure_bind[OF _ M' X])
hoelzl@59664
   597
    apply (simp add: nn_integral_bind[where B="count_space UNIV"] pair_pmf_def measure_pmf_bind[of A]
Andreas@60068
   598
                     nn_integral_measure_pmf_finite emeasure_nonneg one_ereal_def[symmetric])
hoelzl@59664
   599
    apply (subst emeasure_bind[OF _ _ X])
hoelzl@59664
   600
    apply measurable
hoelzl@59664
   601
    apply (subst emeasure_bind[OF _ _ X])
hoelzl@59664
   602
    apply measurable
hoelzl@59664
   603
    done
hoelzl@59664
   604
qed
hoelzl@59664
   605
hoelzl@59664
   606
lemma map_fst_pair_pmf: "map_pmf fst (pair_pmf A B) = A"
hoelzl@59664
   607
  by (simp add: pair_pmf_def map_pmf_def bind_assoc_pmf bind_return_pmf bind_return_pmf')
hoelzl@59664
   608
hoelzl@59664
   609
lemma map_snd_pair_pmf: "map_pmf snd (pair_pmf A B) = B"
hoelzl@59664
   610
  by (simp add: pair_pmf_def map_pmf_def bind_assoc_pmf bind_return_pmf bind_return_pmf')
hoelzl@59664
   611
hoelzl@59664
   612
lemma nn_integral_pmf':
hoelzl@59664
   613
  "inj_on f A \<Longrightarrow> (\<integral>\<^sup>+x. pmf p (f x) \<partial>count_space A) = emeasure p (f ` A)"
hoelzl@59664
   614
  by (subst nn_integral_bij_count_space[where g=f and B="f`A"])
hoelzl@59664
   615
     (auto simp: bij_betw_def nn_integral_pmf)
hoelzl@59664
   616
hoelzl@59664
   617
lemma pmf_le_0_iff[simp]: "pmf M p \<le> 0 \<longleftrightarrow> pmf M p = 0"
hoelzl@59664
   618
  using pmf_nonneg[of M p] by simp
hoelzl@59664
   619
hoelzl@59664
   620
lemma min_pmf_0[simp]: "min (pmf M p) 0 = 0" "min 0 (pmf M p) = 0"
hoelzl@59664
   621
  using pmf_nonneg[of M p] by simp_all
hoelzl@59664
   622
hoelzl@59664
   623
lemma pmf_eq_0_set_pmf: "pmf M p = 0 \<longleftrightarrow> p \<notin> set_pmf M"
hoelzl@59664
   624
  unfolding set_pmf_iff by simp
hoelzl@59664
   625
hoelzl@59664
   626
lemma pmf_map_inj: "inj_on f (set_pmf M) \<Longrightarrow> x \<in> set_pmf M \<Longrightarrow> pmf (map_pmf f M) (f x) = pmf M x"
hoelzl@59664
   627
  by (auto simp: pmf.rep_eq map_pmf_rep_eq measure_distr AE_measure_pmf_iff inj_onD
hoelzl@59664
   628
           intro!: measure_pmf.finite_measure_eq_AE)
hoelzl@59664
   629
Andreas@60068
   630
lemma pmf_map_inj': "inj f \<Longrightarrow> pmf (map_pmf f M) (f x) = pmf M x"
Andreas@60068
   631
apply(cases "x \<in> set_pmf M")
Andreas@60068
   632
 apply(simp add: pmf_map_inj[OF subset_inj_on])
Andreas@60068
   633
apply(simp add: pmf_eq_0_set_pmf[symmetric])
Andreas@60068
   634
apply(auto simp add: pmf_eq_0_set_pmf dest: injD)
Andreas@60068
   635
done
Andreas@60068
   636
Andreas@60068
   637
lemma pmf_map_outside: "x \<notin> f ` set_pmf M \<Longrightarrow> pmf (map_pmf f M) x = 0"
Andreas@60068
   638
unfolding pmf_eq_0_set_pmf by simp
Andreas@60068
   639
hoelzl@59664
   640
subsection \<open> PMFs as function \<close>
hoelzl@59000
   641
hoelzl@58587
   642
context
hoelzl@58587
   643
  fixes f :: "'a \<Rightarrow> real"
hoelzl@58587
   644
  assumes nonneg: "\<And>x. 0 \<le> f x"
hoelzl@58587
   645
  assumes prob: "(\<integral>\<^sup>+x. f x \<partial>count_space UNIV) = 1"
hoelzl@58587
   646
begin
hoelzl@58587
   647
hoelzl@58587
   648
lift_definition embed_pmf :: "'a pmf" is "density (count_space UNIV) (ereal \<circ> f)"
hoelzl@58587
   649
proof (intro conjI)
hoelzl@58587
   650
  have *[simp]: "\<And>x y. ereal (f y) * indicator {x} y = ereal (f x) * indicator {x} y"
hoelzl@58587
   651
    by (simp split: split_indicator)
hoelzl@58587
   652
  show "AE x in density (count_space UNIV) (ereal \<circ> f).
hoelzl@58587
   653
    measure (density (count_space UNIV) (ereal \<circ> f)) {x} \<noteq> 0"
hoelzl@59092
   654
    by (simp add: AE_density nonneg measure_def emeasure_density max_def)
hoelzl@58587
   655
  show "prob_space (density (count_space UNIV) (ereal \<circ> f))"
wenzelm@61169
   656
    by standard (simp add: emeasure_density prob)
hoelzl@58587
   657
qed simp
hoelzl@58587
   658
hoelzl@58587
   659
lemma pmf_embed_pmf: "pmf embed_pmf x = f x"
hoelzl@58587
   660
proof transfer
hoelzl@58587
   661
  have *[simp]: "\<And>x y. ereal (f y) * indicator {x} y = ereal (f x) * indicator {x} y"
hoelzl@58587
   662
    by (simp split: split_indicator)
hoelzl@58587
   663
  fix x show "measure (density (count_space UNIV) (ereal \<circ> f)) {x} = f x"
hoelzl@59092
   664
    by transfer (simp add: measure_def emeasure_density nonneg max_def)
hoelzl@58587
   665
qed
hoelzl@58587
   666
Andreas@60068
   667
lemma set_embed_pmf: "set_pmf embed_pmf = {x. f x \<noteq> 0}"
Andreas@60068
   668
by(auto simp add: set_pmf_eq assms pmf_embed_pmf)
Andreas@60068
   669
hoelzl@58587
   670
end
hoelzl@58587
   671
hoelzl@58587
   672
lemma embed_pmf_transfer:
hoelzl@58730
   673
  "rel_fun (eq_onp (\<lambda>f. (\<forall>x. 0 \<le> f x) \<and> (\<integral>\<^sup>+x. ereal (f x) \<partial>count_space UNIV) = 1)) pmf_as_measure.cr_pmf (\<lambda>f. density (count_space UNIV) (ereal \<circ> f)) embed_pmf"
hoelzl@58587
   674
  by (auto simp: rel_fun_def eq_onp_def embed_pmf.transfer)
hoelzl@58587
   675
hoelzl@59000
   676
lemma measure_pmf_eq_density: "measure_pmf p = density (count_space UNIV) (pmf p)"
hoelzl@59000
   677
proof (transfer, elim conjE)
hoelzl@59000
   678
  fix M :: "'a measure" assume [simp]: "sets M = UNIV" and ae: "AE x in M. measure M {x} \<noteq> 0"
hoelzl@59000
   679
  assume "prob_space M" then interpret prob_space M .
hoelzl@59000
   680
  show "M = density (count_space UNIV) (\<lambda>x. ereal (measure M {x}))"
hoelzl@59000
   681
  proof (rule measure_eqI)
hoelzl@59000
   682
    fix A :: "'a set"
lp15@59667
   683
    have "(\<integral>\<^sup>+ x. ereal (measure M {x}) * indicator A x \<partial>count_space UNIV) =
hoelzl@59000
   684
      (\<integral>\<^sup>+ x. emeasure M {x} * indicator (A \<inter> {x. measure M {x} \<noteq> 0}) x \<partial>count_space UNIV)"
hoelzl@59000
   685
      by (auto intro!: nn_integral_cong simp: emeasure_eq_measure split: split_indicator)
hoelzl@59000
   686
    also have "\<dots> = (\<integral>\<^sup>+ x. emeasure M {x} \<partial>count_space (A \<inter> {x. measure M {x} \<noteq> 0}))"
hoelzl@59000
   687
      by (subst nn_integral_restrict_space[symmetric]) (auto simp: restrict_count_space)
hoelzl@59000
   688
    also have "\<dots> = emeasure M (\<Union>x\<in>(A \<inter> {x. measure M {x} \<noteq> 0}). {x})"
hoelzl@59000
   689
      by (intro emeasure_UN_countable[symmetric] countable_Int2 countable_support)
hoelzl@59000
   690
         (auto simp: disjoint_family_on_def)
hoelzl@59000
   691
    also have "\<dots> = emeasure M A"
hoelzl@59000
   692
      using ae by (intro emeasure_eq_AE) auto
hoelzl@59000
   693
    finally show " emeasure M A = emeasure (density (count_space UNIV) (\<lambda>x. ereal (measure M {x}))) A"
hoelzl@59000
   694
      using emeasure_space_1 by (simp add: emeasure_density)
hoelzl@59000
   695
  qed simp
hoelzl@59000
   696
qed
hoelzl@59000
   697
hoelzl@58587
   698
lemma td_pmf_embed_pmf:
hoelzl@58587
   699
  "type_definition pmf embed_pmf {f::'a \<Rightarrow> real. (\<forall>x. 0 \<le> f x) \<and> (\<integral>\<^sup>+x. ereal (f x) \<partial>count_space UNIV) = 1}"
hoelzl@58587
   700
  unfolding type_definition_def
hoelzl@58587
   701
proof safe
hoelzl@58587
   702
  fix p :: "'a pmf"
hoelzl@58587
   703
  have "(\<integral>\<^sup>+ x. 1 \<partial>measure_pmf p) = 1"
hoelzl@58587
   704
    using measure_pmf.emeasure_space_1[of p] by simp
hoelzl@58587
   705
  then show *: "(\<integral>\<^sup>+ x. ereal (pmf p x) \<partial>count_space UNIV) = 1"
hoelzl@58587
   706
    by (simp add: measure_pmf_eq_density nn_integral_density pmf_nonneg del: nn_integral_const)
hoelzl@58587
   707
hoelzl@58587
   708
  show "embed_pmf (pmf p) = p"
hoelzl@58587
   709
    by (intro measure_pmf_inject[THEN iffD1])
hoelzl@58587
   710
       (simp add: * embed_pmf.rep_eq pmf_nonneg measure_pmf_eq_density[of p] comp_def)
hoelzl@58587
   711
next
hoelzl@58587
   712
  fix f :: "'a \<Rightarrow> real" assume "\<forall>x. 0 \<le> f x" "(\<integral>\<^sup>+x. f x \<partial>count_space UNIV) = 1"
hoelzl@58587
   713
  then show "pmf (embed_pmf f) = f"
hoelzl@58587
   714
    by (auto intro!: pmf_embed_pmf)
hoelzl@58587
   715
qed (rule pmf_nonneg)
hoelzl@58587
   716
hoelzl@58587
   717
end
hoelzl@58587
   718
Andreas@60068
   719
lemma nn_integral_measure_pmf: "(\<integral>\<^sup>+ x. f x \<partial>measure_pmf p) = \<integral>\<^sup>+ x. ereal (pmf p x) * f x \<partial>count_space UNIV"
Andreas@60068
   720
by(simp add: measure_pmf_eq_density nn_integral_density pmf_nonneg)
Andreas@60068
   721
hoelzl@58587
   722
locale pmf_as_function
hoelzl@58587
   723
begin
hoelzl@58587
   724
hoelzl@58587
   725
setup_lifting td_pmf_embed_pmf
hoelzl@58587
   726
lp15@59667
   727
lemma set_pmf_transfer[transfer_rule]:
hoelzl@58730
   728
  assumes "bi_total A"
lp15@59667
   729
  shows "rel_fun (pcr_pmf A) (rel_set A) (\<lambda>f. {x. f x \<noteq> 0}) set_pmf"
hoelzl@58730
   730
  using `bi_total A`
hoelzl@58730
   731
  by (auto simp: pcr_pmf_def cr_pmf_def rel_fun_def rel_set_def bi_total_def Bex_def set_pmf_iff)
hoelzl@58730
   732
     metis+
hoelzl@58730
   733
hoelzl@59000
   734
end
hoelzl@59000
   735
hoelzl@59000
   736
context
hoelzl@59000
   737
begin
hoelzl@59000
   738
hoelzl@59000
   739
interpretation pmf_as_function .
hoelzl@59000
   740
hoelzl@59000
   741
lemma pmf_eqI: "(\<And>i. pmf M i = pmf N i) \<Longrightarrow> M = N"
hoelzl@59000
   742
  by transfer auto
hoelzl@59000
   743
hoelzl@59000
   744
lemma pmf_eq_iff: "M = N \<longleftrightarrow> (\<forall>i. pmf M i = pmf N i)"
hoelzl@59000
   745
  by (auto intro: pmf_eqI)
hoelzl@59000
   746
hoelzl@59664
   747
lemma bind_commute_pmf: "bind_pmf A (\<lambda>x. bind_pmf B (C x)) = bind_pmf B (\<lambda>y. bind_pmf A (\<lambda>x. C x y))"
hoelzl@59664
   748
  unfolding pmf_eq_iff pmf_bind
hoelzl@59664
   749
proof
hoelzl@59664
   750
  fix i
hoelzl@59664
   751
  interpret B: prob_space "restrict_space B B"
hoelzl@59664
   752
    by (intro prob_space_restrict_space measure_pmf.emeasure_eq_1_AE)
hoelzl@59664
   753
       (auto simp: AE_measure_pmf_iff)
hoelzl@59664
   754
  interpret A: prob_space "restrict_space A A"
hoelzl@59664
   755
    by (intro prob_space_restrict_space measure_pmf.emeasure_eq_1_AE)
hoelzl@59664
   756
       (auto simp: AE_measure_pmf_iff)
hoelzl@59664
   757
hoelzl@59664
   758
  interpret AB: pair_prob_space "restrict_space A A" "restrict_space B B"
hoelzl@59664
   759
    by unfold_locales
hoelzl@59664
   760
hoelzl@59664
   761
  have "(\<integral> x. \<integral> y. pmf (C x y) i \<partial>B \<partial>A) = (\<integral> x. (\<integral> y. pmf (C x y) i \<partial>restrict_space B B) \<partial>A)"
hoelzl@59664
   762
    by (rule integral_cong) (auto intro!: integral_pmf_restrict)
hoelzl@59664
   763
  also have "\<dots> = (\<integral> x. (\<integral> y. pmf (C x y) i \<partial>restrict_space B B) \<partial>restrict_space A A)"
hoelzl@59664
   764
    by (intro integral_pmf_restrict B.borel_measurable_lebesgue_integral measurable_pair_restrict_pmf2
hoelzl@59664
   765
              countable_set_pmf borel_measurable_count_space)
hoelzl@59664
   766
  also have "\<dots> = (\<integral> y. \<integral> x. pmf (C x y) i \<partial>restrict_space A A \<partial>restrict_space B B)"
hoelzl@59664
   767
    by (rule AB.Fubini_integral[symmetric])
hoelzl@59664
   768
       (auto intro!: AB.integrable_const_bound[where B=1] measurable_pair_restrict_pmf2
hoelzl@59664
   769
             simp: pmf_nonneg pmf_le_1 measurable_restrict_space1)
hoelzl@59664
   770
  also have "\<dots> = (\<integral> y. \<integral> x. pmf (C x y) i \<partial>restrict_space A A \<partial>B)"
hoelzl@59664
   771
    by (intro integral_pmf_restrict[symmetric] A.borel_measurable_lebesgue_integral measurable_pair_restrict_pmf2
hoelzl@59664
   772
              countable_set_pmf borel_measurable_count_space)
hoelzl@59664
   773
  also have "\<dots> = (\<integral> y. \<integral> x. pmf (C x y) i \<partial>A \<partial>B)"
hoelzl@59664
   774
    by (rule integral_cong) (auto intro!: integral_pmf_restrict[symmetric])
hoelzl@59664
   775
  finally show "(\<integral> x. \<integral> y. pmf (C x y) i \<partial>B \<partial>A) = (\<integral> y. \<integral> x. pmf (C x y) i \<partial>A \<partial>B)" .
hoelzl@59664
   776
qed
hoelzl@59664
   777
hoelzl@59664
   778
lemma pair_map_pmf1: "pair_pmf (map_pmf f A) B = map_pmf (apfst f) (pair_pmf A B)"
hoelzl@59664
   779
proof (safe intro!: pmf_eqI)
hoelzl@59664
   780
  fix a :: "'a" and b :: "'b"
hoelzl@59664
   781
  have [simp]: "\<And>c d. indicator (apfst f -` {(a, b)}) (c, d) = indicator (f -` {a}) c * (indicator {b} d::ereal)"
hoelzl@59664
   782
    by (auto split: split_indicator)
hoelzl@59664
   783
hoelzl@59664
   784
  have "ereal (pmf (pair_pmf (map_pmf f A) B) (a, b)) =
hoelzl@59664
   785
         ereal (pmf (map_pmf (apfst f) (pair_pmf A B)) (a, b))"
hoelzl@59664
   786
    unfolding pmf_pair ereal_pmf_map
hoelzl@59664
   787
    by (simp add: nn_integral_pair_pmf' max_def emeasure_pmf_single nn_integral_multc pmf_nonneg
hoelzl@59664
   788
                  emeasure_map_pmf[symmetric] del: emeasure_map_pmf)
hoelzl@59664
   789
  then show "pmf (pair_pmf (map_pmf f A) B) (a, b) = pmf (map_pmf (apfst f) (pair_pmf A B)) (a, b)"
hoelzl@59664
   790
    by simp
hoelzl@59664
   791
qed
hoelzl@59664
   792
hoelzl@59664
   793
lemma pair_map_pmf2: "pair_pmf A (map_pmf f B) = map_pmf (apsnd f) (pair_pmf A B)"
hoelzl@59664
   794
proof (safe intro!: pmf_eqI)
hoelzl@59664
   795
  fix a :: "'a" and b :: "'b"
hoelzl@59664
   796
  have [simp]: "\<And>c d. indicator (apsnd f -` {(a, b)}) (c, d) = indicator {a} c * (indicator (f -` {b}) d::ereal)"
hoelzl@59664
   797
    by (auto split: split_indicator)
hoelzl@59664
   798
hoelzl@59664
   799
  have "ereal (pmf (pair_pmf A (map_pmf f B)) (a, b)) =
hoelzl@59664
   800
         ereal (pmf (map_pmf (apsnd f) (pair_pmf A B)) (a, b))"
hoelzl@59664
   801
    unfolding pmf_pair ereal_pmf_map
hoelzl@59664
   802
    by (simp add: nn_integral_pair_pmf' max_def emeasure_pmf_single nn_integral_cmult nn_integral_multc pmf_nonneg
hoelzl@59664
   803
                  emeasure_map_pmf[symmetric] del: emeasure_map_pmf)
hoelzl@59664
   804
  then show "pmf (pair_pmf A (map_pmf f B)) (a, b) = pmf (map_pmf (apsnd f) (pair_pmf A B)) (a, b)"
hoelzl@59664
   805
    by simp
hoelzl@59664
   806
qed
hoelzl@59664
   807
hoelzl@59664
   808
lemma map_pair: "map_pmf (\<lambda>(a, b). (f a, g b)) (pair_pmf A B) = pair_pmf (map_pmf f A) (map_pmf g B)"
hoelzl@59664
   809
  by (simp add: pair_map_pmf2 pair_map_pmf1 map_pmf_comp split_beta')
hoelzl@59664
   810
hoelzl@59000
   811
end
hoelzl@59000
   812
hoelzl@59664
   813
subsection \<open> Conditional Probabilities \<close>
hoelzl@59664
   814
hoelzl@59670
   815
lemma measure_pmf_zero_iff: "measure (measure_pmf p) s = 0 \<longleftrightarrow> set_pmf p \<inter> s = {}"
hoelzl@59670
   816
  by (subst measure_pmf.prob_eq_0) (auto simp: AE_measure_pmf_iff)
hoelzl@59670
   817
hoelzl@59664
   818
context
hoelzl@59664
   819
  fixes p :: "'a pmf" and s :: "'a set"
hoelzl@59664
   820
  assumes not_empty: "set_pmf p \<inter> s \<noteq> {}"
hoelzl@59664
   821
begin
hoelzl@59664
   822
hoelzl@59664
   823
interpretation pmf_as_measure .
hoelzl@59664
   824
hoelzl@59664
   825
lemma emeasure_measure_pmf_not_zero: "emeasure (measure_pmf p) s \<noteq> 0"
hoelzl@59664
   826
proof
hoelzl@59664
   827
  assume "emeasure (measure_pmf p) s = 0"
hoelzl@59664
   828
  then have "AE x in measure_pmf p. x \<notin> s"
hoelzl@59664
   829
    by (rule AE_I[rotated]) auto
hoelzl@59664
   830
  with not_empty show False
hoelzl@59664
   831
    by (auto simp: AE_measure_pmf_iff)
hoelzl@59664
   832
qed
hoelzl@59664
   833
hoelzl@59664
   834
lemma measure_measure_pmf_not_zero: "measure (measure_pmf p) s \<noteq> 0"
hoelzl@59664
   835
  using emeasure_measure_pmf_not_zero unfolding measure_pmf.emeasure_eq_measure by simp
hoelzl@59664
   836
hoelzl@59664
   837
lift_definition cond_pmf :: "'a pmf" is
hoelzl@59664
   838
  "uniform_measure (measure_pmf p) s"
hoelzl@59664
   839
proof (intro conjI)
hoelzl@59664
   840
  show "prob_space (uniform_measure (measure_pmf p) s)"
hoelzl@59664
   841
    by (intro prob_space_uniform_measure) (auto simp: emeasure_measure_pmf_not_zero)
hoelzl@59664
   842
  show "AE x in uniform_measure (measure_pmf p) s. measure (uniform_measure (measure_pmf p) s) {x} \<noteq> 0"
hoelzl@59664
   843
    by (simp add: emeasure_measure_pmf_not_zero measure_measure_pmf_not_zero AE_uniform_measure
hoelzl@59664
   844
                  AE_measure_pmf_iff set_pmf.rep_eq)
hoelzl@59664
   845
qed simp
hoelzl@59664
   846
hoelzl@59664
   847
lemma pmf_cond: "pmf cond_pmf x = (if x \<in> s then pmf p x / measure p s else 0)"
hoelzl@59664
   848
  by transfer (simp add: emeasure_measure_pmf_not_zero pmf.rep_eq)
hoelzl@59664
   849
hoelzl@59665
   850
lemma set_cond_pmf[simp]: "set_pmf cond_pmf = set_pmf p \<inter> s"
hoelzl@59664
   851
  by (auto simp add: set_pmf_iff pmf_cond measure_measure_pmf_not_zero split: split_if_asm)
hoelzl@59664
   852
hoelzl@59664
   853
end
hoelzl@59664
   854
hoelzl@59664
   855
lemma cond_map_pmf:
hoelzl@59664
   856
  assumes "set_pmf p \<inter> f -` s \<noteq> {}"
hoelzl@59664
   857
  shows "cond_pmf (map_pmf f p) s = map_pmf f (cond_pmf p (f -` s))"
hoelzl@59664
   858
proof -
hoelzl@59664
   859
  have *: "set_pmf (map_pmf f p) \<inter> s \<noteq> {}"
hoelzl@59665
   860
    using assms by auto
hoelzl@59664
   861
  { fix x
hoelzl@59664
   862
    have "ereal (pmf (map_pmf f (cond_pmf p (f -` s))) x) =
hoelzl@59664
   863
      emeasure p (f -` s \<inter> f -` {x}) / emeasure p (f -` s)"
hoelzl@59664
   864
      unfolding ereal_pmf_map cond_pmf.rep_eq[OF assms] by (simp add: nn_integral_uniform_measure)
hoelzl@59664
   865
    also have "f -` s \<inter> f -` {x} = (if x \<in> s then f -` {x} else {})"
hoelzl@59664
   866
      by auto
hoelzl@59664
   867
    also have "emeasure p (if x \<in> s then f -` {x} else {}) / emeasure p (f -` s) =
hoelzl@59664
   868
      ereal (pmf (cond_pmf (map_pmf f p) s) x)"
hoelzl@59664
   869
      using measure_measure_pmf_not_zero[OF *]
hoelzl@59664
   870
      by (simp add: pmf_cond[OF *] ereal_divide' ereal_pmf_map measure_pmf.emeasure_eq_measure[symmetric]
hoelzl@59664
   871
               del: ereal_divide)
hoelzl@59664
   872
    finally have "ereal (pmf (cond_pmf (map_pmf f p) s) x) = ereal (pmf (map_pmf f (cond_pmf p (f -` s))) x)"
hoelzl@59664
   873
      by simp }
hoelzl@59664
   874
  then show ?thesis
hoelzl@59664
   875
    by (intro pmf_eqI) simp
hoelzl@59664
   876
qed
hoelzl@59664
   877
hoelzl@59664
   878
lemma bind_cond_pmf_cancel:
hoelzl@59670
   879
  assumes [simp]: "\<And>x. x \<in> set_pmf p \<Longrightarrow> set_pmf q \<inter> {y. R x y} \<noteq> {}"
hoelzl@59670
   880
  assumes [simp]: "\<And>y. y \<in> set_pmf q \<Longrightarrow> set_pmf p \<inter> {x. R x y} \<noteq> {}"
hoelzl@59670
   881
  assumes [simp]: "\<And>x y. x \<in> set_pmf p \<Longrightarrow> y \<in> set_pmf q \<Longrightarrow> R x y \<Longrightarrow> measure q {y. R x y} = measure p {x. R x y}"
hoelzl@59670
   882
  shows "bind_pmf p (\<lambda>x. cond_pmf q {y. R x y}) = q"
hoelzl@59664
   883
proof (rule pmf_eqI)
hoelzl@59670
   884
  fix i
hoelzl@59670
   885
  have "ereal (pmf (bind_pmf p (\<lambda>x. cond_pmf q {y. R x y})) i) =
hoelzl@59670
   886
    (\<integral>\<^sup>+x. ereal (pmf q i / measure p {x. R x i}) * ereal (indicator {x. R x i} x) \<partial>p)"
hoelzl@59670
   887
    by (auto simp add: ereal_pmf_bind AE_measure_pmf_iff pmf_cond pmf_eq_0_set_pmf intro!: nn_integral_cong_AE)
hoelzl@59670
   888
  also have "\<dots> = (pmf q i * measure p {x. R x i}) / measure p {x. R x i}"
hoelzl@59670
   889
    by (simp add: pmf_nonneg measure_nonneg zero_ereal_def[symmetric] ereal_indicator
hoelzl@59670
   890
                  nn_integral_cmult measure_pmf.emeasure_eq_measure)
hoelzl@59670
   891
  also have "\<dots> = pmf q i"
hoelzl@59670
   892
    by (cases "pmf q i = 0") (simp_all add: pmf_eq_0_set_pmf measure_measure_pmf_not_zero)
hoelzl@59670
   893
  finally show "pmf (bind_pmf p (\<lambda>x. cond_pmf q {y. R x y})) i = pmf q i"
hoelzl@59670
   894
    by simp
hoelzl@59664
   895
qed
hoelzl@59664
   896
hoelzl@59664
   897
subsection \<open> Relator \<close>
hoelzl@59664
   898
hoelzl@59664
   899
inductive rel_pmf :: "('a \<Rightarrow> 'b \<Rightarrow> bool) \<Rightarrow> 'a pmf \<Rightarrow> 'b pmf \<Rightarrow> bool"
hoelzl@59664
   900
for R p q
hoelzl@59664
   901
where
lp15@59667
   902
  "\<lbrakk> \<And>x y. (x, y) \<in> set_pmf pq \<Longrightarrow> R x y;
hoelzl@59664
   903
     map_pmf fst pq = p; map_pmf snd pq = q \<rbrakk>
hoelzl@59664
   904
  \<Longrightarrow> rel_pmf R p q"
hoelzl@59664
   905
hoelzl@59681
   906
lemma rel_pmfI:
hoelzl@59681
   907
  assumes R: "rel_set R (set_pmf p) (set_pmf q)"
hoelzl@59681
   908
  assumes eq: "\<And>x y. x \<in> set_pmf p \<Longrightarrow> y \<in> set_pmf q \<Longrightarrow> R x y \<Longrightarrow>
hoelzl@59681
   909
    measure p {x. R x y} = measure q {y. R x y}"
hoelzl@59681
   910
  shows "rel_pmf R p q"
hoelzl@59681
   911
proof
hoelzl@59681
   912
  let ?pq = "bind_pmf p (\<lambda>x. bind_pmf (cond_pmf q {y. R x y}) (\<lambda>y. return_pmf (x, y)))"
hoelzl@59681
   913
  have "\<And>x. x \<in> set_pmf p \<Longrightarrow> set_pmf q \<inter> {y. R x y} \<noteq> {}"
hoelzl@59681
   914
    using R by (auto simp: rel_set_def)
hoelzl@59681
   915
  then show "\<And>x y. (x, y) \<in> set_pmf ?pq \<Longrightarrow> R x y"
hoelzl@59681
   916
    by auto
hoelzl@59681
   917
  show "map_pmf fst ?pq = p"
Andreas@60068
   918
    by (simp add: map_bind_pmf bind_return_pmf')
hoelzl@59681
   919
hoelzl@59681
   920
  show "map_pmf snd ?pq = q"
hoelzl@59681
   921
    using R eq
Andreas@60068
   922
    apply (simp add: bind_cond_pmf_cancel map_bind_pmf bind_return_pmf')
hoelzl@59681
   923
    apply (rule bind_cond_pmf_cancel)
hoelzl@59681
   924
    apply (auto simp: rel_set_def)
hoelzl@59681
   925
    done
hoelzl@59681
   926
qed
hoelzl@59681
   927
hoelzl@59681
   928
lemma rel_pmf_imp_rel_set: "rel_pmf R p q \<Longrightarrow> rel_set R (set_pmf p) (set_pmf q)"
hoelzl@59681
   929
  by (force simp add: rel_pmf.simps rel_set_def)
hoelzl@59681
   930
hoelzl@59681
   931
lemma rel_pmfD_measure:
hoelzl@59681
   932
  assumes rel_R: "rel_pmf R p q" and R: "\<And>a b. R a b \<Longrightarrow> R a y \<longleftrightarrow> R x b"
hoelzl@59681
   933
  assumes "x \<in> set_pmf p" "y \<in> set_pmf q"
hoelzl@59681
   934
  shows "measure p {x. R x y} = measure q {y. R x y}"
hoelzl@59681
   935
proof -
hoelzl@59681
   936
  from rel_R obtain pq where pq: "\<And>x y. (x, y) \<in> set_pmf pq \<Longrightarrow> R x y"
hoelzl@59681
   937
    and eq: "p = map_pmf fst pq" "q = map_pmf snd pq"
hoelzl@59681
   938
    by (auto elim: rel_pmf.cases)
hoelzl@59681
   939
  have "measure p {x. R x y} = measure pq {x. R (fst x) y}"
hoelzl@59681
   940
    by (simp add: eq map_pmf_rep_eq measure_distr)
hoelzl@59681
   941
  also have "\<dots> = measure pq {y. R x (snd y)}"
hoelzl@59681
   942
    by (intro measure_pmf.finite_measure_eq_AE)
hoelzl@59681
   943
       (auto simp: AE_measure_pmf_iff R dest!: pq)
hoelzl@59681
   944
  also have "\<dots> = measure q {y. R x y}"
hoelzl@59681
   945
    by (simp add: eq map_pmf_rep_eq measure_distr)
hoelzl@59681
   946
  finally show "measure p {x. R x y} = measure q {y. R x y}" .
hoelzl@59681
   947
qed
hoelzl@59681
   948
hoelzl@59681
   949
lemma rel_pmf_iff_measure:
hoelzl@59681
   950
  assumes "symp R" "transp R"
hoelzl@59681
   951
  shows "rel_pmf R p q \<longleftrightarrow>
hoelzl@59681
   952
    rel_set R (set_pmf p) (set_pmf q) \<and>
hoelzl@59681
   953
    (\<forall>x\<in>set_pmf p. \<forall>y\<in>set_pmf q. R x y \<longrightarrow> measure p {x. R x y} = measure q {y. R x y})"
hoelzl@59681
   954
  by (safe intro!: rel_pmf_imp_rel_set rel_pmfI)
hoelzl@59681
   955
     (auto intro!: rel_pmfD_measure dest: sympD[OF \<open>symp R\<close>] transpD[OF \<open>transp R\<close>])
hoelzl@59681
   956
hoelzl@59681
   957
lemma quotient_rel_set_disjoint:
hoelzl@59681
   958
  "equivp R \<Longrightarrow> C \<in> UNIV // {(x, y). R x y} \<Longrightarrow> rel_set R A B \<Longrightarrow> A \<inter> C = {} \<longleftrightarrow> B \<inter> C = {}"
hoelzl@59681
   959
  using in_quotient_imp_closed[of UNIV "{(x, y). R x y}" C] 
hoelzl@59681
   960
  by (auto 0 0 simp: equivp_equiv rel_set_def set_eq_iff elim: equivpE)
hoelzl@59681
   961
     (blast dest: equivp_symp)+
hoelzl@59681
   962
hoelzl@59681
   963
lemma quotientD: "equiv X R \<Longrightarrow> A \<in> X // R \<Longrightarrow> x \<in> A \<Longrightarrow> A = R `` {x}"
hoelzl@59681
   964
  by (metis Image_singleton_iff equiv_class_eq_iff quotientE)
hoelzl@59681
   965
hoelzl@59681
   966
lemma rel_pmf_iff_equivp:
hoelzl@59681
   967
  assumes "equivp R"
hoelzl@59681
   968
  shows "rel_pmf R p q \<longleftrightarrow> (\<forall>C\<in>UNIV // {(x, y). R x y}. measure p C = measure q C)"
hoelzl@59681
   969
    (is "_ \<longleftrightarrow>   (\<forall>C\<in>_//?R. _)")
hoelzl@59681
   970
proof (subst rel_pmf_iff_measure, safe)
hoelzl@59681
   971
  show "symp R" "transp R"
hoelzl@59681
   972
    using assms by (auto simp: equivp_reflp_symp_transp)
hoelzl@59681
   973
next
hoelzl@59681
   974
  fix C assume C: "C \<in> UNIV // ?R" and R: "rel_set R (set_pmf p) (set_pmf q)"
hoelzl@59681
   975
  assume eq: "\<forall>x\<in>set_pmf p. \<forall>y\<in>set_pmf q. R x y \<longrightarrow> measure p {x. R x y} = measure q {y. R x y}"
hoelzl@59681
   976
  
hoelzl@59681
   977
  show "measure p C = measure q C"
hoelzl@59681
   978
  proof cases
hoelzl@59681
   979
    assume "p \<inter> C = {}"
hoelzl@59681
   980
    moreover then have "q \<inter> C = {}"  
hoelzl@59681
   981
      using quotient_rel_set_disjoint[OF assms C R] by simp
hoelzl@59681
   982
    ultimately show ?thesis
hoelzl@59681
   983
      unfolding measure_pmf_zero_iff[symmetric] by simp
hoelzl@59681
   984
  next
hoelzl@59681
   985
    assume "p \<inter> C \<noteq> {}"
hoelzl@59681
   986
    moreover then have "q \<inter> C \<noteq> {}"  
hoelzl@59681
   987
      using quotient_rel_set_disjoint[OF assms C R] by simp
hoelzl@59681
   988
    ultimately obtain x y where in_set: "x \<in> set_pmf p" "y \<in> set_pmf q" and in_C: "x \<in> C" "y \<in> C"
hoelzl@59681
   989
      by auto
hoelzl@59681
   990
    then have "R x y"
hoelzl@59681
   991
      using in_quotient_imp_in_rel[of UNIV ?R C x y] C assms
hoelzl@59681
   992
      by (simp add: equivp_equiv)
hoelzl@59681
   993
    with in_set eq have "measure p {x. R x y} = measure q {y. R x y}"
hoelzl@59681
   994
      by auto
hoelzl@59681
   995
    moreover have "{y. R x y} = C"
hoelzl@59681
   996
      using assms `x \<in> C` C quotientD[of UNIV ?R C x] by (simp add: equivp_equiv)
hoelzl@59681
   997
    moreover have "{x. R x y} = C"
hoelzl@59681
   998
      using assms `y \<in> C` C quotientD[of UNIV "?R" C y] sympD[of R]
hoelzl@59681
   999
      by (auto simp add: equivp_equiv elim: equivpE)
hoelzl@59681
  1000
    ultimately show ?thesis
hoelzl@59681
  1001
      by auto
hoelzl@59681
  1002
  qed
hoelzl@59681
  1003
next
hoelzl@59681
  1004
  assume eq: "\<forall>C\<in>UNIV // ?R. measure p C = measure q C"
hoelzl@59681
  1005
  show "rel_set R (set_pmf p) (set_pmf q)"
hoelzl@59681
  1006
    unfolding rel_set_def
hoelzl@59681
  1007
  proof safe
hoelzl@59681
  1008
    fix x assume x: "x \<in> set_pmf p"
hoelzl@59681
  1009
    have "{y. R x y} \<in> UNIV // ?R"
hoelzl@59681
  1010
      by (auto simp: quotient_def)
hoelzl@59681
  1011
    with eq have *: "measure q {y. R x y} = measure p {y. R x y}"
hoelzl@59681
  1012
      by auto
hoelzl@59681
  1013
    have "measure q {y. R x y} \<noteq> 0"
hoelzl@59681
  1014
      using x assms unfolding * by (auto simp: measure_pmf_zero_iff set_eq_iff dest: equivp_reflp)
hoelzl@59681
  1015
    then show "\<exists>y\<in>set_pmf q. R x y"
hoelzl@59681
  1016
      unfolding measure_pmf_zero_iff by auto
hoelzl@59681
  1017
  next
hoelzl@59681
  1018
    fix y assume y: "y \<in> set_pmf q"
hoelzl@59681
  1019
    have "{x. R x y} \<in> UNIV // ?R"
hoelzl@59681
  1020
      using assms by (auto simp: quotient_def dest: equivp_symp)
hoelzl@59681
  1021
    with eq have *: "measure p {x. R x y} = measure q {x. R x y}"
hoelzl@59681
  1022
      by auto
hoelzl@59681
  1023
    have "measure p {x. R x y} \<noteq> 0"
hoelzl@59681
  1024
      using y assms unfolding * by (auto simp: measure_pmf_zero_iff set_eq_iff dest: equivp_reflp)
hoelzl@59681
  1025
    then show "\<exists>x\<in>set_pmf p. R x y"
hoelzl@59681
  1026
      unfolding measure_pmf_zero_iff by auto
hoelzl@59681
  1027
  qed
hoelzl@59681
  1028
hoelzl@59681
  1029
  fix x y assume "x \<in> set_pmf p" "y \<in> set_pmf q" "R x y"
hoelzl@59681
  1030
  have "{y. R x y} \<in> UNIV // ?R" "{x. R x y} = {y. R x y}"
hoelzl@59681
  1031
    using assms `R x y` by (auto simp: quotient_def dest: equivp_symp equivp_transp)
hoelzl@59681
  1032
  with eq show "measure p {x. R x y} = measure q {y. R x y}"
hoelzl@59681
  1033
    by auto
hoelzl@59681
  1034
qed
hoelzl@59681
  1035
hoelzl@59664
  1036
bnf pmf: "'a pmf" map: map_pmf sets: set_pmf bd : "natLeq" rel: rel_pmf
hoelzl@59664
  1037
proof -
hoelzl@59664
  1038
  show "map_pmf id = id" by (rule map_pmf_id)
lp15@59667
  1039
  show "\<And>f g. map_pmf (f \<circ> g) = map_pmf f \<circ> map_pmf g" by (rule map_pmf_compose)
hoelzl@59664
  1040
  show "\<And>f g::'a \<Rightarrow> 'b. \<And>p. (\<And>x. x \<in> set_pmf p \<Longrightarrow> f x = g x) \<Longrightarrow> map_pmf f p = map_pmf g p"
hoelzl@59664
  1041
    by (intro map_pmf_cong refl)
hoelzl@59664
  1042
hoelzl@59664
  1043
  show "\<And>f::'a \<Rightarrow> 'b. set_pmf \<circ> map_pmf f = op ` f \<circ> set_pmf"
hoelzl@59664
  1044
    by (rule pmf_set_map)
hoelzl@59664
  1045
wenzelm@60595
  1046
  show "(card_of (set_pmf p), natLeq) \<in> ordLeq" for p :: "'s pmf"
wenzelm@60595
  1047
  proof -
hoelzl@59664
  1048
    have "(card_of (set_pmf p), card_of (UNIV :: nat set)) \<in> ordLeq"
hoelzl@59664
  1049
      by (rule card_of_ordLeqI[where f="to_nat_on (set_pmf p)"])
hoelzl@59664
  1050
         (auto intro: countable_set_pmf)
hoelzl@59664
  1051
    also have "(card_of (UNIV :: nat set), natLeq) \<in> ordLeq"
hoelzl@59664
  1052
      by (metis Field_natLeq card_of_least natLeq_Well_order)
wenzelm@60595
  1053
    finally show ?thesis .
wenzelm@60595
  1054
  qed
hoelzl@59664
  1055
hoelzl@59664
  1056
  show "\<And>R. rel_pmf R =
hoelzl@59664
  1057
         (BNF_Def.Grp {x. set_pmf x \<subseteq> {(x, y). R x y}} (map_pmf fst))\<inverse>\<inverse> OO
hoelzl@59664
  1058
         BNF_Def.Grp {x. set_pmf x \<subseteq> {(x, y). R x y}} (map_pmf snd)"
hoelzl@59664
  1059
     by (auto simp add: fun_eq_iff BNF_Def.Grp_def OO_def rel_pmf.simps)
hoelzl@59664
  1060
wenzelm@60595
  1061
  show "rel_pmf R OO rel_pmf S \<le> rel_pmf (R OO S)"
wenzelm@60595
  1062
    for R :: "'a \<Rightarrow> 'b \<Rightarrow> bool" and S :: "'b \<Rightarrow> 'c \<Rightarrow> bool"
wenzelm@60595
  1063
  proof -
wenzelm@60595
  1064
    { fix p q r
wenzelm@60595
  1065
      assume pq: "rel_pmf R p q"
wenzelm@60595
  1066
        and qr:"rel_pmf S q r"
wenzelm@60595
  1067
      from pq obtain pq where pq: "\<And>x y. (x, y) \<in> set_pmf pq \<Longrightarrow> R x y"
wenzelm@60595
  1068
        and p: "p = map_pmf fst pq" and q: "q = map_pmf snd pq" by cases auto
wenzelm@60595
  1069
      from qr obtain qr where qr: "\<And>y z. (y, z) \<in> set_pmf qr \<Longrightarrow> S y z"
wenzelm@60595
  1070
        and q': "q = map_pmf fst qr" and r: "r = map_pmf snd qr" by cases auto
wenzelm@60595
  1071
  
wenzelm@60595
  1072
      def pr \<equiv> "bind_pmf pq (\<lambda>xy. bind_pmf (cond_pmf qr {yz. fst yz = snd xy}) (\<lambda>yz. return_pmf (fst xy, snd yz)))"
wenzelm@60595
  1073
      have pr_welldefined: "\<And>y. y \<in> q \<Longrightarrow> qr \<inter> {yz. fst yz = y} \<noteq> {}"
wenzelm@60595
  1074
        by (force simp: q')
wenzelm@60595
  1075
  
wenzelm@60595
  1076
      have "rel_pmf (R OO S) p r"
wenzelm@60595
  1077
      proof (rule rel_pmf.intros)
wenzelm@60595
  1078
        fix x z assume "(x, z) \<in> pr"
wenzelm@60595
  1079
        then have "\<exists>y. (x, y) \<in> pq \<and> (y, z) \<in> qr"
wenzelm@60595
  1080
          by (auto simp: q pr_welldefined pr_def split_beta)
wenzelm@60595
  1081
        with pq qr show "(R OO S) x z"
wenzelm@60595
  1082
          by blast
wenzelm@60595
  1083
      next
wenzelm@60595
  1084
        have "map_pmf snd pr = map_pmf snd (bind_pmf q (\<lambda>y. cond_pmf qr {yz. fst yz = y}))"
wenzelm@60595
  1085
          by (simp add: pr_def q split_beta bind_map_pmf map_pmf_def[symmetric] map_bind_pmf map_pmf_comp)
wenzelm@60595
  1086
        then show "map_pmf snd pr = r"
wenzelm@60595
  1087
          unfolding r q' bind_map_pmf by (subst (asm) bind_cond_pmf_cancel) (auto simp: eq_commute)
wenzelm@60595
  1088
      qed (simp add: pr_def map_bind_pmf split_beta map_pmf_def[symmetric] p map_pmf_comp)
wenzelm@60595
  1089
    }
wenzelm@60595
  1090
    then show ?thesis
wenzelm@60595
  1091
      by(auto simp add: le_fun_def)
wenzelm@60595
  1092
  qed
hoelzl@59664
  1093
qed (fact natLeq_card_order natLeq_cinfinite)+
hoelzl@59664
  1094
hoelzl@59665
  1095
lemma rel_pmf_conj[simp]:
hoelzl@59665
  1096
  "rel_pmf (\<lambda>x y. P \<and> Q x y) x y \<longleftrightarrow> P \<and> rel_pmf Q x y"
hoelzl@59665
  1097
  "rel_pmf (\<lambda>x y. Q x y \<and> P) x y \<longleftrightarrow> P \<and> rel_pmf Q x y"
hoelzl@59665
  1098
  using set_pmf_not_empty by (fastforce simp: pmf.in_rel subset_eq)+
hoelzl@59665
  1099
hoelzl@59665
  1100
lemma rel_pmf_top[simp]: "rel_pmf top = top"
hoelzl@59665
  1101
  by (auto simp: pmf.in_rel[abs_def] fun_eq_iff map_fst_pair_pmf map_snd_pair_pmf
hoelzl@59665
  1102
           intro: exI[of _ "pair_pmf x y" for x y])
hoelzl@59665
  1103
hoelzl@59664
  1104
lemma rel_pmf_return_pmf1: "rel_pmf R (return_pmf x) M \<longleftrightarrow> (\<forall>a\<in>M. R x a)"
hoelzl@59664
  1105
proof safe
hoelzl@59664
  1106
  fix a assume "a \<in> M" "rel_pmf R (return_pmf x) M"
hoelzl@59664
  1107
  then obtain pq where *: "\<And>a b. (a, b) \<in> set_pmf pq \<Longrightarrow> R a b"
hoelzl@59664
  1108
    and eq: "return_pmf x = map_pmf fst pq" "M = map_pmf snd pq"
hoelzl@59664
  1109
    by (force elim: rel_pmf.cases)
hoelzl@59664
  1110
  moreover have "set_pmf (return_pmf x) = {x}"
hoelzl@59665
  1111
    by simp
hoelzl@59664
  1112
  with `a \<in> M` have "(x, a) \<in> pq"
hoelzl@59665
  1113
    by (force simp: eq)
hoelzl@59664
  1114
  with * show "R x a"
hoelzl@59664
  1115
    by auto
hoelzl@59664
  1116
qed (auto intro!: rel_pmf.intros[where pq="pair_pmf (return_pmf x) M"]
hoelzl@59665
  1117
          simp: map_fst_pair_pmf map_snd_pair_pmf)
hoelzl@59664
  1118
hoelzl@59664
  1119
lemma rel_pmf_return_pmf2: "rel_pmf R M (return_pmf x) \<longleftrightarrow> (\<forall>a\<in>M. R a x)"
hoelzl@59664
  1120
  by (subst pmf.rel_flip[symmetric]) (simp add: rel_pmf_return_pmf1)
hoelzl@59664
  1121
hoelzl@59664
  1122
lemma rel_return_pmf[simp]: "rel_pmf R (return_pmf x1) (return_pmf x2) = R x1 x2"
hoelzl@59664
  1123
  unfolding rel_pmf_return_pmf2 set_return_pmf by simp
hoelzl@59664
  1124
hoelzl@59664
  1125
lemma rel_pmf_False[simp]: "rel_pmf (\<lambda>x y. False) x y = False"
hoelzl@59664
  1126
  unfolding pmf.in_rel fun_eq_iff using set_pmf_not_empty by fastforce
hoelzl@59664
  1127
hoelzl@59664
  1128
lemma rel_pmf_rel_prod:
hoelzl@59664
  1129
  "rel_pmf (rel_prod R S) (pair_pmf A A') (pair_pmf B B') \<longleftrightarrow> rel_pmf R A B \<and> rel_pmf S A' B'"
hoelzl@59664
  1130
proof safe
hoelzl@59664
  1131
  assume "rel_pmf (rel_prod R S) (pair_pmf A A') (pair_pmf B B')"
hoelzl@59664
  1132
  then obtain pq where pq: "\<And>a b c d. ((a, c), (b, d)) \<in> set_pmf pq \<Longrightarrow> R a b \<and> S c d"
hoelzl@59664
  1133
    and eq: "map_pmf fst pq = pair_pmf A A'" "map_pmf snd pq = pair_pmf B B'"
hoelzl@59664
  1134
    by (force elim: rel_pmf.cases)
hoelzl@59664
  1135
  show "rel_pmf R A B"
hoelzl@59664
  1136
  proof (rule rel_pmf.intros)
hoelzl@59664
  1137
    let ?f = "\<lambda>(a, b). (fst a, fst b)"
hoelzl@59664
  1138
    have [simp]: "(\<lambda>x. fst (?f x)) = fst o fst" "(\<lambda>x. snd (?f x)) = fst o snd"
hoelzl@59664
  1139
      by auto
hoelzl@59664
  1140
hoelzl@59664
  1141
    show "map_pmf fst (map_pmf ?f pq) = A"
hoelzl@59664
  1142
      by (simp add: map_pmf_comp pmf.map_comp[symmetric] eq map_fst_pair_pmf)
hoelzl@59664
  1143
    show "map_pmf snd (map_pmf ?f pq) = B"
hoelzl@59664
  1144
      by (simp add: map_pmf_comp pmf.map_comp[symmetric] eq map_fst_pair_pmf)
hoelzl@59664
  1145
hoelzl@59664
  1146
    fix a b assume "(a, b) \<in> set_pmf (map_pmf ?f pq)"
hoelzl@59664
  1147
    then obtain c d where "((a, c), (b, d)) \<in> set_pmf pq"
hoelzl@59665
  1148
      by auto
hoelzl@59664
  1149
    from pq[OF this] show "R a b" ..
hoelzl@59664
  1150
  qed
hoelzl@59664
  1151
  show "rel_pmf S A' B'"
hoelzl@59664
  1152
  proof (rule rel_pmf.intros)
hoelzl@59664
  1153
    let ?f = "\<lambda>(a, b). (snd a, snd b)"
hoelzl@59664
  1154
    have [simp]: "(\<lambda>x. fst (?f x)) = snd o fst" "(\<lambda>x. snd (?f x)) = snd o snd"
hoelzl@59664
  1155
      by auto
hoelzl@59664
  1156
hoelzl@59664
  1157
    show "map_pmf fst (map_pmf ?f pq) = A'"
hoelzl@59664
  1158
      by (simp add: map_pmf_comp pmf.map_comp[symmetric] eq map_snd_pair_pmf)
hoelzl@59664
  1159
    show "map_pmf snd (map_pmf ?f pq) = B'"
hoelzl@59664
  1160
      by (simp add: map_pmf_comp pmf.map_comp[symmetric] eq map_snd_pair_pmf)
hoelzl@59664
  1161
hoelzl@59664
  1162
    fix c d assume "(c, d) \<in> set_pmf (map_pmf ?f pq)"
hoelzl@59664
  1163
    then obtain a b where "((a, c), (b, d)) \<in> set_pmf pq"
hoelzl@59665
  1164
      by auto
hoelzl@59664
  1165
    from pq[OF this] show "S c d" ..
hoelzl@59664
  1166
  qed
hoelzl@59664
  1167
next
hoelzl@59664
  1168
  assume "rel_pmf R A B" "rel_pmf S A' B'"
hoelzl@59664
  1169
  then obtain Rpq Spq
hoelzl@59664
  1170
    where Rpq: "\<And>a b. (a, b) \<in> set_pmf Rpq \<Longrightarrow> R a b"
hoelzl@59664
  1171
        "map_pmf fst Rpq = A" "map_pmf snd Rpq = B"
hoelzl@59664
  1172
      and Spq: "\<And>a b. (a, b) \<in> set_pmf Spq \<Longrightarrow> S a b"
hoelzl@59664
  1173
        "map_pmf fst Spq = A'" "map_pmf snd Spq = B'"
hoelzl@59664
  1174
    by (force elim: rel_pmf.cases)
hoelzl@59664
  1175
hoelzl@59664
  1176
  let ?f = "(\<lambda>((a, c), (b, d)). ((a, b), (c, d)))"
hoelzl@59664
  1177
  let ?pq = "map_pmf ?f (pair_pmf Rpq Spq)"
hoelzl@59664
  1178
  have [simp]: "(\<lambda>x. fst (?f x)) = (\<lambda>(a, b). (fst a, fst b))" "(\<lambda>x. snd (?f x)) = (\<lambda>(a, b). (snd a, snd b))"
hoelzl@59664
  1179
    by auto
hoelzl@59664
  1180
hoelzl@59664
  1181
  show "rel_pmf (rel_prod R S) (pair_pmf A A') (pair_pmf B B')"
hoelzl@59664
  1182
    by (rule rel_pmf.intros[where pq="?pq"])
hoelzl@59665
  1183
       (auto simp: map_snd_pair_pmf map_fst_pair_pmf map_pmf_comp Rpq Spq
hoelzl@59664
  1184
                   map_pair)
hoelzl@59664
  1185
qed
hoelzl@59664
  1186
lp15@59667
  1187
lemma rel_pmf_reflI:
hoelzl@59664
  1188
  assumes "\<And>x. x \<in> set_pmf p \<Longrightarrow> P x x"
hoelzl@59664
  1189
  shows "rel_pmf P p p"
hoelzl@59665
  1190
  by (rule rel_pmf.intros[where pq="map_pmf (\<lambda>x. (x, x)) p"])
hoelzl@59665
  1191
     (auto simp add: pmf.map_comp o_def assms)
hoelzl@59664
  1192
hoelzl@59664
  1193
context
hoelzl@59664
  1194
begin
hoelzl@59664
  1195
hoelzl@59664
  1196
interpretation pmf_as_measure .
hoelzl@59664
  1197
hoelzl@59664
  1198
definition "join_pmf M = bind_pmf M (\<lambda>x. x)"
hoelzl@59664
  1199
hoelzl@59664
  1200
lemma bind_eq_join_pmf: "bind_pmf M f = join_pmf (map_pmf f M)"
hoelzl@59664
  1201
  unfolding join_pmf_def bind_map_pmf ..
hoelzl@59664
  1202
hoelzl@59664
  1203
lemma join_eq_bind_pmf: "join_pmf M = bind_pmf M id"
hoelzl@59664
  1204
  by (simp add: join_pmf_def id_def)
hoelzl@59664
  1205
hoelzl@59664
  1206
lemma pmf_join: "pmf (join_pmf N) i = (\<integral>M. pmf M i \<partial>measure_pmf N)"
hoelzl@59664
  1207
  unfolding join_pmf_def pmf_bind ..
hoelzl@59664
  1208
hoelzl@59664
  1209
lemma ereal_pmf_join: "ereal (pmf (join_pmf N) i) = (\<integral>\<^sup>+M. pmf M i \<partial>measure_pmf N)"
hoelzl@59664
  1210
  unfolding join_pmf_def ereal_pmf_bind ..
hoelzl@59664
  1211
hoelzl@59665
  1212
lemma set_pmf_join_pmf[simp]: "set_pmf (join_pmf f) = (\<Union>p\<in>set_pmf f. set_pmf p)"
hoelzl@59665
  1213
  by (simp add: join_pmf_def)
hoelzl@59664
  1214
hoelzl@59664
  1215
lemma join_return_pmf: "join_pmf (return_pmf M) = M"
hoelzl@59664
  1216
  by (simp add: integral_return pmf_eq_iff pmf_join return_pmf.rep_eq)
hoelzl@59664
  1217
hoelzl@59664
  1218
lemma map_join_pmf: "map_pmf f (join_pmf AA) = join_pmf (map_pmf (map_pmf f) AA)"
hoelzl@59664
  1219
  by (simp add: join_pmf_def map_pmf_def bind_assoc_pmf bind_return_pmf)
hoelzl@59664
  1220
hoelzl@59664
  1221
lemma join_map_return_pmf: "join_pmf (map_pmf return_pmf A) = A"
hoelzl@59664
  1222
  by (simp add: join_pmf_def map_pmf_def bind_assoc_pmf bind_return_pmf bind_return_pmf')
hoelzl@59664
  1223
hoelzl@59664
  1224
end
hoelzl@59664
  1225
hoelzl@59664
  1226
lemma rel_pmf_joinI:
hoelzl@59664
  1227
  assumes "rel_pmf (rel_pmf P) p q"
hoelzl@59664
  1228
  shows "rel_pmf P (join_pmf p) (join_pmf q)"
hoelzl@59664
  1229
proof -
hoelzl@59664
  1230
  from assms obtain pq where p: "p = map_pmf fst pq"
hoelzl@59664
  1231
    and q: "q = map_pmf snd pq"
hoelzl@59664
  1232
    and P: "\<And>x y. (x, y) \<in> set_pmf pq \<Longrightarrow> rel_pmf P x y"
hoelzl@59664
  1233
    by cases auto
lp15@59667
  1234
  from P obtain PQ
hoelzl@59664
  1235
    where PQ: "\<And>x y a b. \<lbrakk> (x, y) \<in> set_pmf pq; (a, b) \<in> set_pmf (PQ x y) \<rbrakk> \<Longrightarrow> P a b"
hoelzl@59664
  1236
    and x: "\<And>x y. (x, y) \<in> set_pmf pq \<Longrightarrow> map_pmf fst (PQ x y) = x"
hoelzl@59664
  1237
    and y: "\<And>x y. (x, y) \<in> set_pmf pq \<Longrightarrow> map_pmf snd (PQ x y) = y"
hoelzl@59664
  1238
    by(metis rel_pmf.simps)
hoelzl@59664
  1239
hoelzl@59664
  1240
  let ?r = "bind_pmf pq (\<lambda>(x, y). PQ x y)"
hoelzl@59665
  1241
  have "\<And>a b. (a, b) \<in> set_pmf ?r \<Longrightarrow> P a b" by (auto intro: PQ)
hoelzl@59664
  1242
  moreover have "map_pmf fst ?r = join_pmf p" "map_pmf snd ?r = join_pmf q"
hoelzl@59664
  1243
    by (simp_all add: p q x y join_pmf_def map_bind_pmf bind_map_pmf split_def cong: bind_pmf_cong)
hoelzl@59664
  1244
  ultimately show ?thesis ..
hoelzl@59664
  1245
qed
hoelzl@59664
  1246
hoelzl@59664
  1247
lemma rel_pmf_bindI:
hoelzl@59664
  1248
  assumes pq: "rel_pmf R p q"
hoelzl@59664
  1249
  and fg: "\<And>x y. R x y \<Longrightarrow> rel_pmf P (f x) (g y)"
hoelzl@59664
  1250
  shows "rel_pmf P (bind_pmf p f) (bind_pmf q g)"
hoelzl@59664
  1251
  unfolding bind_eq_join_pmf
hoelzl@59664
  1252
  by (rule rel_pmf_joinI)
hoelzl@59664
  1253
     (auto simp add: pmf.rel_map intro: pmf.rel_mono[THEN le_funD, THEN le_funD, THEN le_boolD, THEN mp, OF _ pq] fg)
hoelzl@59664
  1254
hoelzl@59664
  1255
text {*
hoelzl@59664
  1256
  Proof that @{const rel_pmf} preserves orders.
lp15@59667
  1257
  Antisymmetry proof follows Thm. 1 in N. Saheb-Djahromi, Cpo's of measures for nondeterminism,
lp15@59667
  1258
  Theoretical Computer Science 12(1):19--37, 1980,
hoelzl@59664
  1259
  @{url "http://dx.doi.org/10.1016/0304-3975(80)90003-1"}
hoelzl@59664
  1260
*}
hoelzl@59664
  1261
lp15@59667
  1262
lemma
hoelzl@59664
  1263
  assumes *: "rel_pmf R p q"
hoelzl@59664
  1264
  and refl: "reflp R" and trans: "transp R"
hoelzl@59664
  1265
  shows measure_Ici: "measure p {y. R x y} \<le> measure q {y. R x y}" (is ?thesis1)
hoelzl@59664
  1266
  and measure_Ioi: "measure p {y. R x y \<and> \<not> R y x} \<le> measure q {y. R x y \<and> \<not> R y x}" (is ?thesis2)
hoelzl@59664
  1267
proof -
hoelzl@59664
  1268
  from * obtain pq
hoelzl@59664
  1269
    where pq: "\<And>x y. (x, y) \<in> set_pmf pq \<Longrightarrow> R x y"
hoelzl@59664
  1270
    and p: "p = map_pmf fst pq"
hoelzl@59664
  1271
    and q: "q = map_pmf snd pq"
hoelzl@59664
  1272
    by cases auto
hoelzl@59664
  1273
  show ?thesis1 ?thesis2 unfolding p q map_pmf_rep_eq using refl trans
hoelzl@59664
  1274
    by(auto 4 3 simp add: measure_distr reflpD AE_measure_pmf_iff intro!: measure_pmf.finite_measure_mono_AE dest!: pq elim: transpE)
hoelzl@59664
  1275
qed
hoelzl@59664
  1276
hoelzl@59664
  1277
lemma rel_pmf_inf:
hoelzl@59664
  1278
  fixes p q :: "'a pmf"
hoelzl@59664
  1279
  assumes 1: "rel_pmf R p q"
hoelzl@59664
  1280
  assumes 2: "rel_pmf R q p"
hoelzl@59664
  1281
  and refl: "reflp R" and trans: "transp R"
hoelzl@59664
  1282
  shows "rel_pmf (inf R R\<inverse>\<inverse>) p q"
hoelzl@59681
  1283
proof (subst rel_pmf_iff_equivp, safe)
hoelzl@59681
  1284
  show "equivp (inf R R\<inverse>\<inverse>)"
hoelzl@59681
  1285
    using trans refl by (auto simp: equivp_reflp_symp_transp intro: sympI transpI reflpI dest: transpD reflpD)
hoelzl@59681
  1286
  
hoelzl@59681
  1287
  fix C assume "C \<in> UNIV // {(x, y). inf R R\<inverse>\<inverse> x y}"
hoelzl@59681
  1288
  then obtain x where C: "C = {y. R x y \<and> R y x}"
hoelzl@59681
  1289
    by (auto elim: quotientE)
hoelzl@59681
  1290
hoelzl@59670
  1291
  let ?R = "\<lambda>x y. R x y \<and> R y x"
hoelzl@59670
  1292
  let ?\<mu>R = "\<lambda>y. measure q {x. ?R x y}"
hoelzl@59681
  1293
  have "measure p {y. ?R x y} = measure p ({y. R x y} - {y. R x y \<and> \<not> R y x})"
hoelzl@59681
  1294
    by(auto intro!: arg_cong[where f="measure p"])
hoelzl@59681
  1295
  also have "\<dots> = measure p {y. R x y} - measure p {y. R x y \<and> \<not> R y x}"
hoelzl@59681
  1296
    by (rule measure_pmf.finite_measure_Diff) auto
hoelzl@59681
  1297
  also have "measure p {y. R x y \<and> \<not> R y x} = measure q {y. R x y \<and> \<not> R y x}"
hoelzl@59681
  1298
    using 1 2 refl trans by(auto intro!: Orderings.antisym measure_Ioi)
hoelzl@59681
  1299
  also have "measure p {y. R x y} = measure q {y. R x y}"
hoelzl@59681
  1300
    using 1 2 refl trans by(auto intro!: Orderings.antisym measure_Ici)
hoelzl@59681
  1301
  also have "measure q {y. R x y} - measure q {y. R x y \<and> \<not> R y x} =
hoelzl@59681
  1302
    measure q ({y. R x y} - {y. R x y \<and> \<not> R y x})"
hoelzl@59681
  1303
    by(rule measure_pmf.finite_measure_Diff[symmetric]) auto
hoelzl@59681
  1304
  also have "\<dots> = ?\<mu>R x"
hoelzl@59681
  1305
    by(auto intro!: arg_cong[where f="measure q"])
hoelzl@59681
  1306
  finally show "measure p C = measure q C"
hoelzl@59681
  1307
    by (simp add: C conj_commute)
hoelzl@59664
  1308
qed
hoelzl@59664
  1309
hoelzl@59664
  1310
lemma rel_pmf_antisym:
hoelzl@59664
  1311
  fixes p q :: "'a pmf"
hoelzl@59664
  1312
  assumes 1: "rel_pmf R p q"
hoelzl@59664
  1313
  assumes 2: "rel_pmf R q p"
hoelzl@59664
  1314
  and refl: "reflp R" and trans: "transp R" and antisym: "antisymP R"
hoelzl@59664
  1315
  shows "p = q"
hoelzl@59664
  1316
proof -
hoelzl@59664
  1317
  from 1 2 refl trans have "rel_pmf (inf R R\<inverse>\<inverse>) p q" by(rule rel_pmf_inf)
hoelzl@59664
  1318
  also have "inf R R\<inverse>\<inverse> = op ="
hoelzl@59665
  1319
    using refl antisym by (auto intro!: ext simp add: reflpD dest: antisymD)
hoelzl@59664
  1320
  finally show ?thesis unfolding pmf.rel_eq .
hoelzl@59664
  1321
qed
hoelzl@59664
  1322
hoelzl@59664
  1323
lemma reflp_rel_pmf: "reflp R \<Longrightarrow> reflp (rel_pmf R)"
hoelzl@59664
  1324
by(blast intro: reflpI rel_pmf_reflI reflpD)
hoelzl@59664
  1325
hoelzl@59664
  1326
lemma antisymP_rel_pmf:
hoelzl@59664
  1327
  "\<lbrakk> reflp R; transp R; antisymP R \<rbrakk>
hoelzl@59664
  1328
  \<Longrightarrow> antisymP (rel_pmf R)"
hoelzl@59664
  1329
by(rule antisymI)(blast intro: rel_pmf_antisym)
hoelzl@59664
  1330
hoelzl@59664
  1331
lemma transp_rel_pmf:
hoelzl@59664
  1332
  assumes "transp R"
hoelzl@59664
  1333
  shows "transp (rel_pmf R)"
hoelzl@59664
  1334
proof (rule transpI)
hoelzl@59664
  1335
  fix x y z
hoelzl@59664
  1336
  assume "rel_pmf R x y" and "rel_pmf R y z"
hoelzl@59664
  1337
  hence "rel_pmf (R OO R) x z" by (simp add: pmf.rel_compp relcompp.relcompI)
hoelzl@59664
  1338
  thus "rel_pmf R x z"
hoelzl@59664
  1339
    using assms by (metis (no_types) pmf.rel_mono rev_predicate2D transp_relcompp_less_eq)
hoelzl@59664
  1340
qed
hoelzl@59664
  1341
hoelzl@59664
  1342
subsection \<open> Distributions \<close>
hoelzl@59664
  1343
hoelzl@59000
  1344
context
hoelzl@59000
  1345
begin
hoelzl@59000
  1346
hoelzl@59000
  1347
interpretation pmf_as_function .
hoelzl@59000
  1348
hoelzl@59093
  1349
subsubsection \<open> Bernoulli Distribution \<close>
hoelzl@59093
  1350
hoelzl@59000
  1351
lift_definition bernoulli_pmf :: "real \<Rightarrow> bool pmf" is
hoelzl@59000
  1352
  "\<lambda>p b. ((\<lambda>p. if b then p else 1 - p) \<circ> min 1 \<circ> max 0) p"
hoelzl@59000
  1353
  by (auto simp: nn_integral_count_space_finite[where A="{False, True}"] UNIV_bool
hoelzl@59000
  1354
           split: split_max split_min)
hoelzl@59000
  1355
hoelzl@59000
  1356
lemma pmf_bernoulli_True[simp]: "0 \<le> p \<Longrightarrow> p \<le> 1 \<Longrightarrow> pmf (bernoulli_pmf p) True = p"
hoelzl@59000
  1357
  by transfer simp
hoelzl@59000
  1358
hoelzl@59000
  1359
lemma pmf_bernoulli_False[simp]: "0 \<le> p \<Longrightarrow> p \<le> 1 \<Longrightarrow> pmf (bernoulli_pmf p) False = 1 - p"
hoelzl@59000
  1360
  by transfer simp
hoelzl@59000
  1361
hoelzl@59000
  1362
lemma set_pmf_bernoulli: "0 < p \<Longrightarrow> p < 1 \<Longrightarrow> set_pmf (bernoulli_pmf p) = UNIV"
hoelzl@59000
  1363
  by (auto simp add: set_pmf_iff UNIV_bool)
hoelzl@59000
  1364
lp15@59667
  1365
lemma nn_integral_bernoulli_pmf[simp]:
hoelzl@59002
  1366
  assumes [simp]: "0 \<le> p" "p \<le> 1" "\<And>x. 0 \<le> f x"
hoelzl@59002
  1367
  shows "(\<integral>\<^sup>+x. f x \<partial>bernoulli_pmf p) = f True * p + f False * (1 - p)"
hoelzl@59002
  1368
  by (subst nn_integral_measure_pmf_support[of UNIV])
hoelzl@59002
  1369
     (auto simp: UNIV_bool field_simps)
hoelzl@59002
  1370
lp15@59667
  1371
lemma integral_bernoulli_pmf[simp]:
hoelzl@59002
  1372
  assumes [simp]: "0 \<le> p" "p \<le> 1"
hoelzl@59002
  1373
  shows "(\<integral>x. f x \<partial>bernoulli_pmf p) = f True * p + f False * (1 - p)"
hoelzl@59002
  1374
  by (subst integral_measure_pmf[of UNIV]) (auto simp: UNIV_bool)
hoelzl@59002
  1375
Andreas@59525
  1376
lemma pmf_bernoulli_half [simp]: "pmf (bernoulli_pmf (1 / 2)) x = 1 / 2"
Andreas@59525
  1377
by(cases x) simp_all
Andreas@59525
  1378
Andreas@59525
  1379
lemma measure_pmf_bernoulli_half: "measure_pmf (bernoulli_pmf (1 / 2)) = uniform_count_measure UNIV"
Andreas@59525
  1380
by(rule measure_eqI)(simp_all add: nn_integral_pmf[symmetric] emeasure_uniform_count_measure nn_integral_count_space_finite sets_uniform_count_measure)
Andreas@59525
  1381
hoelzl@59093
  1382
subsubsection \<open> Geometric Distribution \<close>
hoelzl@59093
  1383
hoelzl@60602
  1384
context
hoelzl@60602
  1385
  fixes p :: real assumes p[arith]: "0 < p" "p \<le> 1"
hoelzl@60602
  1386
begin
hoelzl@60602
  1387
hoelzl@60602
  1388
lift_definition geometric_pmf :: "nat pmf" is "\<lambda>n. (1 - p)^n * p"
hoelzl@59000
  1389
proof
hoelzl@60602
  1390
  have "(\<Sum>i. ereal (p * (1 - p) ^ i)) = ereal (p * (1 / (1 - (1 - p))))"
hoelzl@60602
  1391
    by (intro sums_suminf_ereal sums_mult geometric_sums) auto
hoelzl@60602
  1392
  then show "(\<integral>\<^sup>+ x. ereal ((1 - p)^x * p) \<partial>count_space UNIV) = 1"
hoelzl@59000
  1393
    by (simp add: nn_integral_count_space_nat field_simps)
hoelzl@59000
  1394
qed simp
hoelzl@59000
  1395
hoelzl@60602
  1396
lemma pmf_geometric[simp]: "pmf geometric_pmf n = (1 - p)^n * p"
hoelzl@59000
  1397
  by transfer rule
hoelzl@59000
  1398
hoelzl@60602
  1399
end
hoelzl@60602
  1400
hoelzl@60602
  1401
lemma set_pmf_geometric: "0 < p \<Longrightarrow> p < 1 \<Longrightarrow> set_pmf (geometric_pmf p) = UNIV"
hoelzl@60602
  1402
  by (auto simp: set_pmf_iff) 
hoelzl@59000
  1403
hoelzl@59093
  1404
subsubsection \<open> Uniform Multiset Distribution \<close>
hoelzl@59093
  1405
hoelzl@59000
  1406
context
hoelzl@59000
  1407
  fixes M :: "'a multiset" assumes M_not_empty: "M \<noteq> {#}"
hoelzl@59000
  1408
begin
hoelzl@59000
  1409
hoelzl@59000
  1410
lift_definition pmf_of_multiset :: "'a pmf" is "\<lambda>x. count M x / size M"
hoelzl@59000
  1411
proof
lp15@59667
  1412
  show "(\<integral>\<^sup>+ x. ereal (real (count M x) / real (size M)) \<partial>count_space UNIV) = 1"
hoelzl@59000
  1413
    using M_not_empty
hoelzl@59000
  1414
    by (simp add: zero_less_divide_iff nn_integral_count_space nonempty_has_size
hoelzl@59000
  1415
                  setsum_divide_distrib[symmetric])
hoelzl@59000
  1416
       (auto simp: size_multiset_overloaded_eq intro!: setsum.cong)
hoelzl@59000
  1417
qed simp
hoelzl@59000
  1418
hoelzl@59000
  1419
lemma pmf_of_multiset[simp]: "pmf pmf_of_multiset x = count M x / size M"
hoelzl@59000
  1420
  by transfer rule
hoelzl@59000
  1421
nipkow@60495
  1422
lemma set_pmf_of_multiset[simp]: "set_pmf pmf_of_multiset = set_mset M"
hoelzl@59000
  1423
  by (auto simp: set_pmf_iff)
hoelzl@59000
  1424
hoelzl@59000
  1425
end
hoelzl@59000
  1426
hoelzl@59093
  1427
subsubsection \<open> Uniform Distribution \<close>
hoelzl@59093
  1428
hoelzl@59000
  1429
context
hoelzl@59000
  1430
  fixes S :: "'a set" assumes S_not_empty: "S \<noteq> {}" and S_finite: "finite S"
hoelzl@59000
  1431
begin
hoelzl@59000
  1432
hoelzl@59000
  1433
lift_definition pmf_of_set :: "'a pmf" is "\<lambda>x. indicator S x / card S"
hoelzl@59000
  1434
proof
lp15@59667
  1435
  show "(\<integral>\<^sup>+ x. ereal (indicator S x / real (card S)) \<partial>count_space UNIV) = 1"
hoelzl@59000
  1436
    using S_not_empty S_finite by (subst nn_integral_count_space'[of S]) auto
hoelzl@59000
  1437
qed simp
hoelzl@59000
  1438
hoelzl@59000
  1439
lemma pmf_of_set[simp]: "pmf pmf_of_set x = indicator S x / card S"
hoelzl@59000
  1440
  by transfer rule
hoelzl@59000
  1441
hoelzl@59000
  1442
lemma set_pmf_of_set[simp]: "set_pmf pmf_of_set = S"
hoelzl@59000
  1443
  using S_finite S_not_empty by (auto simp: set_pmf_iff)
hoelzl@59000
  1444
hoelzl@59002
  1445
lemma emeasure_pmf_of_set[simp]: "emeasure pmf_of_set S = 1"
hoelzl@59002
  1446
  by (rule measure_pmf.emeasure_eq_1_AE) (auto simp: AE_measure_pmf_iff)
hoelzl@59002
  1447
Andreas@60068
  1448
lemma nn_integral_pmf_of_set': 
Andreas@60068
  1449
  "(\<And>x. x \<in> S \<Longrightarrow> f x \<ge> 0) \<Longrightarrow> nn_integral (measure_pmf pmf_of_set) f = setsum f S / card S"
Andreas@60068
  1450
apply(subst nn_integral_measure_pmf_finite, simp_all add: S_finite)
Andreas@60068
  1451
apply(simp add: setsum_ereal_left_distrib[symmetric])
Andreas@60068
  1452
apply(subst ereal_divide', simp add: S_not_empty S_finite)
Andreas@60068
  1453
apply(simp add: ereal_times_divide_eq one_ereal_def[symmetric])
Andreas@60068
  1454
done
Andreas@60068
  1455
Andreas@60068
  1456
lemma nn_integral_pmf_of_set: 
Andreas@60068
  1457
  "nn_integral (measure_pmf pmf_of_set) f = setsum (max 0 \<circ> f) S / card S"
Andreas@60068
  1458
apply(subst nn_integral_max_0[symmetric])
Andreas@60068
  1459
apply(subst nn_integral_pmf_of_set')
Andreas@60068
  1460
apply simp_all
Andreas@60068
  1461
done
Andreas@60068
  1462
Andreas@60068
  1463
lemma integral_pmf_of_set:
Andreas@60068
  1464
  "integral\<^sup>L (measure_pmf pmf_of_set) f = setsum f S / card S"
Andreas@60068
  1465
apply(simp add: real_lebesgue_integral_def integrable_measure_pmf_finite nn_integral_pmf_of_set S_finite)
Andreas@60068
  1466
apply(subst real_of_ereal_minus')
Andreas@60068
  1467
 apply(simp add: ereal_max_0 S_finite del: ereal_max)
Andreas@60068
  1468
apply(simp add: ereal_max_0 S_finite S_not_empty del: ereal_max)
Andreas@60068
  1469
apply(simp add: field_simps S_finite S_not_empty)
Andreas@60068
  1470
apply(subst setsum.distrib[symmetric])
Andreas@60068
  1471
apply(rule setsum.cong; simp_all)
Andreas@60068
  1472
done
Andreas@60068
  1473
hoelzl@59000
  1474
end
hoelzl@59000
  1475
Andreas@60068
  1476
lemma pmf_of_set_singleton: "pmf_of_set {x} = return_pmf x"
Andreas@60068
  1477
by(rule pmf_eqI)(simp add: indicator_def)
Andreas@60068
  1478
Andreas@60068
  1479
lemma map_pmf_of_set_inj: 
Andreas@60068
  1480
  assumes f: "inj_on f A"
Andreas@60068
  1481
  and [simp]: "A \<noteq> {}" "finite A"
Andreas@60068
  1482
  shows "map_pmf f (pmf_of_set A) = pmf_of_set (f ` A)" (is "?lhs = ?rhs")
Andreas@60068
  1483
proof(rule pmf_eqI)
Andreas@60068
  1484
  fix i
Andreas@60068
  1485
  show "pmf ?lhs i = pmf ?rhs i"
Andreas@60068
  1486
  proof(cases "i \<in> f ` A")
Andreas@60068
  1487
    case True
Andreas@60068
  1488
    then obtain i' where "i = f i'" "i' \<in> A" by auto
Andreas@60068
  1489
    thus ?thesis using f by(simp add: card_image pmf_map_inj)
Andreas@60068
  1490
  next
Andreas@60068
  1491
    case False
Andreas@60068
  1492
    hence "pmf ?lhs i = 0" by(simp add: pmf_eq_0_set_pmf set_map_pmf)
Andreas@60068
  1493
    moreover have "pmf ?rhs i = 0" using False by simp
Andreas@60068
  1494
    ultimately show ?thesis by simp
Andreas@60068
  1495
  qed
Andreas@60068
  1496
qed
Andreas@60068
  1497
Andreas@60068
  1498
lemma bernoulli_pmf_half_conv_pmf_of_set: "bernoulli_pmf (1 / 2) = pmf_of_set UNIV"
Andreas@60068
  1499
by(rule pmf_eqI) simp_all
Andreas@60068
  1500
hoelzl@59093
  1501
subsubsection \<open> Poisson Distribution \<close>
hoelzl@59093
  1502
hoelzl@59093
  1503
context
hoelzl@59093
  1504
  fixes rate :: real assumes rate_pos: "0 < rate"
hoelzl@59093
  1505
begin
hoelzl@59093
  1506
hoelzl@59093
  1507
lift_definition poisson_pmf :: "nat pmf" is "\<lambda>k. rate ^ k / fact k * exp (-rate)"
lp15@59730
  1508
proof  (* by Manuel Eberl *)
hoelzl@59093
  1509
  have summable: "summable (\<lambda>x::nat. rate ^ x / fact x)" using summable_exp
haftmann@59557
  1510
    by (simp add: field_simps divide_inverse [symmetric])
hoelzl@59093
  1511
  have "(\<integral>\<^sup>+(x::nat). rate ^ x / fact x * exp (-rate) \<partial>count_space UNIV) =
hoelzl@59093
  1512
          exp (-rate) * (\<integral>\<^sup>+(x::nat). rate ^ x / fact x \<partial>count_space UNIV)"
hoelzl@59093
  1513
    by (simp add: field_simps nn_integral_cmult[symmetric])
hoelzl@59093
  1514
  also from rate_pos have "(\<integral>\<^sup>+(x::nat). rate ^ x / fact x \<partial>count_space UNIV) = (\<Sum>x. rate ^ x / fact x)"
hoelzl@59093
  1515
    by (simp_all add: nn_integral_count_space_nat suminf_ereal summable suminf_ereal_finite)
hoelzl@59093
  1516
  also have "... = exp rate" unfolding exp_def
lp15@59730
  1517
    by (simp add: field_simps divide_inverse [symmetric])
hoelzl@59093
  1518
  also have "ereal (exp (-rate)) * ereal (exp rate) = 1"
hoelzl@59093
  1519
    by (simp add: mult_exp_exp)
lp15@59730
  1520
  finally show "(\<integral>\<^sup>+ x. ereal (rate ^ x / (fact x) * exp (- rate)) \<partial>count_space UNIV) = 1" .
hoelzl@59093
  1521
qed (simp add: rate_pos[THEN less_imp_le])
hoelzl@59093
  1522
hoelzl@59093
  1523
lemma pmf_poisson[simp]: "pmf poisson_pmf k = rate ^ k / fact k * exp (-rate)"
hoelzl@59093
  1524
  by transfer rule
hoelzl@59093
  1525
hoelzl@59093
  1526
lemma set_pmf_poisson[simp]: "set_pmf poisson_pmf = UNIV"
hoelzl@59093
  1527
  using rate_pos by (auto simp: set_pmf_iff)
hoelzl@59093
  1528
hoelzl@59000
  1529
end
hoelzl@59000
  1530
hoelzl@59093
  1531
subsubsection \<open> Binomial Distribution \<close>
hoelzl@59093
  1532
hoelzl@59093
  1533
context
hoelzl@59093
  1534
  fixes n :: nat and p :: real assumes p_nonneg: "0 \<le> p" and p_le_1: "p \<le> 1"
hoelzl@59093
  1535
begin
hoelzl@59093
  1536
hoelzl@59093
  1537
lift_definition binomial_pmf :: "nat pmf" is "\<lambda>k. (n choose k) * p^k * (1 - p)^(n - k)"
hoelzl@59093
  1538
proof
hoelzl@59093
  1539
  have "(\<integral>\<^sup>+k. ereal (real (n choose k) * p ^ k * (1 - p) ^ (n - k)) \<partial>count_space UNIV) =
hoelzl@59093
  1540
    ereal (\<Sum>k\<le>n. real (n choose k) * p ^ k * (1 - p) ^ (n - k))"
hoelzl@59093
  1541
    using p_le_1 p_nonneg by (subst nn_integral_count_space') auto
hoelzl@59093
  1542
  also have "(\<Sum>k\<le>n. real (n choose k) * p ^ k * (1 - p) ^ (n - k)) = (p + (1 - p)) ^ n"
hoelzl@59093
  1543
    by (subst binomial_ring) (simp add: atLeast0AtMost real_of_nat_def)
hoelzl@59093
  1544
  finally show "(\<integral>\<^sup>+ x. ereal (real (n choose x) * p ^ x * (1 - p) ^ (n - x)) \<partial>count_space UNIV) = 1"
hoelzl@59093
  1545
    by simp
hoelzl@59093
  1546
qed (insert p_nonneg p_le_1, simp)
hoelzl@59093
  1547
hoelzl@59093
  1548
lemma pmf_binomial[simp]: "pmf binomial_pmf k = (n choose k) * p^k * (1 - p)^(n - k)"
hoelzl@59093
  1549
  by transfer rule
hoelzl@59093
  1550
hoelzl@59093
  1551
lemma set_pmf_binomial_eq: "set_pmf binomial_pmf = (if p = 0 then {0} else if p = 1 then {n} else {.. n})"
hoelzl@59093
  1552
  using p_nonneg p_le_1 unfolding set_eq_iff set_pmf_iff pmf_binomial by (auto simp: set_pmf_iff)
hoelzl@59093
  1553
hoelzl@59093
  1554
end
hoelzl@59093
  1555
hoelzl@59093
  1556
end
hoelzl@59093
  1557
hoelzl@59093
  1558
lemma set_pmf_binomial_0[simp]: "set_pmf (binomial_pmf n 0) = {0}"
hoelzl@59093
  1559
  by (simp add: set_pmf_binomial_eq)
hoelzl@59093
  1560
hoelzl@59093
  1561
lemma set_pmf_binomial_1[simp]: "set_pmf (binomial_pmf n 1) = {n}"
hoelzl@59093
  1562
  by (simp add: set_pmf_binomial_eq)
hoelzl@59093
  1563
hoelzl@59093
  1564
lemma set_pmf_binomial[simp]: "0 < p \<Longrightarrow> p < 1 \<Longrightarrow> set_pmf (binomial_pmf n p) = {..n}"
hoelzl@59093
  1565
  by (simp add: set_pmf_binomial_eq)
hoelzl@59093
  1566
hoelzl@59000
  1567
end