Consider the set function ℙ defined for every subset of [0,1] by the formula that ℙ(A)=0 if A is

step 1 Let omega be a countable set. We define a function mu on our sigma algebra F as in this way, mu

Consider the set function ℙ defined for every subset of...

Consider the set function $\mathbb{P}$ defined for every subset of $[0,1]$ by the formula that $\mathbb{P}(A)=0$ if $A$ is a finite set and $\mathbb{P}(A)=\infty$ if $A$ is an infinite set. Show that $\mathbb{P}$ satisfies (1.1.3)-(1.1.5), but $\mathbb{P}$ does not have the countable additivity property (1.1.2). We see then that the finite additivity property (1.1.5) does not imply the countable additivity property (1.1.2).

Labs

Want to see this concept in action?

NEW

Explore this concept interactively to see how it behaves as you change inputs.

View Labs

Key Concepts

Set Function

A set function is a rule that assigns a value (often a number) to each subset of a given set. In measure theory, these functions are used to generalize the concept of length, area, and volume to more abstract sets. The particular set function considered here simply distinguishes between finite and infinite subsets by assigning 0 to finite sets and ? to infinite sets.

Finite Additivity

Finite additivity is a property of a set function that requires the function's value on the union of a finite number of disjoint sets to equal the sum of its values on each set individually. This property is useful when dealing with disjoint pieces of a set and ensures that the measure of the whole can be broken down into the measures of its parts, provided there are only finitely many parts.

Countable Additivity

Countable additivity, also known as ?-additivity, is a stronger property than finite additivity. It requires that if you have a countable collection of disjoint sets, the measure of the union of these sets is equal to the sum of the measures of each individual set. The example in the question illustrates that a set function can satisfy finite additivity while failing to be countably additive, highlighting that countable additivity is a stricter requirement in measure theory.

Please give Ace some feedback