Simple function under-approximation to a numerical function
From Maths
- 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
Contents
[hide]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. ∀x∈X[f(x)≥0], then we can construct a (non-negative) simple function that (under)-approximates f[Note 1] as follows:
- Snaf:N≥1×R≥0→E(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:X→R), we construct s below.
Construction of s
Notes
- Jump up ↑ if a:X→¯R is our approximating function, then to be an under-estimation:
- ∀x∈X[a(x)≤f(x)]
Reference
<reference/>