这一节的逻辑构成是这样的:先定义了在countable集合上的级数,并且在绝对收敛下有Fubini定理成立,而后在uncountable集合上也可以定义级数,只要满足任何有限集合的sup存在。如果f是一个定义在uncountable集合上的绝对收敛级数,那么f非退化的点是至多可数的(证明需要用选择公理)。绝对收敛级数有很好理解的series laws,条件收敛级数则有Riemann的结论:可以收敛到任何实数L。
这一节的习题主要是完善正文中的定理证明,然而也不易。
Exercise 8.2.1
Exercise 3.6.3 says if there’s a function whose domain is on a finite subset of N \mathbf N N, then the range of this function is also finite. I’ll use this result later.
Since X X X is at most countable, X X X may be finite or countable. If X X X is finite, then the statement is obviously true. Now we consider the case when X X X is countable.
First suppose the series ∑ x ∈ X f ( x ) ∑_{x∈X}f(x) ∑x∈Xf(x) is absolutely convergent, then there’s a bijection g : N → X g:\mathbf N→X g:N→X such that ∑ n = 0 ∞ f ( g ( n ) ) ∑_{n=0}^∞f(g(n)) ∑n=0∞f(g(n)) is absolutely convergent. Given any element E E E in the set
S = { ∑ x ∈ A ∣ f ( x ) ∣ ∶ A ⊆ X , A finite } S=\left\{∑_{x∈A}|f(x)|∶A⊆X,A\text{ finite}\right\} S={
x∈A∑∣f(x)∣∶A⊆X,A finite}
We know there’s a finite set A A A such that E = ∑ x ∈ A ∣ f ( x ) ∣ E=∑_{x∈A}|f(x)| E=∑x∈A∣f(x)∣ . So we can have a finite subset S ′ S' S′ of N N N such that g ( S ′ ) = A g(S')=A g(S′)=A, from Exercise 3.6.3 we can have S ′ S' S′ is bounded above by some natural number k k k, so
E = ∑ x ∈ A ∣ f ( x ) ∣ = ∑ n ∈ S ′ ∣ f ( g ( n ) ) ∣ ≤ ∑ n = 0 k ∣ f ( g ( n ) ) ∣ ≤ ∑ n = 0 ∞ ∣ f ( g ( n ) ) ∣ E=∑_{x∈A}|f(x)| =∑_{n∈S'}|f(g(n))| ≤∑_{n=0}^k|f(g(n))| ≤∑_{n=0}^∞|f(g(n))| E=x∈A∑∣f(x)∣=n∈S′∑∣f(g(n))∣≤n=0∑k∣f(g(n))∣≤n=0∑∞∣f(g(n))∣
Since this is true for all E E E, we know that ∑ n = 0 ∞ ∣ f ( g ( n ) ) ∣ ∑_{n=0}^∞|f(g(n))| ∑n=0∞∣f(g(n))∣ is an upper bound of S S S, so
sup S ≤ ∑ n = 0 ∞ ∣ f ( g ( n ) ) ∣ < + ∞ \supS≤∑_{n=0}^∞|f(g(n))| <+∞ supS≤n=0∑∞∣f(g(n))∣<+∞
On the contrary, if M = sup { ∑ x ∈ A ∣ f ( x ) ∣ ∶ A ⊆ X , A finite } < + ∞ M=\sup\{∑_{x∈A}|f(x)|∶A⊆X,A\text{ finite}\}<+∞ M=sup{
∑x∈A∣f(x)∣∶A⊆X,A finite}<+∞, we assume the series ∑ x ∈ X f ( x ) ∑_{x∈X}f(x) ∑x∈Xf(x) is not absolutely convergent, then given a bijection g : N → X g:\mathbf N→X g:N→X, we have S N = ∑ n = 0 N ∣ f ( g ( n ) ) ∣ S_N=∑_{n=0}^N|f(g(n))| SN=∑n=0N∣f(g(n))∣ is not bounded above, so there exists a k ∈ N k∈\mathbf N k∈N such that ∑ n = 0 k ∣ f ( g ( n ) ) ∣ > M ∑_{n=0}^k|f(g(n))| >M ∑n=0k∣f(g(n))∣>M, we let A = g ( { n : 0 ≤ n ≤ k } ) A=g(\{n:0≤n≤k\}) A=g({
n:0≤n≤k}), then A A A is finite, and
∑ n = 0 k ∣ f ( g ( n ) ) ∣ = ∑ x ∈ A ∣ f ( x ) ∣ > M ∑_{n=0}^k|f(g(n))| =∑_{x∈A}|f(x)| >M n=0∑k∣f(g(n))∣=x∈A∑∣f(x)∣>M
This leads to a contradiction.
Exercise 8.2.2
Since ∑ x ∈ X f ( x ) ∑_{x∈X}f(x) ∑x∈Xf(x) is absolutely convergent, the quantity M M M is well defined. For ∀ n ∈ N ∀n∈\mathbf N ∀n∈N, consider the set { x ∈ X : ∣ f ( x ) ∣ > 1 / n } \{x∈X:|f(x)|>1/n\} {
x∈X:∣f(x)∣>1/n}, this set is finite with cardinality at most M n Mn Mn, thus use Exercise 8.1.9, we know that
{ x ∈ X : f ( x ) ≠ 0 } = ⋃ n = 1 ∞ { x ∈ X : ∣ f ( x ) ∣ > 1 / n } \{x∈X:f(x)≠0\}=⋃_{n=1}^∞\{x∈X:|f(x)|>1/n\} {
x∈X:f(x)=0}=n=1⋃∞{
x∈X:∣f(x)∣>1/n}
is at most countable.
Exercise 8.2.3
Since both ∑ x ∈ X f ( x ) ∑_{x∈X}f(x) ∑x∈Xf(x) and ∑ x ∈ X g ( x ) ∑_{x∈X}g(x) ∑x∈Xg(x) are absolutely convergent, the sets S = { x ∈ X : f ( x ) ≠ 0 } S=\{x∈X:f(x)≠0\} S={
x∈X:f(x)=0} and B = { x ∈ X : g ( x ) ≠ 0 } B=\{x∈X:g(x)≠0\} B={
x∈X:g(x)=0} are at most countable. We denote ∑ x ∈ X f ( x ) = L ∑_{x∈X}f(x)=L ∑x∈Xf(x)=L and ∑ x ∈ X g ( x ) = M ∑_{x∈X}g(x)=M ∑x∈Xg(x)=M.
( a ) Let A ⊆ X A⊆X A⊆X be a finite set, then by proposition 7.1.11 we have
∑ x ∈ A ∣ f ( x ) + g ( x ) ∣ ≤ ∑ x ∈ A ∣ f ( x ) ∣ + ∑ x ∈ A ∣ g ( x ) ∣ ≤ sup { ∑ x ∈ A ∣ f ( x ) ∣ ∶ A ⊆ X , A finite } + sup { ∑ x ∈ A ∣ g ( x ) ∣ ∶ A ⊆ X , A finite } < ∞ \begin{aligned}∑_{x∈A} |f(x)+g(x)| &≤∑_{x∈A}|f(x)| +∑_{x∈A}|g(x)| \\&≤\sup\left\{∑_{x∈A}|f(x)|∶A⊆X,A\text{ finite}\right\}+\sup \left\{∑_{x∈A}|g(x)|∶A⊆X,A\text{ finite}\right\}\\&<∞\end{aligned} x∈A∑∣f(x)+g(x)∣≤x∈A∑∣f(x)∣+x∈A∑∣g(x)∣≤sup{
x∈A∑∣f(x)∣∶A⊆X,A finite}+sup{
x∈A∑∣g(x)∣∶A⊆X,A finite}<∞
which means
sup { ∑ x ∈ A ∣ f ( x ) + g ( x ) ∣ ∶ A ⊆ X , A finite } ≤ sup { ∑ x ∈ A ∣ f ( x ) ∣ ∶ A ⊆ X , A finite } + sup { ∑ x ∈ A ∣ g ( x ) ∣ ∶ A ⊆ X , A finite } \sup\left\{∑_{x∈A}|f(x)+g(x)|∶A⊆X,A\text{ finite}\right\}\\\leq\sup\left\{∑_{x∈A}|f(x)|∶A⊆X,A\text{ finite}\right\}+\sup \left\{∑_{x∈A}|g(x)|∶A⊆X,A\text{ finite}\right\} sup{
x∈A∑∣f(x)+g(x)∣∶A⊆X,A finite}≤sup{
x∈A∑∣f(x)∣∶A⊆X,A finite}+sup{
x∈A∑∣g(x)∣∶A⊆X,A finite}
Use Definition 8.2.4 we know that ∑ x ∈ X ∣ f ( x ) + g ( x ) ∣ ∑_{x∈X}|f(x)+g(x)| ∑x∈X∣f(x)+g(x)∣ is absolutely convergent. Thus
∑ x ∈ X ∣ f ( x ) + g ( x ) ∣ = ∑ x ∈ X , f ( x ) + g ( x ) ≠ 0 ( f ( x ) + g ( x ) ) = ∑ x ∈ S ∪ B ( f ( x ) + g ( x ) ) ∑_{x∈X}|f(x)+g(x)| =∑_{x∈X,f(x)+g(x)≠0} (f(x)+g(x)) =∑_{x∈S∪B} (f(x)+g(x)) x∈X∑∣f(x)+g(x)∣=x∈X,f(x)+g(x)=0∑(f(x)+g(x))=x∈S∪B∑(f(x)+g(x))
S ∪ B S∪B S∪B is at most countable, if S ∪ B S∪B S∪B is finite we can use Proposition 7.1.11(f) to get
∑ x ∈ S ∪ B ( f ( x ) + g ( x ) ) = ∑ x ∈ S ∪ B f ( x ) + ∑ x ∈ S ∪ B g ( x ) = ∑ x ∈ S f ( x ) + ∑ x ∈ B g ( x ) ∑_{x∈S∪B} (f(x)+g(x)) =∑_{x∈S∪B} f(x)+∑_{x∈S∪B} g(x) =∑_{x∈S} f(x) +∑_{x∈B} g(x) x∈S∪B∑(f(x)+g(x))=x∈S∪B∑f(x)+x∈S∪B∑g(x)=x∈S∑f(x)+x∈B∑g(x)
If S ∪ B S∪B S∪B is countable, we can have a bijection h : N → S ∪ B h:\mathbf N→S∪B h:N→S∪B, s.t.
∑ x ∈ S ∪ B ( f ( x ) + g ( x ) ) = ∑ n = 0 + ∞ ( f ( h ( n ) ) + g ( h ( n ) ) ) ∑_{x∈S∪B} (f(x)+g(x)) =∑_{n=0}^{+∞}\bigg(f\Big(h(n)\Big)+g\Big(h(n)\Big)\bigg) x∈S∪B∑(f(x)+g(x))=n=0∑+∞(f(h(n))+g(h(n)))
Let S N = ∑ n = 0 N ( f ( h ( n ) ) + g ( h ( n ) ) ) = ∑ n = 0 N f ( h ( n ) ) + ∑ n = 0 N g ( h ( n ) ) S_N=∑_{n=0}^N\bigg(f\Big(h(n)\Big)+g\Big(h(n)\Big)\bigg) =∑_{n=0}^Nf(h(n)) +∑_{n=0}^Ng(h(n)) SN=∑n=0N(f(h(n))+g(h(n)))=∑n=0Nf(h(n))+∑n=0Ng(h(n)) , we know that when N → ∞ N→∞ N→∞, ∑ n = 0 N f ( h ( n ) ) → L ∑_{n=0}^Nf(h(n)) →L ∑n=0Nf(h(n))→L since A ⊆ A ∪ B A⊆A∪B A⊆A∪B, by the same logic,