Defocus aberration: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Michael Hardy
No edit summary
 
en>Epicgenius
Reverted 3 good faith edits by 2.246.114.74 using STiki (Mistake? Report it.)
Line 1: Line 1:
Emilia Shryock is my name but you can contact me something you like. [http://www.Nakedtruth.idaho.gov/do-I-have-an-std.aspx South Dakota] is exactly where I've always  at home std testing been living. One of the extremely best things in the world  at home std testing for  [http://www.pornextras.info/user/G49Z std testing at home] him is to collect badges but he is having difficulties to discover time for it. Hiring is her working day job now and she will not alter it anytime soon.<br><br>[http://Www.channel4embarrassingillnesses.com/men-in-white-coats/genital-herpes/symptoms/ Feel free] to visit  at home std testing  [http://www.videoworld.com/user/SMaloney www.videoworld.com] my weblog - std testing at home ([http://moodle.kspu.karelia.ru/user/view.php?id=23302&course=1 Our Webpage])
In [[measure theory]], the '''factorization lemma''' allows us to express a function ''f'' with another function ''T'' if ''f'' is [[measurable]] with respect to ''T''. An application of this is [[regression analysis]].
 
==Theorem==
Let <math>T:\Omega\rightarrow\Omega'</math> be a function of a set <math>\Omega</math> in a [[measure space]] <math>(\Omega',\mathcal{A}')</math> and let <math>f:\Omega\rightarrow\overline{\mathbb{R}}</math> be a scalar function on <math>\Omega</math>. Then <math>f</math> is measurable with respect to the [[σ-algebra]] <math>\sigma(T)=T^{-1}(\mathcal{A}')</math> generated by <math>T</math> in <math>\Omega</math> if and only if there exists a measurable function <math>g:(\Omega',\mathcal{A}')\rightarrow(\overline{\mathbb{R}},\mathcal{B}(\overline{\mathbb{R}}))</math> such that <math>f=g\circ T</math>, where <math>\mathcal{B}(\overline{\mathbb{R}})</math> denotes the [[Borel set]] of the real numbers. If <math>f</math> only takes finite values, then <math>g</math> also only takes finite values.
 
==Proof==
First, if <math>f=g\circ T</math>, then ''f'' is <math>\sigma(T)-\mathcal{B}(\overline{\mathbb{R}})</math> measurable because it is the composition of a <math>\sigma(T)-\mathcal{A}'</math> and of a <math>\mathcal{A}'-\mathcal{B}(\overline{\mathbb{R}})</math> measurable function. The proof of the converse falls into four parts: (1)''f'' is a [[step function]], (2)''f'' is a positive function, (3) ''f'' is any scalar function, (4) ''f'' only takes finite values.
 
===''f'' is a step function===
Suppose <math>f=\sum_{i=1}^n\alpha_i 1_{A_i}</math> is a step function, i.e. <math>n\in\mathbb{N}^*, \forall i\in[\![1,n]\!], A_i\in\sigma(T)</math> and <math>\alpha_i\in\mathbb{R}^+</math>. As ''T'' is a measurable function, for all ''i'', there exists <math>A_i'\in\mathcal{A}'</math> such that <math>A_i=T^{-1}(A_i')</math>. <math>g=\sum_{i=1}^n\alpha_i 1_{A_i'}</math> fulfils the requirements.
 
===''f'' takes only positive values===
If ''f'' takes only positive values, it is the limit of a sequence <math>(u_n)_{n\in\mathbb{N}}</math> of step functions. For each of these, by (1), there exists <math>g_n</math> such that <math>u_n=g_n\circ T</math>. The function <math>\lim_{n\rightarrow+\infty}g_n</math> fulfils the requirements.
 
===General case===
We can decompose ''f'' in a positive part <math>f^+</math> and a negative part <math>f^-</math>. We can then find <math>g_0^+</math> and <math>g_0^-</math> such that <math>f^+=g_0^+\circ T</math> and <math>f^-=g_0^-\circ T</math>. The problem is that the difference <math>g:=g^+-g^-</math> is not defined on the set <math>U=\{x:g_0^+(x)=+\infty\}\cap\{x:g_0^-(x)=+\infty\}</math>. Fortunately, <math>T(\Omega)\cap U=\varnothing</math> because <math>g_0^+(T(\omega))=f^+(\omega)=+\infty</math> always implies <math>g_0^-(T(\omega))=f^-(\omega)=0</math>
We define <math>g^+=1_{\Omega'\backslash U}g_0^+</math> and <math>g^-=1_{\Omega'\backslash U}g_0^-</math>. <math>g=g^+-g^-</math> fulfils the requirements.
 
===''f'' takes finite values only===
If ''f'' takes finite values only, we will show that ''g'' also only takes finite values. Let <math>U'=\{\omega:|g(\omega)|=+\infty\}</math>. Then <math>g_0=1_{\Omega'\backslash U'}g</math> fulfils the requirements because <math>U'\cap T(\Omega)=\varnothing</math>.
 
===Importance of the measure space===
If the function <math> f </math> is not scalar, but takes values in a different measurable space, such as <math>\mathbb{R} </math> with its trivial σ-algebra (the empty set, and the whole real line) instead of <math>\mathcal{B}(\mathbb{R}) </math>, then the lemma becomes false (as the restrictions on <math> f </math> are much weaker).
 
==References==
* Heinz Bauer, Ed. (1992) ''Maß- und Integrationstheorie''. Walter de Gruyter edition. 11.7 Faktorisierungslemma p.&nbsp;71-72.
 
[[Category:Measure theory]]
[[Category:Lemmas]]

Revision as of 16:51, 3 December 2013

In measure theory, the factorization lemma allows us to express a function f with another function T if f is measurable with respect to T. An application of this is regression analysis.

Theorem

Let T:ΩΩ be a function of a set Ω in a measure space (Ω,𝒜) and let f:Ω be a scalar function on Ω. Then f is measurable with respect to the σ-algebra σ(T)=T1(𝒜) generated by T in Ω if and only if there exists a measurable function g:(Ω,𝒜)(,()) such that f=gT, where () denotes the Borel set of the real numbers. If f only takes finite values, then g also only takes finite values.

Proof

First, if f=gT, then f is σ(T)() measurable because it is the composition of a σ(T)𝒜 and of a 𝒜() measurable function. The proof of the converse falls into four parts: (1)f is a step function, (2)f is a positive function, (3) f is any scalar function, (4) f only takes finite values.

f is a step function

Suppose f=i=1nαi1Ai is a step function, i.e. n*,i[[1,n]],Aiσ(T) and αi+. As T is a measurable function, for all i, there exists Ai𝒜 such that Ai=T1(Ai). g=i=1nαi1Ai fulfils the requirements.

f takes only positive values

If f takes only positive values, it is the limit of a sequence (un)n of step functions. For each of these, by (1), there exists gn such that un=gnT. The function limn+gn fulfils the requirements.

General case

We can decompose f in a positive part f+ and a negative part f. We can then find g0+ and g0 such that f+=g0+T and f=g0T. The problem is that the difference g:=g+g is not defined on the set U={x:g0+(x)=+}{x:g0(x)=+}. Fortunately, T(Ω)U= because g0+(T(ω))=f+(ω)=+ always implies g0(T(ω))=f(ω)=0 We define g+=1ΩUg0+ and g=1ΩUg0. g=g+g fulfils the requirements.

f takes finite values only

If f takes finite values only, we will show that g also only takes finite values. Let U={ω:|g(ω)|=+}. Then g0=1ΩUg fulfils the requirements because UT(Ω)=.

Importance of the measure space

If the function f is not scalar, but takes values in a different measurable space, such as with its trivial σ-algebra (the empty set, and the whole real line) instead of (), then the lemma becomes false (as the restrictions on f are much weaker).

References

  • Heinz Bauer, Ed. (1992) Maß- und Integrationstheorie. Walter de Gruyter edition. 11.7 Faktorisierungslemma p. 71-72.