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