Simple Function: Difference between revisions

From Optimal Transport Wiki
Jump to navigation Jump to search
Line 70: Line 70:
which by countable additivity is equal to
which by countable additivity is equal to


<math> = \sum_{i,k} a_i \mu(E_i \cap A_k)</math>
<math> = \sum_{i=1}^n\sum_{k=1}^{\infty} a_i \mu(E_i \cap A_k) = \sum_{k=1}^{\infty}\sum_{i=1}^n a_i \mu(E_i \cap A_k)
=  \sum_{k=1}^{\infty} \int f 1_{A_k} = \sum_{k=1}^{\infty} \int_{A_k} f = \sum_{k=1}^{\infty} \nu(A_k). </math>


==References==
==References==

Revision as of 01:29, 12 December 2020

The simplest functions you will ever integrate, hence the name.

Definition

Let be a measure space. A measurable function is a simple function[1] if is a finite subset of . The standard representation[1] for a simple function is given by

,

where is the indicator function on the disjoint sets that partition , where .

Integration of Simple Functions

These functions earn their name from the simplicity in which their integrals are defined[2]. Let be the space of all measurable functions from to Then

where by convention, we let . Note that is equivalent to and that some arguments may be omitted when there is no confusion.

Furthermore, for any , we define

Properties of Simple Functions

Given simple functions , the following are true[2]:

  • if ;
  • ;
  • if , then ;
  • the function is a measure on .

Proof[3]

Let and be simple functions with their corresponding standard representations.

We show the first claim. Suppose . Then , implying . Similarly, . Thus, the first statement holds for this case.

Suppose . Then

.

Next, we show the second statement. Notice that we can rewrite and as unions of disjoint sets as follows

and

Then

which by countable additivity,

It is worth noting that this may not be the standard representation for the integral of .

As for the third statement, if , then whenever , it must be that , implying that

Finally, we show the last statement. Define . Now we show satisfies all the measure properties. Notice that is a nonnegative function on . Then compute

Consider a disjoint sequence of sets and let be its union. Then

which by countable additivity is equal to

References

  1. 1.0 1.1 Craig, Katy. MATH 201A Lecture 11. UC Santa Barbara, Fall 2020.
  2. 2.0 2.1 Folland, Gerald B. (1999). Real Analysis: Modern Techniques and Their Applications, John Wiley and Sons, ISBN 0471317160, Second edition.
  3. Craig, Katy. MATH 201A Lectures 12-13. UC Santa Barbara, Fall 2020.