Upper/Lower Darboux Sum

  • Thread starter sandra1
  • Start date
  • #1
13
0

Homework Statement


Suppose that function f: [a,b] --> R is bounded, and P and Q be 2 partition of [a,b]. Prove that if P is in Q then U(Q,f)<= U(P,f)


Homework Equations





The Attempt at a Solution


P is in Q so suppose there's a c that is in Q but not in P such that c is in between x_i-1 and x_i
M_k = sup{f(x)| x in [x_k-1,x_k]

let's denote:
M_i = sup{f(x)| x in [x_i-1,x_i]
r_1 = sup{f(x)| x in [x_i-1, c]
r_2 = sup{f(x)| x in [c ,x_i]

therefore M_i = max{r_1,r_2}

by definition U(P,f) = [k=1]\Sigma[/n] M_k*(x_k - x_k-1)
= [k=1]\Sigma[/i-1]M_k*(x_k - x_k-1) + M_i(x_i -x_i-1) + [k=i+1]\Sigma[/n]M_k*(x_k - x_k-1)
>= [k=1]\Sigma[/i-1]M_k*(x_k - x_k-1) + r_1(c - x_i-1) + r_2(x_i - c) [k=i+1]\Sigma[/n]M_k*(x_k - x_k-1)
= U(Q,f)
as desired.

Do you see anything wrong with this proof? Thanks very much
 

Answers and Replies

  • #2
352
0
Your calculation works for the case where [tex]Q[/tex] is a refinement of [tex]P[/tex] by one single additional point [tex]c[/tex]. In general [tex]Q[/tex] refines [tex]P[/tex] by adding some finite number [tex]m[/tex] of points, so you need to observe that the argument can be repeated, say by letting [tex]P \subset P_1 \subset \cdots \subset P_{m-1} \subset Q[/tex] be a sequence of partitions each of which refines the previous by adding a single point.
 
  • #3
13
0
Your calculation works for the case where [tex]Q[/tex] is a refinement of [tex]P[/tex] by one single additional point [tex]c[/tex]. In general [tex]Q[/tex] refines [tex]P[/tex] by adding some finite number [tex]m[/tex] of points, so you need to observe that the argument can be repeated, say by letting [tex]P \subset P_1 \subset \cdots \subset P_{m-1} \subset Q[/tex] be a sequence of partitions each of which refines the previous by adding a single point.

yes you're right. i totally forgot about the general case with Q refines P by any finite number of points more than 1. Thanks very much for your response.
 

Related Threads on Upper/Lower Darboux Sum

  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
7
Views
6K
Replies
0
Views
6K
Replies
5
Views
1K
  • Last Post
Replies
0
Views
4K
Replies
6
Views
2K
Replies
10
Views
364
Replies
1
Views
802
  • Last Post
Replies
1
Views
688
Top