Math 2.0

definition

Upper and lower Darboux sums

Definition

Let a<ba < b, let f ⁣:[a,b]→Rf \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.

Explanations

L1 human

The upper sum covers the graph with rectangles that reach its highest point on each piece. The lower sum uses rectangles that reach its lowest point on each piece.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • 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

What depends on this

12 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Darboux_integral, Darboux sums