陶哲轩实分析(上)11.1及习题-Analysis I 11.1

这一节开始讲Riemann积分了,整个Riemann积分这一章的处理是比较新的,用相对好理解的piecewise constant function来定义上积分和下积分,二者相等即为可积,和以往比较经典的达布和其实是一回事,但接受起来就更容易。第一节主要说分法partition。

Exercise 11.1.1

If X = X=∅ then the statement is obvious, since X X is bounded and connected and is an interval for trivial reasons.
Now suppose X X≠∅ , then (b) implies (a) is clear, by the definition of an interval. Now suppose (a) holds, then M > 0 , X [ M , M ] ∃M>0,X⊂[-M,M] , since X X is non-empty and bounded, we can say sup X \sup ⁡X and inf X \inf ⁡X both exist in R \mathbf R . Now choose any x R x∈\mathbf R such that
inf X < x < sup X \inf⁡X<x<\sup⁡X
By the definition of supremum and infimum, we can find a , b X a,b∈X , s.t.
inf X a < x < b sup X \inf⁡X≤a<x<b≤\sup⁡X
Since X X is connected, [ a , b ] X [a,b]⊂X , thus x X x∈X . So we have the relation ( inf X , sup X ) X (\inf⁡X,\sup⁡X )⊂X , also we can easily have X [ inf X , sup X ] X⊂[\inf⁡X,\sup⁡X ] , then X X is equal to ( inf X , sup X ) (\inf⁡X,\sup⁡X ) plus possibly two points inf X \inf⁡X and sup X \sup⁡X , anyway X X is an interval.

Exercise 11.1.2

By Lemma 11.1.4, I I and J J are bounded and connected, we have M 1 > 0 , M 2 > 0 M_1>0,M_2>0 , s.t.
( I [ M 1 , M 1 ] ) ( J [ M 2 , M 2 ] ) I J [ max ( M 1 , M 2 ) , max ( M 1 , M 2 ) ] (I⊂[-M_1,M_1 ])∧(J⊂[-M_2,M_2 ])⇒I∩J⊂[-\max⁡(M_1,M_2 ),\max⁡(M_1,M_2 )]
Thus I J I∩J is bounded.
Let x , y I J ∀x,y∈I∩J , then as x , y I x,y∈I , we have [ x , y ] J [x,y]⊆J , similarly we have [ x , y ] J [x,y]⊆J , so [ x , y ] I J [x,y]⊆I∩J , this means I J I∩J is connected.
We now can conclude, using Lemma 11.1.4 again, that I J I∩J is a bounded interval.

Exercise 11.1.3

First, if I j I_j is not of the form ( c , b ) (c,b) or [ c . b ) [c.b) for any a c b a≤c≤b , then we can have some 0 < ϵ j < b a 0<ϵ_j<b-a s.t. b ϵ I j b-ϵ∉I_j , as I j I_j is an interval, it’s connected, thus we have
sup I j b ϵ j < b \sup⁡I_j≤b-ϵ_j<b
Now assume all intervals I j , 1 j n I_j,1≤j≤n is not of the form ( c , b ) (c,b) or [ c . b ) [c.b) for any a c b a≤c≤b , then we have sup I j b ϵ j < b , 1 j n \sup⁡I_j≤b-ϵ_j<b,1≤j≤n . Then we can conclude
b min 1 j n ( ϵ j ) 2 I i , 1 i n b-\frac{\min_{1≤j≤n}⁡(ϵ_j )}{2}∉I_i,\quad∀1≤i≤n
so we have b min 1 j n ( ϵ j ) / 2 I b-\min_{1≤j≤n}⁡(ϵ_j )/2∉I , this is a contradiction since I 1 , , I n I_1,…,I_n form a partition of I I .
Thus there must exists at least one of I j I_j in the form of ( c , b ) (c,b) or [ c . b ) [c.b) . By the definition of partition, such I j I_j can only appear once if I 1 , , I n I_1,…,I_n form a partition of I I .

Exercise 11.1.4

P # P \mathbf P\#\mathbf P' is a partition of I I :
Choose x I ∀x∈I , then there’s exactly one K P K∈\mathbf P and J P J∈\mathbf P' s.t. x K , x J x∈K,x∈J , thus x K J x∈K∩J , and any other element belongs to P # P \mathbf P\#\mathbf P' can’t contain x x , otherwise K K or J J can’t be unique. This means P # P \mathbf P\#\mathbf P' is a partition of I I .
P # P \mathbf P\#\mathbf P' is finer than P \mathbf P or P \mathbf P' :
For every M P # P M∈\mathbf P\#\mathbf P' , by definition we shall be able to find K P K∈\mathbf P and J P J∈\mathbf P' s.t.
M = K J M=K∩J
This means M K , K P M⊆K,K∈\mathbf P and M J , J P M⊆J,J∈\mathbf P' , thus we have P # P \mathbf P\#\mathbf P' is finer than P \mathbf P or P \mathbf P' .

发布了77 篇原创文章 · 获赞 14 · 访问量 2809

猜你喜欢

转载自blog.csdn.net/christangdt/article/details/102779393