Math 2.0

Real functions Definition

Upper and lower Darboux sums

Builds on Partition of an intervalBounded sequence

Definition

Let a<ba < b, let f ⁣:[a,b]→ℝf \colon [a, b] \to \mathbb{R} be bounded, and let P=(x0,…,xn)P = (x_0, \dots, x_n) be a partition of [a,b][a, b]. For each ii, let Mi=sup⁡f([xi−1,xi])M_i = \sup f([x_{i-1}, x_i]) and mi=inf⁡f([xi−1,xi])m_i = \inf f([x_{i-1}, x_i]). The upper and lower Darboux sums of ff for PP are U(f,P)=∑i=1nMi(xi−xi−1),L(f,P)=∑i=1nmi(xi−xi−1).U(f, P) = \sum_{i=1}^{n} M_i (x_i - x_{i-1}), \qquad L(f, P) = \sum_{i=1}^{n} m_i (x_i - x_{i-1}).

Remarks

Always (b−a)inf⁡f≤L(f,P)≤U(f,P)≤(b−a)sup⁡f(b - a) \inf f \le L(f, P) \le U(f, P) \le (b - a) \sup f. For a refinement QQ of PP, we have L(f,P)≤L(f,Q)L(f, P) \le L(f, Q) and U(f,Q)≤U(f,P)U(f, Q) \le U(f, P). So L(f,P)≤U(f,Q)L(f, P) \le U(f, Q) for any two partitions PP and QQ.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Partition of an interval definition
  2. Sequence definition
  3. Real sequence definition
  4. Bounded sequence definition
  5. Upper and lower Darboux sums definition

Where this leads

13 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Darboux_integral, Darboux sums
About this page
Tag0QRQVH0CRW
URIm2://0QRQVH0CRW
Kinddefinition
WritingW0 stub
MSC26A42
DefinesUpper and lower Darboux sums
UsesPartition of an interval, Bounded sequence

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by