Before considering the generalization of Riemann integration, it is necessary to define what a simple function is.
Let’s say the range ϕ:R→R of the function values, which are non-negative, is a finite set {a1,a2,⋯,an}. If it satisfies Ai=ϕ−1({ai})∈M, then ϕ is called a simple function. Simple functions have the following properties:
(i): If i=j, then Ai∩Aj=∅
(ii): k=1⨆nAk=R
(iii): ϕ(x)=k=1∑nak1Ak(x) is a measurable function.
Simple functions are, by their very definition, composed of three elements that are too easy to handle. Firstly, since the function values are non-negative, there is no need to consider signs; secondly, being finite makes addition and subtraction flexible; and thirdly, they are measurable. The word simple is used in various ways in different fields of mathematics, but at least in real analysis, it can be considered the opposite of ‘complex’. Having defined simple functions that are easy and convenient to handle, it is immediately possible to think of a new integration that covers Riemann integration.
Lebesgue Integration of Simple Functions
When ϕ is a simple function and E∈M, ∫Eϕdm:=k=1∑nakm(Ak∩E) is called the Lebesgue Integral of the simple functionϕ. The Lebesgue integral has the following properties:
However, the condition of being a simple function is too strong and specific to be widely applicable. Adding an idea like the method of exhaustion roughly completes a satisfactory ‘Lebesgue Integral’.
When ϕ is a simple function, for a non-negative measurable functionf and E∈M,
∫Efdm:=sup{∫Eϕdm0≤ϕ≤f}
is called the Lebesgue Integral of the measurable functionf.
Fundamental Properties
The Lebesgue integral has the following properties:
[1]’: For all r≥0, ∫Erfdm=r∫Efdm
[2]’: For two simple functions f,g, if f≤g, then ∫Efdm≤∫Egdm
[3]’: If A,B∈M for A∩B=∅, then ∫A∪Bfdm=∫Afdm+∫Bfdm
[4]’: If A,B∈M for A⊂B, then ∫Afdm≤∫Bfdm
[5]’: If N∈N, then ∫Nfdm=0
[6]’: m(E)Einff≤∫Efdm≤m(E)Esupf
Explanation
In addition to these basic properties, the following theorem can be considered. Using this theorem, calculations as novel as ∫R1Qdm=0 can be completed in a single cut. Though not as simple to prove as it appears, it’s certainly worth a look at least once.
If E:=f−1(0,∞) for m(E)=0, then f is almost everywhere f=0. Assuming En:=f−1[n1,∞), if E=n=1⋃∞En while n→∞limEn=E holds true. Considering the simple function ϕn:=n11En≤f, we have
n1m(En)=∫Aϕndm≤∫Afdm=0
Therefore,
n1m(En)≤0
meaning, for all n∈N, m(En)=0.