Simple function under-approximation to a numerical function

From Maths
Jump to: navigation, search
See notes page: Notes:Simple function approximation to a numerical function


Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Important for measure theory, and needs a name. SNAF simple numerical approximation function

Definition

Let (X,A) be a measurable space. A \Snaf is a simple numerical approximation function

EARLY VERSION

Definition

TODO: I need to come up with better definitions

Let (X,A) be a measurable space and let f:X¯R be an A/B(¯R)-measurable function that is non-negative, i.e. xX[f(x)0], then we can construct a (non-negative) simple function that (under)-approximates f[Note 1] as follows:

  • Snaf:N1×R0E(A) - recall that E(A) denotes the set of all simple functions on A and that simple functions by their nature have the reals as their co-domain.
    • We could say the mapping Snaf is given by: Snaf:(n,r)(s:XR), we construct s below.

Construction of s

Notes

  1. Jump up if a:X¯R is our approximating function, then to be an under-estimation:
    • xX[a(x)f(x)]
    Note that this would be an "over-estimation" (sort of) in the negative case. This is one of the reasons we forbid f from ever being below zero

Reference

<reference/>