362 using A X |
362 using A X |
363 by (intro countable_INT) auto |
363 by (intro countable_INT) auto |
364 finally show ?thesis . |
364 finally show ?thesis . |
365 qed |
365 qed |
366 |
366 |
|
367 lemma (in sigma_algebra) countable_INT'': |
|
368 "UNIV \<in> M \<Longrightarrow> countable I \<Longrightarrow> (\<And>i. i \<in> I \<Longrightarrow> F i \<in> M) \<Longrightarrow> (\<Inter>i\<in>I. F i) \<in> M" |
|
369 by (cases "I = {}") (auto intro: countable_INT') |
367 |
370 |
368 lemma (in sigma_algebra) countable: |
371 lemma (in sigma_algebra) countable: |
369 assumes "\<And>a. a \<in> A \<Longrightarrow> {a} \<in> M" "countable A" |
372 assumes "\<And>a. a \<in> A \<Longrightarrow> {a} \<in> M" "countable A" |
370 shows "A \<in> M" |
373 shows "A \<in> M" |
371 proof - |
374 proof - |
2283 proof (rule measurable_measure_of) |
2286 proof (rule measurable_measure_of) |
2284 show "f \<in> space N \<rightarrow> UNION M space" |
2287 show "f \<in> space N \<rightarrow> UNION M space" |
2285 using measurable_space[OF f] M by auto |
2288 using measurable_space[OF f] M by auto |
2286 qed (auto intro: measurable_sets f dest: sets.sets_into_space) |
2289 qed (auto intro: measurable_sets f dest: sets.sets_into_space) |
2287 |
2290 |
|
2291 lemma Sup_sigma_sigma: |
|
2292 assumes [simp]: "M \<noteq> {}" and M: "\<And>m. m \<in> M \<Longrightarrow> m \<subseteq> Pow \<Omega>" |
|
2293 shows "(\<Squnion>\<^sub>\<sigma> m\<in>M. sigma \<Omega> m) = sigma \<Omega> (\<Union>M)" |
|
2294 proof (rule measure_eqI) |
|
2295 { fix a m assume "a \<in> sigma_sets \<Omega> m" "m \<in> M" |
|
2296 then have "a \<in> sigma_sets \<Omega> (\<Union>M)" |
|
2297 by induction (auto intro: sigma_sets.intros) } |
|
2298 then show "sets (\<Squnion>\<^sub>\<sigma> m\<in>M. sigma \<Omega> m) = sets (sigma \<Omega> (\<Union>M))" |
|
2299 apply (simp add: sets_Sup_sigma space_measure_of_conv M Union_least) |
|
2300 apply (rule sigma_sets_eqI) |
|
2301 apply auto |
|
2302 done |
|
2303 qed (simp add: Sup_sigma_def emeasure_sigma) |
|
2304 |
|
2305 lemma SUP_sigma_sigma: |
|
2306 assumes M: "M \<noteq> {}" "\<And>m. m \<in> M \<Longrightarrow> f m \<subseteq> Pow \<Omega>" |
|
2307 shows "(\<Squnion>\<^sub>\<sigma> m\<in>M. sigma \<Omega> (f m)) = sigma \<Omega> (\<Union>m\<in>M. f m)" |
|
2308 proof - |
|
2309 have "Sup_sigma (sigma \<Omega> ` f ` M) = sigma \<Omega> (\<Union>(f ` M))" |
|
2310 using M by (intro Sup_sigma_sigma) auto |
|
2311 then show ?thesis |
|
2312 by (simp add: image_image) |
|
2313 qed |
|
2314 |
2288 subsection {* The smallest $\sigma$-algebra regarding a function *} |
2315 subsection {* The smallest $\sigma$-algebra regarding a function *} |
2289 |
2316 |
2290 definition |
2317 definition |
2291 "vimage_algebra X f M = sigma X {f -` A \<inter> X | A. A \<in> sets M}" |
2318 "vimage_algebra X f M = sigma X {f -` A \<inter> X | A. A \<in> sets M}" |
2292 |
2319 |
2330 also have "\<dots> \<in> sets N" |
2357 also have "\<dots> \<in> sets N" |
2331 using f Y by (rule measurable_sets) |
2358 using f Y by (rule measurable_sets) |
2332 finally show "g -` A \<inter> space N \<in> sets N" . |
2359 finally show "g -` A \<inter> space N \<in> sets N" . |
2333 qed (insert g, auto) |
2360 qed (insert g, auto) |
2334 |
2361 |
|
2362 lemma vimage_algebra_sigma: |
|
2363 assumes X: "X \<subseteq> Pow \<Omega>'" and f: "f \<in> \<Omega> \<rightarrow> \<Omega>'" |
|
2364 shows "vimage_algebra \<Omega> f (sigma \<Omega>' X) = sigma \<Omega> {f -` A \<inter> \<Omega> | A. A \<in> X }" (is "?V = ?S") |
|
2365 proof (rule measure_eqI) |
|
2366 have \<Omega>: "{f -` A \<inter> \<Omega> |A. A \<in> X} \<subseteq> Pow \<Omega>" by auto |
|
2367 show "sets ?V = sets ?S" |
|
2368 using sigma_sets_vimage_commute[OF f, of X] |
|
2369 by (simp add: space_measure_of_conv f sets_vimage_algebra2 \<Omega> X) |
|
2370 qed (simp add: vimage_algebra_def emeasure_sigma) |
|
2371 |
2335 lemma vimage_algebra_vimage_algebra_eq: |
2372 lemma vimage_algebra_vimage_algebra_eq: |
2336 assumes *: "f \<in> X \<rightarrow> Y" "g \<in> Y \<rightarrow> space M" |
2373 assumes *: "f \<in> X \<rightarrow> Y" "g \<in> Y \<rightarrow> space M" |
2337 shows "vimage_algebra X f (vimage_algebra Y g M) = vimage_algebra X (\<lambda>x. g (f x)) M" |
2374 shows "vimage_algebra X f (vimage_algebra Y g M) = vimage_algebra X (\<lambda>x. g (f x)) M" |
2338 (is "?VV = ?V") |
2375 (is "?VV = ?V") |
2339 proof (rule measure_eqI) |
2376 proof (rule measure_eqI) |
2340 have "(\<lambda>x. g (f x)) \<in> X \<rightarrow> space M" "\<And>A. A \<inter> f -` Y \<inter> X = A \<inter> X" |
2377 have "(\<lambda>x. g (f x)) \<in> X \<rightarrow> space M" "\<And>A. A \<inter> f -` Y \<inter> X = A \<inter> X" |
2341 using * by auto |
2378 using * by auto |
2342 with * show "sets ?VV = sets ?V" |
2379 with * show "sets ?VV = sets ?V" |
2343 by (simp add: sets_vimage_algebra2 ex_simps[symmetric] vimage_comp comp_def del: ex_simps) |
2380 by (simp add: sets_vimage_algebra2 ex_simps[symmetric] vimage_comp comp_def del: ex_simps) |