Measures

Def: A set function is a function whose domain is a family of sets. An extended eral values set μ defined on a family E of sets is additive if, whenever E,F,E∪F∈E and E∩F=∅, then $$\mu(E \cup F) = \mu(E) + \mu(F).$$An extended real valued set function μ defined on a set E is finitely additive, if for every disjoint family {E1,…,En} of sets in E whose union is also in E, we have $$\mu\left(\bigcup_{i = 1}^n E_i\right) = \sum_{i = 1}^n\mu(E_i).$$An extended real valued set function μ defined on a class E is σ-additive if, for every disjoint sequence {En:n<ω} of sets in E whose union is also E, we have $$\mu\left(\bigcup_{n < \omega} E_n\right) = \sum_{n = 1}^\infty\mu(E_n).$$
Def: A measure is an extended real valued, non negative, and σ-additive set function μ, defined on a ring R, and such that μ(∅)=0.

Prop: If μ is an extended real valued, non negative, and additive set function defined on a ring R, and such that exists a E∈R such that μ(E)<∞, then μ(∅)=0.

Def: If μ is a measure on a ring R, a set E∈R is said to have finite measure if μ(E)<∞; the measure of E is σ-finite if there exists a sequence {En:n<ω} of sets in R such that E⊆⋃n<ωEn and μ(En)<∞ for all n<ω.

Prop: If E is a non empty family of sets and μ a measure on R(E) such that if E∈E, then μ(E)<∞, then μ is finite on R(E).

Def: If the measure of every set E in R is finite or σ-finite, the measure μ is called finite of σ-finite on R. If X∈R (i.e. if R is an algebra) and μ(X) is finite or σ-finite, then μ is called totally finite or totally σ-finite, respectively.

Prop: If μ is a measure on a σ-ring, then the family of all sets of finite measure is a ring and the family of all sets of σ-finite measure is a σ-ring.

Prop: Let μ be a σ-finite measure on a σ-ring. Then the family of all sets of finite measure a σ-ring iff μ is finite.

Def: The measure μ is called complete if the conditions E∈R, F⊆E and μ(E)=0 imply that F∈R.

Def: Let P be a semiring, and {E1,…,En} a finite pairwise disjoint family of elements of P whose union, E is also in P is called a P-partition of E. Let μ be an extended real valued, non negative and additive set function. The P-partition {E1,…,En} is called a μ partition, if for every F in P, $$\mu(E \cap F) = \sum_{i = 1}^n \mu(E_i \cap F).$$If {E1,…,En} and {F1,…,Fm} are P-partitions of E, then {E1,…,En} is called a subpartition of {F1,…,Fm} if each set Ei is contained in one of the sets Fj.

Lemma: If {E1,…,En} and {F1,…,Fm} are partitions of E, then so is their product, consisting of all sets of the form Ei∩Fj.

Lemma: If a subpartition of a partition {E1,…,En} is a μ-partition, then {E1,…,En} is a μ-partition.

Lemma: The product of two μ-partitions is a μ-partition.

Lemma: If E=C0⊆C1⊆⋯⊆Cn=F, where Ci∈P for i∈{0,…,n} and if Di=Ci−Ci−1∈P, for i∈{1,…,n}, then {E,D1,…,Dn} is a μ-partition of F.

Prop: Every partition of a set E in P is a μ-partition. Equivalently, we get that If μ is a extended real valued, non negative and additive set function defined on a Halmos semiring P such that μ(∅)=0, then μ is finitely additive.

Prop: If μ is a countably additive and non negative set function on a Halmos semiring P, such that μ(∅)=0, then there is a unique measure μ― on the ring R(P) such that E∈P, μ―(E)=μ(E). If μ is (totally) finte or σ-finite, then so is μ―.

Def: An extended real value set function μ on a family E is monotone if, whenever E,F∈E, and E⊆F, then μ(E)≤μ(F).

Def: An extended real value set function μ on a family E is subtractive if, whenever E,F,E∖F∈E, E⊆F, and |μ(E)|<∞, then μ(F∖E)=μ(F)−μ(E).

Th: If μ is a measure on a ring R, then μ is monotone and subtractive.

Th: If μ is a measure on a ring R, if E∈R, and if {En:n<ω} of sets in R such that E⊆⋃n<ωEn, then $$\mu(E) \le \sum_{n < \omega} \mu(E_n).$$
Th: If μ is a measure on a ring R, if E∈R, and if {En:n<ω} inifinite disjoint sequence of sets in R such that ⋃n<ωEn⊆E, then $$\sum_{n <\omega} \mu(E_n) \le \mu(E).$$
Th: If μ is a measure on a ring R and {En:n<ω} is an increasing sequence of sets in R for for which limn→∞En∈R, then $$\mu\left(\lim_{n \to \infty} E_n\right) = \lim_{n \to \infty} \mu(E_n).$$
Th: If μ is a measure on a ring R and {En:n<ω} is an decreasing sequence of sets in R of which one has finite measure and for which limn→∞En∈R, then $$\mu\left(\lim_{n \to \infty} E_n\right) = \lim_{n \to \infty} \mu(E_n).$$
Def: An extended real valued set function μ defined on a family E, is continuous from below at a set E if for every increasing sequence {En:n<ω} of sets in E for which limn→∞En=E, we have limn→∞μ(En)=μ(E). Similarly, μ is continuous from above at E if, for every decreasing sequence {En:n<ω} of sets in E for which |μ(Em)|<∞ for at least one value of m and for which limn→∞μ(En)=μ(E).

Obs: The two theorems above, we see that if μ is a measure, then μ is continuous from above and from below.

Cor: If μ is a measure on a ring R and if {En:n<ω} is a sequence of sets in R for which ⋂n≤m<ωEn∈R, for m<ω and lim infn→∞En∈R, then $$\mu\left(\liminf_{n \to \infty} E_n\right) \le \liminf_{n \to \infty} \mu(E_n).$$
Cor: If μ is a measure on a ring R and if {En:n<ω} is a sequence of sets in R for which ⋃n≤m<ωEn∈R, for m<ω, lim infn→∞En∈R, and if μ(⋃n≤m<ωEm)<∞ then $$ \limsup_{n \to \infty} \mu(E_n)\le \mu\left(\limsup_{n \to \infty} E_n\right).$$
Cor: If μ is a measure on a ring R and if {En:n<ω} is a sequence of sets in R for which ⋃n≤m<ωEn∈R, for m<ω, lim infn→∞En∈R, if μ(⋃n≤m<ωEm)<∞, and ∑n<ωμ(En)<∞, then μ(lim supEn)=0.

Th: Let μ a finite, non negative, and additive set function on a ring R. If μ is either continuous from below at every E∈R, or continuous from below at ∅, then μ is a measure on R.

Prop: If μ is a measure on a ring R, then if E,F∈R, then μ(E)+μ(F)=μ(E∪F)+μ(E∩F).