Math analysis
Class 1 Some Inequality and Def of limit
Triangle Inequality
a , b ∈ R ⟹ ∣ ∣ a ∣ − ∣ b ∣ ∣ ≤ ∣ a + b ∣ ≤ ∣ a ∣ + ∣ b ∣ a,b\in R \implies {\left \vert {\left \vert a \right \vert} -{\left \vert b \right \vert} \right \vert} \le {\left \vert a+b \right \vert} \leq {\left \vert a \right \vert} + {\left \vert b \right \vert} a , b ∈ R ⟹ ∣ ∣ a ∣ − ∣ b ∣ ∣ ≤ ∣ a + b ∣ ≤ ∣ a ∣ + ∣ b ∣
− ∣ a ∣ ∣ b ∣ ≤ a b ≤ ∣ a ∣ ∣ b ∣ ⟹ ∣ a ∣ 2 − 2 ∣ a ∣ ∣ b ∣ + ∣ a + b ∣ 2 ≤ a 2 + 2 a b + b 2 ≤ ∣ a ∣ 2 + 2 ∣ a ∣ ∣ b ∣ + ∣ a + b ∣ 2 ⟹ ( ∣ a ∣ − ∣ b ∣ ) 2 ≤ ( a + b ) 2 ≤ ( ∣ a ∣ + ∣ b ∣ ) 2 \begin{gathered}
-{\left \vert a \right \vert} {\left \vert b \right \vert} \le ab\le {\left \vert a \right \vert} {\left \vert b \right \vert}
\implies \\
{\left \vert a \right \vert} ^2-2 {\left \vert a \right \vert} {\left \vert b \right \vert} + {\left \vert a+b \right \vert} ^2
\le a^2+2ab+b^2
\le {\left \vert a \right \vert} ^2+2 {\left \vert a \right \vert} {\left \vert b \right \vert} + {\left \vert a+b \right \vert} ^2 \implies \\
({\left \vert a \right \vert} -{\left \vert b \right \vert} )^2\le (a+b)^2\le ({\left \vert a \right \vert} +{\left \vert b \right \vert} )^2
\end{gathered} − ∣ a ∣ ∣ b ∣ ≤ ab ≤ ∣ a ∣ ∣ b ∣ ⟹ ∣ a ∣ 2 − 2 ∣ a ∣ ∣ b ∣ + ∣ a + b ∣ 2 ≤ a 2 + 2 ab + b 2 ≤ ∣ a ∣ 2 + 2 ∣ a ∣ ∣ b ∣ + ∣ a + b ∣ 2 ⟹ ( ∣ a ∣ − ∣ b ∣ ) 2 ≤ ( a + b ) 2 ≤ ( ∣ a ∣ + ∣ b ∣ ) 2
向量的模长也满足 也可以用这个做法.
Cauchy-Schwarz Inequality
0 < x i ∈ R ⟹ ∑ i x i n ≥ ∏ i x i n ≥ n ∑ i 1 x i \begin{gathered}
0<x_i \in R \implies
\dfrac{\sum_i x_i}{n} \ge \sqrt[n]{\prod_i x_i} \ge \dfrac{n}{\sum_i \dfrac{1}{x_i} }
\end{gathered} 0 < x i ∈ R ⟹ n ∑ i x i ≥ n i ∏ x i ≥ ∑ i x i 1 n
显然 取x i = 1 x i x_i=\dfrac{1}{x_i} x i = x i 1 能用左边不等式推右边 只证左边
归纳,2 2 2 的幂次显然吧
对非2 2 2 的幂次n n n ,用X = ∏ i x i n X=\sqrt[n]{\prod_i x_i} X = n ∏ i x i 补完,直接套
Array's Limit
l i m n → ∞ a n = A ⟺ ∀ ϵ > 0 ∃ N s . t . n ≥ N ⟹ ∣ a n − A ∣ < ϵ \begin{gathered}
lim_{n\to \infty} a_n = A \iff \\
\forall \epsilon >0 \exists N \ s.t.\
n\ge N \implies \left \vert a_n-A \right \vert < \epsilon
\end{gathered} l i m n → ∞ a n = A ⟺ ∀ ϵ > 0∃ N s . t . n ≥ N ⟹ ∣ a n − A ∣ < ϵ
注意
N = N ( ϵ ) N=N(\epsilon) N = N ( ϵ )
N N N 不唯一
ϵ \epsilon ϵ 可限制在任意( 0 , a ) , a > 0 (0,a),a>0 ( 0 , a ) , a > 0
Eg 1
lim n → ∞ n 1 n = 1 \lim_{n \to \infty} n^{\frac{1}{n} }=1 lim n → ∞ n n 1 = 1
∣ n 1 n − 1 ∣ = ∣ ( n n ) 1 n − 1 ∣ = ∣ ( ∏ i 1 ⋅ n n ) 1 n − 1 ∣ ≤ ∣ n − 2 + 2 n n − 1 ∣ ≤ 2 n \begin{gathered}
\vert n^{\frac{1}{n} }-1 \vert \\
= \vert (\sqrt n \sqrt n)^{\frac{1}{n} } -1 \vert \\
={\left \vert (\prod_i 1 \cdot \sqrt n\sqrt n)^{\frac{1}{n} } -1 \right \vert} \\
\le {\left \vert \dfrac{n-2+2\sqrt n}{n} -1 \right \vert} \\
\le \dfrac{2}{\sqrt n}
\end{gathered} ∣ n n 1 − 1∣ = ∣ ( n n ) n 1 − 1∣ = ( i ∏ 1 ⋅ n n ) n 1 − 1 ≤ n n − 2 + 2 n − 1 ≤ n 2
Or try this:
∣ n 1 n − 1 ∣ = n 1 n − 1 < ϵ ⟸ n 1 n < ( ϵ + 1 ) ⟸ n < ( 1 + ϵ ) n ⟸ n < 1 + ϵ n + ϵ 2 n ( n − 1 ) 2 \begin{gathered}
{\left \vert n^{\frac{1}{n} }-1 \right \vert} =n^{\frac{1}{n} }-1<\epsilon \\
\impliedby n^{\frac{1}{n}}<(\epsilon+1) \\
\impliedby n<(1+\epsilon)^n \\
\impliedby n<1+\epsilon n+\frac{\epsilon^2n(n-1)}{2}
\end{gathered} n n 1 − 1 = n n 1 − 1 < ϵ ⟸ n n 1 < ( ϵ + 1 ) ⟸ n < ( 1 + ϵ ) n ⟸ n < 1 + ϵ n + 2 ϵ 2 n ( n − 1 )
Solve the equation, it's a parabola with upward opening so the solution exists.
[think] At this stage, we cannot say lim g ( f ( n ) ) = g ( lim f ( n ) ) \lim g(f(n))=g(\lim f(n)) lim g ( f ( n )) = g ( lim f ( n )) which depends on continuity of function. But you sometimes can rewrite the proof with inequality.
Class 2
About Q Q Q
n ∈ Z ∪ Q C \begin{gathered}
\sqrt n \in Z \cup Q^C
\end{gathered} n ∈ Z ∪ Q C
p 2 = q 2 n p^2=q^2n p 2 = q 2 n Integer factorization
More natural than textbook but it doesn't depend on Integer factorization.
p q \dfrac{p}{q} q p is finite decimal or repeating decimal
Simulate how the division is done and consider the remainder will be repeated.
About Cardinality
A Example
Find a bijection of [ 0 , 1 ] [0,1] [ 0 , 1 ] and ( 0 , 1 ) (0,1) ( 0 , 1 )
f ( x ) : ( 0 , 1 ) → [ 0 , 1 ] = { 0 , x = 1 2 1 , x = 1 3 1 n − 2 , x = 1 n x , otherwise \begin{gathered}
f(x):(0,1) \to [0,1]=\begin{cases}
0,x=\dfrac{1}{2} \\
1,x=\dfrac{1}{3} \\
\dfrac{1}{n-2} , x=\dfrac{1}{n} \\
x, \text{otherwise}
\end{cases}
\end{gathered} f ( x ) : ( 0 , 1 ) → [ 0 , 1 ] = ⎩ ⎨ ⎧ 0 , x = 2 1 1 , x = 3 1 n − 2 1 , x = n 1 x , otherwise
Wow!
Cardinality is comparable
∀ A , B , ∃ f ( x ) : A → B s . t . f is injective or surjective \begin{gathered}
\forall A,B, {\ } \exists f(x):A\to B \\ s.t.\\
\text{f is injective or surjective}
\end{gathered} ∀ A , B , ∃ f ( x ) : A → B s . t . f is injective or surjective
(承认选择公理)
首先选择公理出良序定理,找到A , B A,B A , B 的良序( A , < ) , ( B , < ) (A,<),(B,<) ( A , < ) , ( B , < ) .
然后进行超限归纳,把A A A ,B B B 按照良序(保证了每个元素存在序里的后继),最小元素匹配,然后剩下的次小元素匹配,这么做下去.
然后这个看起来进行的是普通的自然数归纳显然是错的. 你需要用超限归纳也就是在序上做归纳.
然后问题来到序是什么.
序的结构是这样的 首先是自然数 自然数定义是0 0 0 定义为空集开始 然后定义succ ( S ) = S ∪ { S } \operatorname{succ}(S)=S \cup \{S\} succ ( S ) = S ∪ { S }
然后定义完所有自然数后 定义ω = ⋃ i i \omega=\bigcup_i i ω = ⋃ i i ,就是把所有的自然数的集合并起来(显然它包含所有的自然数). 然后我们可以接下来用后继的定于去定义ω + 1 , ω + 2 … \omega+1,\omega+2\ldots ω + 1 , ω + 2 … ,并且你又可以把它们并起来得到ω × 2 \omega\times 2 ω × 2 ,不断走后继,ω , 2 ω , 3 ω … \omega,2\omega,3\omega\ldots ω , 2 ω , 3 ω … 可以变成ω 2 \omega^2 ω 2 ,又有ω 3 … ω ω \omega^3\ldots \omega^\omega ω 3 … ω ω 等等
基本上是每个层次的运算完了之后进下一个层次的序数构造 总之它看起来包含了各种各样的无穷,可以应付所有大小的集合.
然后我们要在序数的结构上做归纳法,就要证明:x → succ ( x ) x\to \operatorname{succ}(x) x → succ ( x ) ,还要证明极限这一把也对,就是a 1 … a n → ∪ i a i a_1\ldots a_n \to \cup_i a_i a 1 … a n → ∪ i a i 这个操作(也就是对某个极限序数,如果所有它以前的序数推到它自己)合法,就满足了你可以不断到下一极限.这样推出对全体元素合法. 这就是超限归纳法.
那你对照一下我们的归纳就是一一对应啊,所以是合法的. 就结束了.
然后我们刚才是说明了可以借良序去给两个集合配对,那么你就一定能找到一个对另一个的单射,所以一定可比.
Cantor-Bernstein-Schröder Theorem
Card ( A ) ≤ Card ( B ) , Card ( B ) ≤ Card ( A ) ⟹ Card ( A ) = Card ( B ) \operatorname{Card}(A)\le \operatorname{Card}(B),\operatorname{Card}(B)\le \operatorname{Card}(A) \implies \operatorname{Card}(A)=\operatorname{Card}(B) Card ( A ) ≤ Card ( B ) , Card ( B ) ≤ Card ( A ) ⟹ Card ( A ) = Card ( B )
或者表达为
{ ∀ A , B , g : A → B , f : B → A f , g is injective ⟹ ∃ h : A ↔ B is bijective \begin{gathered}
\begin{cases}
\forall A,B,g:A\to B,f:B\to A\\
f,g \text{ is injective}
\end{cases}
\implies \exists h:A \leftrightarrow B \text{ is bijective}
\end{gathered} { ∀ A , B , g : A → B , f : B → A f , g is injective ⟹ ∃ h : A ↔ B is bijective
考虑从任意元素u ∈ A u\in A u ∈ A 可以引出一条链:u → f ( u ) → g ( f ( u ) → f ( g ( f ( u ) ) ) → … u\to f(u)\to g(f(u)\to f(g(f(u)))\to \ldots u → f ( u ) → g ( f ( u ) → f ( g ( f ( u ))) → … .
同理v ∈ B v \in B v ∈ B 开始的链v → g ( v ) → f ( g ( v ) ) → g ( f ( g ( v ) ) ) → … v\to g(v)\to f(g(v))\to g(f(g(v)))\to \ldots v → g ( v ) → f ( g ( v )) → g ( f ( g ( v ))) → … .
注意到所有元素一定都在某条链上(映射).每个点度数一定至多一进一出(单射).
于是每条链上构造一个双射(显然的)拼起来即可.
Q.E.D \text{Q.E.D} Q.E.D
其实这些应该算集合论还是什么?
Class 3 Properties of Limit
Uniqueness:Obviously
Local boundedness: 取ϵ = 1 \epsilon=1 ϵ = 1 得N N N ,N N N 后面显然,前面有限项也显然.
About subsequence:
about any subsequence
about some subsequence whose union is the sequence
Limitaion's Calculation
lim n → ∞ a n = A , lim n → ∞ b n = B \lim_{n \to \infty} a_n=A,\lim_{n \to \infty} b_n=B n → ∞ lim a n = A , n → ∞ lim b n = B
lim n → ∞ a n b n = A B \lim_{n \to \infty} a_nb_n=AB n → ∞ lim a n b n = A B
∣ a n b n − A B ∣ = ∣ a n b n − a n B + a n B − A B ∣ ≤ ∣ a N ∣ ∣ b n − B ∣ + ∣ B ∣ ∣ a n − A ∣ \begin{gathered}
{\left \vert a_nb_n-AB \right \vert} = \\
{\left \vert a_nb_n-a_nB+a_nB-AB \right \vert} \\ \\
\le {\left \vert a_N \right \vert} {\left \vert b_n-B \right \vert} +{\left \vert B \right \vert} {\left \vert a_n-A \right \vert} \\
\end{gathered} ∣ a n b n − A B ∣ = ∣ a n b n − a n B + a n B − A B ∣ ≤ ∣ a N ∣ ∣ b n − B ∣ + ∣ B ∣ ∣ a n − A ∣
显然a n , b n a_n,b_n a n , b n 有界,令M M M 是他俩共同的界,取ϵ ′ = 1 114514 M + 114514 \epsilon'=\dfrac{1}{114514M+114514} ϵ ′ = 114514 M + 114514 1 用到a n , b n a_n,b_n a n , b n 上即证.
lim n → ∞ a n b n = A B \lim_{n \to \infty} \frac{a_n}{b_n} =\frac{A}{B} n → ∞ lim b n a n = B A
先上一个保号性干掉分母上出现0 0 0 的事.
证取倒数:
∣ 1 b n − 1 B ∣ < ϵ ⟸ ∣ B − b n ∣ < ϵ b n B ⟸ ϵ ′ = ϵ B M + 114514 ( ∣ M ∣ > b n ) Q.E.D \begin{gathered}
{\left \vert \frac{1}{b_n}-\frac{1}{B} \right \vert}<\epsilon \\
\impliedby {\left \vert B-b_n \right \vert} <\epsilon b_nB \\
\impliedby \epsilon'=\frac{\epsilon}{BM+114514} (\vert M\vert>b_n)
\end{gathered}
\\
\text{Q.E.D} b n 1 − B 1 < ϵ ⟸ ∣ B − b n ∣ < ϵ b n B ⟸ ϵ ′ = B M + 114514 ϵ ( ∣ M ∣ > b n ) Q.E.D
那转化到乘法是显然的.
无穷小
基本就是收敛到0 0 0 的数列啊.
Eg
{ lim n → ∞ a n = a lim n → ∞ b n = b ⟹ lim n → ∞ ∑ i a i b n − i n = a b \begin{cases}
\lim_{n \to \infty} a_n=a \\
\lim_{n \to \infty} b_n=b
\end{cases} \\
\implies \lim_{n \to \infty} \frac{\sum_i a_ib_{n-i}}{n}=ab
{ lim n → ∞ a n = a lim n → ∞ b n = b ⟹ n → ∞ lim n ∑ i a i b n − i = ab
Solution 1
b = 0 b=0 b = 0 时,考虑a 有界 M a有界M a 有界 M .
lim n → ∞ ∑ i a i b n − i n ≤ lim n → ∞ M b n − i n = 0 \begin{gathered}
\lim_{n \to \infty} \dfrac{\sum_i a_ib_{n-i}}{n} \\
\le \lim_{n \to \infty} M\dfrac{b_{n-i}}{n} =0
\end{gathered} n → ∞ lim n ∑ i a i b n − i ≤ n → ∞ lim M n b n − i = 0
b ≠ 0 b\ne 0 b = 0 ,b i ′ = b i − b b'_i=b_i-b b i ′ = b i − b ,有
lim n → ∞ ∑ i a i b n − i n = lim n → ∞ ∑ i a i b n − i ′ n + ∑ i a i n b = 0 + a b \begin{gathered}
\lim_{n \to \infty} \frac{\sum_i a_ib_{n-i}}{n} =\lim_{n \to \infty} \frac{\sum_i a_ib'_{n-i}}{n} +\frac{\sum_i a_i}{n} b=0+ab
\end{gathered} n → ∞ lim n ∑ i a i b n − i = n → ∞ lim n ∑ i a i b n − i ′ + n ∑ i a i b = 0 + ab
\begin{gathered}
\end{gathered}
Solution 2
不妨设a , b > 0 a,b>0 a , b > 0 ,则有界性可以得到后面是a n , b n > 0 a_n,b_n>0 a n , b n > 0
考虑影响值的肯定是中间的项,所以直接拆,取ϵ \epsilon ϵ ,对a , b a,b a , b 可以得到N 1 N_1 N 1
lim n → ∞ ∑ i a i b n − i n = = lim n → ∞ ∑ i = 1 N 1 a i b n − i + ∑ i = 1 N 1 b i a n − i + ∑ i = N 1 + 1 n − N 1 − 1 a i b n − i n = lim n → ∞ ∑ i = 1 N 1 a i b n − i n + lim n → ∞ ∑ i = 1 N 1 b i a n − i n + lim n → ∞ ∑ i = N 1 + 1 n − N 1 − 1 a i b n − i n ∈ ( lim n → ∞ n − 2 N 1 − 1 n ( a − ϵ ) ( b − ϵ ) , lim n → ∞ n − 2 N 1 − 1 n ( a + ϵ ) ( b + ϵ ) ) = ( ( a − ϵ ) ( b − ϵ ) , ( a + ϵ ) ( b + ϵ ) ) \begin{gathered}
\lim_{n \to \infty} \dfrac{\sum_i a_ib_{n-i}}{n}= \\
=\lim_{n \to \infty} \dfrac{\sum _{i = 1} ^{N_1} a_ib_{n-i}+\sum _{i = 1} ^{N_1} b_ia_{n-i}+\sum _{i = N_1+1} ^{n-N_1-1} a_ib_{n-i} }{n} \\
=\lim_{n \to \infty} \dfrac{\sum _{i = 1} ^{N_1} a_ib_{n-i}}{n} \\
+ \lim_{n \to \infty} \dfrac{\sum _{i = 1} ^{N_1} b_ia_{n-i}}{n} \\
+\lim_{n \to \infty} \dfrac{\sum _{i = N_1+1} ^{n-N_1-1} a_ib_{n-i}}{n} \\
\in (\lim_{n \to \infty} \dfrac{n-2N_1-1}{n} (a-\epsilon)(b-\epsilon) \\
,\lim_{n \to \infty} \dfrac{n-2N_1-1}{n} (a+\epsilon)(b+\epsilon)) \\
= ((a-\epsilon)(b-\epsilon),(a+\epsilon)(b+\epsilon))
\end{gathered} n → ∞ lim n ∑ i a i b n − i = = n → ∞ lim n ∑ i = 1 N 1 a i b n − i + ∑ i = 1 N 1 b i a n − i + ∑ i = N 1 + 1 n − N 1 − 1 a i b n − i = n → ∞ lim n ∑ i = 1 N 1 a i b n − i + n → ∞ lim n ∑ i = 1 N 1 b i a n − i + n → ∞ lim n ∑ i = N 1 + 1 n − N 1 − 1 a i b n − i ∈ ( n → ∞ lim n n − 2 N 1 − 1 ( a − ϵ ) ( b − ϵ ) , n → ∞ lim n n − 2 N 1 − 1 ( a + ϵ ) ( b + ϵ )) = (( a − ϵ ) ( b − ϵ ) , ( a + ϵ ) ( b + ϵ ))
后面显然.`
Class 4
eg1
a > 1 , k ∈ N ∗ , lim n → ∞ n k a n = 0 \begin{gathered}
a>1,k\in N^*,\lim_{n \to \infty} \frac{n^k}{a^n} =0
\end{gathered} a > 1 , k ∈ N ∗ , n → ∞ lim a n n k = 0
a n = ( 1 + b ) n a^n=(1+b)^n a n = ( 1 + b ) n 展开会出现n n n 的任意次方,然后显然.
Stolz
{ y n ↑ , lim n → ∞ y n = ∞ lim n → ∞ x n − x n − 1 y n − y n − 1 = a ∈ [ − ∞ , + ∞ ] ⟹ lim n → ∞ x n y n = a \begin{gathered}
\begin{cases}
y_n \uparrow,\lim_{n \to \infty} y_n=\infty \\
\lim_{n \to \infty} \dfrac{x_n-x_{n-1}}{y_n-y_{n-1}} =a\in[-\infty,+\infty]
\end{cases}
\\
\implies \lim_{n \to \infty} \dfrac{x_n}{y_n} =a
\end{gathered} ⎩ ⎨ ⎧ y n ↑ , lim n → ∞ y n = ∞ lim n → ∞ y n − y n − 1 x n − x n − 1 = a ∈ [ − ∞ , + ∞ ] ⟹ n → ∞ lim y n x n = a
先简化,不妨设a ≥ 0 , Δ x n Δ y n > 0 a\ge 0,\frac{\Delta x_n}{\Delta y_n}>0 a ≥ 0 , Δ y n Δ x n > 0
然后可以证a = 0 a=0 a = 0 时,你取ϵ 1 \epsilon_1 ϵ 1 得N 1 N_1 N 1 ,变成 Δ x n Δ y n < ϵ \dfrac{\Delta x_n}{\Delta y_n} <\epsilon Δ y n Δ x n < ϵ .于是
x n y n = x N 1 + ∑ i = N 1 + 1 n Δ x i y N 1 + ∑ i = N 1 + 1 n Δ y i ≤ x N 1 + ϵ ∑ i = N 1 + 1 n Δ y i y N 1 + ∑ i = N 1 + 1 n Δ y i ≤ x N 1 + ϵ ∑ i = N 1 + 1 n Δ y i ∑ i = N 1 + 1 n Δ y i \begin{gathered}
\dfrac{x_n}{y_n} \\
=\dfrac{x_{N_1}+\sum _{i = N_1+1} ^{n} \Delta x_i}{y_{N_1}+\sum _{i = N_1+1} ^{n} \Delta y_i} \\
\le \dfrac{x_{N_1}+\epsilon\sum _{i = N_1+1} ^{n} \Delta y_i}{y_{N_1}+\sum _{i = N_1+1} ^{n} \Delta y_i} \\
\le \dfrac{x_{N_1}+\epsilon\sum _{i = N_1+1} ^{n} \Delta y_i}{\sum _{i = N_1+1} ^{n} \Delta y_i}
\end{gathered} y n x n = y N 1 + ∑ i = N 1 + 1 n Δ y i x N 1 + ∑ i = N 1 + 1 n Δ x i ≤ y N 1 + ∑ i = N 1 + 1 n Δ y i x N 1 + ϵ ∑ i = N 1 + 1 n Δ y i ≤ ∑ i = N 1 + 1 n Δ y i x N 1 + ϵ ∑ i = N 1 + 1 n Δ y i
因为你 Y = ∑ i = N 1 + 1 n Δ y i → + ∞ Y=\sum _{i = N_1+1} ^{n} \Delta y_i \to +\infty Y = ∑ i = N 1 + 1 n Δ y i → + ∞ ,所以一定可以有ϵ Y > x N 1 \epsilon Y>x_{N_1} ϵ Y > x N 1 .就能证< 2 ϵ <2\epsilon < 2 ϵ ,你再取一下ϵ \epsilon ϵ 就得证了.
然后我说0 < a ∈ R 0<a\in R 0 < a ∈ R 时你直接x ′ = x − a y x'=x-ay x ′ = x − a y 就用结论,a = + ∞ a=+\infty a = + ∞ 的时候你取倒数用结论,就做完了.
Class 5
单调有界数列有极限
{ a i > a i − 1 a i < M ⟹ lim n → ∞ a i exists \begin{gathered}
\begin{cases}
a_i>a_{i-1} \\
a_i<M
\end{cases}
\implies
\lim_{n \to \infty} a_i \text{ exists}
\end{gathered} { a i > a i − 1 a i < M ⟹ n → ∞ lim a i exists
取 { a i } \{a_i\} { a i } 上确界M 0 M_0 M 0 ,则任意ϵ \epsilon ϵ ,取M ′ = M 0 − ϵ M'=M_0-\epsilon M ′ = M 0 − ϵ ,由确界知∃ i s . t . a i ∈ ( M ′ , M 0 ] \exists i \ s.t.\
a_i\in (M',M_0] ∃ i s . t . a i ∈ ( M ′ , M 0 ] ,则∀ n > i , ∣ a n − M ∣ < ϵ \forall n>i,\vert a_n-M\vert<\epsilon ∀ n > i , ∣ a n − M ∣ < ϵ .
然后书上因为没教你上确界,试图用无限小数说明.那其实就是你一位一位考虑,就先这一位增加到最大,然后进入下一位,容易发现最后区间长度趋近于0 0 0
其实无限小数就是区间套啊.
e
a n : = lim n → ∞ ( 1 + 1 n ) n = b n : = lim n → ∞ ∑ i = 0 n 1 i ! \begin{gathered}
a_n:=\lim_{n \to \infty} (1+\dfrac{1}{n} )^n = b_n:=\lim_{n \to \infty} \sum _{i = 0} ^{n} \dfrac{1}{i!}
\end{gathered} a n := n → ∞ lim ( 1 + n 1 ) n = b n := n → ∞ lim i = 0 ∑ n i ! 1
右边那个单调有界都是好证的.证相等:
a n = ( 1 + 1 n ) n = ∑ i = 0 n 1 n i ( n i ) = ∑ i = 0 n 1 i ! ∏ j = 0 i − 1 ( 1 − j n ) < b n \begin{gathered}
a_n=(1+\dfrac{1}{n} )^n=\sum _{i = 0} ^{n} \dfrac{1}{n^i} \binom{n}{i} \\
=\sum _{i = 0} ^{n} \dfrac{1}{i!} \prod_{j=0}^{i-1} (1-\dfrac{j}{n} )
<b_n \\
\end{gathered} a n = ( 1 + n 1 ) n = i = 0 ∑ n n i 1 ( i n ) = i = 0 ∑ n i ! 1 j = 0 ∏ i − 1 ( 1 − n j ) < b n
又有你考虑级数a a a 展开的某个部分和∑ i = 0 k 1 i ! ∏ j = 0 i − 1 ( 1 − j n ) \sum _{i = 0} ^{k} \dfrac{1}{i!} \prod_{j=0}^{i-1} (1-\dfrac{j}{n} ) ∑ i = 0 k i ! 1 ∏ j = 0 i − 1 ( 1 − n j ) ,当n n n 趋近于无穷大的时候这个部分和趋近于b k b_k b k ,于是会大于b k − 1 b_{k-1} b k − 1 ,也就是说你对每个b k b_k b k 都能找打比他大的a a a ,就解决了.
重点是把一次到极限拆成两个取极限.但这个为什么对呢.
是好证的,其实就是
[think]
lim a → ∞ lim b → ∞ f ( a , b ) = X ⟹ lim n → ∞ f ( n , n ) = X \begin{gathered}
\lim_{a \to \infty} \lim_{b \to \infty} f(a,b) = X
\implies \lim_{n \to \infty} f(n,n) = X
\end{gathered} a → ∞ lim b → ∞ lim f ( a , b ) = X ⟹ n → ∞ lim f ( n , n ) = X
Fixed:这是不一定的啊,当我们学了多元函数,需要一致收敛之类的条件啊,但其实这里也用不到这个内容啊,我们实际上是用到的是对函数中的无关变量取极限就没有影响.
0 < e − ∑ i = 0 n 1 i ! < 1 n ⋅ n ! \begin{gathered}
0<e-\sum _{i = 0} ^{n} \dfrac{1}{i!} < \dfrac{1}{n\cdot n!}
\end{gathered} 0 < e − i = 0 ∑ n i ! 1 < n ⋅ n ! 1
b n : = ∑ i = 0 n 1 i ! X = b n + m − b n = ∑ i = n + 1 n + m 1 i ! < 1 ( n + 1 ) ! ∑ i = 0 m − 1 1 ( n + 1 ) i < 1 n ! ⋅ n ⟹ e − b n = lim m → ∞ X < 1 n ! ⋅ n \begin{gathered}
b_n:=\sum _{i = 0} ^{n} \dfrac{1}{i!} \\
X=b_{n+m}-b_n=\sum _{i = n+1} ^{n+m} \dfrac{1}{i!} \\
<\dfrac{1}{(n+1)!} \sum _{i = 0} ^{m-1} \dfrac{1}{(n+1)^i}<\dfrac{1}{n!\cdot n} \\ \implies e-b_n= \lim_{m \to \infty} X<\dfrac{1}{n!\cdot n}
\end{gathered} b n := i = 0 ∑ n i ! 1 X = b n + m − b n = i = n + 1 ∑ n + m i ! 1 < ( n + 1 )! 1 i = 0 ∑ m − 1 ( n + 1 ) i 1 < n ! ⋅ n 1 ⟹ e − b n = m → ∞ lim X < n ! ⋅ n 1
然后说为什么取极限小于号还是小于号呢?
X = b n + m − b n < b n + m + k − b n < 1 n ! ⋅ n ⟹ lim k → ∞ e − b n < 1 n ! ⋅ n \begin{gathered}
X=b_{n+m}-b_n<b_{n+m+k}-b_n<\dfrac{1}{n!\cdot n}
\\
\stackrel{\lim_{k \to \infty} }{\Longrightarrow}
e-b_n<\dfrac{1}{n!\cdot n}
\end{gathered} X = b n + m − b n < b n + m + k − b n < n ! ⋅ n 1 ⟹ l i m k → ∞ e − b n < n ! ⋅ n 1
[think] 对单调数列让一个独立变量趋近无穷说明严格不等号.
有个魔怔法,你先去下一条证明e e e 是无理数再回来说取不了等.
假设e = p q e=\dfrac{p}{q} e = q p
p q − b n < 1 n ⋅ n ! ⟹ n = q p ( q − 1 ) ! − b q q ! < 1 q \begin{gathered}
\dfrac{p}{q} -b_n<\dfrac{1}{n\cdot n!}
\stackrel{n=q}{\Longrightarrow}
p(q-1)!-b_q q!<\dfrac{1}{q}
\end{gathered} q p − b n < n ⋅ n ! 1 ⟹ n = q p ( q − 1 )! − b q q ! < q 1
左边是不为0 0 0 的整数(为0 0 0 与b b b 增矛盾),右边是分数
[think] 一个无理数等价于存在一列分母到无穷的有理数始终有更高阶(相比序列中分母)的余项.
( 1 + 1 n ) n ↑ ( 1 + 1 n ) n + 1 ↓ \begin{gathered}
(1+\dfrac{1}{n} )^n \uparrow \\
(1+\dfrac{1}{n} )^{n+1} \downarrow
\end{gathered} ( 1 + n 1 ) n ↑ ( 1 + n 1 ) n + 1 ↓
( 1 + 1 n ) n ⋅ 1 < ( n ⋅ ( 1 + 1 n + 1 ) n + 1 ) n + 1 = ( 1 + 1 n + 1 ) n + 1 \begin{gathered}
(1+\dfrac{1}{n} )^n\cdot 1< (\dfrac{n\cdot (1+\dfrac{1}{n}+1 )}{n+1} )^{n+1}=(1+\dfrac{1}{n+1} )^{n+1}
\end{gathered} ( 1 + n 1 ) n ⋅ 1 < ( n + 1 n ⋅ ( 1 + n 1 + 1 ) ) n + 1 = ( 1 + n + 1 1 ) n + 1
第二个取倒数同理.
从这个出发可以说明ln \ln ln 的切线放缩系列不等式.
有界数列必有单调子列
可以考虑后缀max,取出一个单调子列.
也可以区间套,每次进有无穷多项的区间.
Class 6
Cauchy Convergance Theorem
Cauchy Convergance Theorem
∀ ϵ , ∃ N s . t . ∀ n , m > N , ∣ a n − a m ∣ < ϵ ⟺ lim n → ∞ a n exists \begin{gathered}
\forall \epsilon, \exists N \\ s.t.\\
\forall n,m>N, \vert a_n-a_m\vert<\epsilon
\iff \lim_{n \to \infty} a_n \text{ exists}
\end{gathered} ∀ ϵ , ∃ N s . t . ∀ n , m > N , ∣ a n − a m ∣ < ϵ ⟺ n → ∞ lim a n exists
右推左是显然的.
首先容易得到有界.于是它有收敛子列.
然后你其他的项到你的收敛子列的距离拿柯西的条件放缩一下就证完了.
或者也可以闭区间套.
确界原理
来闭区间套,二等分,如果上面的(包含边界)有就取上面,否则取下面,框出一个数.
然后来看,比他小的不是上界是好说的(取个区间即可).怎么说明它是上界呢?
考虑任何一个数,递归后一定有某一次它在下半区间(包含中点),那就证完了.
可能甚至不如无穷小数简洁 反正本质相同.
有限覆盖定理
S = { ( x , y ) ∣ x < y } , T ⊂ S , ∪ I ∈ T I ⊃ [ a , b ] ⟹ ∃ A ∈ T , ∪ I ∈ A I ⊃ [ a , b ] , ∣ A ∣ ∈ N ( not infinity ) \begin{gathered}
S=\{ (x,y) \vert x<y \},T\subset S , \cup_{I\in T} I \supset [a,b] \\
\implies \exists A \in T,\cup_{I\in A} I \supset [a,b],\vert A\vert\in N(\text{not infinity} )
\end{gathered} S = {( x , y ) ∣ x < y } , T ⊂ S , ∪ I ∈ T I ⊃ [ a , b ] ⟹ ∃ A ∈ T , ∪ I ∈ A I ⊃ [ a , b ] , ∣ A ∣ ∈ N ( not infinity )
反证,设[ A , B ] [A,B] [ A , B ] 不能被有限覆盖.
闭区间套 二等分 则一定有一半区间也是不能被有限覆盖的.递归到不能被有限覆盖的区间,最后弄出一个数.
但包含这个数的极小区间显然可以被有限覆盖.矛盾,得证.
很棒的啊,它完全不关心你无穷覆盖的结构而是到数的结构去了.
Class 7
Funciton's Limits
lim x → x 0 f ( x ) = A ⟺ ∀ ϵ , ∃ δ , s . t . ∀ x , ∣ x − x 0 ∣ ∈ ( 0 , δ ) , ∣ f ( x ) − A ∣ < ϵ \begin{gathered}
\lim_{x \to x_0} f(x) = A \\
\iff \forall \epsilon, \exists \delta,\\ s.t.\\
\forall x, \vert x-x_0 \vert \in (0,\delta), \vert f(x)-A \vert <\epsilon
\end{gathered} x → x 0 lim f ( x ) = A ⟺ ∀ ϵ , ∃ δ , s . t . ∀ x , ∣ x − x 0 ∣ ∈ ( 0 , δ ) , ∣ f ( x ) − A ∣ < ϵ
Heine Theorem
lim x → x 0 f ( x ) = A ⟺ ∀ { x n } , lim n → ∞ x n = x 0 lim n → ∞ f ( x n ) = A \begin{gathered}
\lim_{x \to x_0} f(x)=A \\
\iff \forall \{ x_n \} ,\lim_{n \to \infty} x_n = x_0 \\
\lim_{n \to \infty} f(x_n) = A
\end{gathered} x → x 0 lim f ( x ) = A ⟺ ∀ { x n } , n → ∞ lim x n = x 0 n → ∞ lim f ( x n ) = A
正向是显然的.
反向你就反证,然后极限不存在就翻译成
∃ ϵ , ∀ δ , ∃ x , ∣ x − x 0 ∣ ∣ f ( x ) − A ∣ ≥ ϵ \exists \epsilon, \forall \delta, \exists x,\vert x-x_0 \vert \\
\vert f(x)-A \vert \ge \epsilon ∃ ϵ , ∀ δ , ∃ x , ∣ x − x 0 ∣ ∣ f ( x ) − A ∣ ≥ ϵ
于是你取一个极限是0 0 0 的δ \delta δ ,得到一列收敛到x 0 x_0 x 0 的x x x ,然后用这个数列就矛盾了.
然后你可以用这种方法,把函数极限的各种性质转化到数列极限,四则运算,夹逼等.
柯西收敛
lim x → x 0 exists ⟺ ∀ ϵ , ∃ δ , ∀ x 1 , x 2 ∈ N ∗ ( x 0 , δ ) , ∣ f ( x 1 ) − f ( x 2 ) ∣ < ϵ \begin{gathered}
\lim_{x \to x_0} \text{ exists} \iff \forall \epsilon, \exists \delta,\forall x_1,x_2 \in N^*(x_0,\delta),\vert f(x_1)-f(x_2) \vert < \epsilon
\end{gathered} x → x 0 lim exists ⟺ ∀ ϵ , ∃ δ , ∀ x 1 , x 2 ∈ N ∗ ( x 0 , δ ) , ∣ f ( x 1 ) − f ( x 2 ) ∣ < ϵ
正向是显然的.
反向的话你可以用上面Heine转化成数列,则你只需要证所有这样的数列极限相等.
然后你发现你直接取任意两个数列,然后插(奇数偶数项分别放两个数列的元素)就可以直接证明这两个数列极限相等.于是结束.
{ lim x → x 0 f ( x ) = A lim t → t 0 g ( t ) = x 0 ∃ η > 0 , t ∈ N ( t 0 , η ) ⟹ g ( t ) ≠ 0 ⟹ lim t → t 0 f ( g ( t ) ) = A \begin{gathered}
\begin{cases}
\lim_{x \to x_0} f(x) = A \\
\lim_{t \to t_0} g(t) = x_0 \\
\exists \eta>0, t\in N(t_0,\eta) \implies g(t)\ne 0
\end{cases} \\
\implies \lim_{t \to t_0} f(g(t)) = A
\end{gathered} ⎩ ⎨ ⎧ lim x → x 0 f ( x ) = A lim t → t 0 g ( t ) = x 0 ∃ η > 0 , t ∈ N ( t 0 , η ) ⟹ g ( t ) = 0 ⟹ t → t 0 lim f ( g ( t )) = A
直接翻译成ϵ − δ \epsilon-\delta ϵ − δ 是显然的.
lim → 0 sin ( x ) x = 1 \begin{gathered}
\lim_{ \to _0} \dfrac{\sin(x)}{x} = 1
\end{gathered} → 0 lim x sin ( x ) = 1
通过sin ( x ) ≤ x ≤ tan ( x ) \sin(x)\le x \le \tan(x) sin ( x ) ≤ x ≤ tan ( x ) 同时除以x x x 得到:
{ sin ( x ) x ≤ 1 sin ( x ) x ≥ cos ( x ) ⟹ Squeeze Theorem lim x → 0 sin ( x ) x = 1 \begin{gathered}
\begin{cases}
\dfrac{\sin(x)}{x} \le 1 \\
\dfrac{\sin(x)}{x} \ge \cos(x)
\end{cases} \\
\stackrel{\text{Squeeze Theorem}}{\Longrightarrow} \\
\lim_{x \to 0} \dfrac{\sin(x)}{x} =1
\end{gathered} ⎩ ⎨ ⎧ x sin ( x ) ≤ 1 x sin ( x ) ≥ cos ( x ) ⟹ Squeeze Theorem x → 0 lim x sin ( x ) = 1
R ( x ) = { 1 , x = 0 1 q , x = p q 0 , x ∉ Q ⟹ lim x → x 0 R ( x ) = 0 \begin{gathered}
R(x)=\begin{cases}
1,x=0 \\
\dfrac{1}{q}, x=\dfrac{p}{q} \\
0,x\notin Q
\end{cases}
\implies \lim_{x \to x_0} R(x)=0
\end{gathered} R ( x ) = ⎩ ⎨ ⎧ 1 , x = 0 q 1 , x = q p 0 , x ∈ / Q ⟹ x → x 0 lim R ( x ) = 0
首先显然是周期函数可以只看[ 0 , 1 ] [0,1] [ 0 , 1 ] .
其次对于任意x 0 x_0 x 0 ,对ϵ \epsilon ϵ ,对所有 n ≤ 1 ϵ n\le \dfrac{1}{\epsilon} n ≤ ϵ 1 ,令 δ = 1 2 min j ≤ n , i ≤ j { ∣ i j − x 0 ∣ } \delta=\dfrac{1}{2} \min_{j\le n,i\le j} \{ \vert \dfrac{i}{j} -x_0 \vert \} δ = 2 1 min j ≤ n , i ≤ j { ∣ j i − x 0 ∣ } 即可保证,该区间[ x − δ , x + δ ] [x-\delta,x+\delta] [ x − δ , x + δ ] 内没有分母比n n n 小的有理数,于是就证明了.
Ex Class 1
定义指数函数
承认确界原理,实数的四则运算,< < < 关系,等式性质等.
定义指数函数下 a x ( a > 0 ) , x ∈ R 下a^x(a>0),x\in R 下 a x ( a > 0 ) , x ∈ R
首先良好的定义x ∈ N x\in N x ∈ N 的情况.
然后尝试定义 x = 1 k , k ∈ N x=\dfrac{1}{k},k\in N x = k 1 , k ∈ N 的情况,那么要证明
∀ x > 0 , n ∈ N ∗ , ∃ ! y s . t . y n = x \begin{gathered}
\forall x>0,n\in N^*,\exists! y {\ } s.t. {\ } y^n=x
\end{gathered} ∀ x > 0 , n ∈ N ∗ , ∃ ! y s . t . y n = x
那么构造 E = { t ∣ t n < x } E=\{ t \vert t^n<x \} E = { t ∣ t n < x } ,容易证明:
非空:x 1 + x ∈ E \dfrac{x}{1+x}\in E 1 + x x ∈ E
有上界:( x + 1 ) n > x (x+1)^n>x ( x + 1 ) n > x
于是确界存在,设上确界为y y y ,尝试证明y n = x y^n=x y n = x .
假设y n < x y^n<x y n < x ,设h ∈ ( 0 , min ( 1 , x − y n n ( y + 1 ) n − 1 ) ) h\in (0,\min(1,\dfrac{x-y^n}{n(y+1)^{n-1}})) h ∈ ( 0 , min ( 1 , n ( y + 1 ) n − 1 x − y n )) .
于是发现( y + h ) n − y n < h n ( y + h ) n − 1 < x − y n (y+h)^n-y^n<hn(y+h)^{n-1}<x-y^n ( y + h ) n − y n < hn ( y + h ) n − 1 < x − y n
于是( y + h ) n < x , y + h ∈ E (y+h)^n<x,y+h\in E ( y + h ) n < x , y + h ∈ E ,与y y y 是上确界矛盾.
再假设y n > x y^n>x y n > x ,设h = y n − x n y n − 1 h=\dfrac{y^n-x}{ny^{n-1}} h = n y n − 1 y n − x .
则y n − ( y − h ) n < h n y n − 1 = y n − x y^n-(y-h)^n<hny^{n-1}=y^n-x y n − ( y − h ) n < hn y n − 1 = y n − x ,即( y − h ) n > x (y-h)^n>x ( y − h ) n > x ,故y − h y-h y − h 也是E E E 的上界,与上确界矛盾.
于是就证明出y n = x y^n=x y n = x .
那么现在我们能定义 a x , x ∈ Q a^x,x\in Q a x , x ∈ Q . 了吗?
不行.接下来你要证明有理数约不约分结果是一样的.即:
r = m n = p q ⟹ a = ( x m ) 1 n = ( x p ) 1 q = b \begin{gathered}
r=\dfrac{m}{n} =\dfrac{p}{q} \implies a=(x^m)^{\frac1n}=(x^p)^{\frac1q}=b
\end{gathered} r = n m = q p ⟹ a = ( x m ) n 1 = ( x p ) q 1 = b
a n q = x n r q , b n q = x n r q ⟹ a n q = b n q ⟹ a = b \begin{gathered}
a^{nq}=x^{nrq},b^{nq}=x^{nrq} \\
\implies a^{nq}=b^{nq} \\
\implies a=b
\end{gathered} a n q = x n r q , b n q = x n r q ⟹ a n q = b n q ⟹ a = b
下一个目标是实数!
定义a x , x ∈ R a^x,x\in R a x , x ∈ R 是所有a q , q ∈ Q , q ≤ x a^q,q\in Q,q\le x a q , q ∈ Q , q ≤ x 的上确界就行了吧!
那么你是不是得说说实数这个满足和刚才一样的运算律,也就是:
a x a y = a x + y ( a x ) y = a x y \begin{gathered}
a^xa^y=a^{x+y} \\
(a^x)^y=a^{xy}
\end{gathered} a x a y = a x + y ( a x ) y = a x y
Class 8
等价无穷小替换
重点就是你只能替换形如F ( x ) P ( x ) → F ( x ) Q ( x ) ( P ( x ) ∼ Q ( x ) ) F(x)P(x)\to F(x)Q(x)(P(x)\sim Q(x)) F ( x ) P ( x ) → F ( x ) Q ( x ) ( P ( x ) ∼ Q ( x )) .
你不能替换F ( x , P ( x ) ) → F ( x , Q ( x ) ) F(x,P(x))\to F(x,Q(x)) F ( x , P ( x )) → F ( x , Q ( x )) 这种.
这样正确性就保证了.
然后对F ( x ) ( P ( x ) + H ( x ) ) → F ( x ) ( Q ( x ) + H ( x ) ) F(x)(P(x)+H(x))\to F(x)(Q(x)+H(x)) F ( x ) ( P ( x ) + H ( x )) → F ( x ) ( Q ( x ) + H ( x )) 是合法的,当且仅当你低次项没消掉.
然后通用就是你换的时候带上配亚诺余项就不会错了.
反函数连续性
连续函数的反函数是连续的.
f ( x ) is continuous , f ∘ f − 1 = x ⟹ f − 1 is continuous \begin{gathered}
f(x) \text{ is continuous} ,f\circ f^{-1}=x \\
\implies f^{-1} \text{is continuous}
\end{gathered} f ( x ) is continuous , f ∘ f − 1 = x ⟹ f − 1 is continuous
Sol1
lim y → y 0 f − 1 ( y ) = f − 1 ( y 0 ) = x 0 ⟺ ∀ { y n } , lim n → ∞ y n = y 0 s . t . lim n → ∞ f − 1 ( y ) = x 0 Contrapose! Assume ∃ ϵ , ∀ δ , ∃ y 1 ∈ N ∗ ( y 0 , δ ) , ∣ f − 1 ( y 1 ) − x 0 ∣ > ϵ . ∃ { x n } , x n = y 1 ( δ ) . x n is bounded ⟹ ∃ { i n } , x i n is convergent , lim n → ∞ x i n = X ≠ x 0 lim n → ∞ f ( x i n ) = f ( X ) ∵ lim n → ∞ f ( x n ) = lim n → ∞ y n = y 0 ∴ f ( X ) = y 0 = f ( x 0 ) , X ≠ x 0 Contradiction to injection \begin{gathered}
\lim_{y \to y_0} f^{-1}(y)=f^{-1}(y_0)=x_0 \\
\iff \forall \{ y_n \} ,\lim_{n \to \infty} y_n=y_0 \ s.t.\
\lim_{n \to \infty} f^{-1}(y)=x_0 \\
\text{Contrapose! Assume} \exists \epsilon,\forall \delta,\exists y_1\in N^*(y_0,\delta),\vert f^{-1}(y_1)-x_0 \vert > \epsilon. \\
\exists \{ x_n \} ,x_n=y_1(\delta). \\
x_n \text{is bounded} \implies \exists \{ i_n \} , \\
x_{i_n} \text{is convergent} ,\lim_{n \to \infty} x_{i_n}=X\ne x_0 \\
\lim_{n \to \infty} f(x_{i_n})=f(X) \\
\because \lim_{n \to \infty} f(x_n) =\lim_{n \to \infty} y_n=y_0 \\
\therefore f(X)=y_0=f(x_0),X\ne x_0 \\
\text{Contradiction to injection}
\end{gathered} y → y 0 lim f − 1 ( y ) = f − 1 ( y 0 ) = x 0 ⟺ ∀ { y n } , n → ∞ lim y n = y 0 s . t . n → ∞ lim f − 1 ( y ) = x 0 Contrapose! Assume ∃ ϵ , ∀ δ , ∃ y 1 ∈ N ∗ ( y 0 , δ ) , ∣ f − 1 ( y 1 ) − x 0 ∣ > ϵ . ∃ { x n } , x n = y 1 ( δ ) . x n is bounded ⟹ ∃ { i n } , x i n is convergent , n → ∞ lim x i n = X = x 0 n → ∞ lim f ( x i n ) = f ( X ) ∵ n → ∞ lim f ( x n ) = n → ∞ lim y n = y 0 ∴ f ( X ) = y 0 = f ( x 0 ) , X = x 0 Contradiction to injection
[think] 这里为什么数列这么好用呢?感觉因为函数极限的定义不是对称的,但 lim n → ∞ x n = x 0 , lim n → ∞ y n = y 0 \lim_{n \to \infty} x_n=x_0,\lim_{n \to \infty} y_n=y_0 lim n → ∞ x n = x 0 , lim n → ∞ y n = y 0 这个关系是对称的.
Sol2
容易证明连续函数是单射必须严格单调.
对x 0 x_0 x 0 的任意邻域N N N ,f ( N ) f(N) f ( N ) 也是y 0 y_0 y 0 的邻域,于是 ∀ ϵ , x ∈ N ( x 0 , ϵ ) ⟹ y ∈ f ( N ( x 0 , ϵ ) ) \forall \epsilon,x\in N(x_0,\epsilon) \implies y\in f(N(x_0,\epsilon)) ∀ ϵ , x ∈ N ( x 0 , ϵ ) ⟹ y ∈ f ( N ( x 0 , ϵ )) ,把这个翻译成ϵ − δ \epsilon-\delta ϵ − δ .
[think] 考虑的是连续函数把邻域变成邻域(或者说连续函数把闭集映到闭集,于是在一边有极限在另一边也有)吧.
所以证连续其实是用不着单调的. 不过我们知道连续函数单射一定是单调的.
初等函数都是连续函数
x a = e a ln x x^a=e^{a\ln x} x a = e a l n x ,于是只要证:
指数函数和三角函数是连续的
连续函数的反函数是连续的
指数:
lim x → x 0 e x = e x 0 lim x → x 0 e x − x 0 = e x 0 lim x → 0 e x ⟹ e x is continuous ⟺ e x is continuous at 0 lim x → 0 e x = 0 ⟺ ∀ x n , lim n → ∞ e x n = 0 , lim n → ∞ x n = 0 lim n → ∞ n 1 n = 1 ⟹ lim n → ∞ e x n = 0 \begin{gathered}
\lim_{x \to x_0} e^x = e^{x_0} \lim_{x \to x_0} e^{x-x_0} = e^{x_0} \lim{x\to 0} e^x \\
\implies e^x \text{ is continuous} \iff e^x \text{ is continuous at } 0 \\
\lim_{x \to 0} e^x=0 \\
\iff \forall x_n,\lim_{n \to \infty} e^{x_n} = 0,\lim_{n \to \infty} x_n=0 \\
\lim_{n \to \infty} n^{\frac{1}{n}}=1 \implies \lim_{n \to \infty} e^{x_n}=0
\end{gathered} x → x 0 lim e x = e x 0 x → x 0 lim e x − x 0 = e x 0 lim x → 0 e x ⟹ e x is continuous ⟺ e x is continuous at 0 x → 0 lim e x = 0 ⟺ ∀ x n , n → ∞ lim e x n = 0 , n → ∞ lim x n = 0 n → ∞ lim n n 1 = 1 ⟹ n → ∞ lim e x n = 0
三角:
lim Δ x → 0 sin ( x + Δ x ) = sin x cos Δ x + cos x sin Δ x = sin x \begin{gathered}
\lim_{\Delta x \to 0} \sin(x+\Delta x)=\sin x\cos \Delta x+\cos x\sin \Delta x \\
=\sin x
\end{gathered} Δ x → 0 lim sin ( x + Δ x ) = sin x cos Δ x + cos x sin Δ x = sin x
反函数用前面的方法.
Class 9
{ x ∈ [ a , b ] , f is continuous y ∈ [ f ( a ) , f ( b ) ] ⟹ ∃ x 0 , f ( x 0 ) = y \begin{cases}
x\in [a,b], f\text{ is continuous} \\
y\in [f(a),f(b)]
\end{cases} \implies \exists x_0, f(x_0)=y { x ∈ [ a , b ] , f is continuous y ∈ [ f ( a ) , f ( b )] ⟹ ∃ x 0 , f ( x 0 ) = y
Sol1
不妨设f ( a ) ≤ y ≤ f ( b ) f(a)\le y \le f(b) f ( a ) ≤ y ≤ f ( b ) ,= = = 情况显然,只考虑f ( a ) < y < f ( b ) f(a)<y<f(b) f ( a ) < y < f ( b ) .
取 A = { x ∣ f ( x ) < y } A=\{ x\vert f(x)<y \} A = { x ∣ f ( x ) < y } 则它有上确界x 1 x_1 x 1 .
那么要证明f ( x 1 ) = y f(x_1)=y f ( x 1 ) = y ,考虑:
若f ( x 1 ) < y f(x_1)<y f ( x 1 ) < y ,则 lim x → x 1 f ( x ) = y ⟹ ϵ = y − f ( x 1 ) , ∀ x ∈ ( x 1 − δ , x 1 + δ ) ⟹ f ( x ) ∈ ( f ( x 1 ) − ϵ , f ( x 1 ) + ϵ ) < y \lim_{x \to x_1} f(x)=y \implies \epsilon=y-f(x_1),\forall x\in (x_1-\delta,x_1+\delta)\implies f(x)\in (f(x_1)-\epsilon,f(x_1)+\epsilon)<y lim x → x 1 f ( x ) = y ⟹ ϵ = y − f ( x 1 ) , ∀ x ∈ ( x 1 − δ , x 1 + δ ) ⟹ f ( x ) ∈ ( f ( x 1 ) − ϵ , f ( x 1 ) + ϵ ) < y ,于是∃ x 2 > x 1 , f ( x 2 ) < y \exists x_2>x_1,f(x_2)<y ∃ x 2 > x 1 , f ( x 2 ) < y ,与x 1 x_1 x 1 上确界矛盾.故f ( x 1 ) ≤ y f(x_1)\le y f ( x 1 ) ≤ y .
同理f ( x 1 ) ≥ y f(x_1)\ge y f ( x 1 ) ≥ y ,于是f ( x 1 ) = y f(x_1)=y f ( x 1 ) = y .
那么一定存在一个收敛到x 1 x_1 x 1 的数列 { z n } \{ z_n \} { z n } 你就直接发现 lim n → ∞ f ( z n ) = f ( lim n → ∞ z n ) \lim_{n \to \infty} f(z_n) = f(\lim_{n \to \infty} z_n) lim n → ∞ f ( z n ) = f ( lim n → ∞ z n )
Q.E.D \text{Q.E.D} Q.E.D
[think] 核心在 x 0 = sup { x ∣ f ( x ) < y } x_0=\sup \{ x \vert f(x)<y \} x 0 = sup { x ∣ f ( x ) < y } ,即先看到构造x 0 x_0 x 0 的方式.
Sol2
另一个做法是闭区间套,把区间二等分,那么把平凡情况讨论掉后,一定有( f ( a ) − y ) ( f ( b ) − y ) < 0 (f(a)-y)(f(b)-y)<0 ( f ( a ) − y ) ( f ( b ) − y ) < 0 ,那么现在区间中点m m m 处,f ( m ) = y f(m)=y f ( m ) = y 直接结束,否则递归到值域区间包含y y y 的一边.
如果过程没有在中间停止,那么闭区间套定理,∃ ! ξ \exists !\xi ∃ ! ξ 在所有的区间中.考虑区间序列[ a n , b n ] [a_n,b_n] [ a n , b n ] ,那么显然f ( a n ) − p f(a_n)-p f ( a n ) − p 和f ( b n ) − p f(b_n)-p f ( b n ) − p 符号始终不变且相异,于是对a , b a,b a , b 分别取极限可以证f ( ξ ) f(\xi) f ( ξ ) 收敛到y y y .
[think] 讲题顺序很迷惑(这个证明是Class 11讲零点存在弄出来的). 不过你注意到这个闭区间套证法是可以证明其他几条连续函数性质的(闭区间上一致连续,有界,极值定理都是可以的).
间断点分类.
when lim x → x 0 f ( x ) = f ( x 0 ) not satisfied \begin{gathered}
\text{when }
\lim_{x \to x_0} f(x)=f(x_0) \text{ not satisfied}
\end{gathered} when x → x 0 lim f ( x ) = f ( x 0 ) not satisfied
分类:
f ( x 0 + ) ≠ f ( x 0 − ) f(x_0^+)\ne f(x_0^-) f ( x 0 + ) = f ( x 0 − ) :跳跃间断点
f ( x 0 + ) = f ( x 0 − ) ≠ f ( x 0 ) f(x_0^+)=f(x_0^-)\ne f(x_0) f ( x 0 + ) = f ( x 0 − ) = f ( x 0 ) :可去间断点
f ( x 0 + ) or f ( x 0 − ) not exists f(x_0^+) \text{ or } f(x_0^-) \text{ not exists} f ( x 0 + ) or f ( x 0 − ) not exists :无穷间断点
在[ a , b ] [a,b] [ a , b ] 上有定义的单调函数的间断点必然是跳跃间断点.
那么先证明左右极限存在:若x 0 x_0 x 0 是间断点,这里和介值定理的证明是一样的:
let S = { f ( x ) ∣ x ∈ [ a , x 0 ) } A = sup S if A < f ( x 0 − ) , by limit’s local sign-preserving property ∃ x 1 ∈ N − ( x 0 ) , x 1 < x 0 , f ( x 1 ) > A , Contradiction! if A > f ( x 0 − ) , ∃ x n , f ( x n ) > A − ϵ > f ( x 0 − ) Contradiction! ∴ A = f ( x 0 − ) same for B = f ( x 0 + ) ∀ x 1 < x 0 , x 2 > x 0 , f ( x 1 ) < f ( x 2 ) f ( x 1 ) < f ( x 0 ) ⟹ lim x 1 → x 0 A ≤ f ( x 0 ) f ( x 2 ) > f ( x 0 ) ⟹ lim x 2 → x 0 B ≥ f ( x 0 ) ∴ A = B ⟹ A = f ( x 0 ) = B ∴ A ≠ B \begin{gathered}
\text{let } S=\{ f(x)\vert x\in[a,x_0) \} \\
A=\sup S \\
\text{if }A<f(x_0^-),\text{by limit's local sign-preserving property} \\
\exists x_1\in N^-(x_0),x_1<x_0,f(x_1)>A,\text{Contradiction!} \\
\text{if } A>f(x_0^-),\exists x_n,f(x_n)>A-\epsilon>f(x_0^-)\text{Contradiction!} \\
\therefore A=f(x_0^-) \\
\text{same for } B=f(x_0^+) \\
\forall x_1<x_0,x_2>x_0,f(x_1)<f(x_2) \\
f(x_1)<f(x_0) \stackrel{\lim_{x_1 \to x_0} }{\Longrightarrow}A\le f(x_0) \\
f(x_2)>f(x_0)\stackrel{\lim_{x_2\to x_0}}{\Longrightarrow}B\ge f(x_0) \\
\therefore A=B \implies A=f(x_0)=B \\
\therefore A\ne B
\end{gathered} let S = { f ( x ) ∣ x ∈ [ a , x 0 )} A = sup S if A < f ( x 0 − ) , by limit’s local sign-preserving property ∃ x 1 ∈ N − ( x 0 ) , x 1 < x 0 , f ( x 1 ) > A , Contradiction! if A > f ( x 0 − ) , ∃ x n , f ( x n ) > A − ϵ > f ( x 0 − ) Contradiction! ∴ A = f ( x 0 − ) same for B = f ( x 0 + ) ∀ x 1 < x 0 , x 2 > x 0 , f ( x 1 ) < f ( x 2 ) f ( x 1 ) < f ( x 0 ) ⟹ l i m x 1 → x 0 A ≤ f ( x 0 ) f ( x 2 ) > f ( x 0 ) ⟹ l i m x 2 → x 0 B ≥ f ( x 0 ) ∴ A = B ⟹ A = f ( x 0 ) = B ∴ A = B
[think] 这个证明和介值定理证明那里都走了:构造集合,确界存在,确界等于某值,构造集合里极限为确界的收敛数列,连续性 的流程, 似乎是推出集合边界极限的套路.
在[ a , b ] [a,b] [ a , b ] 上有定义的单调函数的间断点必然至多可数个.
对x 1 , x 2 x_1,x_2 x 1 , x 2 两个跳跃间断点:
f ( x 1 − ) < f ( x 1 + ) ≤ f ( x 2 − ) < f ( x 2 + ) \begin{gathered}
f(x_1^-)<f(x_1^+)\le f(x_2^-)<f(x_2^+)
\end{gathered} f ( x 1 − ) < f ( x 1 + ) ≤ f ( x 2 − ) < f ( x 2 + )
于是每个间断点x i x_i x i 对应一个( f ( x i − ) , f ( x i + ) ) (f(x_i^-),f(x_i^+)) ( f ( x i − ) , f ( x i + )) ,且不同x i x_i x i 对应区间互不相交.
于是每个区间可以对应一个不同的有理数,有理数至多可数.
[think] 于是任何一个区间的不交划分只有可数个.(禁止[ a , a ] [a,a] [ a , a ] 的情况)
Ex Class 2
其实这节课在Class 10后面 但讲间断点的话和这里更近.
∀ f ( x ) , x ∈ ( a , b ) , f has at most countable point of discontinuity of the first kind \begin{gathered}
\forall f(x), x\in (a,b),f \text{ has at most countable point of discontinuity of the first kind}
\end{gathered} ∀ f ( x ) , x ∈ ( a , b ) , f has at most countable point of discontinuity of the first kind
首先我们考虑右极限大于左极限的间断点,证明它们是可数的.
对于一个间断点x 0 x_0 x 0 ,lim x → x 0 − f ( x ) = A , lim x → x 0 + f ( x ) = B \lim_{x \to x_0^-} f(x)=A,\lim_{x \to x_0^+} f(x)=B lim x → x 0 − f ( x ) = A , lim x → x 0 + f ( x ) = B ,显然我们可以找到p ∈ Q , p ∈ ( A , B ) p\in Q,p\in (A,B) p ∈ Q , p ∈ ( A , B ) .
而由于极限保号性,你也容易找到q , r ∈ Q q,r\in Q q , r ∈ Q 使得∀ x ∈ ( q , x 0 ) , f ( x ) < p , ∀ x ∈ ( x 0 , r ) , f ( x ) > p \forall x\in (q,x_0),f(x)<p,\forall x\in (x_0,r),f(x)>p ∀ x ∈ ( q , x 0 ) , f ( x ) < p , ∀ x ∈ ( x 0 , r ) , f ( x ) > p .
考虑是否可能有两个间断点x 1 < x 2 x_1<x_2 x 1 < x 2 对应相同的p , r , q p,r,q p , r , q ,那么显然q < x 1 < x 2 < r q<x_1<x_2<r q < x 1 < x 2 < r ,但是( x 1 , r ) (x_1,r) ( x 1 , r ) 中的值小于p p p ,( q , x 2 ) (q,x_2) ( q , x 2 ) 中的值大于p p p ,而这两个区间有交,所以不可能有两个间断点对应相同的p , r , q p,r,q p , r , q ,那么这些间断点可以单射到Q 3 Q^3 Q 3 上是可数的.
而对于左极限小于右极限的间断点同理可得.
接下来考虑左右极限相等的间断点,让p ∈ ( A , f ( x 0 ) ) p\in (A,f(x_0)) p ∈ ( A , f ( x 0 )) ,而q , r q,r q , r 满足( q , x 0 ) , ( x 0 , r ) (q,x_0),(x_0,r) ( q , x 0 ) , ( x 0 , r ) 有f ( x ) < p f(x)<p f ( x ) < p ,那么考虑有两个相同的这样的p , q , r p,q,r p , q , r 的x 1 , x 2 x_1,x_2 x 1 , x 2 ,你会发现f ( x 1 ) f(x_1) f ( x 1 ) 和f ( x 2 ) f(x_2) f ( x 2 ) 不能都小于p p p 你就爆炸了.所以也是不同的间断点对应不同的数对.
于是都是可数的.总和也是可数的.
Class 10
Some Limits' Calculation
f → 1 , g → ∞ lim f g = e lim g ln f = e lim g ( f − 1 ) \begin{gathered} \\
f\to 1,g\to \infty \\
\lim f^g=e^{\lim g\ln f}=e^{\lim g(f-1)}
\end{gathered} f → 1 , g → ∞ lim f g = e l i m g l n f = e l i m g ( f − 1 )
lim x → ∞ ( 1 + 1 x ) x = e \begin{gathered}
\lim_{x \to \infty} (1+\dfrac{1}{x} )^x=e
\end{gathered} x → ∞ lim ( 1 + x 1 ) x = e
lim x → + ∞ ( 1 + 1 x ) x ∈ ( ( 1 + 1 [ x ] + 1 ) [ x ] , ( 1 + 1 [ x ] ) [ x ] + 1 ) let e n = lim n → ∞ ( 1 + 1 n ) n lim x → + ∞ ( 1 + 1 [ x ] + 1 ) [ x ] = lim n → ∞ e [ x ] + 1 ( 1 + 1 [ x ] + 1 ) − 1 = e lim x → + ∞ ( 1 + 1 [ x ] ) [ x ] + 1 = lim n → ∞ e [ x ] ( 1 + 1 [ x ] ) = e ⟹ Squeeze Theorem lim x → + ∞ ( 1 + 1 x ) x = e lim x → − ∞ ( 1 + 1 x ) x = lim x → + ∞ ( 1 + 1 − x ) − x = lim x → + ∞ ( x x − 1 ) x = lim x → + ∞ ( 1 + 1 x − 1 ) x = e \begin{gathered}
\lim_{x \to +\infty} (1+\dfrac{1}{x} )^x\in
((1+\dfrac{1}{[x]+1} )^{[x]},(1+\dfrac{1}{[x]} )^{[x]+1}) \\
\text{let } e_n=\lim_{n \to \infty} (1+\dfrac{1}{n} )^n \\
\lim_{x \to +\infty} (1+\dfrac{1}{[x]+1} )^{[x]} \\
=\lim_{n \to \infty} e_{[x]+1}(1+\dfrac{1}{[x]+1})^{-1} \\
=e \\
\lim_{x \to +\infty} (1+\dfrac{1}{[x]} )^{[x]+1} \\
=\lim_{n \to \infty} e_{[x]}(1+\dfrac{1}{[x]} ) \\
=e \\
\stackrel{\text{ Squeeze Theorem }}{\Longrightarrow}
\lim_{x \to +\infty} (1+\dfrac{1}{x} )^x=e \\
\lim_{x \to -\infty} (1+\dfrac{1}{x} )^x \\
=\lim_{x \to +\infty}(1+\dfrac{1}{-x} )^{-x} \\
=\lim_{x \to +\infty}(\dfrac{x}{x-1} )^x \\
=\lim_{x \to +\infty}(1+\dfrac{1}{x-1} )^x \\
=e
\end{gathered} x → + ∞ lim ( 1 + x 1 ) x ∈ (( 1 + [ x ] + 1 1 ) [ x ] , ( 1 + [ x ] 1 ) [ x ] + 1 ) let e n = n → ∞ lim ( 1 + n 1 ) n x → + ∞ lim ( 1 + [ x ] + 1 1 ) [ x ] = n → ∞ lim e [ x ] + 1 ( 1 + [ x ] + 1 1 ) − 1 = e x → + ∞ lim ( 1 + [ x ] 1 ) [ x ] + 1 = n → ∞ lim e [ x ] ( 1 + [ x ] 1 ) = e ⟹ Squeeze Theorem x → + ∞ lim ( 1 + x 1 ) x = e x → − ∞ lim ( 1 + x 1 ) x = x → + ∞ lim ( 1 + − x 1 ) − x = x → + ∞ lim ( x − 1 x ) x = x → + ∞ lim ( 1 + x − 1 1 ) x = e
真麻烦.一句话就是取整夹你.
lim x → 1 m x m − 1 − n x n − 1 \begin{gathered}
\lim_{x \to 1} \dfrac{m}{x^m-1} -\dfrac{n}{x^n-1}
\end{gathered} x → 1 lim x m − 1 m − x n − 1 n
lim x → 1 m x m − 1 − n x n − 1 = lim x → 1 m ( x n − 1 ) − n ( x m − 1 ) ( x m − 1 ) ( x n − 1 ) = lim x → 1 m ( n ( x − 1 ) + n ( n − 1 ) 2 ( x − 1 ) 2 ) m n ( x − 1 ) 2 − − n ( m ( x − 1 ) + m ( m − 1 ) 2 ( x − 1 ) 2 ) m n ( x − 1 ) 2 = lim x → 1 m n 2 − n m 2 2 n m = n − m 2 \begin{gathered}
\lim_{x \to 1} \dfrac{m}{x^m-1} -\dfrac{n}{x^n-1}
=\lim_{x \to 1} \dfrac{m(x^n-1)-n(x^m-1)}{(x^m-1)(x^n-1)} \\
=\lim_{x \to 1} \dfrac{m(n(x-1)+\dfrac{n(n-1)}{2} (x-1)^2)}{mn(x-1)^2} \\
-\dfrac{-n(m(x-1)+\dfrac{m(m-1)}{2} (x-1)^2)}{mn(x-1)^2} \\
=\lim_{x \to 1} \dfrac{mn^2-nm^2}{2nm} \\
=\dfrac{n-m}{2}
\end{gathered} x → 1 lim x m − 1 m − x n − 1 n = x → 1 lim ( x m − 1 ) ( x n − 1 ) m ( x n − 1 ) − n ( x m − 1 ) = x → 1 lim mn ( x − 1 ) 2 m ( n ( x − 1 ) + 2 n ( n − 1 ) ( x − 1 ) 2 ) − mn ( x − 1 ) 2 − n ( m ( x − 1 ) + 2 m ( m − 1 ) ( x − 1 ) 2 ) = x → 1 lim 2 nm m n 2 − n m 2 = 2 n − m
Uniform Continuity
f ( x ) is uniformly continuous in [ a , b ] ⟺ ∀ ϵ > 0 , ∃ δ , ∀ x 1 , x 2 ∈ [ a , b ] , ∣ x 1 − x 2 ∣ < δ ⟹ ∣ f ( x 1 ) − f ( x 2 ) ∣ < ϵ \begin{gathered}
f(x) \text{ is uniformly continuous in } [a,b] \\
\iff
\forall \epsilon>0,\exists \delta,\forall x_1,x_2\in [a,b], \\
\vert x_1-x_2 \vert <\delta \implies \vert f(x_1)-f(x_2) \vert <\epsilon
\end{gathered} f ( x ) is uniformly continuous in [ a , b ] ⟺ ∀ ϵ > 0 , ∃ δ , ∀ x 1 , x 2 ∈ [ a , b ] , ∣ x 1 − x 2 ∣ < δ ⟹ ∣ f ( x 1 ) − f ( x 2 ) ∣ < ϵ
Not Uniform Continuity
∃ ϵ , s n , t n , ∣ s n − t n ∣ < 1 n , ∣ f ( s n ) − f ( t n ) ∣ > ϵ \begin{gathered}
\exists \epsilon,s_n,t_n, \\
\vert s_n-t_n \vert < \dfrac{1}{n} ,\vert f(s_n)-f(t_n) \vert >\epsilon
\end{gathered} ∃ ϵ , s n , t n , ∣ s n − t n ∣ < n 1 , ∣ f ( s n ) − f ( t n ) ∣ > ϵ
f ( x ) = x is uniformly continuous in [ 0 , + ∞ ) \begin{gathered}
f(x)=\sqrt{ x } \text{ is uniformly continuous in } [0,+\infty)
\end{gathered} f ( x ) = x is uniformly continuous in [ 0 , + ∞ )
x 1 > x 2 ⟹ ∣ x 1 − x 2 ∣ = ∣ x 1 − x 2 x 1 + x 2 ∣ < ∣ x 1 − x 2 x 1 − x 2 ∣ = x 1 − x 2 < δ \begin{gathered}
x_1>x_2 \implies \\
\vert \sqrt{x_1}-\sqrt{ x_2 } \vert ={\left \vert \dfrac{x_1-x_2}{\sqrt{ x_1 } +\sqrt{ x_2 } } \right \vert} < {\left \vert \dfrac{x_1-x_2}{\sqrt{x_1-x_2}} \right \vert} =\sqrt{ x_1-x_2 }<\sqrt \delta
\end{gathered} x 1 > x 2 ⟹ ∣ x 1 − x 2 ∣ = x 1 + x 2 x 1 − x 2 < x 1 − x 2 x 1 − x 2 = x 1 − x 2 < δ
f ( x ) = 1 x is not uniformly continuous in ( 0 , 1 ) \begin{gathered}
f(x)=\dfrac{1}{x} \text{ is not uniformly continuous in } (0,1)
\end{gathered} f ( x ) = x 1 is not uniformly continuous in ( 0 , 1 )
1 n − 1 2 n < 1 n , y ( 1 n ) − y ( 1 2 n ) = n ≥ 1 \begin{gathered}
\dfrac{1}{n} -\dfrac{1}{2n} <\dfrac{1}{n} , \\
y(\dfrac{1}{n} )-y(\dfrac{1}{2n} )=n\ge 1
\end{gathered} n 1 − 2 n 1 < n 1 , y ( n 1 ) − y ( 2 n 1 ) = n ≥ 1
闭区间连续函数性质
反证
∃ ϵ , s n , t n , ∣ s n − t n ∣ < 1 n , ∣ f ( s n ) − f ( t n ) ∣ > ϵ \begin{gathered}
\exists \epsilon,s_n,t_n,\vert s_n-t_n \vert <\dfrac{1}{n} ,\vert f(s_n)-f(t_n) \vert >\epsilon \\
\end{gathered} ∃ ϵ , s n , t n , ∣ s n − t n ∣ < n 1 , ∣ f ( s n ) − f ( t n ) ∣ > ϵ
取s n , t n s_n,t_n s n , t n 的收敛子列s n ′ , t n ′ s'_n,t'_n s n ′ , t n ′ :
let x 0 = lim n → ∞ s n ′ = lim n → ∞ s n = lim n → ∞ t n ′ = lim n → ∞ t n ∈ [ a , b ] lim n → ∞ f ( s n ′ ) = lim n → ∞ f ( t n ′ ) = f ( x 0 ) ⟹ lim n → ∞ ∣ f ( s n ′ ) − f ( t n ′ ) ∣ = 0 \begin{gathered}
\text{let} x_0=\lim_{n \to \infty} s'_n=\lim_{n \to \infty} s_n=\lim_{n \to \infty} t'_n=\lim_{n \to \infty} t_n \in [a,b] \\
\lim_{n \to \infty} f(s'_n)=\lim_{n \to \infty} f(t_n')=f(x_0) \\
\implies \lim_{n \to \infty} \vert f(s'_n)-f(t'_n) \vert =0
\end{gathered} let x 0 = n → ∞ lim s n ′ = n → ∞ lim s n = n → ∞ lim t n ′ = n → ∞ lim t n ∈ [ a , b ] n → ∞ lim f ( s n ′ ) = n → ∞ lim f ( t n ′ ) = f ( x 0 ) ⟹ n → ∞ lim ∣ f ( s n ′ ) − f ( t n ′ ) ∣ = 0
Sol1
反证,设无界,∃ x n \exists x_n ∃ x n 满足f ( x n ) > n f(x_n)>n f ( x n ) > n ,取x n x_n x n 的收敛子列,那么 f ( lim n → ∞ x n ) = ∞ f(\lim_{n \to \infty} x_n)=\infty f ( lim n → ∞ x n ) = ∞ 矛盾.
Sol2
用上面一致连续,那么区间的值域跨度不超过 b − a δ ϵ \dfrac{b-a}{\delta} \epsilon δ b − a ϵ .
闭区间上连续函数一定能取到最大值最小值.
{ M = sup { f ( x ) ∣ x ∈ [ a , b ] } f is continuous ⟹ ∃ x ∈ [ a , b ] , f ( x ) = M \begin{cases}
M=\sup \{ f(x) \vert x\in [a,b] \} \\
\text{f is continuous}
\end{cases}
\implies \exists x\in [a,b], f(x)=M { M = sup { f ( x ) ∣ x ∈ [ a , b ]} f is continuous ⟹ ∃ x ∈ [ a , b ] , f ( x ) = M
考虑取任意M 1 < M M_1<M M 1 < M ,可以得到一个f ( x 1 ) ∈ ( M 1 , M ) f(x_1)\in (M_1,M) f ( x 1 ) ∈ ( M 1 , M ) ,取M n > f ( x n − 1 ) M_n>f(x_{n-1}) M n > f ( x n − 1 ) 可得x n ∈ ( M n , M ) x_n \in (M_n,M) x n ∈ ( M n , M ) ,显然x n x_n x n 有界可以取收敛子列y n y_n y n ,则lim n → ∞ f ( y n ) = f ( lim n → ∞ y n ) \lim_{n \to \infty} f(y_n)=f(\lim_{n \to \infty} y_n) lim n → ∞ f ( y n ) = f ( lim n → ∞ y n ) ,则于是得证
Class 11
Continuous Function's Periodicty
{ f ( x ) is a periodic function that isn’t constant f ( x ) is continuous ⟹ f ( x ) has min positive period \begin{cases}
f(x)\text{ is a periodic function that isn't constant} \\
f(x)\text{ is continuous}
\end{cases} \\
\implies f(x)\text{ has min positive period} { f ( x ) is a periodic function that isn’t constant f ( x ) is continuous ⟹ f ( x ) has min positive period
T : = { t ∣ t > 0 , f ( x + t ) = f ( x ) } t 0 : = inf T \begin{gathered}
T:= \{ t \vert t>0,f(x+t)=f(x) \} \\
t_0:= \inf T \\
\end{gathered} T := { t ∣ t > 0 , f ( x + t ) = f ( x )} t 0 := inf T
若t 0 ≠ 0 t_0\ne 0 t 0 = 0 ,取 { t n } , t i ∈ T , lim n → ∞ t n = t 0 \{ t_n \},t_i\in T,\lim_{n \to \infty} t_n=t_0 { t n } , t i ∈ T , lim n → ∞ t n = t 0 ,则 f ( x ) = f ( x + t n ) = lim n → ∞ f ( x + t n ) = f ( x + lim n → ∞ t n ) = f ( x + t 0 ) f(x)=f(x+t_n)=\lim_{n \to \infty} f(x+t_n)=f(x+\lim_{n \to \infty} t_n)=f(x+t_0) f ( x ) = f ( x + t n ) = lim n → ∞ f ( x + t n ) = f ( x + lim n → ∞ t n ) = f ( x + t 0 )
若t 0 = 0 t_0=0 t 0 = 0 ,因为不是常函数, 则∃ x 0 s . t . f ( x 0 ) ≠ f ( 0 ) \exists x_0 {\ } s.t. {\ } f(x_0)\ne f(0) ∃ x 0 s . t . f ( x 0 ) = f ( 0 ) ,因为连续,和极限有保号性你可以说∀ x ∈ O ( x 0 , δ ) , f ( x ) ≠ f ( 0 ) \forall x\in O(x_0,\delta),f(x)\ne f(0) ∀ x ∈ O ( x 0 , δ ) , f ( x ) = f ( 0 ) ,但由t 0 = 0 t_0=0 t 0 = 0 ,你可以找到t < δ t<\delta t < δ ,那就可以再找到N N N 使得N t ∈ ( x 0 − δ , x 0 + δ ) Nt\in (x_0-\delta,x_0+\delta) N t ∈ ( x 0 − δ , x 0 + δ ) ,N t Nt N t 一定是周期,但f ( 0 + N t ) ≠ f ( 0 ) f(0+Nt)\ne f(0) f ( 0 + N t ) = f ( 0 ) ,矛盾.
于是得证.
Directive
导数的定义,初等函数求导,导数的四则运算.
Class 12
极限里换元
u ( x ) is continuous , lim u → u 0 G ( u ) = A ⟹ lim x → x 0 G ( u ( x ) ) = A \begin{gathered}
u(x) \text{ is continuous},\lim_{u \to u_0} G(u)=A \\
\implies \lim_{x \to x_0} G(u(x)) = A
\end{gathered} u ( x ) is continuous , u → u 0 lim G ( u ) = A ⟹ x → x 0 lim G ( u ( x )) = A
∀ ϵ , ∃ δ , u ( x ) ∈ N ∗ ( u ( x ) , δ 1 ) ⟹ G ( u ( x ) ) ∈ N ( A , ϵ ) ⟹ ∀ ϵ , ∃ δ , x ∈ N ∗ ( x 0 , δ ) ⟹ u ( x ) ∈ N ( u ( x ) , δ 1 ) \begin{gathered}
\forall \epsilon,\exists \delta, u(x)\in N^*(u(x),\delta_1) \implies G(u(x))\in N(A,\epsilon) \\
\implies \forall \epsilon,\exists \delta,x\in N^*(x_0,\delta) \implies u(x)\in N(u(x),\delta_1) \\
\end{gathered} ∀ ϵ , ∃ δ , u ( x ) ∈ N ∗ ( u ( x ) , δ 1 ) ⟹ G ( u ( x )) ∈ N ( A , ϵ ) ⟹ ∀ ϵ , ∃ δ , x ∈ N ∗ ( x 0 , δ ) ⟹ u ( x ) ∈ N ( u ( x ) , δ 1 )
这里有一点小小的问题,不过你发现只要定义G 1 ( u ( x 0 ) ) = G 1 ( u 0 ) = A G_1(u(x_0))=G_1(u_0)=A G 1 ( u ( x 0 )) = G 1 ( u 0 ) = A 即可避免,因为条件里这个点反正是任意的.
于是结束.
复合函数求导(链式法则)
( f ( g ( x ) ) ) ′ = f ′ ( g ( x ) ) g ′ ( x ) \begin{gathered}
(f(g(x)))'=f'(g(x))g'(x)
\end{gathered} ( f ( g ( x )) ) ′ = f ′ ( g ( x )) g ′ ( x )
Sol
用上面的极限换元一换就出来啦
My Sol
f ( x ) = f ( x 0 ) + f ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) g ( x ) = g ( x 0 ) + g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) lim x → x 0 f ( g ( x ) ) − f ( g ( x 0 ) ) x − x 0 = lim x → x 0 f ( g ( x 0 ) + g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) ) − f ( g ( x 0 ) ) x − x 0 = lim x → x 0 f ′ ( g ( x 0 ) ) ( g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) ) x − x 0 + o ( g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) ) x − x 0 = lim x → x 0 f ′ ( g ( x 0 ) ) g ′ ( x 0 ) + o ( g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) ) x − x 0 \begin{gathered}
f(x)=f(x_0)+f'(x_0)(x-x_0)+o(x-x_0) \\
g(x)=g(x_0)+g'(x_0)(x-x_0)+o(x-x_0) \\
\lim_{x \to x_0} \dfrac{f(g(x))-f(g(x_0))}{x-x_0} \\
=\lim_{x \to x_0} \dfrac{f(g(x_0)+g'(x_0)(x-x_0)+o(x-x_0))-f(g(x_0))}{x-x_0} \\
=\lim_{x \to x_0} \dfrac{f'(g(x_0))(g'(x_0)(x-x_0)+o(x-x_0))}{x-x_0} \\
+\dfrac{o(g'(x_0)(x-x_0)+o(x-x_0))}{x-x_0} \\
=\lim_{x \to x_0} f'(g(x_0))g'(x_0)+\dfrac{o(g'(x_0)(x-x_0)+o(x-x_0))}{x-x_0} \\
\end{gathered} f ( x ) = f ( x 0 ) + f ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) g ( x ) = g ( x 0 ) + g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) x → x 0 lim x − x 0 f ( g ( x )) − f ( g ( x 0 )) = x → x 0 lim x − x 0 f ( g ( x 0 ) + g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 )) − f ( g ( x 0 )) = x → x 0 lim x − x 0 f ′ ( g ( x 0 )) ( g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 )) + x − x 0 o ( g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 )) = x → x 0 lim f ′ ( g ( x 0 )) g ′ ( x 0 ) + x − x 0 o ( g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ))
而满足o ( x − x 0 ) ≤ ϵ ( x − x 0 ) o(x-x_0)\le\epsilon(x-x_0) o ( x − x 0 ) ≤ ϵ ( x − x 0 ) 的x x x 是x 0 x_0 x 0 的一个邻域,于是
lim x → x 0 o ( g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 ) ) x − x 0 ≤ lim x → x 0 o ( ( g ′ ( x 0 ) + ϵ ) ( x − x 0 ) ) x − x 0 = 0 \begin{gathered}
\lim_{x \to x_0} \dfrac{o(g'(x_0)(x-x_0)+o(x-x_0))}{x-x_0} \\
\le \lim_{x \to x_0} \dfrac{ o((g'(x_0)+\epsilon)(x-x_0))}{x-x_0} \\
=0
\end{gathered} x → x 0 lim x − x 0 o ( g ′ ( x 0 ) ( x − x 0 ) + o ( x − x 0 )) ≤ x → x 0 lim x − x 0 o (( g ′ ( x 0 ) + ϵ ) ( x − x 0 )) = 0
得证.
只能说很暴力.
莱布尼茨求导公式
( u v ) ( n ) = ∑ i = 1 0 ( n i ) u ( i ) v ( n − i ) \begin{gathered}
(uv)^{(n)}=\sum _{i = 1} ^{0} \binom{n}{i} u^{(i)}v^{(n-i)}
\end{gathered} ( uv ) ( n ) = i = 1 ∑ 0 ( i n ) u ( i ) v ( n − i )
据说一般用在有一个高阶导数是0 0 0 的情况
arctan ( 50 ) ( 0 ) = 0 \begin{gathered}
\arctan^{(50)}(0)=0
\end{gathered} arctan ( 50 ) ( 0 ) = 0
Sol 1
arctan ′ ( x ) = 1 1 + x 2 ⟹ ( 1 + x 2 ) arctan ′ ( x ) = 1 0 = ( ( 1 + x 2 ) arctan ′ ( x ) ) ( n ) = ( 1 + x 2 ) arctan ( n + 1 ) ( x ) + ( n 1 ) 2 x arctan ( n ) ( x ) + ( n 2 ) 2 arctan ( n − 1 ) ( x ) ⟹ x = 0 arctan ( n + 1 ) ( 0 ) + n ( n − 1 ) arctan ( n − 1 ) ( 0 ) = 0 \begin{gathered}
\arctan'(x)=\dfrac{1}{1+x^2} \\
\implies (1+x^2)\arctan'(x)=1 \\
0=((1+x^2)\arctan'(x))^{(n)} \\
=(1+x^2)\arctan^{(n+1)}(x)+\binom{n}{1}2x\arctan^{(n)}(x)+\binom{n}{2}2\arctan^{(n-1)}(x) \\
\stackrel{ x=0 }{\Longrightarrow} \arctan^{(n+1)}(0)+n(n-1) \arctan^{(n-1)}(0)=0
\end{gathered} arctan ′ ( x ) = 1 + x 2 1 ⟹ ( 1 + x 2 ) arctan ′ ( x ) = 1 0 = (( 1 + x 2 ) arctan ′ ( x ) ) ( n ) = ( 1 + x 2 ) arctan ( n + 1 ) ( x ) + ( 1 n ) 2 x arctan ( n ) ( x ) + ( 2 n ) 2 arctan ( n − 1 ) ( x ) ⟹ x = 0 arctan ( n + 1 ) ( 0 ) + n ( n − 1 ) arctan ( n − 1 ) ( 0 ) = 0
于是有递推,得到是0 0 0 .
Sol 2
注意到一阶导是偶函数,又求了奇数次变成奇函数,所以说0 0 0 .
Sol 3
对
1 1 + x 2 = 1 ( x − i ) ( x + i ) = 1 ( 1 − i x ) ( 1 + i x ) = 1 2 i ( 1 x − i − 1 x + i ) \begin{gathered}
\dfrac{1}{1+x^2}=\dfrac{1}{(x-i)(x+i)} =\dfrac{1}{(1-ix)(1+ix) } \\
=\dfrac{1}{2i} (\dfrac{1}{x-i}-\dfrac{1}{x+i})
\end{gathered} 1 + x 2 1 = ( x − i ) ( x + i ) 1 = ( 1 − i x ) ( 1 + i x ) 1 = 2 i 1 ( x − i 1 − x + i 1 )
于是可以对两个分数分别求导.复变函数从实数轴上逼近的导数当然就是原函数的导数.
Class 13
中值定理
Theorems
极值点
f ( x 0 ) f(x_0) f ( x 0 ) 是极大值当且仅当存在δ , ∀ x ∈ N ∗ ( x , δ ) , f ( x ) < f ( x 0 ) \delta,\forall x\in N^*(x,\delta),f(x)<f(x_0) δ , ∀ x ∈ N ∗ ( x , δ ) , f ( x ) < f ( x 0 )
极值和最值既不充分也不必要.
最值是极值当且仅当最值在区间内部,端点不行.
Fermat Theorem
f ( x 0 ) f(x_0) f ( x 0 ) 是极值点,f ′ ( x 0 ) f'(x_0) f ′ ( x 0 ) 存在则f ′ ( x 0 ) = 0 f'(x_0)=0 f ′ ( x 0 ) = 0
不妨设是极大值.
f ′ ( x 0 − ) = lim x → x 0 − f ( x ) − f ( x 0 ) x − x 0 ≥ 0 f ′ ( x 0 + ) = lim x → x 0 f ( x ) − f ( x 0 ) x − x 0 ≤ 0 ⟹ f ′ ( x 0 ) = f ′ ( x 0 − ) = f ′ ( x 0 + ) = 0 \begin{gathered}
f'(x_0^-)=\lim_{x \to x_0^-} \dfrac{f(x)-f(x_0)}{x-x_0} \ge 0 \\
f'(x_0^+)=\lim_{x \to x_0} \dfrac{f(x)-f(x_0)}{x-x_0} \le 0 \\
\implies f'(x_0)=f'(x_0^-)=f'(x_0^+)=0
\end{gathered} f ′ ( x 0 − ) = x → x 0 − lim x − x 0 f ( x ) − f ( x 0 ) ≥ 0 f ′ ( x 0 + ) = x → x 0 lim x − x 0 f ( x ) − f ( x 0 ) ≤ 0 ⟹ f ′ ( x 0 ) = f ′ ( x 0 − ) = f ′ ( x 0 + ) = 0
Rolle's Theorem
{ f ( x ) ∈ C [ a , b ] x ∈ ( a , b ) ⟹ ∃ f ′ ( x ) f ( a ) = f ( b ) ⟹ ∃ ξ ∈ ( a , b ) , f ′ ( ξ ) = 0 \begin{gathered}
\begin{cases}
f(x) \in C[a,b] \\
x\in (a,b) \implies \exists f'(x) \\
f(a)=f(b)
\end{cases} \\
\implies
\exists \xi\in (a,b),f'(\xi)=0
\end{gathered} ⎩ ⎨ ⎧ f ( x ) ∈ C [ a , b ] x ∈ ( a , b ) ⟹ ∃ f ′ ( x ) f ( a ) = f ( b ) ⟹ ∃ ξ ∈ ( a , b ) , f ′ ( ξ ) = 0
用连续函数最值定理,并且在f f f 不是常函数由f ( a ) = f ( b ) f(a)=f(b) f ( a ) = f ( b ) 显然有至少一个最值在中间取.这个最值是极值.极值处费马定理,得证.
Lagrange Mean Value Theorem
{ f ( x ) ∈ C [ a , b ] x ∈ ( a , b ) ⟹ ∃ f ′ ( x ) ⟹ ∃ ξ ∈ ( a , b ) , f ′ ( ξ ) = f ( a ) − f ( b ) a − b \begin{gathered}
\begin{cases}
f(x) \in C[a,b] \\
x\in (a,b) \implies \exists f'(x)
\end{cases} \\
\implies \exists \xi\in (a,b),f'(\xi)=\dfrac{f(a)-f(b)}{a-b}
\end{gathered} { f ( x ) ∈ C [ a , b ] x ∈ ( a , b ) ⟹ ∃ f ′ ( x ) ⟹ ∃ ξ ∈ ( a , b ) , f ′ ( ξ ) = a − b f ( a ) − f ( b )
let F ( x ) = f ( x ) − f ( a ) − f ( b ) ( a − b ) ( x − a ) \begin{gathered}
\text{let } F(x)=f(x)-\dfrac{f(a)-f(b)}{(a-b)} (x-a)
\end{gathered} let F ( x ) = f ( x ) − ( a − b ) f ( a ) − f ( b ) ( x − a )
然后直接 Rolle's Theorem.
Cauchy Mean Value Theorem
{ f ( x ) ∈ C [ a , b ] x ∈ ( a , b ) ⟹ ∃ f ′ ( x ) g ( x ) ∈ C [ a , b ] x ∈ ( a , b ) ⟹ ∃ g ′ ( x ) ∀ ( a ′ , b ′ ) , x ∈ ( a ′ , b ′ ) , g ′ ( x ) ≢ 0 ∃ ξ ∈ ( a , b ) , f ′ ( ξ ) g ′ ( ξ ) = f ( a ) − f ( b ) g ( a ) − g ( b ) \begin{gathered}
\begin{cases}
f(x) \in C[a,b] \\
x\in (a,b) \implies \exists f'(x) \\
g(x)\in C[a,b] \\
x\in (a,b) \implies \exists g'(x) \\
\forall (a',b'),x\in (a',b'),g'(x)\not \equiv 0
\end{cases} \\
\exists \xi \in (a,b),\dfrac{f'(\xi)}{g'(\xi)} =\dfrac{f(a)-f(b)}{g(a)-g(b)}
\end{gathered} ⎩ ⎨ ⎧ f ( x ) ∈ C [ a , b ] x ∈ ( a , b ) ⟹ ∃ f ′ ( x ) g ( x ) ∈ C [ a , b ] x ∈ ( a , b ) ⟹ ∃ g ′ ( x ) ∀ ( a ′ , b ′ ) , x ∈ ( a ′ , b ′ ) , g ′ ( x ) ≡ 0 ∃ ξ ∈ ( a , b ) , g ′ ( ξ ) f ′ ( ξ ) = g ( a ) − g ( b ) f ( a ) − f ( b )
let F ( x ) = f ( x ) − f ( a ) − f ( b ) g ( a ) − g ( b ) ( g ( x ) − g ( a ) ) \begin{gathered}
\text{let } F(x)=f(x)-\dfrac{f(a)-f(b)}{g(a)-g(b)} (g(x)-g(a))
\end{gathered} let F ( x ) = f ( x ) − g ( a ) − g ( b ) f ( a ) − f ( b ) ( g ( x ) − g ( a ))
Rolle's Theorem 启动
Usage
他说你应该在研究导函数零点的时候用Rolle,研究函数和导函数关系用Lagrange,研究两个函数的时候用Cauchy
lim x → + ∞ f ′ ( x ) = 0 ⟹ lim x → + ∞ f ( x ) x = 0 \begin{gathered}
\lim_{x \to +\infty} f'(x)=0 \implies \lim_{x \to +\infty} \dfrac{f(x)}{x} =0
\end{gathered} x → + ∞ lim f ′ ( x ) = 0 ⟹ x → + ∞ lim x f ( x ) = 0
x > A > X ⟹ ∣ f ( x ) − f ( A ) ∣ < ϵ 1 ( x − A ) ⟹ ∣ f ( x ) x ∣ < f ( A ) − ϵ 1 A x + ϵ 1 \begin{gathered}
x>A>X \\
\implies
\vert f(x)-f(A) \vert <\epsilon_1(x-A) \\
\implies \vert \dfrac{f(x)}{x} \vert <\dfrac{f(A)-\epsilon_1A}{x} +\epsilon_1
\end{gathered} x > A > X ⟹ ∣ f ( x ) − f ( A ) ∣ < ϵ 1 ( x − A ) ⟹ ∣ x f ( x ) ∣ < x f ( A ) − ϵ 1 A + ϵ 1
其实从这就能看出来了,同时取极限则 lim x → + ∞ ∣ f ( x ) x ∣ \lim_{x \to +\infty} \vert \dfrac{f(x)}{x} \vert lim x → + ∞ ∣ x f ( x ) ∣ 小于任意正数,于是是0 0 0 .
∀ a > b , ∃ ξ ∈ ( a , b ) , a e b − b e a = ( 1 − ξ ) e ξ ( a − b ) \begin{gathered}
\forall a>b,\exists \xi \in (a,b),ae^b-be^a=(1-\xi)e^\xi(a-b)
\end{gathered} ∀ a > b , ∃ ξ ∈ ( a , b ) , a e b − b e a = ( 1 − ξ ) e ξ ( a − b )
⟹ e b b − e a a 1 b − 1 a = ( 1 − ξ ) e ξ \begin{gathered}
\implies \dfrac{\dfrac{e^b}{b} -\dfrac{e^a}{a} }{\dfrac{1}{b} -\dfrac{1}{a}} =(1-\xi)e^{\xi}
\end{gathered} ⟹ b 1 − a 1 b e b − a e a = ( 1 − ξ ) e ξ
然后柯西中值结束.
∃ ξ ∈ C [ a , b ] , ∃ f ′ ′ ( x ) ⟹ ∃ ξ ∈ ( a , b ) , f ( b ) + f ( a ) − 2 f ( a + b 2 ) = ( b − a 2 ) 2 f ′ ′ ( ξ ) \begin{gathered}
\exists \xi\in C[a,b],\exists f''(x) \\
\implies \exists \xi \in (a,b), \\
f(b)+f(a)-2f(\dfrac{a+b}{2})=(\dfrac{b-a}{2})^2f''(\xi)
\end{gathered} ∃ ξ ∈ C [ a , b ] , ∃ f ′′ ( x ) ⟹ ∃ ξ ∈ ( a , b ) , f ( b ) + f ( a ) − 2 f ( 2 a + b ) = ( 2 b − a ) 2 f ′′ ( ξ )
let F ( x ) = f ( x ) − f ( x − b − a 2 ) F ( b ) − F ( a + b 2 ) = f ( b ) + f ( a ) − 2 f ( a + b 2 ) = b − a 2 ( F ′ ( ξ 1 ) − F ′ ( ξ 1 − b − a 2 ) ) = ( b − a 2 ) 2 F ′ ′ ( ξ ) \begin{gathered}
\text{let } F(x)=f(x)-f(x-\dfrac{b-a}{2}) \\
F(b)-F(\dfrac{a+b}{2} )=f(b)+f(a)-2f(\dfrac{a+b}{2}) \\
=\dfrac{b-a}{2} (F'(\xi_1)-F'(\xi_1-\dfrac{b-a}{2} )) \\
=(\dfrac{b-a}{2} )^2F''(\xi)
\end{gathered} let F ( x ) = f ( x ) − f ( x − 2 b − a ) F ( b ) − F ( 2 a + b ) = f ( b ) + f ( a ) − 2 f ( 2 a + b ) = 2 b − a ( F ′ ( ξ 1 ) − F ′ ( ξ 1 − 2 b − a )) = ( 2 b − a ) 2 F ′′ ( ξ )
我们注意到如果你上来不构造函数对f ( b ) − f ( m i d ) , f ( m i d ) − f ( a ) f(b)-f(mid),f(mid)-f(a) f ( b ) − f ( mi d ) , f ( mi d ) − f ( a ) 分别用拉格朗日中值是做不出来的.这么干限制强(要求值对应相等而非差相等)显然就不如分开.
f ( x ) ∈ C [ 1 , + ∞ ) , ∃ f ′ ( x ) e − x f ′ ( x ) is bounded in [ 1 , + ∞ ) ⟹ e − x f ( x ) is bounded in ( 1 , + ∞ ) \begin{gathered}
f(x)\in C[1,+\infty),\exists f'(x) \\
e^{-x}f'(x) \text{ is bounded in } [1,+\infty) \\
\implies e^{-x}f(x) \text{ is bounded in } (1,+\infty)
\end{gathered} f ( x ) ∈ C [ 1 , + ∞ ) , ∃ f ′ ( x ) e − x f ′ ( x ) is bounded in [ 1 , + ∞ ) ⟹ e − x f ( x ) is bounded in ( 1 , + ∞ )
f ( x 1 ) − f ( x 2 ) e x 1 − e x 2 = f ′ ( ξ ) e ξ ≤ M e − x f ( x ) ≤ f ( x ) − f ( 1 ) e x + f ( 1 ) ≤ f ( x ) − f ( 1 ) e x − e 1 + f ( 1 ) = f ′ ( ξ ) e ξ + f ( 1 ) ≤ M + f ( 1 ) \begin{gathered}
\dfrac{f(x_1)-f(x_2)}{e^{x_1}-e^{x_2}} =\dfrac{f'(\xi)}{e^{\xi}}\le M \\
e^{-x}f(x)\le \dfrac{f(x)-f(1)}{e^x} +f(1) \\
\le \dfrac{f(x)-f(1)}{e^x-e^1} +f(1) \\
= \dfrac{f'(\xi)}{e^\xi}+f(1) \\
\le M+f(1)
\end{gathered} e x 1 − e x 2 f ( x 1 ) − f ( x 2 ) = e ξ f ′ ( ξ ) ≤ M e − x f ( x ) ≤ e x f ( x ) − f ( 1 ) + f ( 1 ) ≤ e x − e 1 f ( x ) − f ( 1 ) + f ( 1 ) = e ξ f ′ ( ξ ) + f ( 1 ) ≤ M + f ( 1 )
f ( x ) ∈ C ( 0 , 1 ] , ∃ f ′ ( x ) ∃ lim x → 0 + x f ′ ( x ) ⟹ f ( x ) ∈ U C ( 0 , 1 ] \begin{gathered}
f(x)\in C(0,1],\exists f'(x) \\
\exists\lim_{x \to 0^+} \sqrt xf'(x) \\
\implies f(x) \in UC(0,1]
\end{gathered} f ( x ) ∈ C ( 0 , 1 ] , ∃ f ′ ( x ) ∃ x → 0 + lim x f ′ ( x ) ⟹ f ( x ) ∈ U C ( 0 , 1 ]
Class 14
Darbox Theorem
∀ x ∈ [ a , b ] , ∃ f ′ ( x ) ⟹ { ∀ v ∈ [ f ′ ( a ) , f ′ ( b ) ] , ∃ ξ , f ′ ( ξ ) = v f ′ ( x ) has no discontinuity of first kind \begin{gathered}
\forall x\in [a,b], \\
\exists f'(x) \\
\implies \begin{cases}
\forall v\in [f'(a),f'(b)],\exists \xi,f'(\xi)=v \\
f'(x) \text{ has no discontinuity of first kind}
\end{cases}
\end{gathered} ∀ x ∈ [ a , b ] , ∃ f ′ ( x ) ⟹ { ∀ v ∈ [ f ′ ( a ) , f ′ ( b )] , ∃ ξ , f ′ ( ξ ) = v f ′ ( x ) has no discontinuity of first kind
(1)
先不妨设f ′ ( a ) < 0 < f ′ ( b ) f'(a)<0<f'(b) f ′ ( a ) < 0 < f ′ ( b )
由定义容易说明a , b a,b a , b 不是极小值.
于是存在最值定理,( a , b ) (a,b) ( a , b ) 中存在最值x x x ,于是存在f ′ ( x ) = 0 f'(x)=0 f ′ ( x ) = 0
其他情况显然可以规约过来.
(2)
考虑对一个间断点x 0 x_0 x 0
第一类间断点所以有左右极限L , R L,R L , R ,那么∀ ϵ ∃ δ , x ∈ ( x 0 − δ , x 0 ) ⟹ f ′ ( x 0 ) ∈ N ( L , ϵ ) \forall \epsilon\exists \delta, x \in (x_0-\delta,x_0) \implies f'(x_0)\in N(L,\epsilon) ∀ ϵ ∃ δ , x ∈ ( x 0 − δ , x 0 ) ⟹ f ′ ( x 0 ) ∈ N ( L , ϵ ) .同理有∀ x ∈ ( x 0 , x 0 + δ ) ⟹ f ′ ( x ) ∈ N ( R , ϵ ) \forall x\in(x_0,x_0+\delta) \implies f'(x)\in N(R,\epsilon) ∀ x ∈ ( x 0 , x 0 + δ ) ⟹ f ′ ( x ) ∈ N ( R , ϵ ) .
于是可以取ϵ \epsilon ϵ 使得两个邻域不交,则这个小区间上至少越过了一个值.对[ x 0 − δ 2 , x 0 + δ 2 ] [x_0-\dfrac{\delta}{2},x_0+\dfrac{\delta}{2}] [ x 0 − 2 δ , x 0 + 2 δ ] 用(1)
单调性
f ( x ) ∈ C [ a , b ] , ∀ x ∈ [ a , b ] − D , f ′ ( x ) > 0 D is finite set ⟹ f ( x ) is strictly increasing at [ a , b ] \begin{gathered}
f(x)\in C[a,b],\forall x\in [a,b]-D,f'(x)>0 \\
D \text{ is finite set} \\
\implies f(x) \text{ is strictly increasing at }[a,b]
\end{gathered} f ( x ) ∈ C [ a , b ] , ∀ x ∈ [ a , b ] − D , f ′ ( x ) > 0 D is finite set ⟹ f ( x ) is strictly increasing at [ a , b ]
∀ x 1 < x 2 \forall x_1<x_2 ∀ x 1 < x 2 ,把D D D 在( x 1 , x 2 ) (x_1,x_2) ( x 1 , x 2 ) 中的点排序得到d 1 … d k d_1\ldots d_k d 1 … d k ,令d 0 = x 1 , d k = x 2 d_0=x_1,d_k=x_2 d 0 = x 1 , d k = x 2 ,显然有
f ( x 2 ) − f ( x 1 ) = ∑ i = 1 k + 1 f ( d i ) − f ( d i − 1 ) = ∑ i = 1 k + 1 f ′ ( ξ i ) ( d i − d i − 1 ) > 0 \begin{gathered}
f(x_2)-f(x_1)=\sum _{i = 1} ^{k+1} f(d_i)-f(d_{i-1}) \\
=\sum _{i = 1} ^{k+1} f'(\xi_i) (d_i-d_{i-1}) \\
>0
\end{gathered} f ( x 2 ) − f ( x 1 ) = i = 1 ∑ k + 1 f ( d i ) − f ( d i − 1 ) = i = 1 ∑ k + 1 f ′ ( ξ i ) ( d i − d i − 1 ) > 0
每个区间都有闭区间连续开区间可导推导闭区间上中值定理.
p , q > 1 , a , b > 0 , 1 p + 1 q = 1 ⟹ a p p + b q q ≥ a b \begin{gathered}
p,q>1,a,b>0,\dfrac{1}{p} + \dfrac{1}{q} =1 \\
\implies \dfrac{a^p}{p} +\dfrac{b^q}{q} \ge ab
\end{gathered} p , q > 1 , a , b > 0 , p 1 + q 1 = 1 ⟹ p a p + q b q ≥ ab
也是求偏导啊.
然后下节课讲了凸函数之后还有个做法说的是
f ( x ) = ln x , x 1 = a p , x 2 = a q \begin{gathered}
f(x)=\ln x,x_1=a^p,x_2=a^q
\end{gathered} f ( x ) = ln x , x 1 = a p , x 2 = a q
用琴声.
a b ≤ ϵ a ln a + ϵ e e b ϵ \begin{gathered}
ab\le \epsilon a\ln a+\dfrac{\epsilon}{e} e^{\frac{b}{\epsilon} }
\end{gathered} ab ≤ ϵ a ln a + e ϵ e ϵ b
求偏导,代入结束.
f ( b ) = ϵ a ln a + ϵ e e b ϵ − a b f ′ ( b ) = e b ϵ − 1 − a a 0 = e b 0 ϵ − 1 f ( b 0 ) = ( b − ϵ ) e b ϵ − 1 + ϵ e e b ϵ − b e b ϵ − 1 = ϵ e e b ϵ − ϵ e b e − 1 = 0 \begin{gathered}
f(b)=\epsilon a\ln a+\dfrac{\epsilon}{e} e^{\frac{b}{\epsilon}}-ab \\
f'(b)=e^{\frac{b}{\epsilon} -1}-a \\
a_0=e^{\frac{b_0}{\epsilon}-1} \\
f(b_0)=(b-\epsilon)e^{\frac{b}{\epsilon}-1 }+\dfrac{\epsilon}{e} e^{\frac{b}{\epsilon}}-be^{\frac{b}{\epsilon}-1} \\
=\dfrac{\epsilon}{e} e^{\frac{b}{\epsilon}}-\epsilon e^{\frac{b}{e}-1 } \\
=0
\end{gathered} f ( b ) = ϵ a ln a + e ϵ e ϵ b − ab f ′ ( b ) = e ϵ b − 1 − a a 0 = e ϵ b 0 − 1 f ( b 0 ) = ( b − ϵ ) e ϵ b − 1 + e ϵ e ϵ b − b e ϵ b − 1 = e ϵ e ϵ b − ϵ e e b − 1 = 0
这节课其实是讲单调性和导数关系的,只是看起来比较高中能记的不多.
Class 15
凹凸性
定义成了
Convex/Concave function
f ( x ) is convex function ⟺ ∀ x , y ∈ D , λ ∈ ( 0 , 1 ) f ( λ x + ( 1 − λ ) y ) ≤ λ f ( x ) + ( 1 − λ ) f ( y ) \begin{gathered}
f(x) \text{ is convex function} \iff \\
\forall x,y\in D,\lambda \in (0,1) \\
f(\lambda x+(1-\lambda)y)\le \lambda f(x)+(1-\lambda)f(y)
\end{gathered} f ( x ) is convex function ⟺ ∀ x , y ∈ D , λ ∈ ( 0 , 1 ) f ( λ x + ( 1 − λ ) y ) ≤ λ f ( x ) + ( 1 − λ ) f ( y )
f ( x ) is convex ⟺ ∀ { x n } , { λ n } , f ( ∑ i = 1 n λ i x i ∑ i = 1 n λ i ) ≤ ∑ i = 1 n λ i f ( x i ) ∑ i = 1 n λ i \begin{gathered}
f(x) \text{ is convex} \iff \\
\forall \{ x_n \} ,\{ \lambda_n \},
f(\dfrac{\sum _{i = 1} ^{n} \lambda_ix_i}{\sum _{i = 1} ^{n} \lambda_i} )\le \dfrac{\sum _{i = 1} ^{n} \lambda_if(x_i)}{\sum _{i = 1} ^{n} \lambda_i}
\end{gathered} f ( x ) is convex ⟺ ∀ { x n } , { λ n } , f ( ∑ i = 1 n λ i ∑ i = 1 n λ i x i ) ≤ ∑ i = 1 n λ i ∑ i = 1 n λ i f ( x i )
f ( x ) is convex , ∃ f ′ ( x ) ⟺ f ′ ( x ) is increasing \begin{gathered}
f(x) \text{ is convex} ,\exists f'(x) \\
\iff f'(x) \text{ is increasing}
\end{gathered} f ( x ) is convex , ∃ f ′ ( x ) ⟺ f ′ ( x ) is increasing
显然凸性等价于
x 1 < x 2 < x 3 ⟹ f ( x 1 ) − f ( x 2 ) x 1 − x 2 < f ( x 2 ) − f ( x 3 ) x 2 − x 3 \begin{gathered}
x_1<x_2<x_3 \implies \\
\dfrac{f(x_1)-f(x_2)}{x_1-x_2} <\dfrac{f(x_2)-f(x_3)}{x_2-x_3}
\end{gathered} x 1 < x 2 < x 3 ⟹ x 1 − x 2 f ( x 1 ) − f ( x 2 ) < x 2 − x 3 f ( x 2 ) − f ( x 3 )
这个定理反向用拉格朗日中值是显然的.对正向:
∀ x 1 < x 2 f ′ ( x 1 ) = lim x → x 1 − f ( x 1 ) − f ( x ) x 1 − x ≤ f ( x 1 ) − f ( x 2 ) x 1 − x 2 same for f ′ ( x 2 ) ≥ f ( x 1 ) − f ( x 2 ) x 1 − x 2 \begin{gathered}
\forall x_1<x_2 \\
f'(x_1)=\lim_{x \to x_1^-} \dfrac{f(x_1)-f(x)}{x_1-x} \le \dfrac{f(x_1)-f(x_2)}{x_1-x_2} \\
\text{same for} f'(x_2)\ge \dfrac{f(x_1)-f(x_2)}{x_1-x_2}
\end{gathered} ∀ x 1 < x 2 f ′ ( x 1 ) = x → x 1 − lim x 1 − x f ( x 1 ) − f ( x ) ≤ x 1 − x 2 f ( x 1 ) − f ( x 2 ) same for f ′ ( x 2 ) ≥ x 1 − x 2 f ( x 1 ) − f ( x 2 )
于是结束.
∑ i = 1 n a i b i ≤ ( ∑ i = 1 n a p ) 1 p ( ∑ i = 1 n b q ) 1 q \begin{gathered}
\sum _{i = 1} ^{n} a_ib_i\le (\sum _{i = 1} ^{n} a^p )^{\frac1p}(\sum _{i = 1} ^{n} b^q)^{\frac1q}
\end{gathered} i = 1 ∑ n a i b i ≤ ( i = 1 ∑ n a p ) p 1 ( i = 1 ∑ n b q ) q 1
( a i ( ∑ i = 1 n a p ) 1 p ) ( b i ( ∑ i = 1 n b q ) 1 q ) ≤ 1 p a i p ∑ i = 1 n a p + 1 q b i q ∑ i = 1 n b q \begin{gathered}
(\dfrac{a_i}{(\sum _{i = 1} ^{n} a^p)^{\frac{1}{p}}} )(\dfrac{b_i}{(\sum _{i = 1} ^{n} b^q)^{\frac{1}{q}}} )
\le \dfrac{1}{p} \dfrac{a_i^p}{\sum _{i = 1} ^{n} a^p}+\dfrac{1}{q} \dfrac{b_i^q}{\sum _{i = 1} ^{n} b^q}
\end{gathered} ( ( ∑ i = 1 n a p ) p 1 a i ) ( ( ∑ i = 1 n b q ) q 1 b i ) ≤ p 1 ∑ i = 1 n a p a i p + q 1 ∑ i = 1 n b q b i q
同时累加即证.
Ex Class 3
对这样的常微分方程:
y ′ = Φ ( x , y ) y ( a ) = 0 \begin{gathered}
y'=\Phi(x,y) \\
y(a)=0
\end{gathered} y ′ = Φ ( x , y ) y ( a ) = 0
若
∃ A , ∀ y 1 , y 2 , ∣ Φ ( x , y 1 ) − Φ ( x , y 2 ) ∣ ≤ A ∣ y 1 − y 2 ∣ \begin{gathered}
\exists A,\forall y_1,y_2, \\
\vert \Phi(x,y_1)-\Phi(x,y_2) \vert \le A \vert y_1-y_2 \vert
\end{gathered} ∃ A , ∀ y 1 , y 2 , ∣Φ ( x , y 1 ) − Φ ( x , y 2 ) ∣ ≤ A ∣ y 1 − y 2 ∣
则微分方程的解唯一.
假设存在两个解y 1 ( x ) , y 2 ( x ) y_1(x),y_2(x) y 1 ( x ) , y 2 ( x ) ,令g ( x ) = y 2 ( x ) − y 1 ( x ) g(x)=y_2(x)-y_1(x) g ( x ) = y 2 ( x ) − y 1 ( x ) 有
g ′ ( x ) = ∣ Φ ( x , y 2 ) − Φ ( x , y 1 ) ∣ ≤ A ∣ y 2 − y 1 ∣ = A g ( x ) \begin{gathered}
g'(x)=\vert \Phi(x,y_2)-\Phi(x,y_1) \vert \le A \vert y_2-y_1 \vert =A g(x)
\end{gathered} g ′ ( x ) = ∣Φ ( x , y 2 ) − Φ ( x , y 1 ) ∣ ≤ A ∣ y 2 − y 1 ∣ = A g ( x )
于是由作业Math Analysis Homework Week5-Class1-T6 易证g ( x ) = 0 g(x)=0 g ( x ) = 0
压缩映射
f ( x ) is contraction ⟺ ∃ A ∈ ( 0 , 1 ) , ∀ x 1 , x 2 ∣ f ( x 1 ) − f ( x 2 ) ∣ ≤ A ∣ x 1 − x 2 ∣ \begin{gathered}
f(x) \text{ is contraction } \iff \\
\exists A\in (0,1),\forall x_1,x_2 \\
\vert f(x_1)-f(x_2) \vert \le A\vert x_1-x_2 \vert
\end{gathered} f ( x ) is contraction ⟺ ∃ A ∈ ( 0 , 1 ) , ∀ x 1 , x 2 ∣ f ( x 1 ) − f ( x 2 ) ∣ ≤ A ∣ x 1 − x 2 ∣
Banach不动点定理
f ( x ) is contraction , { x n } s . t . x n + 1 = f ( x n ) ⟹ lim n → ∞ x n = X ∧ X is the unique fixed point of f \begin{gathered}
f(x) \text{ is contraction},\{ x_n \} \ s.t.\
x_{n+1}=f(x_n) \\
\implies \lim_{n \to \infty} x_n=X\land X \text{ is the unique fixed point of }f
\end{gathered} f ( x ) is contraction , { x n } s . t . x n + 1 = f ( x n ) ⟹ n → ∞ lim x n = X ∧ X is the unique fixed point of f
考虑任意数列 { x n } \{ x_n \} { x n } ,则
∀ n < m ∣ x m − x n ∣ = ∑ i = n m − 1 ∣ x i + 1 − x i ∣ ≤ ∑ i = 1 m − 1 ∣ x 1 − x 2 ∣ A n + i − 1 ≤ ∣ x 1 − x 2 ∣ A n 1 − A → 0 \begin{gathered}
\forall n<m \\
\vert x_m-x_n \vert =\sum _{i = n} ^{m-1} \vert x_{i+1}-x_i \vert \\
\le \sum _{i = 1} ^{m-1} \vert x_1-x_2 \vert A^{n+i-1} \\
\le \vert x_1-x_2 \vert \dfrac{A^n}{1-A} \\
\to 0
\end{gathered} ∀ n < m ∣ x m − x n ∣ = i = n ∑ m − 1 ∣ x i + 1 − x i ∣ ≤ i = 1 ∑ m − 1 ∣ x 1 − x 2 ∣ A n + i − 1 ≤ ∣ x 1 − x 2 ∣ 1 − A A n → 0
于是x n x_n x n 收敛,且同时取极限能看出极限是不动点.
考虑如果由两个不动点X 1 , X 2 X_1,X_2 X 1 , X 2 ,那么 ∣ X 1 − X 2 ∣ ≤ A ∣ f ( X 1 ) − f ( X 2 ) ∣ = A ∣ X 1 − X 2 ∣ \vert X_1-X_2 \vert \le A\vert f(X_1)-f(X_2) \vert=A\vert X_1-X_2 \vert ∣ X 1 − X 2 ∣ ≤ A ∣ f ( X 1 ) − f ( X 2 ) ∣ = A ∣ X 1 − X 2 ∣ ,可以得到X 1 = X 2 X_1=X_2 X 1 = X 2 ,得证.
{ f ∈ C 2 [ a , b ] , f ′ ( x ) ≥ δ > 0 , f ′ ′ ( x ) ∈ ( 0 , M ) , f ( X ) = 0 x 1 ∈ ( X , b ) , x n + 1 = x n − f ( x n ) f ′ ( x n ) ⟹ { lim n → ∞ x n = X ∃ N , n > N ⟹ ( x n − X ) ∼ ( x n − 1 − X ) 2 \begin{gathered}
\begin{cases}
f\in C^2[a,b],f'(x)\ge \delta>0,f''(x)\in (0,M),f(X)=0 \\
x_1\in (X,b),x_{n+1}=x_n-\dfrac{f(x_n)}{f'(x_n)}
\end{cases} \\
\implies \begin{cases}
\lim_{n \to \infty} x_n=X \\
\exists N,n>N \implies (x_n-X)\sim (x_{n-1}-X)^2
\end{cases}
\end{gathered} ⎩ ⎨ ⎧ f ∈ C 2 [ a , b ] , f ′ ( x ) ≥ δ > 0 , f ′′ ( x ) ∈ ( 0 , M ) , f ( X ) = 0 x 1 ∈ ( X , b ) , x n + 1 = x n − f ′ ( x n ) f ( x n ) ⟹ { lim n → ∞ x n = X ∃ N , n > N ⟹ ( x n − X ) ∼ ( x n − 1 − X ) 2
就是牛顿迭代
显然f ′ ( x ) > 0 f'(x)>0 f ′ ( x ) > 0 得到f f f 增.
尝试证明 x n > X x_n>X x n > X ,即f ( x n ) > 0 f(x_n)>0 f ( x n ) > 0 .
L' Hopital
{ f , g ∈ C 1 ( a , b ) , g ′ ( x ) ≠ 0 lim x → a + f ( x ) = lim x → a + g ( x ) = 0 ⟹ lim x → a + f ( x ) g ( x ) = lim x → a + f ′ ( x ) g ′ ( x ) \begin{gathered}
\begin{cases}
f,g \in C^1(a,b),g'(x)\ne 0 \\
\lim_{x \to a^+} f(x)=\lim_{x \to a^+} g(x)=0
\end{cases} \\
\implies \lim_{x \to a^+} \dfrac{f(x)}{g(x)} =\lim_{x \to a^+} \dfrac{f'(x)}{g'(x)}
\end{gathered} { f , g ∈ C 1 ( a , b ) , g ′ ( x ) = 0 lim x → a + f ( x ) = lim x → a + g ( x ) = 0 ⟹ x → a + lim g ( x ) f ( x ) = x → a + lim g ′ ( x ) f ′ ( x )
不妨设f ( a ) = g ( a ) = 0 f(a)=g(a)=0 f ( a ) = g ( a ) = 0
然后你可以对一个[ a , a + b 2 ] [a,\dfrac{a+b}{2}] [ a , 2 a + b ] 用柯西中值,有
∃ ξ ∈ ( a , x ) s . t . f ( x ) − f ( a ) g ( x ) − g ( a ) = f ′ ( ξ ) g ′ ( ξ ) ∴ lim x → a + f ( x ) g ( x ) = lim x → a + f ′ ( ξ ) g ′ ( ξ ) = lim ξ → a + f ′ ( ξ ) g ′ ( ξ ) \begin{gathered}
\exists \xi\in (a,x) \\ s.t.\\
\dfrac{f(x)-f(a)}{g(x)-g(a)}=\dfrac{f'(\xi)}{g'(\xi)} \\
\therefore \lim_{x \to a^+} \dfrac{f(x)}{g(x)} =\lim_{x \to a^+} \dfrac{f'(\xi)}{g'(\xi)}=\lim_{\xi \to a^+} \dfrac{f'(\xi)}{g'(\xi)}
\end{gathered} ∃ ξ ∈ ( a , x ) s . t . g ( x ) − g ( a ) f ( x ) − f ( a ) = g ′ ( ξ ) f ′ ( ξ ) ∴ x → a + lim g ( x ) f ( x ) = x → a + lim g ′ ( ξ ) f ′ ( ξ ) = ξ → a + lim g ′ ( ξ ) f ′ ( ξ )
[think] 为什么 lim x → a + f ( x ) = lim ξ → a + f ( ξ ) \lim_{x \to a^+} f(x)=\lim_{\xi \to a^+} f(\xi) lim x → a + f ( x ) = lim ξ → a + f ( ξ ) 若ξ ∈ ( a , x ) \xi\in (a,x) ξ ∈ ( a , x ) .因为你转换到数列上,就是对任意x x x 趋近到a a a 的序列你可以找到一个ξ \xi ξ 趋近到a a a 的序列.
你还可以对无穷区间用:对( a , + ∞ ) (a,+\infty) ( a , + ∞ ) ,考虑复合 1 x \dfrac1x x 1
lim x → + ∞ f ( x ) g ( x ) = lim x → 0 f ( 1 x ) g ( 1 x ) = lim x → 0 − 1 x 2 f ′ ( 1 x ) − 1 x 2 g ′ ( 1 x ) = lim x → + ∞ f ′ ( x ) g ′ ( x ) \begin{gathered}
\lim_{x \to +\infty} \dfrac{f(x)}{g(x)}=\lim_{x \to 0} \dfrac{f(\dfrac{1}{x} )}{g(\dfrac{1}{x})} \\
=\lim_{x \to 0} \dfrac{-\dfrac{1}{x^2} f'(\dfrac{1}{x})}{-\dfrac{1}{x^2} g'(\dfrac{1}{x} )} \\
=\lim_{x \to +\infty} \dfrac{f'(x)}{g'(x)}
\end{gathered} x → + ∞ lim g ( x ) f ( x ) = x → 0 lim g ( x 1 ) f ( x 1 ) = x → 0 lim − x 2 1 g ′ ( x 1 ) − x 2 1 f ′ ( x 1 ) = x → + ∞ lim g ′ ( x ) f ′ ( x )
另外,考虑若g , f → ∞ g,f\to \infty g , f → ∞ ,可以
g f = 1 f 1 g = f ′ f 2 g ′ g 2 = g 2 f ′ f 2 g ′ ⟹ f ′ g ′ = f g \begin{gathered}
\dfrac{g}{f} =\dfrac{\dfrac{1}{f} }{\dfrac{1}{g} } = \dfrac{\dfrac{f'}{f^2} }{\dfrac{g'}{g^2} }=\dfrac{g^2f'}{f^2g'} \\
\implies \dfrac{f'}{g'} =\dfrac{f}{g}
\end{gathered} f g = g 1 f 1 = g 2 g ′ f 2 f ′ = f 2 g ′ g 2 f ′ ⟹ g ′ f ′ = g f
于是也可以对 ∞ ∞ \dfrac{\infty}{\infty} ∞ ∞ 用?但问题在于这样要求预先知道 f g \dfrac{f}{g} g f 极限存在,所以考虑下面的结论.
{ f , g ∈ C 1 ( a , b ) , g ′ ( x ) ≠ 0 lim x → a + g ( x ) = + ∞ ⟹ lim x → a + f ( x ) g ( x ) = lim x → a + f ′ ( x ) g ′ ( x ) \begin{gathered}
\begin{cases}
f,g \in C^1(a,b),g'(x)\ne 0 \\
\lim_{x \to a^+} g(x)=+\infty
\end{cases} \\
\implies \lim_{x \to a^+} \dfrac{f(x)}{g(x)} =\lim_{x \to a^+} \dfrac{f'(x)}{g'(x)}
\end{gathered} { f , g ∈ C 1 ( a , b ) , g ′ ( x ) = 0 lim x → a + g ( x ) = + ∞ ⟹ x → a + lim g ( x ) f ( x ) = x → a + lim g ′ ( x ) f ′ ( x )
Solution 1
你先转化成对于任意趋近到a + a^+ a + 且满足g ( x ) g(x) g ( x ) 单调的序列x x x ,然后有
lim n → ∞ f ( x n ) g ( x n ) = S t o l z lim n → ∞ f ( x n ) − f ( x n − 1 ) g ( x n ) − g ( x n − 1 ) = lim n → ∞ ( x n − x n − 1 ) f ′ ( ξ n ) ( x n − x n − 1 ) g ′ ( ξ n ) , ξ n ∈ ( x n − 1 , x n ) = lim n → ∞ f ′ ( ξ n ) g ′ ( ξ n ) = lim x → a + f ′ ( x ) g ′ ( x ) \begin{gathered}
\lim_{n \to \infty} \dfrac{f(x_n)}{g(x_n)} \\
\xlongequal{Stolz}\lim_{n \to \infty} \dfrac{f(x_n)-f(x_{n-1})}{g(x_n)-g(x_{n-1})} \\
=\lim_{n \to \infty} \dfrac{(x_n-x_{n-1})f'(\xi_n)}{(x_n-x_{n-1})g'(\xi_n)},\xi_n\in (x_{n-1},x_n) \\
=\lim_{n \to \infty} \dfrac{f'(\xi_n)}{g'(\xi_n)} \\
=\lim_{x \to a^+} \dfrac{f'(x)}{g'(x)}
\end{gathered} n → ∞ lim g ( x n ) f ( x n ) S t o l z n → ∞ lim g ( x n ) − g ( x n − 1 ) f ( x n ) − f ( x n − 1 ) = n → ∞ lim ( x n − x n − 1 ) g ′ ( ξ n ) ( x n − x n − 1 ) f ′ ( ξ n ) , ξ n ∈ ( x n − 1 , x n ) = n → ∞ lim g ′ ( ξ n ) f ′ ( ξ n ) = x → a + lim g ′ ( x ) f ′ ( x )
但是海涅要求对任意的序列x x x 怎么办呢?
考虑一个数列的一个性质:若数列的任何一个子列都有一个子列趋近到A A A ,则原数列也趋近到A A A ,这个反证是容易的.
那么而对于你这个任意数列的任意子列,显然都能再取一个子列使得g ( x ) g(x) g ( x ) 单调,于是得证.
Solution 2
我们现在的问题是f ( a ) f(a) f ( a ) 没有任何信息,所以想办法取c ∈ ( a , a + δ ) c\in (a,a+\delta) c ∈ ( a , a + δ ) ,然后对x ∈ ( a , c ) x\in(a,c) x ∈ ( a , c ) 用 [ x , c ] [x,c] [ x , c ] 用柯西证明
你有
f ( x ) − f ( c ) g ( x ) − g ( c ) = f ′ ( ξ ) g ′ ( ξ ) ⟹ f ( x ) g ( x ) = f ′ ( ξ ) g ′ ( ξ ) − g ( c ) g ( x ) f ′ ( ξ ) g ′ ( ξ ) + f ( c ) g ( x ) \begin{gathered}
\dfrac{f(x)-f(c)}{g(x)-g(c)} =\dfrac{f'(\xi)}{g'(\xi)} \\
\implies \dfrac{f(x)}{g(x)} =\dfrac{f'(\xi)}{g'(\xi)} -\dfrac{g(c)}{g(x)} \dfrac{f'(\xi)}{g'(\xi)} +\dfrac{f(c)}{g(x)}
\end{gathered} g ( x ) − g ( c ) f ( x ) − f ( c ) = g ′ ( ξ ) f ′ ( ξ ) ⟹ g ( x ) f ( x ) = g ′ ( ξ ) f ′ ( ξ ) − g ( x ) g ( c ) g ′ ( ξ ) f ′ ( ξ ) + g ( x ) f ( c )
然后第二项,第三项显然趋近于0 0 0 .
然后你同时趋向于a a a 就得证了.
[think] 但是我还是喜欢第一种. 因为它一直保持着f g \dfrac{f}{g} g f 的结构()
{ f ∈ C 1 ( a , + ∞ ) , α > 0 lim x → + ∞ ( α f ( x ) + x f ′ ( x ) ) = β ⟹ lim x → + ∞ f ( x ) = α β \begin{gathered}
\begin{cases}
f\in C^1(a,+\infty),\alpha>0 \\
\lim_{x \to +\infty} (\alpha f(x)+xf'(x))=\beta \\
\end{cases} \\
\implies \lim_{x \to +\infty} f(x)=\dfrac{\alpha}{\beta}
\end{gathered} { f ∈ C 1 ( a , + ∞ ) , α > 0 lim x → + ∞ ( α f ( x ) + x f ′ ( x )) = β ⟹ x → + ∞ lim f ( x ) = β α
lim x → + ∞ f ( x ) = lim x → + ∞ f ( x ) x α x α = lim x → + ∞ f ( x ) α x α − 1 + f ′ ( x ) x α α x α − 1 = α β \begin{gathered}
\lim_{x \to +\infty}f(x) \\
=\lim_{x \to +\infty}\dfrac{f(x)x^\alpha}{x^\alpha} \\
=\lim_{x \to +\infty}\dfrac{f(x)\alpha x^{\alpha-1}+f'(x)x^\alpha}{\alpha x^{\alpha-1}} \\
=\dfrac{\alpha}{\beta}
\end{gathered} x → + ∞ lim f ( x ) = x → + ∞ lim x α f ( x ) x α = x → + ∞ lim α x α − 1 f ( x ) α x α − 1 + f ′ ( x ) x α = β α
如果你好奇如何注意到,那么考虑解微分方程用的那个积分因子,对P ( x ) f ( x ) + f ′ ( x ) P(x)f(x)+f'(x) P ( x ) f ( x ) + f ′ ( x ) 应该使用e ∫ P ( x ) d x e^{\int P(x)dx} e ∫ P ( x ) d x
Class 16
f ( x ) = ∑ i = 0 n f ( i ) ( x 0 ) i ! ( x − x 0 ) i + o ( ( x − x 0 ) n ) \begin{gathered}
f(x)=\sum _{i = 0} ^{n} \dfrac{f^{(i)}(x_0)}{i!} (x-x_0)^i+o((x-x_0)^n)
\end{gathered} f ( x ) = i = 0 ∑ n i ! f ( i ) ( x 0 ) ( x − x 0 ) i + o (( x − x 0 ) n )
减过来变成
f ( x ) − ∑ i = 0 n f ( i ) i ! ( x − x 0 ) i ( x − x 0 ) n \begin{gathered}
\dfrac{f(x)-\sum _{i = 0} ^{n} \dfrac{f^{(i)}}{i!}(x-x_0)^i }{(x-x_0)^{n}}
\end{gathered} ( x − x 0 ) n f ( x ) − ∑ i = 0 n i ! f ( i ) ( x − x 0 ) i
然后洛n − 1 n-1 n − 1 次.
设f ( k ) ( x 0 ) ≠ 0 f^{(k)}(x_0)\ne 0 f ( k ) ( x 0 ) = 0 中k k k 为满足条件的最小正整数,则若k k k 为奇数x 0 x_0 x 0 不是极值点.若k k k 为偶数则x 0 x_0 x 0 是极值点.
lim x → x 0 f ( x ) − f ( x 0 ) ( x − x 0 ) k = f ( k ) ( x 0 ) k ! ≠ 0 \begin{gathered}
\lim_{x \to x_0} \dfrac{f(x)-f(x_0)}{(x-x_0)^k} =\dfrac{f^{(k)}(x_0)}{k!} \ne 0
\end{gathered} x → x 0 lim ( x − x 0 ) k f ( x ) − f ( x 0 ) = k ! f ( k ) ( x 0 ) = 0
于是邻域内 f ( x ) − f ( x 0 ) ( x − x 0 ) k \dfrac{f(x)-f(x_0)}{(x-x_0)^k} ( x − x 0 ) k f ( x ) − f ( x 0 ) 和f ( k ) ( x 0 ) f^{(k)}(x_0) f ( k ) ( x 0 ) 同号.
f ( x ) = ∑ i = 0 n f ( i ) i ! ( x − x 0 ) i + f ( n + 1 ) ( ξ ) ( n + 1 ) ! ( x − x 0 ) n + 1 \begin{gathered}
f(x)=\sum _{i = 0} ^{n} \dfrac{f^{(i)}}{i!} (x-x_0)^i + \dfrac{f^{(n+1)}(\xi)}{(n+1)!} (x-x_0)^{n+1}
\end{gathered} f ( x ) = i = 0 ∑ n i ! f ( i ) ( x − x 0 ) i + ( n + 1 )! f ( n + 1 ) ( ξ ) ( x − x 0 ) n + 1
f ( x ) = ∑ i = 0 n f ( i ) i ! ( x − x 0 ) i + f ( n + 1 ) ( ξ ) n ! ( x − x 0 ) ( x − ξ ) n \begin{gathered}
f(x)=\sum _{i = 0} ^{n} \dfrac{f^{(i)}}{i!} (x-x_0)^i + \dfrac{f^{(n+1)}(\xi)}{n!} (x-x_0)(x-\xi)^n
\end{gathered} f ( x ) = i = 0 ∑ n i ! f ( i ) ( x − x 0 ) i + n ! f ( n + 1 ) ( ξ ) ( x − x 0 ) ( x − ξ ) n
let F ( t , x ) = ∑ i = 0 n f ( i ) ( t ) i ! ( x − t ) i δ F δ t = f ′ ( t ) + ∑ i = 1 n f ( i + 1 ) ( t ) i ! ( x − t ) i − f ( i ) ( t ) ( i − 1 ) ! ( x − t ) i − 1 = f ( n + 1 ) ( t ) n ! ( x − t ) n f ( x ) − T n ( x ) = F ( x , x ) − F ( x 0 , x ) = ( x − x 0 ) δ F δ t ( ξ ) = f ( n + 1 ) n ! ( x − x 0 ) ( x − ξ ) n f ( x ) − T n ( x ) ( x − x 0 ) n + 1 = F ( x , x ) − F ( x 0 , x ) ( x − x 0 ) n + 1 − ( x 0 − x 0 ) n + 1 = δ F δ t ( ξ ) ( n + 1 ) ( ξ − x 0 ) n ⟹ f ( x ) − T n ( x ) = f ( n + 1 ) ( ξ ) ( n + 1 ) ! ( x − x 0 ) n + 1 \begin{gathered}
\text{let } F(t,x)=\sum _{i = 0} ^{n} \dfrac{f^{(i)}(t)}{i!} (x-t)^i \\
\dfrac{\delta F}{\delta t}=f'(t)+\sum _{i = 1} ^{n} \dfrac{f^{(i+1)}(t)}{i!} (x-t)^i-\dfrac{f^{(i)}(t)}{(i-1)!} (x-t)^{i-1} \\
=\dfrac{f^{(n+1)(t)}}{n!} (x-t)^n \\
f(x)-T_n(x) \\
=F(x,x)-F(x_0,x) \\
=(x-x_0)\dfrac{\delta F}{\delta t}(\xi) \\
=\dfrac{f^{(n+1)}}{n!} (x-x_0)(x-\xi)^n \\
\dfrac{f(x)-T_n(x)}{(x-x_0)^{n+1}} \\
=\dfrac{F(x,x)-F(x_0,x)}{(x-x_0)^{n+1}-(x_0-x_0)^{n+1}} \\
=\dfrac{\dfrac{\delta F}{\delta t} (\xi)}{(n+1)(\xi-x_0)^n} \\
\implies f(x)-T_n(x)= \dfrac{f^{(n+1)}(\xi)}{(n+1)!} (x-x_0)^{n+1}
\end{gathered} let F ( t , x ) = i = 0 ∑ n i ! f ( i ) ( t ) ( x − t ) i δ t δ F = f ′ ( t ) + i = 1 ∑ n i ! f ( i + 1 ) ( t ) ( x − t ) i − ( i − 1 )! f ( i ) ( t ) ( x − t ) i − 1 = n ! f ( n + 1 ) ( t ) ( x − t ) n f ( x ) − T n ( x ) = F ( x , x ) − F ( x 0 , x ) = ( x − x 0 ) δ t δ F ( ξ ) = n ! f ( n + 1 ) ( x − x 0 ) ( x − ξ ) n ( x − x 0 ) n + 1 f ( x ) − T n ( x ) = ( x − x 0 ) n + 1 − ( x 0 − x 0 ) n + 1 F ( x , x ) − F ( x 0 , x ) = ( n + 1 ) ( ξ − x 0 ) n δ t δ F ( ξ ) ⟹ f ( x ) − T n ( x ) = ( n + 1 )! f ( n + 1 ) ( ξ ) ( x − x 0 ) n + 1
f ∈ C 2 [ 0 , 1 ] , ∣ f ( x ) ∣ ≤ 1 , ∣ f ′ ′ ( x ) ∣ ≤ 2 ⟹ ∣ f ′ ( x ) ∣ ≤ 3 \begin{gathered}
f\in C^2[0,1],\vert f(x) \vert \le 1,\vert f''(x) \vert \le 2 \\
\implies \vert f'(x) \vert \le 3
\end{gathered} f ∈ C 2 [ 0 , 1 ] , ∣ f ( x ) ∣ ≤ 1 , ∣ f ′′ ( x ) ∣ ≤ 2 ⟹ ∣ f ′ ( x ) ∣ ≤ 3
f ( a ) = f ( x ) + f ′ ( x ) ( a − x ) + f ′ ′ ( ξ ) ( a − x ) 2 2 \begin{gathered}
f(a)=f(x)+f'(x)(a-x)+\dfrac{f''(\xi)(a-x)^2}{2}
\end{gathered} f ( a ) = f ( x ) + f ′ ( x ) ( a − x ) + 2 f ′′ ( ξ ) ( a − x ) 2
带入a = 1 a=1 a = 1 和0 0 0 然后解方程,把范围带进去.
{ f ∈ C 3 [ a , + ∞ ) ∃ lim x → + ∞ f ( x ) = A , lim x → + ∞ f ′ ′ ′ ( x ) = B ⟹ lim x → + ∞ f ′ ( x ) = lim x → + ∞ f ′ ′ ( x ) = lim x → + ∞ f ′ ′ ′ ( x ) = 0 \begin{gathered}
\begin{cases}
f\in C^3[a,+\infty) \\
\exists \lim_{x \to +\infty} f(x)=A,\lim_{x \to +\infty} f'''(x)=B \\
\end{cases}
\implies \\
\lim_{x \to +\infty} f'(x)= \lim_{x \to +\infty} f''(x)=\lim_{x \to +\infty} f'''(x)=0
\end{gathered} { f ∈ C 3 [ a , + ∞ ) ∃ lim x → + ∞ f ( x ) = A , lim x → + ∞ f ′′′ ( x ) = B ⟹ x → + ∞ lim f ′ ( x ) = x → + ∞ lim f ′′ ( x ) = x → + ∞ lim f ′′′ ( x ) = 0
考虑展开
f ( x + d ) = f ( x ) + f ′ ( x ) d + f ′ ′ ( x ) d 2 2 + f ′ ′ ′ ( x + θ d ) d 3 6 \begin{gathered}
f(x+d)=f(x)+f'(x)d+\dfrac{f''(x)d^2}{2} +\dfrac{f'''(x+\theta d)d^3}{6}
\end{gathered} f ( x + d ) = f ( x ) + f ′ ( x ) d + 2 f ′′ ( x ) d 2 + 6 f ′′′ ( x + θ d ) d 3
然后随便取几个固定d = 1 , − 1 , 2 d=1,-1,2 d = 1 , − 1 , 2 ,让x x x 到无穷,解方程就能解出来.
因为你导数条件在无穷所以你要先趋近无穷.
[think] 当我们试图拿几个数的多项式表示函数,那函数相关条件自然都变成这几个数的多项式的方程.
Class 17
不定积分
找反导数
F ( x ) = ∫ f ( x ) d x ⟺ F ′ ( x ) = f ( x ) \begin{gathered}
F(x)=\int f(x)dx \iff F'(x)=f(x)
\end{gathered} F ( x ) = ∫ f ( x ) d x ⟺ F ′ ( x ) = f ( x )
∫ sec d x \begin{gathered}
\int \sec dx
\end{gathered} ∫ sec d x
= ∫ cos x cos 2 x d x = ∫ d sin x ( 1 + sin x ) ( 1 − sin x ) = ∫ 1 2 ( 1 1 − sin x + 1 1 + sin x d sin x ) = 1 2 ln ∣ 1 + sin x 1 − sin x ∣ + C = ln ∣ sec x + tan x ∣ + C \begin{gathered}
=\int \dfrac{\cos x}{\cos^2 x}dx \\
=\int \dfrac{d\sin x}{(1+\sin x)(1-\sin x)} \\
=\int \dfrac{1}{2} (\dfrac{1}{1-\sin x} +\dfrac{1}{1+\sin x} d\sin x ) \\
=\dfrac{1}{2} \ln \vert \dfrac{1+\sin x}{1-\sin x} \vert +C \\
=\ln \vert \sec x+\tan x \vert +C
\end{gathered} = ∫ cos 2 x cos x d x = ∫ ( 1 + sin x ) ( 1 − sin x ) d sin x = ∫ 2 1 ( 1 − sin x 1 + 1 + sin x 1 d sin x ) = 2 1 ln ∣ 1 − sin x 1 + sin x ∣ + C = ln ∣ sec x + tan x ∣ + C
分部积分
∫ u d v = u v − ∫ v d u \begin{gathered}
\int udv=uv-\int vdu
\end{gathered} ∫ u d v = uv − ∫ v d u
∫ ( 1 x − 1 x 2 ) e x d x \begin{gathered}
\int (\dfrac{1}{x} -\dfrac{1}{x^2} )e^xdx
\end{gathered} ∫ ( x 1 − x 2 1 ) e x d x
= ∫ e x x d x + ∫ d ( 1 x ) e x = ∫ e x x d x + e x x − ∫ e x x + C = e x x + C \begin{gathered}
=\int \dfrac{e^x}{x} dx+\int d(\dfrac{1}{x} )e^x \\
=\int \dfrac{e^x}{x} dx+\dfrac{e^x}{x} -\int \dfrac{e^x}{x}+C \\
=\dfrac{e^x}{x} +C
\end{gathered} = ∫ x e x d x + ∫ d ( x 1 ) e x = ∫ x e x d x + x e x − ∫ x e x + C = x e x + C
∫ sec 3 x d x \begin{gathered}
\int \sec^3 x dx
\end{gathered} ∫ sec 3 x d x
∫ sec 3 x d x = ∫ sec x d tan x = sec x tan x − ∫ tan 2 x sec x = sec x tan x − ∫ sec 3 x d x + ∫ sec x d x ⟹ ∫ sec 3 x d x = 1 2 ( sec x tan x + ∫ sec x ) = 1 2 ( sec x tan x + ln ( sec x + tan x ) ) + C \begin{gathered}
\int \sec^3 xdx=\int \sec x d\tan x \\
=\sec x\tan x-\int \tan^2 x\sec x \\
=\sec x\tan x-\int \sec^3 xdx+\int \sec xdx \\
\implies \int \sec^3 xdx=\dfrac{1}{2} (\sec x\tan x+\int \sec x) \\=\dfrac{1}{2} (\sec x\tan x+\ln (\sec x+\tan x))+C
\end{gathered} ∫ sec 3 x d x = ∫ sec x d tan x = sec x tan x − ∫ tan 2 x sec x = sec x tan x − ∫ sec 3 x d x + ∫ sec x d x ⟹ ∫ sec 3 x d x = 2 1 ( sec x tan x + ∫ sec x ) = 2 1 ( sec x tan x + ln ( sec x + tan x )) + C
换元积分
换就不好了......
∫ 3 sin x + cos x sin x + 2 cos x d x \begin{gathered}
\int \dfrac{3\sin x+\cos x}{\sin x+2\cos x} dx \\
\end{gathered} ∫ sin x + 2 cos x 3 sin x + cos x d x
3 sin x + cos x = ( sin x + 2 cos x ) − ( cos x − 2 sin x ) ∫ 3 sin x + cos x sin x + 2 cos x d x = x − ∫ d ( sin x + 2 cos x ) sin x + 2 cos x = x − ln ∣ sin x + 2 cos x ∣ \begin{gathered}
3\sin x+\cos x=(\sin x+2\cos x)-(\cos x-2\sin x) \\
\int \dfrac{3\sin x+\cos x}{\sin x+2\cos x} dx \\
=x-\int \dfrac{d(\sin x+2\cos x)}{\sin x+2\cos x} \\
=x-\ln \vert \sin x+2\cos x \vert
\end{gathered} 3 sin x + cos x = ( sin x + 2 cos x ) − ( cos x − 2 sin x ) ∫ sin x + 2 cos x 3 sin x + cos x d x = x − ∫ sin x + 2 cos x d ( sin x + 2 cos x ) = x − ln ∣ sin x + 2 cos x ∣
∫ x arctan x ( 1 + x 2 ) 2 d x \begin{gathered}
\int \dfrac{x\arctan x}{(1+x^2)^2} dx
\end{gathered} ∫ ( 1 + x 2 ) 2 x arctan x d x
= 1 2 ∫ arctan x ( 1 + x 2 ) 2 d ( x 2 + 1 ) = 1 2 ∫ arctan x d ( 1 1 + x 2 ) = arctan x 2 ( 1 + x 2 ) − 1 2 ∫ d x ( 1 + x 2 ) 2 let x = tan t = arctan x 2 ( 1 + x 2 ) − 1 2 ∫ sec 2 x sec 4 x d x = arctan x 2 ( 1 + x 2 ) − 1 2 ∫ sec 2 x sec 4 x d x = arctan x 2 ( 1 + x 2 ) − 1 2 2 − sin 2 t 4 \begin{gathered}
=\dfrac{1}{2} \int \dfrac{\arctan x}{(1+x^2)^2} d(x^2+1) \\
=\dfrac{1}{2} \int \arctan x d(\dfrac{1}{1+x^2}) \\
=\dfrac{\arctan x}{2(1+x^2)}-\dfrac{1}{2} \int \dfrac{dx}{(1+x^2)^2} \\
\text{let } x=\tan t \\
=\dfrac{\arctan x}{2(1+x^2)}-\dfrac{1}{2} \int \dfrac{\sec^2 x}{\sec^4 x}dx \\
=\dfrac{\arctan x}{2(1+x^2)}-\dfrac{1}{2} \int \dfrac{\sec^2 x}{\sec^4 x}dx \\
=\dfrac{\arctan x}{2(1+x^2)}-\dfrac{1}{2} \dfrac{2-\sin2t}{4}
\end{gathered} = 2 1 ∫ ( 1 + x 2 ) 2 arctan x d ( x 2 + 1 ) = 2 1 ∫ arctan x d ( 1 + x 2 1 ) = 2 ( 1 + x 2 ) arctan x − 2 1 ∫ ( 1 + x 2 ) 2 d x let x = tan t = 2 ( 1 + x 2 ) arctan x − 2 1 ∫ sec 4 x sec 2 x d x = 2 ( 1 + x 2 ) arctan x − 2 1 ∫ sec 4 x sec 2 x d x = 2 ( 1 + x 2 ) arctan x − 2 1 4 2 − sin 2 t
然后换成x x x 就行了 懒得写了.
∫ d x ( x + 1 ) 2 ( x + 2 ) 3 \begin{gathered}
\int \dfrac{dx}{(x+1)^2(x+2)^3}
\end{gathered} ∫ ( x + 1 ) 2 ( x + 2 ) 3 d x
let t = x + 1 x + 2 a n s = ∫ ( 1 − t ) 5 t 2 ( 1 − t ) 2 d t \begin{gathered}
\text{let } t=\dfrac{x+1}{x+2} \\
ans=\int \dfrac{(1-t)^5}{t^2(1-t)^2}dt
\end{gathered} let t = x + 2 x + 1 an s = ∫ t 2 ( 1 − t ) 2 ( 1 − t ) 5 d t
然后拆了做就行了.
就是分母是两个一次多项式的幂的积你换元它们的比.
Class 18
有理分式积分
∀ P ( x ) , deg P ( x ) < deg ( ∏ i Q i ( x ) ) , deg Q i ( x ) ≤ 2 ∃ R i ( x ) , deg R i ( x ) < deg Q i ( x ) s . t . P ( x ) ∏ i = 1 k Q i ( x ) = ∑ i = 1 n R i ( x ) Q q i ( x ) k i \begin{gathered}
\forall P(x),\deg P(x)<\deg (\prod_i Q_i(x)),\deg Q_i(x)\le 2 \\
\exists R_i(x),\deg R_i(x)<\deg Q_i(x) \\ s.t.\\
\dfrac{P(x)}{\prod_{i=1}^k Q_i(x)} =\sum _{i = 1} ^{n} \dfrac{R_i(x)}{Q_{q_i}(x)^{k_i}}
\end{gathered} ∀ P ( x ) , deg P ( x ) < deg ( i ∏ Q i ( x )) , deg Q i ( x ) ≤ 2 ∃ R i ( x ) , deg R i ( x ) < deg Q i ( x ) s . t . ∏ i = 1 k Q i ( x ) P ( x ) = i = 1 ∑ n Q q i ( x ) k i R i ( x )
待定系数,启动!
左边有deg P \deg P deg P 个方程.
右边有deg Q \deg Q deg Q 个未知数.
结束.
注意分解的时候如果有若干个相同的Q i Q_i Q i ,则拆成Q i k ( x ) Q_i^k(x) Q i k ( x ) ,如出现
a x 2 + b x + c ( x − 1 ) 3 \begin{gathered}
\dfrac{ax^2+bx+c}{(x-1)^3}
\end{gathered} ( x − 1 ) 3 a x 2 + b x + c
就可以拆成r 1 x − 1 , r 2 ( x − 1 ) 2 , r 3 ( x − 1 ) 3 \dfrac{r_1}{x-1} ,\dfrac{r_2}{(x-1)^2},\dfrac{r_3}{(x-1)^3} x − 1 r 1 , ( x − 1 ) 2 r 2 , ( x − 1 ) 3 r 3 去表示,r i ∈ R r_i\in R r i ∈ R .
所以有理分式你先分解,分解完了分母一次的和r ( x − x 0 ) k \dfrac{r}{(x-x_0)^k} ( x − x 0 ) k r 的直接秒,现在问题来到分母是二次的函数.
∫ 5 x + 6 x 2 + x + 1 d x \begin{gathered}
\int \dfrac{5x+6}{x^2+x+1} dx
\end{gathered} ∫ x 2 + x + 1 5 x + 6 d x
考虑我们会积1 x 2 + a \dfrac1{x^2+a} x 2 + a 1 的形式,于是你要把分子干成一次,分母干成没有一次,先换元分母t = x 2 + x + 1 t=x^2+x+1 t = x 2 + x + 1 ,d t = 2 x + 1 dt=2x+1 d t = 2 x + 1 .
= ∫ 5 2 d t t + ∫ 7 2 ( x 2 + x + 1 ) d x \begin{gathered}
=\int \dfrac{\dfrac{5}{2} dt }{t} +\int\dfrac{7}{2(x^2+x+1)}dx
\end{gathered} = ∫ t 2 5 d t + ∫ 2 ( x 2 + x + 1 ) 7 d x
然后右边配方即可.
那如果分母是二次项的幂呢?可以用一样的办法消掉分子上的一次项,然后还是三角换元,这样你变成积三角函数的幂了.
根式积分
去分母根号:
( x − a ) ( x − b ) → t = x − a x − b x 2 + b x + c → x 2 + b x + c = t + x , x = t 2 − c b − 2 t a x 2 + b x + 1 → a x 2 + b x + c = x t + 1 \begin{gathered}
\sqrt{ (x-a)(x-b) } \to t=\sqrt{ \dfrac{x-a}{x-b} } \\
\sqrt{ x^2+bx+c } \to \sqrt{x^2+bx+c}=t+x,x=\dfrac{t^2-c}{b-2t} \\
\sqrt{ ax^2+bx+1 } \to \sqrt{ ax^2+bx+c } = xt+1
\end{gathered} ( x − a ) ( x − b ) → t = x − b x − a x 2 + b x + c → x 2 + b x + c = t + x , x = b − 2 t t 2 − c a x 2 + b x + 1 → a x 2 + b x + c = x t + 1
Class 19
定积分
∫ a b f ( x ) = lim ∣ ∣ T ∣ ∣ → 0 ∑ i = 1 n f ( ξ i ) Δ x i where T = { t 1 … t n } , t i < t i + 1 , t 0 = a , t n = b , Δ x i = t i − t i − 1 , ξ ∈ ( t i − 1 , t i ) ∣ ∣ T ∣ ∣ = max i Δ x i \begin{gathered}
\int_a^b f(x)=\lim_{\vert\vert T \vert\vert \to 0} \sum _{i = 1} ^{n} f(\xi_i)\Delta x_i \\
\text{where} \\
T=\{ t_1\ldots t_n \} ,t_i<t_{i+1},t_0=a,t_n=b, \\
\Delta x_i=t_i-t_{i-1},\xi\in (t_{i-1},t_i) \\
\vert\vert T \vert\vert =\max_i \Delta x_i
\end{gathered} ∫ a b f ( x ) = ∣∣ T ∣∣ → 0 lim i = 1 ∑ n f ( ξ i ) Δ x i where T = { t 1 … t n } , t i < t i + 1 , t 0 = a , t n = b , Δ x i = t i − t i − 1 , ξ ∈ ( t i − 1 , t i ) ∣∣ T ∣∣ = i max Δ x i
极限存在则称为黎曼可积.
牛顿莱布尼茨公式
{ f ( x ) is integrable on [ a , b ] F ( x ) ∈ C [ a , b ] , D ( a , b ) f ( x ) = F ′ ( x ) ⟹ ∫ a b f ( x ) = F ( b ) − F ( a ) \begin{gathered}
\begin{cases}
f(x) \text{ is integrable on }[a,b] \\
F(x)\in C[a,b],D(a,b) \\
f(x)=F'(x)
\end{cases} \\
\implies \int_a^b f(x)=F(b)-F(a)
\end{gathered} ⎩ ⎨ ⎧ f ( x ) is integrable on [ a , b ] F ( x ) ∈ C [ a , b ] , D ( a , b ) f ( x ) = F ′ ( x ) ⟹ ∫ a b f ( x ) = F ( b ) − F ( a )
F ( b ) − F ( a ) = ∑ i = 1 n F ( t i ) − F ( t i − 1 ) = ∑ i = 1 n ( t i − t i − 1 ) f ( ξ i ) , ξ i ∈ ( t i − 1 − t i ) = S lim ∣ ∣ T ∣ ∣ → 0 F ( b ) − F ( a ) = lim ∣ ∣ T ∣ ∣ → 0 S = ∫ a b f ( x ) \begin{gathered}
F(b)-F(a) \\
=\sum _{i = 1} ^{n} F(t_i)-F(t_{i-1}) \\
=\sum _{i = 1} ^{n} (t_i-t_{i-1})f(\xi_i),\xi_i\in (t_{i-1}-t_i) \\
=S \\
\lim_{\vert\vert T \vert\vert \to 0} F(b)-F(a)=\lim_{\vert\vert T \vert\vert \to 0} S=\int_a^b f(x)
\end{gathered} F ( b ) − F ( a ) = i = 1 ∑ n F ( t i ) − F ( t i − 1 ) = i = 1 ∑ n ( t i − t i − 1 ) f ( ξ i ) , ξ i ∈ ( t i − 1 − t i ) = S ∣∣ T ∣∣ → 0 lim F ( b ) − F ( a ) = ∣∣ T ∣∣ → 0 lim S = ∫ a b f ( x )
Class 20
积分练习
f ( x ) ∈ C [ a , b ] , f ( x ) > 0 ⟹ 1 b − a ∫ a b ln ( f ( x ) ) d x ≤ ln ( 1 b − a ∫ a b f ( x ) d x ) \begin{gathered}
f(x)\in C[a,b],f(x)>0 \\
\implies \dfrac{1}{b-a} \int_a^b \ln(f(x))dx\le \ln(\dfrac{1}{b-a} \int_a^b f(x)dx)
\end{gathered} f ( x ) ∈ C [ a , b ] , f ( x ) > 0 ⟹ b − a 1 ∫ a b ln ( f ( x )) d x ≤ ln ( b − a 1 ∫ a b f ( x ) d x )
几何均值小于代数均值
我们两边任取相同的[ a , b ] [a,b] [ a , b ] 的分割和取点,于是就是ln \ln ln 的琴生,即
L H S = 1 b − a ∑ i ln ( f ( ξ i ) ) ( t i − t i − 1 ) R H S = ln ( 1 b − a ∑ i f ( ξ i ) ( t i − t i − 1 ) ) \begin{gathered}
LHS=\dfrac{1}{b-a} \sum_i \ln(f(\xi_i)) (t_i-t_{i-1})\\
RHS=\ln(\dfrac{1}{b-a} \sum_i f(\xi_i)(t_i-t_{i-1}))
\end{gathered} L H S = b − a 1 i ∑ ln ( f ( ξ i )) ( t i − t i − 1 ) R H S = ln ( b − a 1 i ∑ f ( ξ i ) ( t i − t i − 1 ))
Holder
{ p , q > 1 , 1 p + 1 q f , g is integrable ⟹ ∫ a b f ( x ) g ( x ) d x ≤ ( ∫ a b f ( x ) p d x ) 1 p ( ∫ a b g ( x ) q d x ) 1 q \begin{gathered}
\begin{cases}
p,q>1,\dfrac{1}{p} +\dfrac{1}{q} \\
f,g \text{ is integrable}
\end{cases} \\
\implies \int_a^b f(x)g(x)dx\le (\int_a^b f(x)^pdx)^{\frac{1}{p} }(\int_a^b g(x)^qdx)^{\frac{1}{q} }
\end{gathered} ⎩ ⎨ ⎧ p , q > 1 , p 1 + q 1 f , g is integrable ⟹ ∫ a b f ( x ) g ( x ) d x ≤ ( ∫ a b f ( x ) p d x ) p 1 ( ∫ a b g ( x ) q d x ) q 1
感觉你直接弄到离散上也行啊.
要么就是抄带权柯西的步骤
f ( x ) g ( x ) ( ∫ a b f ( x ) p d x ) 1 p ∫ a b g ( x ) q d x ) 1 q ≤ 1 p f p ( x ) ( ∫ a b f ( x ) p d x ) + 1 q f q ( x ) ( ∫ a b g ( x ) q d x ) \begin{gathered}
\dfrac{f(x)g(x)}{(\int_a^b f(x)^pdx)^{\frac1p}\int_a^b g(x)^qdx)^{\frac1q}}\le \dfrac{1}{p} \dfrac{f^p(x)}{(\int_a^b f(x)^pdx)}+\dfrac{1}{q} \dfrac{f^q(x)}{(\int_a^b g(x)^qdx)}
\end{gathered} ( ∫ a b f ( x ) p d x ) p 1 ∫ a b g ( x ) q d x ) q 1 f ( x ) g ( x ) ≤ p 1 ( ∫ a b f ( x ) p d x ) f p ( x ) + q 1 ( ∫ a b g ( x ) q d x ) f q ( x )
然后同时积分,结束.
f ( x ) ∈ D 2 [ a , b ] , f ′ ′ ( x ) > 0 , f ( x ) ≤ 0 ⟹ f ( x ) ≥ 2 b − a ∫ a b f ( x ) d x \begin{gathered}
f(x)\in D^2[a,b],f''(x)>0,f(x)\le 0 \\
\implies f(x)\ge \dfrac{2}{b-a} \int_a^b f(x)dx
\end{gathered} f ( x ) ∈ D 2 [ a , b ] , f ′′ ( x ) > 0 , f ( x ) ≤ 0 ⟹ f ( x ) ≥ b − a 2 ∫ a b f ( x ) d x
f ( x ) = f ( t ) + f ′ ( t ) ( x − t ) + f ′ ′ ( ξ ) 2 ( x − t ) 2 ≥ f ( t ) + f ′ ( t ) ( x − t ) ( b − a ) f ( x ) ≥ ∫ a b f ( t ) d t + ∫ a b f ′ ( t ) ( x − t ) d t \begin{gathered}
f(x)=f(t)+f'(t)(x-t)+\dfrac{f''(\xi)}{2} (x-t)^2 \\
\ge f(t)+f'(t)(x-t) \\
(b-a)f(x)\ge \int_a^bf(t)dt+\int_a^bf'(t)(x-t)dt
\end{gathered} f ( x ) = f ( t ) + f ′ ( t ) ( x − t ) + 2 f ′′ ( ξ ) ( x − t ) 2 ≥ f ( t ) + f ′ ( t ) ( x − t ) ( b − a ) f ( x ) ≥ ∫ a b f ( t ) d t + ∫ a b f ′ ( t ) ( x − t ) d t
只需证
∫ a b f ′ ( t ) ( x − t ) d t ≥ ∫ a b f ( t ) d t \begin{gathered}
\int_a^b f'(t)(x-t)dt\ge \int_a^b f(t)dt
\end{gathered} ∫ a b f ′ ( t ) ( x − t ) d t ≥ ∫ a b f ( t ) d t
考虑
∫ a b f ′ ( t ) ( x − t ) d t = x ( f ( b ) − f ( a ) ) − ( b f ( b ) − a f ( a ) ) + ∫ a b f ( t ) d t = − ( b − x ) f ( b ) − ( x − a ) f ( a ) + ∫ a b f ( t ) d t \begin{gathered}
\int_a^b f'(t)(x-t)dt \\
=x(f(b)-f(a))-(bf(b)-af(a))+\int_a^b f(t)dt \\
=-(b-x)f(b)-(x-a)f(a)+\int_a^b f(t)dt
\end{gathered} ∫ a b f ′ ( t ) ( x − t ) d t = x ( f ( b ) − f ( a )) − ( b f ( b ) − a f ( a )) + ∫ a b f ( t ) d t = − ( b − x ) f ( b ) − ( x − a ) f ( a ) + ∫ a b f ( t ) d t
得证.
唉傻了,你考虑这个的意思其实就是,一个上凸的图形的面积面积比直接连起来的大.所以你琴声才是正解.
f ( x ) ∈ C [ 0 , 1 ] ⟹ lim n → ∞ ∫ 0 1 f ( x n ) d x = f ( 1 ) \begin{gathered}
f(x)\in C[0,1] \\
\implies \lim_{n \to \infty} \int_0^1 f(\sqrt[ n ]{ x } )dx =f(1)
\end{gathered} f ( x ) ∈ C [ 0 , 1 ] ⟹ n → ∞ lim ∫ 0 1 f ( n x ) d x = f ( 1 )
你大概体会一下,n n n 很大的时候基本上x n \sqrt[n]{x} n x 都很接近1 1 1 ,而在一个0 0 0 的小邻域内离1 1 1 比较远,所以能猜到答案是f ( 1 ) f(1) f ( 1 ) ,能交换.
∫ 0 1 f ( x n ) = ∫ 0 1 n f ( x n ) d x + ∫ 1 n 1 f ( x n ) d x \begin{gathered}
\int_0^1 f(\sqrt[ n ]{ x } )=\int_0^{\frac1n} f(\sqrt[ n ]{ x } )dx+\int_{\frac1n}^1f(\sqrt[ n ]{ x } )dx \\
\end{gathered} ∫ 0 1 f ( n x ) = ∫ 0 n 1 f ( n x ) d x + ∫ n 1 1 f ( n x ) d x
因为f f f 有界,所以左边是0 0 0 .右边用中值得到
= ( 1 − 1 n ) f ( ξ n ) \begin{gathered}
=(1-\dfrac{1}{n})f(\sqrt[n]{\xi})
\end{gathered} = ( 1 − n 1 ) f ( n ξ )
因为你1 ≥ ξ n ≥ 1 n n = 1 1\ge \sqrt[n]{\xi}\ge \sqrt[n]{\dfrac1n}=1 1 ≥ n ξ ≥ n n 1 = 1 ,于是结束了.
原函数存在定理
f ( x ) is integrable on [ a , b ] ⟹ F ( x ) = ∫ a x f ( x ) d x ∈ C [ a , b ] \begin{gathered}
f(x) \text{ is integrable on } [a,b] \\
\implies F(x)=\int_a^x f(x)dx \in C[a,b]
\end{gathered} f ( x ) is integrable on [ a , b ] ⟹ F ( x ) = ∫ a x f ( x ) d x ∈ C [ a , b ]
因为可积,设∣ f ∣ ≤ M \vert f\vert \le M ∣ f ∣ ≤ M .
∣ F ( x 0 + h ) − F ( x 0 ) ∣ = ∣ ∫ x 0 x 0 + h f ( x ) d x ∣ ≤ h M \begin{gathered}
\vert F(x_0+h)-F(x_0) \vert =\vert \int_{x_0}^{x_0+h} f(x)dx \vert \le hM
\end{gathered} ∣ F ( x 0 + h ) − F ( x 0 ) ∣ = ∣ ∫ x 0 x 0 + h f ( x ) d x ∣ ≤ h M
显然连续.
f ∈ C [ a , b ] ⟹ F ( x ) = ∫ a x f ( x ) d x s . t . F ′ ( x ) = f ( x ) \begin{gathered}
f\in C[a,b] \implies F(x)=\int_a^x f(x)dx \ s.t.\
F'(x)=f(x)
\end{gathered} f ∈ C [ a , b ] ⟹ F ( x ) = ∫ a x f ( x ) d x s . t . F ′ ( x ) = f ( x )
F ′ ( x 0 ) = lim h → 0 F ( x 0 + h ) − F ( x 0 ) h = lim h → 0 ∫ x 0 x 0 + h f ( x ) d x h = lim h → 0 h f ( ξ ) h , ξ ∈ ( x 0 , x 0 + h ) = lim h → 0 f ( ξ ) = f ( x 0 ) \begin{gathered}
F'(x_0)=\lim_{h \to 0} \dfrac{F(x_0+h)-F(x_0)}{h} \\
=\lim_{h \to 0} \dfrac{\int_{x_0}^{x_0+h}f(x)dx}{h} \\
=\lim_{h \to 0} \dfrac{hf(\xi)}{h},\xi\in (x_0,x_0+h) \\
=\lim_{h \to 0} f(\xi) \\
=f(x_0)
\end{gathered} F ′ ( x 0 ) = h → 0 lim h F ( x 0 + h ) − F ( x 0 ) = h → 0 lim h ∫ x 0 x 0 + h f ( x ) d x = h → 0 lim h h f ( ξ ) , ξ ∈ ( x 0 , x 0 + h ) = h → 0 lim f ( ξ ) = f ( x 0 )
g ( x ) ∈ D F ( x ) = ∫ g ( 0 ) g ( x ) f ( x ) d x ⟹ F ′ ( x ) = g ′ ( x ) f ( x ) \begin{gathered}
g(x)\in D \\
F(x)=\int_{g(0)}^{g(x)}f(x)dx \\
\implies F'(x)=g'(x)f(x)
\end{gathered} g ( x ) ∈ D F ( x ) = ∫ g ( 0 ) g ( x ) f ( x ) d x ⟹ F ′ ( x ) = g ′ ( x ) f ( x )
换元,x = g ( t ) x=g(t) x = g ( t ) ,看成关于t t t 的复合函数求导.
f ∈ C 1 [ a , b ] , f ( a ) = 0 ⟹ ∫ a b f 2 ( x ) d x ≤ 1 2 ( b − a ) 2 ∫ a b ( f ′ ( x ) ) 2 d x \begin{gathered}
f\in C^1[a,b],f(a)=0 \\
\implies \int_a^b f^2(x)dx\le \dfrac{1}{2} (b-a)^2 \int_a^b (f'(x))^2 dx
\end{gathered} f ∈ C 1 [ a , b ] , f ( a ) = 0 ⟹ ∫ a b f 2 ( x ) d x ≤ 2 1 ( b − a ) 2 ∫ a b ( f ′ ( x ) ) 2 d x
f ( x ) = ∫ a x f ′ ( t ) d t = ∫ a x 1 ⋅ f ′ ( t ) d t ≤ ( ∫ a x 1 2 d t ) 1 2 ( ∫ a x f ′ 2 ( t ) d t ) 1 2 ≤ ( x − a ) 1 2 ( ∫ a b f ′ 2 ( t ) d t ) 1 2 \begin{gathered}
f(x)=\int_a^x f'(t)dt \\
=\int_a^x 1\cdot f'(t)dt \\
\le (\int_a^x 1^2dt)^\frac12(\int_a^x f'^2(t)dt)^\frac12 \\
\le (x-a)^{\frac12}(\int_a^b f'^2(t)dt)^\frac12
\end{gathered} f ( x ) = ∫ a x f ′ ( t ) d t = ∫ a x 1 ⋅ f ′ ( t ) d t ≤ ( ∫ a x 1 2 d t ) 2 1 ( ∫ a x f ′2 ( t ) d t ) 2 1 ≤ ( x − a ) 2 1 ( ∫ a b f ′2 ( t ) d t ) 2 1
同时平方再积分,结束.
另一个神秘做法是
∫ a x ( f ′ ( x ) + c ) 2 ≥ 0 \begin{gathered}
\int_a^x (f'(x)+c)^2\ge 0
\end{gathered} ∫ a x ( f ′ ( x ) + c ) 2 ≥ 0
展开后,让左边的式子关于c c c 最小得到一个不等式去做,但同样难以想到啊.
Class 21
一道例题
{ f ( x ) ∈ C 2 [ 0 , 1 ] f ( 0 ) = f ( 1 ) = 0 ∀ x ∈ ( 0 , 1 ) , f ( x ) ≠ 0 ⟹ ∫ 0 1 ∣ f ′ ′ ( x ) f ( x ) ∣ d x ≥ 4 \begin{gathered}
\begin{cases}
f(x)\in C^2[0,1] \\
f(0)=f(1)=0 \\
\forall x\in(0,1),f(x)\ne 0
\end{cases} \\
\implies \int_0^1 \vert \dfrac{f''(x)}{f(x)} \vert dx\ge 4
\end{gathered} ⎩ ⎨ ⎧ f ( x ) ∈ C 2 [ 0 , 1 ] f ( 0 ) = f ( 1 ) = 0 ∀ x ∈ ( 0 , 1 ) , f ( x ) = 0 ⟹ ∫ 0 1 ∣ f ( x ) f ′′ ( x ) ∣ d x ≥ 4
这个f ′ ′ f \dfrac{f''}{f} f f ′′ 太鬼了,于是你直接把f f f 放掉.不妨设f ( x ) > 0 f(x)>0 f ( x ) > 0 ,f ( x 0 ) f(x_0) f ( x 0 ) 为f f f 最大值,则
f ( x ) = f ( x 0 ) + ( x − x 0 ) f ′ ( ξ ) ⟹ { 0 = f ( 0 ) = f ( x 0 ) + x 0 f ′ ( ξ 1 ) 0 = f ( 1 ) = f ( x 0 ) + ( 1 − x 0 ) f ′ ( ξ 2 ) \begin{gathered}
f(x)=f(x_0)+(x-x_0)f'(\xi) \\
\implies \begin{cases}
0=f(0)=f(x_0)+x_0f'(\xi_1) \\
0=f(1)=f(x_0)+(1-x_0)f'(\xi_2)
\end{cases}
\end{gathered} f ( x ) = f ( x 0 ) + ( x − x 0 ) f ′ ( ξ ) ⟹ { 0 = f ( 0 ) = f ( x 0 ) + x 0 f ′ ( ξ 1 ) 0 = f ( 1 ) = f ( x 0 ) + ( 1 − x 0 ) f ′ ( ξ 2 )
于是
∫ 0 1 ∣ f ′ ′ ( x ) f ( x ) ∣ d x ≥ 1 f ( x 0 ) ∣ ∫ 0 1 f ′ ′ ( x ) ∣ d x ≥ 1 f ( x 0 ) ∣ ∫ ξ 1 ξ 2 f ′ ′ ( x ) ∣ d x = 1 f ( x 0 ) ∣ f ′ ( ξ 1 ) − f ′ ( ξ 2 ) ∣ = 1 f ( x 0 ) ∣ f ( x 0 ) x 0 − f ( x 0 ) 1 − x 0 ∣ ≥ 1 4 \begin{gathered}
\int_0^1 \vert \dfrac{f''(x)}{f(x)} \vert dx \\
\ge \dfrac{1}{f(x_0)} \vert \int_0^1 f''(x) \vert dx \\
\ge \dfrac{1}{f(x_0)} \vert \int_{\xi_1}^{\xi_2}f''(x) \vert dx \\
=\dfrac{1}{f(x_0)} \vert f'(\xi_1)-f'(\xi_2) \vert \\
=\dfrac{1}{f(x_0)} \vert \dfrac{f(x_0)}{x_0}-\dfrac{f(x_0)}{1-x_0} \vert \\
\ge \dfrac{1}{4}
\end{gathered} ∫ 0 1 ∣ f ( x ) f ′′ ( x ) ∣ d x ≥ f ( x 0 ) 1 ∣ ∫ 0 1 f ′′ ( x ) ∣ d x ≥ f ( x 0 ) 1 ∣ ∫ ξ 1 ξ 2 f ′′ ( x ) ∣ d x = f ( x 0 ) 1 ∣ f ′ ( ξ 1 ) − f ′ ( ξ 2 ) ∣ = f ( x 0 ) 1 ∣ x 0 f ( x 0 ) − 1 − x 0 f ( x 0 ) ∣ ≥ 4 1
[think] todo
I m = ∫ 0 π 2 cos m x d x \begin{gathered}
I_m=\int_0^\frac\pi2 \cos^m xdx
\end{gathered} I m = ∫ 0 2 π cos m x d x
I m = ∫ 0 π 2 cos x cos m − 1 x d x = sin x cos m − 1 ∣ 0 π 2 − ∫ 0 π 2 sin x ( m − 1 ) cos m − 2 x ( − sin x ) d x = ( m − 1 ) ∫ 0 π 2 ( 1 − c o s 2 x ) cos m − 2 x d x = ( m − 1 ) I m − 2 − ( m − 1 ) I m ⟹ I m = m − 1 m I m − 2 \begin{gathered}
I_m=\int_0^\frac\pi2 \cos x\cos^{m-1}x dx \\
=\sin x \cos^{m-1} \vert^{\frac\pi2}_0- \int_0^\frac\pi2 \sin x(m-1) \cos^{m-2} x(-\sin x)dx \\
=(m-1)\int_0^\frac\pi2 (1-cos^2 x)\cos^{m-2}xdx \\
=(m-1)I_{m-2}-(m-1)I_m \\
\implies I_m=\dfrac{m-1}{m} I_{m-2}
\end{gathered} I m = ∫ 0 2 π cos x cos m − 1 x d x = sin x cos m − 1 ∣ 0 2 π − ∫ 0 2 π sin x ( m − 1 ) cos m − 2 x ( − sin x ) d x = ( m − 1 ) ∫ 0 2 π ( 1 − co s 2 x ) cos m − 2 x d x = ( m − 1 ) I m − 2 − ( m − 1 ) I m ⟹ I m = m m − 1 I m − 2
于是递推即可.
积分型泰勒
f ∈ C n + 1 ⟹ f ( x ) = T n ( f , x 0 , x ) + ∫ x 0 x f ( n + 1 ) ( t ) ( x − t ) n d t \begin{gathered}
f\in C^{n+1} \\
\implies f(x)=T_n(f,x_0,x)+\int_{x_0}^x f^{(n+1)}(t)(x-t)^ndt
\end{gathered} f ∈ C n + 1 ⟹ f ( x ) = T n ( f , x 0 , x ) + ∫ x 0 x f ( n + 1 ) ( t ) ( x − t ) n d t
注意到
∫ x 0 x f ( n ) ( t ) ( t − x 0 ) n − 1 ( n − 1 ) ! d t = f ( n ) ( t ) ( t − x 0 ) n n ! − ∫ x 0 x f ( n + 1 ) ( t ) ( t − x 0 ) n n ! d t \begin{gathered}
\int_{x_0}^x f^{(n)}(t)\dfrac{(t-x_0)^{n-1}}{(n-1)!}dt \\
=f^{(n)}(t)\dfrac{(t-x_0)^n}{n!}-\int_{x_0}^x f^{(n+1)}(t)\dfrac{(t-x_0)^n}{n!} dt
\end{gathered} ∫ x 0 x f ( n ) ( t ) ( n − 1 )! ( t − x 0 ) n − 1 d t = f ( n ) ( t ) n ! ( t − x 0 ) n − ∫ x 0 x f ( n + 1 ) ( t ) n ! ( t − x 0 ) n d t
于是你直接递归的做一下:
f ( x ) − f ( x 0 ) = ∑ i = 1 n f ( i ) ( x ) i ! ( − 1 ) i − 1 ( x − x 0 ) i + ( − 1 ) n ∫ x 0 x f ( n + 1 ) ( t ) ( t − x 0 ) n n ! d t \begin{gathered}
f(x)-f(x_0)=\sum _{i = 1} ^{n} \dfrac{f^{(i)}(x)}{i!} (-1)^{i-1}(x-x_0)^i + (-1)^n \int_{x_0}^x f^{(n+1)}(t)\dfrac{(t-x_0)^n}{n!} dt
\end{gathered} f ( x ) − f ( x 0 ) = i = 1 ∑ n i ! f ( i ) ( x ) ( − 1 ) i − 1 ( x − x 0 ) i + ( − 1 ) n ∫ x 0 x f ( n + 1 ) ( t ) n ! ( t − x 0 ) n d t
发现两个问题:求导在x x x 上,以及交错,所以你直接把x 0 x_0 x 0 和x x x 交换一下:
f ( x 0 ) − f ( x ) = − ∑ i = 1 n f ( i ) ( x 0 ) i ! ( x − x 0 ) i − ∫ x 0 x f ( n + 1 ) ( t ) ( t − x 0 ) n n ! d t ⟺ f ( x ) = ∑ i = 0 n f ( i ) ( x 0 ) i ! ( x − x 0 ) i + ∫ x 0 x f ( n + 1 ) ( t ) ( t − x 0 ) n n ! d t \begin{gathered}
f(x_0)-f(x)=-\sum _{i = 1} ^{n} \dfrac{f^{(i)}(x_0)}{i!} (x-x_0)^i
-\int_{x_0}^x f^{(n+1)}(t) \dfrac{(t-x_0)^n}{n!} dt \\
\iff \\
f(x)=\sum _{i = 0} ^{n} \dfrac{f^{(i)}(x_0)}{i!} (x-x_0)^i+\int_{x_0}^x f^{(n+1)}(t) \dfrac{(t-x_0)^n}{n!} dt
\end{gathered} f ( x 0 ) − f ( x ) = − i = 1 ∑ n i ! f ( i ) ( x 0 ) ( x − x 0 ) i − ∫ x 0 x f ( n + 1 ) ( t ) n ! ( t − x 0 ) n d t ⟺ f ( x ) = i = 0 ∑ n i ! f ( i ) ( x 0 ) ( x − x 0 ) i + ∫ x 0 x f ( n + 1 ) ( t ) n ! ( t − x 0 ) n d t
最后的积分部分还涉及一个对称的换元.
所以其实就是你一开始对x 0 x_0 x 0 积分就对了.
从这里我们可以注意到,对最后一个式子用积分中值是柯西中值.
要得到拉格朗日余项,也对最后一个式子用积分中值∫ f ( x ) g ( x ) d x \int f(x)g(x)dx ∫ f ( x ) g ( x ) d x 的版本即可.
换元为什么对
也就是为什么可以说:
∫ a b f ( x ) d x = ∫ c d f ( g ( t ) ) g ′ ( t ) d t \begin{gathered}
\int_a^b f(x)dx=\int_c^d f(g(t))g'(t)dt
\end{gathered} ∫ a b f ( x ) d x = ∫ c d f ( g ( t )) g ′ ( t ) d t
g g g 可逆,g ( c ) = a , g ( d ) = b g(c)=a,g(d)=b g ( c ) = a , g ( d ) = b
如果条件是f ∈ C , g ∈ C 1 f\in C,g\in C^1 f ∈ C , g ∈ C 1 ,那么直接对两边的变上限积分求导即可.
如果条件是黎曼可积,你需要回归定义+拉格朗日中值得到g ′ g' g ′ 去证明.
Class 22
一道例题
∫ 0 1 f ( x ) d x = 1 , ∫ 0 1 x f ( x ) d x = 0 ⟹ sup x ∈ [ 0 , 1 ] ∣ f ( x ) ∣ ≥ 2 + 1 \begin{gathered}
\int_0^1 f(x)dx=1,\int_0^1 xf(x)dx=0 \\
\implies \sup_{x\in [0,1]} \vert f(x) \vert \ge \sqrt 2+1
\end{gathered} ∫ 0 1 f ( x ) d x = 1 , ∫ 0 1 x f ( x ) d x = 0 ⟹ x ∈ [ 0 , 1 ] sup ∣ f ( x ) ∣ ≥ 2 + 1
考虑反证,则 ∣ f ( x ) ∣ < 2 + 1 \vert f(x) \vert <\sqrt 2+1 ∣ f ( x ) ∣ < 2 + 1
− 1 = ∫ 0 1 f ( x ) ( 2 x − 1 ) d x 1 = ∣ ∫ 0 1 f ( x ) ( 2 x − 1 ) d x ∣ < ( 2 + 1 ) ∫ 0 1 ∣ 2 x − 1 ∣ d x = ( 2 + 1 ) ( 2 − 1 ) = 1 \begin{gathered}
-1=\int_0^1 f(x)(\sqrt 2x-1)dx \\
1=\vert \int_0^1 f(x)(\sqrt 2x-1)dx \vert \\
<(\sqrt2+1)\int_0^1 \vert \sqrt2 x-1 \vert dx \\
=(\sqrt 2+1)(\sqrt 2-1) \\
=1
\end{gathered} − 1 = ∫ 0 1 f ( x ) ( 2 x − 1 ) d x 1 = ∣ ∫ 0 1 f ( x ) ( 2 x − 1 ) d x ∣ < ( 2 + 1 ) ∫ 0 1 ∣ 2 x − 1∣ d x = ( 2 + 1 ) ( 2 − 1 ) = 1
得证.
[think] 首先,∫ 0 1 ( a x + b ) f ( x ) = b \int_0^1 (ax+b)f(x)=b ∫ 0 1 ( a x + b ) f ( x ) = b 包含了所有信息是你应该想到的.其次f ( x ) f(x) f ( x ) 的最优形态看起来是最大值最小值的绝对值相等的二值的函数,所以这个放缩是有的.
可积性理论
按照这个路径:
定义上和,下和
固定分割,任意和介于上和,下和之间
于是显然可积等价于上和极限与下和极限相等
细分之后,上和不增下和不降
于是我们发现对于一列确定的上和下和的分割T n T_n T n ,如果它们收敛,那么对任意另一列S n S_n S n ,我们把它们的分割并起来拼一个新的S n ∪ T k S_n\cup T_k S n ∪ T k 一定收敛,而拼起来的过程中的值的变化是不超过 K = ∣ T k ∣ 2 M ∥ S n ∥ K=\vert T_k \vert 2M\Vert S_n \Vert K = ∣ T k ∣2 M ∥ S n ∥ ,M M M 为被积函数的界.于是你让S S S 去和满足K < ϵ K<\epsilon K < ϵ 的T k T_k T k 去拼得到一个新的S n ∪ T k S_n\cup T_k S n ∪ T k ,显然这个也收敛.且这个和我们原来的S S S 每项差都小于ϵ \epsilon ϵ ,所以原S S S 也收敛.
于是你说明任意一列分割的上下和极限相等就所有的都相等.
然后还有一个可积性的理论是任意值v v v 和ϵ \epsilon ϵ 可以取T T T ,使得T T T 中最大值减最小值超过v v v 的区间长度和小于ϵ \epsilon ϵ :由这个推可积只要容易转化到∑ w i Δ x \sum w_i \Delta x ∑ w i Δ x 的可积条件,而如果这个不成立,则存在v , ϵ v,\epsilon v , ϵ ,那你能找到两列差v v v 的就爆炸了.
第二积分中值
{ g is decreasing on [ a , b ] g ( x ) ≥ 0 f ∈ R [ a , b ] ⟹ ∫ a b f ( x ) g ( x ) d x = g ( a ) ∫ a c f ( x ) d x \begin{gathered}
\begin{cases}
g \text{ is decreasing on } [a,b] \\
g(x)\ge 0 \\
f\in R[a,b]
\end{cases}\\
\implies \int_a^b f(x)g(x)dx = g(a)\int_a^c f(x)dx
\end{gathered} ⎩ ⎨ ⎧ g is decreasing on [ a , b ] g ( x ) ≥ 0 f ∈ R [ a , b ] ⟹ ∫ a b f ( x ) g ( x ) d x = g ( a ) ∫ a c f ( x ) d x
首先我们定义F ( x ) = ∫ a x f ( t ) d t F(x)=\int_a^x f(t)dt F ( x ) = ∫ a x f ( t ) d t ,我们就是要证明g ( a ) F ( x ) g(a)F(x) g ( a ) F ( x ) 的最大值比左侧大,最小值比左侧小.
其实最大值是显然的.
考虑
∫ a b f ( x ) g ( x ) d x = ∑ i = 1 n ∫ x i x i + 1 f ( x ) g ( x ) d x = ∑ i = 1 n ∫ x i x i + 1 f ( x ) ( g ( x ) − g ( x i ) ) d x + ∑ i = 1 n ∫ x i x i + 1 f ( x ) g ( x i ) d x \begin{gathered}
\int_a^b f(x)g(x)dx \\
=\sum _{i = 1} ^{n} \int_{x_i}^{x_{i+1}}f(x)g(x)dx \\
=\sum _{i = 1} ^{n} \int_{x_i}^{x_{i+1}}f(x)(g(x)-g(x_i))dx \\
+\sum_{i=1}^n \int_{x_i}^{x_{i+1}}f(x)g(x_i)dx
\end{gathered} ∫ a b f ( x ) g ( x ) d x = i = 1 ∑ n ∫ x i x i + 1 f ( x ) g ( x ) d x = i = 1 ∑ n ∫ x i x i + 1 f ( x ) ( g ( x ) − g ( x i )) d x + i = 1 ∑ n ∫ x i x i + 1 f ( x ) g ( x i ) d x
其中对第一项,考虑g g g 可积所以我们可以取分割是的g ( x ) − g ( x i ) g(x)-g(x_i) g ( x ) − g ( x i ) 的积分是任意小,然后你把f ( x ) f(x) f ( x ) 放成他的界就说明这块最后是0 0 0 .
对第二项转化成
todo
g g g 是增的情况是相同的,而结合可以证明:
{ g is monotonic on [ a , b ] f ( x ) ∈ R [ a , b ] ⟹ ∃ c , ∫ a b f ( x ) g ( x ) d x = g ( a ) ∫ a c f ( x ) d x + g ( b ) ∫ c b f ( x ) d x \begin{gathered}
\begin{cases}
g \text{ is monotonic on } [a,b] \\
f(x)\in R[a,b]
\end{cases}
\\
\implies \exists c,\int_a^b f(x)g(x)dx=g(a)\int_a^cf(x)dx+g(b)\int_c^b f(x)dx
\end{gathered} { g is monotonic on [ a , b ] f ( x ) ∈ R [ a , b ] ⟹ ∃ c , ∫ a b f ( x ) g ( x ) d x = g ( a ) ∫ a c f ( x ) d x + g ( b ) ∫ c b f ( x ) d x
取g 0 ( x ) = g ( x ) − g ( a ) g_0(x)=g(x)-g(a) g 0 ( x ) = g ( x ) − g ( a ) (或者g g g 递减,取g 0 ( x ) = g ( x ) − g ( b ) g_0(x)=g(x)-g(b) g 0 ( x ) = g ( x ) − g ( b ) )用上面的形式.
Class 23
f is decreasing on [ 0 , 2 π ] ⟹ ∀ n ∈ Z , ∫ 0 2 π f ( x ) sin ( n x ) d x ≥ 0 \begin{gathered}
f \text{ is decreasing on } [0,2\pi] \\
\implies \forall n\in Z,\int_0^{2\pi} f(x)\sin(nx)dx\ge 0
\end{gathered} f is decreasing on [ 0 , 2 π ] ⟹ ∀ n ∈ Z , ∫ 0 2 π f ( x ) sin ( n x ) d x ≥ 0
直接用中值就是
f ( 0 ) ( − cos n t + cos 0 ) + f ( 2 π ) ( cos n t − cos 2 π ) ≥ 0 \begin{gathered}
f(0)(-\cos nt+\cos 0) \\
+f(2\pi)(\cos nt-\cos 2\pi) \\
\ge 0
\end{gathered} f ( 0 ) ( − cos n t + cos 0 ) + f ( 2 π ) ( cos n t − cos 2 π ) ≥ 0
x > 0 ⟹ ∀ c , ∣ ∫ x x + c sin ( t 2 ) d t ∣ ≤ 1 x \begin{gathered}
x>0 \implies \forall c,\vert \int_x^{x+c} \sin(t^2)dt \vert \le \dfrac{1}{x}
\end{gathered} x > 0 ⟹ ∀ c , ∣ ∫ x x + c sin ( t 2 ) d t ∣ ≤ x 1
你考虑t 2 t^2 t 2 肯定要处理:
= ∫ x x + c 1 t 2 sin ( t 2 ) d ( t 2 ) = ∫ x 2 ( x + c ) 2 1 2 s sin s d s \begin{gathered}
=\int_x^{x+c} \dfrac{1}{\sqrt{t^2}} \sin(t^2)d(t^2) \\
=\int_{x^2}^{(x+c)^2}\dfrac{1}{2\sqrt s}\sin sds \\
\end{gathered} = ∫ x x + c t 2 1 sin ( t 2 ) d ( t 2 ) = ∫ x 2 ( x + c ) 2 2 s 1 sin s d s
然后用第二中值
= ∣ 1 2 x ∫ x 2 ξ sin s d s ∣ ≤ 1 2 x \begin{gathered}
=\vert \dfrac{1}{2x} \int_{x^2}^\xi \sin sds \vert \\
\le \dfrac{1}{2x}
\end{gathered} = ∣ 2 x 1 ∫ x 2 ξ sin s d s ∣ ≤ 2 x 1
Lebeisge Theorem
勒贝格测度下,R R R 上零测集等价于可以被总长为任意小的可数个区间覆盖.
因为勒贝格测度是完备的.任意一个区间覆盖的测度是有定义 的,空集是有定义的,于是完备化定义了中间的是0 0 0 .
f f f 可积当且仅当f f f 有界且不连续点的集合测度为0 0 0 .
Sol 1
定义函数一点的振幅为
w ( x ) = lim d → 0 sup y 1 , y 2 ∈ [ x − d , x + d ] ∣ f ( y 1 ) − f ( y 2 ) ∣ \begin{gathered}
w(x)=\lim_{d \to 0} \sup_{y_1,y_2\in[x-d,x+d]}\vert f(y_1)-f(y_2) \vert
\end{gathered} w ( x ) = d → 0 lim y 1 , y 2 ∈ [ x − d , x + d ] sup ∣ f ( y 1 ) − f ( y 2 ) ∣
容易看出连续等价于w ( x ) = 0 w(x)=0 w ( x ) = 0 .
(实际上是上极限减下极限,等于0就是只有一个极限).
于是考虑零测集的一组开覆盖I = ⋃ I 1 , I 2 , … I=\bigcup I_1,I_2,\ldots I = ⋃ I 1 , I 2 , … 满足长度和小于任意ϵ 1 \epsilon_1 ϵ 1 .
那么对区间[ a , b ] [a,b] [ a , b ] 的每个点,考虑
若当前点在I I I 中,则你取一个它的小邻域也在I I I 中(I I I 是开集).
否则,当前点是连续点,则连续点满足w ( x ) = 0 w(x)=0 w ( x ) = 0 是一个极限,所以存在一个d d d 使得N ( x , d ) N(x,d) N ( x , d ) 上的振幅小于任意ϵ 2 \epsilon_2 ϵ 2 .我们取这样一个邻域N ( x , d ) N(x,d) N ( x , d ) .
于是所有点对应的区间构成对[ a , b ] [a,b] [ a , b ] 的无限开覆盖,于是它有有限子覆盖,于是你可以拿出有限个区间.
把这些区间的端点组成划分T T T ,考虑T T T 中的每个区间:
如果它被一个来自I I I 的点的区间包含,那么这样的区间总长度小于I I I 的总长度.而剩下的区间被第二种区间包含,每个振幅小于ϵ 2 \epsilon_2 ϵ 2 .
这样你的∑ w Δ x \sum w\Delta x ∑ w Δ x 就是第一类的加第二类的,第一类的是2 M ϵ 1 2M\epsilon_1 2 M ϵ 1 ,第二类是( b − a ) ϵ 2 (b-a)\epsilon_2 ( b − a ) ϵ 2 ,都是乘常数,所以可以任意小得证.这是充分.
对于必要性,那么如果f f f 真的可积,你考虑等价条件之一是对任意ϵ , δ \epsilon,\delta ϵ , δ ,可以找到分割T T T 使得振幅大于ϵ \epsilon ϵ 的区间长度小于δ \delta δ .
于是你取ϵ = 1 n \epsilon=\dfrac1n ϵ = n 1 ,取δ = 1 2 n \delta=\dfrac1{2^n} δ = 2 n 1 再把这些区间并起来结束.
Sol 2
或者我们看到振幅是上极限减下极限(包含自身),所以是上半连续的,所以振幅大于等于ϵ \epsilon ϵ 的集合是一个闭集,所以覆盖零测集的一组集合可以取有限覆盖来覆盖大于等于ϵ \epsilon ϵ 的.后面的仍然一样走.
Sol 3
老师上课讲的:
首先我们需要一个引理:若D = { x ∣ w ( x ) ≠ 0 } D=\{x \vert w(x)\ne 0\} D = { x ∣ w ( x ) = 0 } 有一个可数开区间覆盖且是零测集,则
∀ ϵ , ∃ δ , ∀ x ∈ [ a , b ] − D , y ∈ [ a , b ] , ∣ x − y ∣ < δ ⟹ ∣ f ( x ) − f ( y ) ∣ < ϵ \begin{gathered}
\forall \epsilon,\exists \delta,\forall x\in [a,b]-D,y\in [a,b],\vert x-y \vert <\delta \\
\implies \vert f(x)-f(y) \vert <\epsilon
\end{gathered} ∀ ϵ , ∃ δ , ∀ x ∈ [ a , b ] − D , y ∈ [ a , b ] , ∣ x − y ∣ < δ ⟹ ∣ f ( x ) − f ( y ) ∣ < ϵ
证明考虑反证,则存在
c n ∈ [ a , b ] − D , d n ∈ [ a , b ] lim n → ∞ ∣ c n − d n ∣ = 0 lim n → ∞ ∣ f ( c n ) − f ( d n ) ∣ > ϵ \begin{gathered}
c_n\in [a,b]-D,d_n\in [a,b] \\
\lim_{n \to \infty} \vert c_n-d_n \vert =0 \\
\lim_{n \to \infty} \vert f(c_n)-f(d_n) \vert >\epsilon
\end{gathered} c n ∈ [ a , b ] − D , d n ∈ [ a , b ] n → ∞ lim ∣ c n − d n ∣ = 0 n → ∞ lim ∣ f ( c n ) − f ( d n ) ∣ > ϵ
那我们取a a a 的一个收敛子列,则b b b 对应子列也收敛到相同点,而你用闭集减去若干开集得到的是闭集,所以这个共同的点落在[ a , b ] − D [a,b]-D [ a , b ] − D 中,对这个连续点用连续性定义即推出矛盾.
有了引理之后,对任意分割T T T 满足∥ T ∥ < δ \Vert T\Vert<\delta ∥ T ∥ < δ ,考虑T T T 的每个小区间把和K = [ a − b ] − D K=[a-b]-D K = [ a − b ] − D 的交是否为空集分类.为空的集合完全包含于覆盖长度很小,而不为空集的有该区间内振幅一定小于2 ϵ 2\epsilon 2 ϵ ,于是随便取一下ϵ \epsilon ϵ 把结果加一下就得证.