src/HOL/Probability/Product_Measure.thy

added Standard_System.slurp convenience;
tuned;

theory Product_Measure
imports Lebesgue_Integration
begin

definition "dynkin M \<longleftrightarrow>
  space M \<in> sets M \<and>
  (\<forall> A \<in> sets M. A \<subseteq> space M) \<and>
  (\<forall> a \<in> sets M. \<forall> b \<in> sets M. a \<subseteq> b \<longrightarrow> b - a \<in> sets M) \<and>
  (\<forall>A. disjoint_family A \<and> range A \<subseteq> sets M \<longrightarrow> (\<Union>i::nat. A i) \<in> sets M)"

lemma dynkinI:
  assumes "\<And> A. A \<in> sets M \<Longrightarrow> A \<subseteq> space M"
  assumes "space M \<in> sets M" and "\<forall> b \<in> sets M. \<forall> a \<in> sets M. a \<subseteq> b \<longrightarrow> b - a \<in> sets M"
  assumes "\<And> a. (\<And> i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {})
          \<Longrightarrow> (\<And> i :: nat. a i \<in> sets M) \<Longrightarrow> UNION UNIV a \<in> sets M"
  shows "dynkin M"
using assms by (auto simp: dynkin_def disjoint_family_on_def image_subset_iff)

lemma dynkin_subset:
  assumes "dynkin M"
  shows "\<And> A. A \<in> sets M \<Longrightarrow> A \<subseteq> space M"
using assms unfolding dynkin_def by auto

lemma dynkin_space:
  assumes "dynkin M"
  shows "space M \<in> sets M"
using assms unfolding dynkin_def by auto

lemma dynkin_diff:
  assumes "dynkin M"
  shows "\<And> a b. \<lbrakk> a \<in> sets M ; b \<in> sets M ; a \<subseteq> b \<rbrakk> \<Longrightarrow> b - a \<in> sets M"
using assms unfolding dynkin_def by auto

lemma dynkin_empty:
  assumes "dynkin M"
  shows "{} \<in> sets M"
using dynkin_diff[OF assms dynkin_space[OF assms] dynkin_space[OF assms]] by auto

lemma dynkin_UN:
  assumes "dynkin M"
  assumes "\<And> i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {}"
  assumes "\<And> i :: nat. a i \<in> sets M"
  shows "UNION UNIV a \<in> sets M"
using assms by (auto simp: dynkin_def disjoint_family_on_def image_subset_iff)

definition "Int_stable M \<longleftrightarrow> (\<forall> a \<in> sets M. \<forall> b \<in> sets M. a \<inter> b \<in> sets M)"

lemma dynkin_trivial:
  shows "dynkin \<lparr> space = A, sets = Pow A \<rparr>"
by (rule dynkinI) auto

lemma dynkin_lemma:
  fixes D :: "'a algebra"
  assumes stab: "Int_stable E"
  and spac: "space E = space D"
  and subsED: "sets E \<subseteq> sets D"
  and subsDE: "sets D \<subseteq> sigma_sets (space E) (sets E)"
  and dyn: "dynkin D"
  shows "sigma (space E) (sets E) = D"
proof -
  def sets_\<delta>E == "\<Inter> {sets d | d :: 'a algebra. dynkin d \<and> space d = space E \<and> sets E \<subseteq> sets d}"
  def \<delta>E == "\<lparr> space = space E, sets = sets_\<delta>E \<rparr>"
  have "\<lparr> space = space E, sets = Pow (space E) \<rparr> \<in> {d | d. dynkin d \<and> space d = space E \<and> sets E \<subseteq> sets d}"
    using dynkin_trivial spac subsED dynkin_subset[OF dyn] by fastsimp
  hence not_empty: "{sets (d :: 'a algebra) | d. dynkin d \<and> space d = space E \<and> sets E \<subseteq> sets d} \<noteq> {}"
    using exI[of "\<lambda> x. space x = space E \<and> dynkin x \<and> sets E \<subseteq> sets x" "\<lparr> space = space E, sets = Pow (space E) \<rparr>", simplified]
    by auto
  have \<delta>E_D: "sets_\<delta>E \<subseteq> sets D"
    unfolding sets_\<delta>E_def using assms by auto
  have \<delta>ynkin: "dynkin \<delta>E"
  proof (rule dynkinI, safe)
    fix A x assume asm: "A \<in> sets \<delta>E" "x \<in> A"
    { fix d :: "('a, 'b) algebra_scheme" assume "A \<in> sets d" "dynkin d \<and> space d = space E"
      hence "A \<subseteq> space d" using dynkin_subset by auto }
    show "x \<in> space \<delta>E" using asm unfolding \<delta>E_def sets_\<delta>E_def using not_empty
      by simp (metis dynkin_subset in_mono mem_def)
  next
    show "space \<delta>E \<in> sets \<delta>E"
      unfolding \<delta>E_def sets_\<delta>E_def
      using dynkin_space by fastsimp
  next
    fix a b assume "a \<in> sets \<delta>E" "b \<in> sets \<delta>E" "a \<subseteq> b"
    thus "b - a \<in> sets \<delta>E"
      unfolding \<delta>E_def sets_\<delta>E_def by (auto intro:dynkin_diff)
  next
    fix a assume asm: "\<And>i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {}" "\<And>i. a i \<in> sets \<delta>E"
    thus "UNION UNIV a \<in> sets \<delta>E"
      unfolding \<delta>E_def sets_\<delta>E_def apply (auto intro!:dynkin_UN[OF _ asm(1)])
      by blast
  qed

  def Dy == "\<lambda> d. {A | A. A \<in> sets_\<delta>E \<and> A \<inter> d \<in> sets_\<delta>E}"
  { fix d assume dasm: "d \<in> sets_\<delta>E"
    have "dynkin \<lparr> space = space E, sets = Dy d \<rparr>"
    proof (rule dynkinI, safe, simp_all)
      fix A x assume "A \<in> Dy d" "x \<in> A"
      thus "x \<in> space E" unfolding Dy_def sets_\<delta>E_def using not_empty
        by simp (metis dynkin_subset in_mono mem_def)
    next
      show "space E \<in> Dy d"
        unfolding Dy_def \<delta>E_def sets_\<delta>E_def
      proof auto
        fix d assume asm: "dynkin d" "space d = space E" "sets E \<subseteq> sets d"
        hence "space d \<in> sets d" using dynkin_space[OF asm(1)] by auto
        thus "space E \<in> sets d" using asm by auto
      next
        fix da :: "'a algebra" assume asm: "dynkin da" "space da = space E" "sets E \<subseteq> sets da"
        have d: "d = space E \<inter> d"
          using dasm dynkin_subset[OF asm(1)] asm(2) dynkin_subset[OF \<delta>ynkin]
          unfolding \<delta>E_def by auto
        hence "space E \<inter> d \<in> sets \<delta>E" unfolding \<delta>E_def
          using dasm by auto
        have "sets \<delta>E \<subseteq> sets da" unfolding \<delta>E_def sets_\<delta>E_def using asm
          by auto
        thus "space E \<inter> d \<in> sets da" using dasm asm d dynkin_subset[OF \<delta>ynkin]
          unfolding \<delta>E_def by auto
      qed
    next
      fix a b assume absm: "a \<in> Dy d" "b \<in> Dy d" "a \<subseteq> b"
      hence "a \<in> sets \<delta>E" "b \<in> sets \<delta>E"
        unfolding Dy_def \<delta>E_def by auto
      hence *: "b - a \<in> sets \<delta>E"
        using dynkin_diff[OF \<delta>ynkin] `a \<subseteq> b` by auto
      have "a \<inter> d \<in> sets \<delta>E" "b \<inter> d \<in> sets \<delta>E"
        using absm unfolding Dy_def \<delta>E_def by auto
      hence "(b \<inter> d) - (a \<inter> d) \<in> sets \<delta>E"
        using dynkin_diff[OF \<delta>ynkin] `a \<subseteq> b` by auto
      hence **: "(b - a) \<inter> d \<in> sets \<delta>E" by (auto simp add:Diff_Int_distrib2)
      thus "b - a \<in> Dy d"
        using * ** unfolding Dy_def \<delta>E_def by auto
    next
      fix a assume aasm: "\<And>i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {}" "\<And>i. a i \<in> Dy d"
      hence "\<And> i. a i \<in> sets \<delta>E"
        unfolding Dy_def \<delta>E_def by auto
      from dynkin_UN[OF \<delta>ynkin aasm(1) this]
      have *: "UNION UNIV a \<in> sets \<delta>E" by auto
      from aasm
      have aE: "\<forall> i. a i \<inter> d \<in> sets \<delta>E"
        unfolding Dy_def \<delta>E_def by auto
      from aasm
      have "\<And>i j :: nat. i \<noteq> j \<Longrightarrow> (a i \<inter> d) \<inter> (a j \<inter> d) = {}" by auto
      from dynkin_UN[OF \<delta>ynkin this]
      have "UNION UNIV (\<lambda> i. a i \<inter> d) \<in> sets \<delta>E"
        using aE by auto
      hence **: "UNION UNIV a \<inter> d \<in> sets \<delta>E" by auto
      from * ** show "UNION UNIV a \<in> Dy d" unfolding Dy_def \<delta>E_def by auto
    qed } note Dy_nkin = this
  have E_\<delta>E: "sets E \<subseteq> sets \<delta>E"
    unfolding \<delta>E_def sets_\<delta>E_def by auto
  { fix d assume dasm: "d \<in> sets \<delta>E"
    { fix e assume easm: "e \<in> sets E"
      hence deasm: "e \<in> sets \<delta>E"
        unfolding \<delta>E_def sets_\<delta>E_def by auto
      have subset: "Dy e \<subseteq> sets \<delta>E"
        unfolding Dy_def \<delta>E_def by auto
      { fix e' assume e'asm: "e' \<in> sets E"
        have "e' \<inter> e \<in> sets E"
          using easm e'asm stab unfolding Int_stable_def by auto
        hence "e' \<inter> e \<in> sets \<delta>E"
          unfolding \<delta>E_def sets_\<delta>E_def by auto
        hence "e' \<in> Dy e" using e'asm unfolding Dy_def \<delta>E_def sets_\<delta>E_def by auto }
      hence E_Dy: "sets E \<subseteq> Dy e" by auto
      have "\<lparr> space = space E, sets = Dy e \<rparr> \<in> {d | d. dynkin d \<and> space d = space E \<and> sets E \<subseteq> sets d}"
        using Dy_nkin[OF deasm[unfolded \<delta>E_def, simplified]] E_\<delta>E E_Dy by auto
      hence "sets_\<delta>E \<subseteq> Dy e"
        unfolding sets_\<delta>E_def by auto (metis E_Dy simps(1) simps(2) spac)
      hence "sets \<delta>E = Dy e" using subset unfolding \<delta>E_def by auto
      hence "d \<inter> e \<in> sets \<delta>E"
        using dasm easm deasm unfolding Dy_def \<delta>E_def by auto
      hence "e \<in> Dy d" using deasm
        unfolding Dy_def \<delta>E_def
        by (auto simp add:Int_commute) }
    hence "sets E \<subseteq> Dy d" by auto
    hence "sets \<delta>E \<subseteq> Dy d" using Dy_nkin[OF dasm[unfolded \<delta>E_def, simplified]]
      unfolding \<delta>E_def sets_\<delta>E_def
      by auto (metis `sets E <= Dy d` simps(1) simps(2) spac)
    hence *: "sets \<delta>E = Dy d"
      unfolding Dy_def \<delta>E_def by auto
    fix a assume aasm: "a \<in> sets \<delta>E"
    hence "a \<inter> d \<in> sets \<delta>E"
      using * dasm unfolding Dy_def \<delta>E_def by auto } note \<delta>E_stab = this
  { fix A :: "nat \<Rightarrow> 'a set" assume Asm: "range A \<subseteq> sets \<delta>E" "\<And>A. A \<in> sets \<delta>E \<Longrightarrow> A \<subseteq> space \<delta>E"
      "\<And>a. a \<in> sets \<delta>E \<Longrightarrow> space \<delta>E - a \<in> sets \<delta>E"
    "{} \<in> sets \<delta>E" "space \<delta>E \<in> sets \<delta>E"
    let "?A i" = "A i \<inter> (\<Inter> j \<in> {..< i}. space \<delta>E - A j)"
    { fix i :: nat
      have *: "(\<Inter> j \<in> {..< i}. space \<delta>E - A j) \<inter> space \<delta>E \<in> sets \<delta>E"
        apply (induct i)
        using lessThan_Suc Asm \<delta>E_stab apply fastsimp
        apply (subst lessThan_Suc)
        apply (subst INT_insert)
        apply (subst Int_assoc)
        apply (subst \<delta>E_stab)
        using lessThan_Suc Asm \<delta>E_stab Asm
        apply (fastsimp simp add:Int_assoc dynkin_diff[OF \<delta>ynkin])
        prefer 2 apply simp
        apply (rule dynkin_diff[OF \<delta>ynkin, of _ "space \<delta>E", OF _ dynkin_space[OF \<delta>ynkin]])
        using Asm by auto
      have **: "\<And> i. A i \<subseteq> space \<delta>E" using Asm by auto
      have "(\<Inter> j \<in> {..< i}. space \<delta>E - A j) \<subseteq> space \<delta>E \<or> (\<Inter> j \<in> {..< i}. A j) = UNIV \<and> i = 0"
        apply (cases i)
        using Asm ** dynkin_subset[OF \<delta>ynkin, of "A (i - 1)"]
        by auto
      hence Aisets: "?A i \<in> sets \<delta>E"
        apply (cases i)
        using Asm * apply fastsimp
        apply (rule \<delta>E_stab)
        using Asm * **
        by (auto simp add:Int_absorb2)
      have "?A i = disjointed A i" unfolding disjointed_def
      atLeast0LessThan using Asm by auto
      hence "?A i = disjointed A i" "?A i \<in> sets \<delta>E"
        using Aisets by auto
    } note Ai = this
    from dynkin_UN[OF \<delta>ynkin _ this(2)] this disjoint_family_disjointed[of A]
    have "(\<Union> i. ?A i) \<in> sets \<delta>E"
      by (auto simp add:disjoint_family_on_def disjointed_def)
    hence "(\<Union> i. A i) \<in> sets \<delta>E"
      using Ai(1) UN_disjointed_eq[of A] by auto } note \<delta>E_UN = this
  { fix a b assume asm: "a \<in> sets \<delta>E" "b \<in> sets \<delta>E"
    let ?ab = "\<lambda> i. if (i::nat) = 0 then a else if i = 1 then b else {}"
    have *: "(\<Union> i. ?ab i) \<in> sets \<delta>E"
      apply (rule \<delta>E_UN)
      using asm \<delta>E_UN dynkin_empty[OF \<delta>ynkin] 
      dynkin_subset[OF \<delta>ynkin] 
      dynkin_space[OF \<delta>ynkin]
      dynkin_diff[OF \<delta>ynkin] by auto
    have "(\<Union> i. ?ab i) = a \<union> b" apply auto
      apply (case_tac "i = 0")
      apply auto
      apply (case_tac "i = 1")
      by auto
    hence "a \<union> b \<in> sets \<delta>E" using * by auto} note \<delta>E_Un = this
  have "sigma_algebra \<delta>E"
    apply unfold_locales
    using dynkin_subset[OF \<delta>ynkin]
    using dynkin_diff[OF \<delta>ynkin, of _ "space \<delta>E", OF _ dynkin_space[OF \<delta>ynkin]]
    using dynkin_diff[OF \<delta>ynkin, of "space \<delta>E" "space \<delta>E", OF dynkin_space[OF \<delta>ynkin] dynkin_space[OF \<delta>ynkin]]
    using dynkin_space[OF \<delta>ynkin]
    using \<delta>E_UN \<delta>E_Un
    by auto
  from sigma_algebra.sigma_subset[OF this E_\<delta>E] \<delta>E_D subsDE spac
  show ?thesis by (auto simp add:\<delta>E_def sigma_def)
qed

lemma measure_eq:
  assumes fin: "\<mu> (space M) = \<nu> (space M)" "\<nu> (space M) < \<omega>"
  assumes E: "M = sigma (space E) (sets E)" "Int_stable E"
  assumes eq: "\<And> e. e \<in> sets E \<Longrightarrow> \<mu> e = \<nu> e"
  assumes ms: "measure_space M \<mu>" "measure_space M \<nu>"
  assumes A: "A \<in> sets M"
  shows "\<mu> A = \<nu> A"
proof -
  interpret M: measure_space M \<mu>
    using ms by simp
  interpret M': measure_space M \<nu>
    using ms by simp

  let ?D_sets = "{A. A \<in> sets M \<and> \<mu> A = \<nu> A}"
  have \<delta>: "dynkin \<lparr> space = space M , sets = ?D_sets \<rparr>"
  proof (rule dynkinI, safe, simp_all)
    fix A x assume "A \<in> sets M \<and> \<mu> A = \<nu> A" "x \<in> A"
    thus "x \<in> space M" using assms M.sets_into_space by auto
  next
    show "\<mu> (space M) = \<nu> (space M)"
      using fin by auto
  next
    fix a b
    assume asm: "a \<in> sets M \<and> \<mu> a = \<nu> a"
      "b \<in> sets M \<and> \<mu> b = \<nu> b" "a \<subseteq> b"
    hence "a \<subseteq> space M"
      using M.sets_into_space by auto
    from M.measure_mono[OF this]
    have "\<mu> a \<le> \<mu> (space M)"
      using asm by auto
    hence afin: "\<mu> a < \<omega>"
      using fin by auto
    have *: "b = b - a \<union> a" using asm by auto
    have **: "(b - a) \<inter> a = {}" using asm by auto
    have iv: "\<mu> (b - a) + \<mu> a = \<mu> b"
      using M.measure_additive[of "b - a" a]
        conjunct1[OF asm(1)] conjunct1[OF asm(2)] * **
      by auto
    have v: "\<nu> (b - a) + \<nu> a = \<nu> b"
      using M'.measure_additive[of "b - a" a]
        conjunct1[OF asm(1)] conjunct1[OF asm(2)] * **
      by auto
    from iv v have "\<mu> (b - a) = \<nu> (b - a)" using asm afin
      pinfreal_add_cancel_right[of "\<mu> (b - a)" "\<nu> a" "\<nu> (b - a)"]
      by auto
    thus "b - a \<in> sets M \<and> \<mu> (b - a) = \<nu> (b - a)"
      using asm by auto
  next
    fix a assume "\<And>i j :: nat. i \<noteq> j \<Longrightarrow> a i \<inter> a j = {}"
      "\<And>i. a i \<in> sets M \<and> \<mu> (a i) = \<nu> (a i)"
    thus "(\<Union>x. a x) \<in> sets M \<and> \<mu> (\<Union>x. a x) = \<nu> (\<Union>x. a x)"
      using M.measure_countably_additive
        M'.measure_countably_additive
        M.countable_UN
      apply (auto simp add:disjoint_family_on_def image_def)
      apply (subst M.measure_countably_additive[symmetric])
      apply (auto simp add:disjoint_family_on_def)
      apply (subst M'.measure_countably_additive[symmetric])
      by (auto simp add:disjoint_family_on_def)
  qed
  have *: "sets E \<subseteq> ?D_sets"
    using eq E sigma_sets.Basic[of _ "sets E"]
    by (auto simp add:sigma_def)
  have **: "?D_sets \<subseteq> sets M" by auto
  have "M = \<lparr> space = space M , sets = ?D_sets \<rparr>"
    unfolding E(1)
    apply (rule dynkin_lemma[OF E(2)])
    using eq E space_sigma \<delta> sigma_sets.Basic
    by (auto simp add:sigma_def)
  from subst[OF this, of "\<lambda> M. A \<in> sets M", OF A]
  show ?thesis by auto
qed
(*
lemma
  assumes sfin: "range A \<subseteq> sets M" "(\<Union>i. A i) = space M" "\<And> i :: nat. \<nu> (A i) < \<omega>"
  assumes A: "\<And>  i. \<mu> (A i) = \<nu> (A i)" "\<And> i. A i \<subseteq> A (Suc i)"
  assumes E: "M = sigma (space E) (sets E)" "Int_stable E"
  assumes eq: "\<And> e. e \<in> sets E \<Longrightarrow> \<mu> e = \<nu> e"
  assumes ms: "measure_space (M :: 'a algebra) \<mu>" "measure_space M \<nu>"
  assumes B: "B \<in> sets M"
  shows "\<mu> B = \<nu> B"
proof -
  interpret M: measure_space M \<mu> by (rule ms)
  interpret M': measure_space M \<nu> by (rule ms)
  have *: "M = \<lparr> space = space M, sets = sets M \<rparr>" by auto
  { fix i :: nat
    have **: "M\<lparr> space := A i, sets := op \<inter> (A i) ` sets M \<rparr> =
      \<lparr> space = A i, sets = op \<inter> (A i) ` sets M \<rparr>"
      by auto
    have mu_i: "measure_space \<lparr> space = A i, sets = op \<inter> (A i) ` sets M \<rparr> \<mu>"
      using M.restricted_measure_space[of "A i", simplified **]
        sfin by auto
    have nu_i: "measure_space \<lparr> space = A i, sets = op \<inter> (A i) ` sets M \<rparr> \<nu>"
      using M'.restricted_measure_space[of "A i", simplified **]
        sfin by auto
    let ?M = "\<lparr> space = A i, sets = op \<inter> (A i) ` sets M \<rparr>"
    have "\<mu> (A i \<inter> B) = \<nu> (A i \<inter> B)"
      apply (rule measure_eq[of \<mu> ?M \<nu> "\<lparr> space = space E \<inter> A i, sets = op \<inter> (A i) ` sets E\<rparr>" "A i \<inter> B", simplified])
      using assms nu_i mu_i
      apply (auto simp add:image_def) (* TODO *) sorry
    show ?thesis sorry
qed
*)
definition prod_sets where
  "prod_sets A B = {z. \<exists>x \<in> A. \<exists>y \<in> B. z = x \<times> y}"

definition
  "prod_measure_space M1 M2 = sigma (space M1 \<times> space M2) (prod_sets (sets M1) (sets M2))"

lemma
  fixes M1 :: "'a algebra" and M2 :: "'b algebra"
  assumes "algebra M1" "algebra M2"
  shows measureable_fst[intro!, simp]:
    "fst \<in> measurable (prod_measure_space M1 M2) M1" (is ?fst)
  and measureable_snd[intro!, simp]:
    "snd \<in> measurable (prod_measure_space M1 M2) M2" (is ?snd)
proof -
  interpret M1: algebra M1 by fact
  interpret M2: algebra M2 by fact

  { fix X assume "X \<in> sets M1"
    then have "\<exists>X1\<in>sets M1. \<exists>X2\<in>sets M2. fst -` X \<inter> space M1 \<times> space M2 = X1 \<times> X2"
      apply - apply (rule bexI[of _ X]) apply (rule bexI[of _ "space M2"])
      using M1.sets_into_space by force+ }
  moreover
  { fix X assume "X \<in> sets M2"
    then have "\<exists>X1\<in>sets M1. \<exists>X2\<in>sets M2. snd -` X \<inter> space M1 \<times> space M2 = X1 \<times> X2"
      apply - apply (rule bexI[of _ "space M1"]) apply (rule bexI[of _ X])
      using M2.sets_into_space by force+ }
  ultimately show ?fst ?snd
    by (force intro!: sigma_sets.Basic
              simp: measurable_def prod_measure_space_def prod_sets_def sets_sigma)+
qed

lemma (in sigma_algebra) measureable_prod:
  fixes M1 :: "'a algebra" and M2 :: "'b algebra"
  assumes "algebra M1" "algebra M2"
  shows "f \<in> measurable M (prod_measure_space M1 M2) \<longleftrightarrow>
    (fst \<circ> f) \<in> measurable M M1 \<and> (snd \<circ> f) \<in> measurable M M2"
using assms proof (safe intro!: measurable_comp[where b="prod_measure_space M1 M2"])
  interpret M1: algebra M1 by fact
  interpret M2: algebra M2 by fact
  assume f: "(fst \<circ> f) \<in> measurable M M1" and s: "(snd \<circ> f) \<in> measurable M M2"

  show "f \<in> measurable M (prod_measure_space M1 M2)" unfolding prod_measure_space_def
  proof (rule measurable_sigma)
    show "prod_sets (sets M1) (sets M2) \<subseteq> Pow (space M1 \<times> space M2)"
      unfolding prod_sets_def using M1.sets_into_space M2.sets_into_space by auto
    show "f \<in> space M \<rightarrow> space M1 \<times> space M2"
      using f s by (auto simp: mem_Times_iff measurable_def comp_def)
    fix A assume "A \<in> prod_sets (sets M1) (sets M2)"
    then obtain B C where "B \<in> sets M1" "C \<in> sets M2" "A = B \<times> C"
      unfolding prod_sets_def by auto
    moreover have "(fst \<circ> f) -` B \<inter> space M \<in> sets M"
      using f `B \<in> sets M1` unfolding measurable_def by auto
    moreover have "(snd \<circ> f) -` C \<inter> space M \<in> sets M"
      using s `C \<in> sets M2` unfolding measurable_def by auto
    moreover have "f -` A \<inter> space M = ((fst \<circ> f) -` B \<inter> space M) \<inter> ((snd \<circ> f) -` C \<inter> space M)"
      unfolding `A = B \<times> C` by (auto simp: vimage_Times)
    ultimately show "f -` A \<inter> space M \<in> sets M" by auto
  qed
qed

definition
  "prod_measure M \<mu> N \<nu> = (\<lambda>A. measure_space.positive_integral M \<mu> (\<lambda>s0. \<nu> ((\<lambda>s1. (s0, s1)) -` A)))"

lemma prod_setsI: "x \<in> A \<Longrightarrow> y \<in> B \<Longrightarrow> (x \<times> y) \<in> prod_sets A B"
  by (auto simp add: prod_sets_def)

lemma sigma_prod_sets_finite:
  assumes "finite A" and "finite B"
  shows "sigma_sets (A \<times> B) (prod_sets (Pow A) (Pow B)) = Pow (A \<times> B)"
proof safe
  have fin: "finite (A \<times> B)" using assms by (rule finite_cartesian_product)

  fix x assume subset: "x \<subseteq> A \<times> B"
  hence "finite x" using fin by (rule finite_subset)
  from this subset show "x \<in> sigma_sets (A\<times>B) (prod_sets (Pow A) (Pow B))"
    (is "x \<in> sigma_sets ?prod ?sets")
  proof (induct x)
    case empty show ?case by (rule sigma_sets.Empty)
  next
    case (insert a x)
    hence "{a} \<in> sigma_sets ?prod ?sets" by (auto simp: prod_sets_def intro!: sigma_sets.Basic)
    moreover have "x \<in> sigma_sets ?prod ?sets" using insert by auto
    ultimately show ?case unfolding insert_is_Un[of a x] by (rule sigma_sets_Un)
  qed
next
  fix x a b
  assume "x \<in> sigma_sets (A\<times>B) (prod_sets (Pow A) (Pow B))" and "(a, b) \<in> x"
  from sigma_sets_into_sp[OF _ this(1)] this(2)
  show "a \<in> A" and "b \<in> B"
    by (auto simp: prod_sets_def)
qed

lemma (in sigma_algebra) measurable_prod_sigma:
  assumes sa1: "sigma_algebra a1" and sa2: "sigma_algebra a2"
  assumes 1: "(fst o f) \<in> measurable M a1" and 2: "(snd o f) \<in> measurable M a2"
  shows "f \<in> measurable M (sigma ((space a1) \<times> (space a2))
                          (prod_sets (sets a1) (sets a2)))"
proof -
  from 1 have fn1: "fst \<circ> f \<in> space M \<rightarrow> space a1"
     and q1: "\<forall>y\<in>sets a1. (fst \<circ> f) -` y \<inter> space M \<in> sets M"
    by (auto simp add: measurable_def)
  from 2 have fn2: "snd \<circ> f \<in> space M \<rightarrow> space a2"
     and q2: "\<forall>y\<in>sets a2. (snd \<circ> f) -` y \<inter> space M \<in> sets M"
    by (auto simp add: measurable_def)
  show ?thesis
    proof (rule measurable_sigma)
      show "prod_sets (sets a1) (sets a2) \<subseteq> Pow (space a1 \<times> space a2)" using sa1 sa2
        by (auto simp add: prod_sets_def sigma_algebra_iff dest: algebra.space_closed)
    next
      show "f \<in> space M \<rightarrow> space a1 \<times> space a2"
        by (rule prod_final [OF fn1 fn2])
    next
      fix z
      assume z: "z \<in> prod_sets (sets a1) (sets a2)"
      thus "f -` z \<inter> space M \<in> sets M"
        proof (auto simp add: prod_sets_def vimage_Times)
          fix x y
          assume x: "x \<in> sets a1" and y: "y \<in> sets a2"
          have "(fst \<circ> f) -` x \<inter> (snd \<circ> f) -` y \<inter> space M =
                ((fst \<circ> f) -` x \<inter> space M) \<inter> ((snd \<circ> f) -` y \<inter> space M)"
            by blast
          also have "...  \<in> sets M" using x y q1 q2
            by blast
          finally show "(fst \<circ> f) -` x \<inter> (snd \<circ> f) -` y \<inter> space M \<in> sets M" .
        qed
    qed
qed

lemma (in sigma_finite_measure) prod_measure_times:
  assumes "sigma_finite_measure N \<nu>"
  and "A1 \<in> sets M" "A2 \<in> sets N"
  shows "prod_measure M \<mu> N \<nu> (A1 \<times> A2) = \<mu> A1 * \<nu> A2"
  oops

lemma (in sigma_finite_measure) sigma_finite_prod_measure_space:
  assumes "sigma_finite_measure N \<nu>"
  shows "sigma_finite_measure (prod_measure_space M N) (prod_measure M \<mu> N \<nu>)"
  oops

lemma (in finite_measure_space) finite_prod_measure_times:
  assumes "finite_measure_space N \<nu>"
  and "A1 \<in> sets M" "A2 \<in> sets N"
  shows "prod_measure M \<mu> N \<nu> (A1 \<times> A2) = \<mu> A1 * \<nu> A2"
proof -
  interpret N: finite_measure_space N \<nu> by fact
  have *: "\<And>x. \<nu> (Pair x -` (A1 \<times> A2)) * \<mu> {x} = (if x \<in> A1 then \<nu> A2 * \<mu> {x} else 0)"
    by (auto simp: vimage_Times comp_def)
  have "finite A1"
    using `A1 \<in> sets M` finite_space by (auto simp: sets_eq_Pow intro: finite_subset)
  then have "\<mu> A1 = (\<Sum>x\<in>A1. \<mu> {x})" using `A1 \<in> sets M`
    by (auto intro!: measure_finite_singleton simp: sets_eq_Pow)
  then show ?thesis using `A1 \<in> sets M`
    unfolding prod_measure_def positive_integral_finite_eq_setsum *
    by (auto simp add: sets_eq_Pow setsum_right_distrib[symmetric] mult_commute setsum_cases[OF finite_space])
qed

lemma (in finite_measure_space) finite_prod_measure_space:
  assumes "finite_measure_space N \<nu>"
  shows "prod_measure_space M N = \<lparr> space = space M \<times> space N, sets = Pow (space M \<times> space N) \<rparr>"
proof -
  interpret N: finite_measure_space N \<nu> by fact
  show ?thesis using finite_space N.finite_space
    by (simp add: sigma_def prod_measure_space_def sigma_prod_sets_finite sets_eq_Pow N.sets_eq_Pow)
qed

lemma (in finite_measure_space) finite_measure_space_finite_prod_measure:
  fixes N :: "('c, 'd) algebra_scheme"
  assumes N: "finite_measure_space N \<nu>"
  shows "finite_measure_space (prod_measure_space M N) (prod_measure M \<mu> N \<nu>)"
  unfolding finite_prod_measure_space[OF assms]
proof (rule finite_measure_spaceI, simp_all)
  interpret N: finite_measure_space N \<nu> by fact
  show "finite (space M \<times> space N)" using finite_space N.finite_space by auto
  show "prod_measure M \<mu> N \<nu> (space M \<times> space N) \<noteq> \<omega>"
    using finite_prod_measure_times[OF N top N.top] by simp
  show "prod_measure M \<mu> N \<nu> {} = 0"
    using finite_prod_measure_times[OF N empty_sets N.empty_sets] by simp

  fix A B :: "('a * 'c) set" assume "A \<inter> B = {}" "A \<subseteq> space M \<times> space N" "B \<subseteq> space M \<times> space N"
  then show "prod_measure M \<mu> N \<nu> (A \<union> B) = prod_measure M \<mu> N \<nu> A + prod_measure M \<mu> N \<nu> B"
    apply (auto simp add: sets_eq_Pow prod_measure_def positive_integral_add[symmetric]
                intro!: positive_integral_cong)
    apply (subst N.measure_additive)
    apply (auto intro!: arg_cong[where f=\<mu>] simp: N.sets_eq_Pow sets_eq_Pow)
    done
qed

lemma (in finite_measure_space) finite_measure_space_finite_prod_measure_alterantive:
  assumes N: "finite_measure_space N \<nu>"
  shows "finite_measure_space \<lparr> space = space M \<times> space N, sets = Pow (space M \<times> space N) \<rparr> (prod_measure M \<mu> N \<nu>)"
    (is "finite_measure_space ?M ?m")
  unfolding finite_prod_measure_space[OF N, symmetric]
  using finite_measure_space_finite_prod_measure[OF N] .

lemma prod_measure_times_finite:
  assumes fms: "finite_measure_space M \<mu>" "finite_measure_space N \<nu>" and a: "a \<in> space M \<times> space N"
  shows "prod_measure M \<mu> N \<nu> {a} = \<mu> {fst a} * \<nu> {snd a}"
proof (cases a)
  case (Pair b c)
  hence a_eq: "{a} = {b} \<times> {c}" by simp

  interpret M: finite_measure_space M \<mu> by fact
  interpret N: finite_measure_space N \<nu> by fact

  from finite_measure_space.finite_prod_measure_times[OF fms, of "{b}" "{c}"] M.sets_eq_Pow N.sets_eq_Pow a Pair
  show ?thesis unfolding a_eq by simp
qed

end