Redshift: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>John
en>ClueBot NG
m Reverting possible vandalism by 50.76.147.45 to version by Banedon. False positive? Report it. Thanks, ClueBot NG. (1717231) (Bot)
Line 1: Line 1:
[[File:Integral as region under curve.svg|thumb|right|The integral as the area of a region under a curve.]]
Alyson is the name people use to call me and I believe it sounds quite great when you say it. To perform domino is something I really appreciate performing. She functions as a travel agent but quickly she'll be on her personal. Mississippi is the only location I've been residing in but I will have to transfer in a yr or two.<br><br>My weblog :: phone psychic ([http://www.light4america.com/profile.php?u=Lu82F http://www.light4america.com/profile.php?u=Lu82F])
[[File:Riemann integral regular.gif|thumb|right|A sequence of Riemann sums over a regular partition of an interval. The number on top is the total area of the rectangles, which converges to the integral of the function.]]
[[File:Riemann integral irregular.gif|thumb|right|The partition does not need to be regular, as shown here. The approximation works as long as the width of each subdivision tends to zero.]]
{{Calculus |Integral}}
 
In the branch of [[mathematics]] known as [[real analysis]], the '''Riemann integral''', created by [[Bernhard Riemann]], was the first rigorous definition of the [[integral]] of a [[function (mathematics)|function]] on an [[Interval (mathematics)|interval]].<ref>The Riemann integral was introduced in Bernhard Riemann's paper "Über die Darstellbarkeit einer Function durch eine trigonometrische Reihe" (On the representability of a function by a trigonometric series; i.e., when can a function be represented by a trigonometric series).  This paper was submitted to the University of Göttingen in 1854 as Riemann's ''Habilitationsschrift'' (qualification to become an instructor). It was published in 1868 in ''Abhandlungen der Königlichen Gesellschaft der Wissenschaften zu Göttingen'' (Proceedings of the Royal Philosophical Society at Göttingen), vol. 13, pages 87-132. (Available on-line [http://books.google.com/books?id=PDVFAAAAcAAJ&pg=RA1-PA87 here].) For Riemann's definition of his integral, see section 4, "Über der Begriff eines bestimmten Integrals und den Umfang seiner Gültigkeit" (On the concept of a definite integral and the extent of its validity), pages 101-103.</ref> For many functions and practical applications, the Riemann integral can be evaluated by using the [[fundamental theorem of calculus]] or (approximately) by [[numerical integration]].
 
The Riemann integral is unsuitable for many theoretical purposes. Some of the technical deficiencies in Riemann integration can be remedied with the [[Riemann&ndash;Stieltjes integral]], and most disappear with the [[Lebesgue integral]].
 
== Overview ==
 
Let ''f'' be a non-negative [[real numbers|real]]-valued function of the interval [''a'', ''b''], and let
 
:<math>S = \left \{ (x, y) \, : \ a \leq x \leq b, 0 < y < f(x) \right \}</math>
 
be the region of the plane under the graph of the function ''f'' and above the interval [''a'', ''b''] (see the figure on the top right).  We are interested in measuring the area of ''S''.  Once we have measured it, we will denote the area by:
 
:<math>\int_{a}^{b}f(x)\,dx.</math>
 
The basic idea of the Riemann integral is to use very simple approximations for the area of ''S''. By taking better and better approximations, we can say that "in the limit" we get exactly the area of ''S'' under the curve.
 
Note that where ''f'' can be both positive and negative, the definition of ''S'' is modified so that the integral corresponds to the ''signed area'' under the graph of ''f'', that is, the area above the ''x''-axis minus the area below the ''x''-axis.
 
== Definition ==
 
=== Partitions of an interval ===
 
A [[partition of an interval]] [''a'', ''b''] is a finite sequence of numbers of the form
 
: <math>a = x_0 < x_1 < x_2 < \cdots < x_n = b</math>
 
Each
 
:<math>\left [x_i,x_{i+1} \right ]</math>
 
is called a '''subinterval''' of the partition.  The '''mesh''' or '''norm''' of a partition is defined to be the length of the longest subinterval, that is,
 
:<math>\max (x_{i+1}-x_i), \quad i \in [0,n-1].</math>
 
A '''tagged partition''' <math>P(x,t)</math> of an interval [''a'', ''b''] is a partition together with a finite sequence of numbers <math>t_0,\dots,t_{n-1}</math> subject to the conditions that for each ''i'', <math>t_i \in [x_i,x_{i+1}]</math>.  In other words, it is a partition together with a distinguished point of every subinterval.  The mesh of a tagged partition is the same as that of an ordinary partition.
 
Suppose that two partitions <math>P(x,t)</math> and <math>Q(y,s)</math> are both partitions of the interval [''a'', ''b''].  We say that <math>Q(y,s)</math> is a '''refinement''' of <math>P(x,t)</math> if for each integer ''i'', with <math>i \in [0,n]</math>,  there exists an integer <math>r(i)</math> such that <math>x_i=y_{r(i)}</math> and such that <math>t_i=s_j</math> for some ''j'' with <math>j \in [r(i),r(i+1))</math>. Said more simply, a refinement of a tagged partition adds tags to the partition, thus it "refines" the accuracy of the partition.
 
We can define a [[partial order]] on the set of all tagged partitions by saying that one tagged partition is greater or equal to another if the former is a refinement of the latter.
 
=== Riemann sums ===
Choose a real-valued function ''f'' which is defined on the interval [''a'', ''b''].  The ''[[Riemann sum]]'' of ''f'' with respect to the tagged partition <math>x_0,\ldots,x_n</math> together with <math>t_0,\ldots,t_{n-1}</math> is:<ref>{{cite book|author=Crantz, Steven G.|title=Real Analysis and Foundations|publisher=CRC Press|year=2005|isbn=9781584884835|page=219|url=http://books.google.com/books?id=oWao9tYvYXAC&pg=PA219}}</ref>
 
:<math>\sum_{i=0}^{n-1} f(t_i) (x_{i+1}-x_i).</math>
 
Each term in the sum is the product of the value of the function at a given point, and the length of an interval.  Consequently, each term represents the area of a rectangle with height <math>f(t_i)</math> and width <math>x_{i+1}-x_i</math>.  The Riemann sum is the signed area under all the rectangles.
 
=== {{anchor|Riemann-integrable}} Riemann integral ===
Loosely speaking, the Riemann integral is the limit of the Riemann sums of a function as the partitions get finer. If the limit exists then the function is said to be '''integrable''' (or more specifically '''Riemann-integrable''').  The Riemann sum can be made as close as desired to the Riemann integral by making the partition fine enough.<ref>{{Cite book|last=Taylor|first=Michael E.|authorlink=Michael E. Taylor|title=Measure Theory and Integration|publisher=American Mathematical Society|year=2006|isbn=9780821872468|page=1|url=http://books.google.com/books?id=P_zJA-E5oe4C&pg=PA1}}</ref>
 
One important fact is that the mesh of the partitions must become smaller and smaller, so that in the limit, it is zero.  If this were not so, then we would not be getting a good approximation to the function on certain subintervals.  In fact, this is enough to define an integral.  To be specific, we say that the Riemann integral of ''f'' equals ''s'' if the following condition holds:
 
<blockquote>For all ε > 0, there exists δ such that for any tagged partition <math>x_0,\ldots,x_n</math> and <math>t_0,\ldots,t_{n-1}</math> whose mesh is less than δ, we have
 
:<math>\left|\sum_{i=0}^{n-1} f(t_i) (x_{i+1}-x_i) - s\right| < \varepsilon.</math></blockquote>
 
Unfortunately, this definition is very difficult to use.  It would help to develop an equivalent definition of the Riemann integral which is easier to work with.  We develop this definition now, with a proof of equivalence following.  Our new definition says that the Riemann integral of ''f'' equals ''s''  if the following condition holds:
 
<blockquote>For all ε > 0, there exists a tagged partition <math>x_0,\ldots,x_n</math> and <math>t_0,\ldots,t_{n-1}</math> such that for any refinement <math>y_0, \ldots, y_m</math> and <math>s_0,\ldots,s_{m-1}</math> of <math>x_0,\ldots,x_n</math> and <math>t_0,\ldots,t_{n-1}</math>, we have
 
: <math>\left|\sum_{i=0}^{m-1} f(s_i) (y_{i+1}-y_i) - s\right| < \varepsilon.</math></blockquote>
 
Both of these mean that eventually, the Riemann sum of ''f'' with respect to any partition gets trapped close to ''s''.  Since this is true no matter how close we demand the sums be trapped, we say that the Riemann sums converge to ''s''.  These definitions are actually a special case of a more general concept, a [[net (mathematics)|net]].
 
As we stated earlier, these two definitions are equivalent.  In other words, ''s'' works in the first definition if and only if ''s'' works in the second definition.  To show that the first definition implies the second, start with an ε, and choose a δ that satisfies the condition.  Choose any tagged partition whose mesh is less than δ.  Its Riemann sum is within ε of ''s'', and any refinement of this partition will also have mesh less than δ, so the Riemann sum of the refinement will also be within ε of ''s''.  To show that the second definition implies the first, it is easiest to use the [[Darboux integral]].  First one shows that the second definition is equivalent to the definition of the Darboux integral; for this see the article on Darboux integration. Now we will show that a Darboux integrable function satisfies the first definition.  Fix ε, and choose a partition <math>y_0, \ldots, y_m</math> such that the lower and upper Darboux sums with respect to this partition are within <math>\tfrac{\varepsilon}{2}</math> of the value ''s'' of the Darboux integral. Let
 
:<math> r = \sup_{x \in [a, b]} |f(x)|.</math>
 
If ''r'' = 0, then ''f'' is the zero function, which is clearly both Darboux and Riemann integrable with integral zero. Therefore we will assume that ''r'' > 0. If ''m'' > 1, then we choose δ such that
:<math>\delta < \min \left \{\frac{\varepsilon}{2r(m-1)}, (y_1 - y_0), (y_2 - y_1), \cdots, (y_m - y_{m-1}) \right \}</math>
If ''m'' = 1, then we choose δ to be less than one. Choose a tagged partition <math>x_0,\ldots,x_n</math> and <math>t_0,\ldots,t_{n-1}</math>. We must show that the Riemann sum is within ε of ''s'' .
 
To see this, choose an interval <math>[x_i,x_{i+1}]</math>. If this interval is contained within some <math>[y_j,y_{j+1}]</math>, then
:<math> m_j < f(t_i) < M_j</math>
where ''m<sub>j</sub>'' and ''M<sub>j</sub>'' are respectively, the infimum and the supremum of ''f'' on <math>[y_j,y_{j+1}]</math>. If all intervals had this property, then this would conclude the proof, because each term in the Riemann sum would be bounded a corresponding term in the Darboux sums, and we chose the Darboux sums to be near ''s''.  This is the case when ''m'' = 1, so the proof is finished in that case.
 
Therefore, we may assume that ''m'' > 1. In this case, it is possible that one of the <math>[x_i,x_{i+1}]</math> is not contained in any <math>[y_j,y_{j+1}]</math>. Instead, it may stretch across two of the intervals determined by <math>y_0, \ldots, y_m</math>. (It cannot meet three intervals because δ is assumed to be smaller than the length of any one interval.) In symbols, it may happen that
:<math>y_j < x_i < y_{j+1} < x_{i+1} < y_{j+2}.</math>
(We may assume that all the inequalities are strict because otherwise we are in the previous case by our assumption on the length of δ.) This can happen at most ''m''−1 times.
 
To handle this case, we will estimate the difference between the Riemann sum and the Darboux sum by subdividing the partition <math>x_0,\ldots,x_n</math> at <math>y_{j+1}</math>. The term <math>f(t_i)(x_i-x_{i+1})</math> in the Riemann sum splits into two terms:
 
:<math>f(t_i)(x_i - x_{i+1}) = f(t_i)(x_i - y_{j+1}) + f(t_i)(y_{j+1} - x_{i+1}).</math>
 
Suppose that <math>t_i \in [x_i,x_{i+1}]</math>. Then
 
:<math>m_j < f(t_i) < M_j,</math>
 
so this term is bounded by the corresponding term in the Darboux sum for ''y<sub>j</sub>''. To bound the other term, notice that
 
:<math>y_{j+1}-x_{i+1} < \delta < \frac{\varepsilon}{2r(m-1)},</math>
 
It follows:
 
:<math>f(t_i)(y_{j+1} - x_{i+1}) < \frac{\varepsilon}{2(m-1)}.</math>
 
Since this happens at most ''m''−1 times, the total of all the terms which are not bounded by the Darboux sum is at most&nbsp;<math>\tfrac{\varepsilon}{2}</math>. Therefore the distance between the Riemann sum and ''s'' is at most&nbsp;ε.
 
== Examples ==
Let <math>f:[0,1] \to \mathbf{R}</math> be the function which takes the value 1 at every point.  Any Riemann sum of ''f'' on [0, 1] will have the value 1, therefore the Riemann integral of ''f'' on [0, 1] is 1.
 
Let <math>I_{\mathbf{Q}}:[0,1] \to \mathbf{R}</math> be the [[indicator function]] of the rational numbers in [0, 1]; that is, ''I''<sub>'''Q'''</sub> takes the value 1 on rational numbers and 0 on irrational numbers. This function does not have a Riemann integral.  To prove this, we will show how to construct tagged partitions whose Riemann sums get arbitrarily close to both zero and one.
 
To start, let <math>x_0, \ldots, x_n</math> and <math>t_0, \ldots, t_{n-1}</math> be a tagged partition (each ''t<sub>i</sub>'' is between ''x<sub>i</sub>'' and <math>x_{i+1}</math>).  Choose ε > 0.  The ''t<sub>i</sub>'' have already been chosen, and we can't change the value of ''f'' at those points.  But if we cut the partition into tiny pieces around each ''t<sub>i</sub>'', we can minimize the effect of the ''t<sub>i</sub>''.  Then, by carefully choosing the new tags, we can make the value of the Riemann sum turn out to be within ε of either zero or one&mdash;our choice!
 
Our first step is to cut up the partition.  There are ''n'' of the ''t<sub>i</sub>'', and we want their total effect to be less than ε.  If we confine each of them to an interval of length less than <math>\tfrac{\varepsilon}{n}</math>, then the contribution of each ''t<sub>i</sub>'' to the Riemann sum will be at least <math>\tfrac{(0\cdot\varepsilon)}{n}</math> and at most <math>\tfrac{(1\cdot\varepsilon)}{n}</math>.  This makes the total sum at least zero and at most ε.  So let δ be a positive number less than <math>\tfrac{\varepsilon}{n}</math>.  If it happens that two of the ''t<sub>i</sub>'' are within δ of each other, choose δ smaller.  If it happens that some ''t<sub>i</sub>'' is within δ of some ''x<sub>j</sub>'', and ''t<sub>i</sub>'' is not equal to ''x<sub>j</sub>'', choose δ smaller.  Since there are only finitely many ''t<sub>i</sub>'' and ''x<sub>j</sub>'', we can always choose δ sufficiently small.
 
Now we add two cuts to the partition for each ''t<sub>i</sub>''.  One of the cuts will be at <math>t_i - \tfrac{\delta}{2}</math>, and the other will be at <math>t_i + \tfrac{\delta}{2}</math>.  If one of these leaves the interval [0, 1], then we leave it out. ''t<sub>i</sub>'' will be the tag corresponding to the subinterval
:<math>\left [t_i - \tfrac{\delta}{2}, t_i + \tfrac{\delta}{2} \right ].</math> 
If ''t<sub>i</sub>'' is directly on top of one of the ''x<sub>j</sub>'', then we let ''t<sub>i</sub>'' be the tag for both intervals:
:<math>\left [t_i - \tfrac{\delta}{2}, x_j \right ], \quad \left [x_j,t_i + \tfrac{\delta}{2} \right ].</math>
We still have to choose tags for the other subintervals.  We will choose them in two different ways.  The first way is to always choose a [[rational point]], so that the Riemann sum is as large as possible.  This will make the value of the Riemann sum at least 1−ε.  The second way is to always choose an irrational point, so that the Riemann sum is as small as possible.  This will make the value of the Riemann sum at most ε.
 
Since we started from an arbitrary partition and ended up as close as we wanted to either zero or one, it is false to say that we are eventually trapped near some number ''s'', so this function is not Riemann integrable.  However, it is [[Lebesgue integral|Lebesgue integrable]].  In the Lebesgue sense its integral is zero, since the function is zero [[almost everywhere]].  But this is a fact that is beyond the reach of the Riemann integral.
 
There are even worse examples. ''I''<sub>'''Q'''</sub> is equivalent (that is, equal almost everywhere) to a Riemann integrable function, but there are non-Riemann integrable bounded functions which are not equivalent to any Riemann integrable function. For example, let ''C'' be the [[Smith–Volterra–Cantor set]], and let ''I''<sub>''C''</sub> be its indicator function. Because ''C'' is not [[Jordan measure|Jordan measurable]], ''I''<sub>''C''</sub> is not Riemann integrable. Moreover, no function ''g'' equivalent to ''I''<sub>''C''</sub> is Riemann integrable: ''g'', like ''I''<sub>''C''</sub>, must be zero on a dense set, so as in the previous example, any Riemann sum of ''g'' has a refinement which is within ε of 0 for any positive number&nbsp;ε. But if the Riemann integral of ''g'' exists, then it must equal the Lebesgue integral of ''I''<sub>''C''</sub>, which is 1/2. Therefore ''g'' is not Riemann integrable.
 
== Similar concepts ==
 
It is popular to define the Riemann integral as the [[Darboux integral]].  This is because the Darboux integral is technically simpler and because a function is Riemann-integrable if and only if it is Darboux-integrable.
 
Some calculus books do not use general tagged partitions, but limit themselves to specific types of tagged partitions.  If the type of partition is limited too much, some non-integrable functions may appear to be integrable.
 
One popular restriction is the use of "left-hand" and "right-hand" Riemann sums.  In a left-hand Riemann sum, <math>t_i = x_i</math> for all ''i'', and in a right-hand Riemann sum, <math>t_i = x_{i+1}</math> for all ''i''.  Alone this restriction does not impose a problem: we can refine any partition in a way that makes it a left-hand or right-hand sum by subdividing it at each ''t<sub>i</sub>''.  In more formal language, the set of all left-hand Riemann sums and the set of all right-hand Riemann sums is [[cofinal (mathematics)|cofinal]] in the set of all tagged partitions.
 
Another popular restriction is the use of regular subdivisions of an interval.  For example, the <math>n'</math>th regular subdivision of [0, 1] consists of the intervals
:<math>\left [0, \tfrac{1}{n} \right], \left [\tfrac{1}{n}, \tfrac{2}{n} \right], \ldots, \left[\tfrac{n-1}{n}, 1 \right].</math>
Again, alone this restriction does not impose a problem, but the reasoning required to see this fact is more difficult than in the case of left-hand and right-hand Riemann sums.
 
However, combining these restrictions, so that one uses only left-hand or right-hand Riemann sums on regularly divided intervals, is dangerous.  If a function is known in advance to be Riemann integrable, then this technique will give the correct value of the integral.  But under these conditions the [[indicator function]] ''I''<sub>'''Q'''</sub> will appear to be integrable on [0, 1] with integral equal to one: Every endpoint of every subinterval will be a rational number, so the function will always be evaluated at rational numbers, and hence it will appear to always equal one.  The problem with this definition becomes apparent when we try to split the integral into two pieces.  The following equation ought to hold:
 
:<math>\int_0^{\sqrt{2}-1}\! I_\mathbf{Q}(x) \,\mathrm{d}x + \int_{\sqrt{2}-1}^1\! I_\mathbf{Q}(x) \,\mathrm{d}x = \int_0^1\! I_\mathbf{Q}(x) \,\mathrm{d}x.</math>
 
If we use regular subdivisions and left-hand or right-hand Riemann sums, then the two terms on the left are equal to zero, since every endpoint except 0 and 1 will be irrational, but as we have seen the term on the right will equal 1.
 
As defined above, the Riemann integral avoids this problem by refusing to integrate ''I''<sub>'''Q'''</sub>.  The Lebesgue integral is defined in such a way that all these integrals are 0.
 
== Properties ==
 
=== Linearity ===
The Riemann integral is a linear transformation; that is, if ''f'' and ''g'' are Riemann-integrable on [''a'', ''b''] and α and β are constants, then
 
:<math> \int_{a}^{b}( \alpha f(x) + \beta g(x))\,dx = \alpha \int_{a}^{b}f(x)\,dx + \beta \int_{a}^{b}g(x)\,dx. </math>
 
Because the Riemann integral of a function is a number, this makes the Riemann integral a linear functional on the vector space of Riemann-integrable functions.
 
== Integrability ==
A function on a compact interval [''a'', ''b''] is Riemann integrable if and only if it is [[bounded function|bounded]] and [[continuous function|continuous]] [[almost everywhere]] (the set of its points of discontinuity has [[measure zero]], in the sense of [[Lebesgue measure]]). This is known as the '''{{visible anchor|Lebesgue integrability condition}}''' or '''Lebesgue's criterion for Riemann integrability''' or the '''Riemann&mdash;Lebesgue theorem'''.<ref name="apostol169">{{harvnb|Apostol|1974|pp=169&ndash;172}}</ref> Note that this should ''not'' be confused with the notion of the [[Lebesgue integral]] of a function existing; the result is due to Lebesgue, and uses the notion of measure zero, but does not refer to or use Lebesgue measure more generally, or the Lebesgue integral.
 
The integrability condition can be proven in various ways,<ref name="apostol169" /><ref>{{Cite journal
| issn = 0002-9890
| volume = 43
| issue = 7
| pages = 396–398
| last = Brown
| first = A. B.
| title = A Proof of the Lebesgue Condition for Riemann Integrability
| journal = The American Mathematical Monthly| date = September 1936
| jstor = 2301737
}}</ref><ref>Basic real analysis, by Houshang H. Sohrab, section 7.3, Sets of Measure Zero and Lebesgue’s Integrability Condition, [http://books.google.com/books?id=gBPI_oYZoMMC&pg=PA264 pp. 264–271]</ref><ref>''[http://ramanujan.math.trinity.edu/wtrench/texts/TRENCH_REAL_ANALYSIS.PDF Introduction to Real Analysis],'' updated April 2010, William F. Trench, 3.5 "A More Advanced Look at the Existence of the Proper Riemann Integral", pp. 171–177</ref> one of which is sketched below.
 
:{| class="toccolours collapsible collapsed" width="90%" style="text-align:left"
!Proof
|-
|The proof is easiest using the [[Darboux integral]] definition of integrability (formally, the Riemann condition for integrability) – a function is Riemann integrable if and only if the upper and lower sums can be made arbitrarily close by choosing an appropriate partition.
 
One direction is very brief by using the [[Oscillation (mathematics)|oscillation]] definition of continuity:<ref>[http://unapologetic.wordpress.com/2009/12/15/lebesgues-condition/ Lebesgue’s Condition], John Armstrong, December 15, 2009, The Unapologetic Mathematician</ref> if ''f'' is discontinuous on a set of positive measure, then for some ''ε,'' ''f'' has oscillation at least ε on a set ''X''<sub>ε</sub> of positive measure ''m''(''X''<sub>ε</sub>) > 0, so the upper and lower integrals of ''f'' differ by at least <math>\varepsilon \cdot m(X_\varepsilon);</math> this is where oscillation is used.
 
The converse direction is straightforward but longer. Conversely,<ref>[http://unapologetic.wordpress.com/2009/12/09/jordan-content-integrability-condition/ Jordan Content Integrability Condition], John Armstrong, December 9, 2009, The Unapologetic Mathematician</ref> if ''f'' is continuous almost everywhere, then for any partition of the interval [''a'', ''b''], first divide the partition  into two sets of intervals, ''C'' and ''D,'' with ''D'' containing all discontinuous points and ''C'' containing the rest. Intuitively, the ''width'' of ''D'' can be made arbitrarily small, while the ''height'' of ''C'' can be made arbitrarily small. Formally, for any ε, one can choose a subpartition ''D′'' such that discontinuities are contained in intervals whose union has total length at most ε; then the lower sum and upper sum on ''D′'' differ by at most <math>\varepsilon\cdot (M-m),</math> where ''m'' and ''M'' are the infimum and supremum of ''f;'' this is where boundedness is used, and implicitly the equivalence of [[Jordan content]] zero and Lebesgue measure zero on a compact set (hence a finite partition can be used). On the rest (''C′''), the function is continuous on a compact interval, hence [[uniformly continuous]], so a subpartition can be chosen such that on each subinterval, the function varies by at most ε, so the lower and upper sums differ by at most <math>\varepsilon \cdot (b-a)</math> (this is where compactness is used). The total difference is thus bounded by
:<math>\varepsilon \cdot\bigl((M-m)+(b-a)\bigr) = K\varepsilon,</math>
which is a constant times ''ε,'' and hence can be made arbitrarily small, thus the function is Riemann integrable.
|}
 
In particular, a [[countable set]] has measure zero, and thus a bounded function (on a compact interval) with only finitely or countably many discontinuities is Riemann integrable.
 
An [[indicator function]] of a bounded set is Riemann-integrable if and only if the set is [[Jordan measure|Jordan measurable]].<ref>[http://planetmath.org/encyclopedia/Volume.html PlanetMath Volume]</ref>
 
If a real-valued function is [[monotone function|monotone]] on the interval [''a'', ''b''] it is Riemann-integrable, since its set of discontinuities is countable, and therefore of Lebesgue measure zero.
 
If a real-valued function on [''a'', ''b''] is Riemann-integrable, it is [[Lebesgue integral|Lebesgue-integrable]]. That is, Riemann-integrability is a ''stronger'' (meaning more difficult to satisfy) condition than Lebesgue-integrability.
 
If <math>{f_n}</math> is a [[uniform convergence|uniformly convergent]] sequence on [''a'', ''b''] with limit ''f'', then Riemann integrability of all <math>{f_n}</math> implies Riemann integrability of ''f'', and
 
:<math> \int_{a}^{b} f\, dx = \int_a^b{\lim_{n \to \infty}{f_n}\, dx} = \lim_{n \to \infty} \int_{a}^{b} f_n\, dx.</math>
However, the [[Lebesgue monotone convergence theorem]] (on a monotone pointwise limit) does not hold.
 
== Generalizations ==
It is easy to extend the Riemann integral to functions with values in the Euclidean vector space '''R'''<sup>''n''</sup> for any ''n''. The integral is defined by linearity; in other words, if {{nowrap|1='''f''' = (''f''<sub>1</sub>, ..., ''f''<sub>''n''</sub>)}} then
:<math>\int\mathbf{f} = \left(\int f_1,\,\dots, \int f_n\right).</math>
In particular, since the complex numbers are a real [[vector space]], this allows the integration of complex valued functions.
 
The Riemann integral is only defined on bounded intervals, and it does not extend well to unbounded intervals.  The simplest possible extension is to define such an integral as a limit, in other words, as an [[improper integral]].  We could set:
:<math>\int_{-\infty}^\infty f(t)\,dt = \lim_{x\to\infty}\int_{-x}^x f(t)\,dt.</math>
 
Unfortunately, this does not work well.  Translation invariance, the fact that the Riemann integral of the function should not change if we move the function left or right, is lost.  For example, let {{nowrap|1=''f''(''x'') = −1}} for all {{nowrap|1=''x'' < 0}}, {{nowrap|1=''f''(0) = 0}} and {{nowrap|1=''f''(''x'') = 1}} for all {{nowrap|1=''x'' > 0}} then
:<math>\int_{-x}^x f(t)\,dt = \int_{-x}^0 f(t)\,dt + \int_0^x f(t)\,dt = -x + x = 0</math>
for all ''x''. But if we shift ''f''(''x'') to the right by one unit to get ''f''(''x''−1), we get
:<math>\int_{-x}^x f(t-1)\,dt = \int_{-x}^1 f(t-1)\,dt + \int_1^x f(t-1)\,dt = -(x+1) + (x-1) = -2</math>
for all {{nowrap|1=''x'' > 1.}} Since this is unacceptable, we could try the definition:
:<math>\int_{-\infty}^\infty f(t)\,dt = \lim_{a\to-\infty}\lim_{b\to\infty}\int_a^b f(t)\,dt.</math>
 
Then if we attempt to integrate the function ''f'' above, we get +∞, because we take the limit {{nowrap|1=''b'' → ∞}} first. If we reverse the order of the limits, then we get −∞.
 
This is also unacceptable, so we could require that the integral exists and gives the same value regardless of the order. Even this does not give us what we want, because the Riemann integral no longer commutes with uniform limits. For example, let {{nowrap|1=''f<sub>n</sub>''(''x'') = ''n''<sup>−1</sup>}} on (0, ''n'') and 0 everywhere else. For all ''n'' we have
:<math>\int f_n\,dx = 1.</math>
But ''f''<sub>''n''</sub> converges uniformly to zero, so the integral of lim(''f''<sub>''n''</sub>) is zero. Consequently
:<math>\int f\,dx \not= \lim\int f_n\,dx .</math>
Even though this is the correct value, it shows that the most important criterion for exchanging limits and (proper) integrals is false for improper integrals. This makes the Riemann integral unworkable in applications.
 
A better route is to abandon the Riemann integral for the [[Lebesgue integral]]. The definition of the Lebesgue integral is not obviously a generalization of the Riemann integral, but it is not hard to prove that every Riemann-integrable function is Lebesgue-integrable and that the values of the two integrals agree whenever they are both defined. Moreover, a function ƒ defined on a bounded interval is Riemann-integrable if and only if it is bounded and the set of points where ''f'' is discontinuous has Lebesgue measure zero.
 
An integral which is in fact a direct generalization of the Riemann integral is the [[Henstock–Kurzweil integral]].
 
Another way of generalizing the Riemann integral is to replace the factors {{nowrap|1=''x''<sub>''k''+1</sub>&nbsp;−&nbsp;''x''<sub>''k''</sub>}} in the definition of a Riemann sum by something else; roughly speaking, this gives the interval of integration a different notion of length. This is the approach taken by the [[Riemann–Stieltjes integral]].
 
== See also ==
* [[Area]]
* [[Antiderivative]]
 
==Notes==
{{reflist}}
 
== References ==
* Shilov, G. E., and Gurevich, B. L., 1978. ''Integral, Measure, and Derivative: A Unified Approach'', Richard A. Silverman, trans. Dover Publications. ISBN 0-486-63519-8.
* {{citation|first=Tom|last=Apostol|authorlink=Tom Apostol|title=Mathematical Analysis|year=1974|publisher=Addison-Wesley}}
 
==External links==
* {{springer|title=Riemann integral|id=p/r081950}}
 
{{integral}}
 
[[Category:Definitions of mathematical integration]]

Revision as of 16:11, 25 February 2014

Alyson is the name people use to call me and I believe it sounds quite great when you say it. To perform domino is something I really appreciate performing. She functions as a travel agent but quickly she'll be on her personal. Mississippi is the only location I've been residing in but I will have to transfer in a yr or two.

My weblog :: phone psychic (http://www.light4america.com/profile.php?u=Lu82F)