没有合适的资源?快使用搜索试试~ 我知道了~
首页证明不存在仅含可数成员的无限σ-代数
《Rudin实分析与复分析习题解答》是一本专门针对Rudin著作中的实分析与复分析部分设计的习题解答书籍。该书由李光明教授编写,适用于中国科技大学数学与统计学院的学生和广大对实分析感兴趣的读者。这本书的核心内容围绕着Rudin教材中的理论难题和练习题展开,旨在帮助学习者深入理解和掌握实分析的基本概念、定理以及证明技巧。 在第一章中,讨论的问题是关于无限σ-algebra的性质。问题的关键在于是否存在一个仅包含可数成员的无限σ-algebra。答案是否定的,即不存在这样的σ-algebra。作者通过严谨的论证来证明这一结论。首先,作者提出假设存在这样的σ-algebra M,并且给出了有限集合A1, A2, ..., An,这些集合互不相交且属于M。他进一步指出,由于集合间的互斥性,仅由这些集合构成的σ-algebra F是有限的,因为不可能有超过2n种不同的组合。然后,根据M的定义,必然存在不属于F的集合A。 接着,作者证明如果A与所有的Ai都不相交,那么A会包含在某个Ai中,这就导致了矛盾。因此,至少存在一个Ai,使得A与它至少有一个非空交集,从而推翻了最初的假设。这个论证过程强调了σ-algebra的基本性质,即它必须能够包含所有由原始元素生成的可数多个集合。 整个解答过程不仅展示了实分析中的逻辑推理和集合论的应用,还突出了理解抽象概念如σ-algebra在解决具体问题中的关键作用。通过阅读这本书的习题解答,读者不仅可以巩固理论知识,还能提高解决实际问题的能力,对于深入理解实分析的理论框架和实践应用具有重要意义。
资源详情
资源推荐
16 ABSTRACT INTEGRATION
2
13. Show that proposition 1.24(c) is also true when c = +∞.
Proof: We want to prove that if f ≥ 0 and c = +∞ (f is measurable), then
Z
E
cfdµ = c
Z
E
fdµ
In fact, since f is nonnegative measurable, so 0 ≤
R
X
fdµ always exists. If
R
X
fdµ = 0, then f ∈ L
1
(µ). According to Theorem 1.39 and ∀ E ∈ M, we
have
0 ≤
Z
E
fdµ ≤
Z
X
fdµ = 0
it follows that f = 0 a.e on X, then ∞f(x) = 0 a.e on X. Thanks to
Theorem 1.24(d), ∃ A ∈ M s.t. µ(A) = 0, ∞f(x) = 0 on X − A, and
R
X−A
∞f(x)dµ = 0.
Note that by Theorem 1.24(e), one has
R
A
∞·f(x)dµ =
R
A
f(x)∞dµ = 0.
Then,
Z
X
∞·f(x)dµ =
Z
X−A
∞·f(x)dµ +
Z
A
∞·f(x)dµ = 0 + 0 = 0 = ∞
Z
X
f(x)dµ
If 0 <
R
X
fdµ, using the facts {x : f(x) > 0} =
S
+∞
n=1
{x : f(x) ≥
1
n
} and
µ{x : f(x) > 0} > 0, there ∃ n s.t. µ{x : f(x) ≥
1
n
} > 0, so
Z
X
∞ · f(x)dµ ≥
Z
{x:f(x)≥
1
n
}
∞ · f(x)dµ = ∞µ{x : f(x) ≥
1
n
} = ∞.
Moreover, ∞ ·
R
X
fdµ = ∞. Hence we get
∞ ·
Z
X
fdµ =
Z
X
∞ · fdµ.
We obtain the desired conclusion. 2
CHAPTER
TWO
1. Let {f
n
} be a sequence of real nonnegative functions on R
1
, and consid-
ering the following four statements:
(a) If f
1
and f
2
are upper semicontinuous, then f
1
+ f
2
is upper semi-
continuous.
(b) If f
1
and f
2
are lower semicontinuous, then f
1
+ f
2
is lower semicon-
tinuous.
(c) If each f
n
are upper semicontinuous, then
P
∞
1
f
n
is upper semicon-
tinuous.
(d) If each f
n
are lower semicontinuous, then
P
∞
1
f
n
is lower semicontin-
uous.
Show that three of these are true and that one is false. What happens
if the word nonnegative is omitted? Is the truth of the statements affected if
R
1
is replaced by a general topological space?
Proof: We first state a proposition and give its proof.
Proposition : f is lower semicontinuous on X ⇔ ∀ x
0
∈ X, ∀ ε > 0, s.t.
{x : f(x) > f(x
0
) − ε} is open set ⇔ ∀ x
0
∈ X, ∀ ε > 0, s.t. open set
B(x
0
) ⊂ {x : f(x) > f(x
0
) − ε}, x
0
∈ B(x
0
).
Proof of Proposition: We begin to prove the first ⇔. In fact, if f is lower
semicontinuous on X, then by definition ∀ a ∈ R
1
, {x : f(x) > a} is open,
especially one can take a = f(x
0
)−ε ∈ R
1
, then {x : f(x) > f(x
0
)−ε} is open
set. On the other hand, ∀ a ∈ R
1
, if {x : f(x) > a} = φ, then {x : f(x) > a}
is open. If {x : f(x) > a} 6= φ, we know ∃ x
0
∈ {x : f(x) > a}, obviously
f(x
0
) − a = ε > 0, note also
{x : f(x) > a} = {x : f(x) > f(x
0
) − (f(x
0
) − a)}
17
18 POSITIVE BOREL MEASURES
is open, we get f is lower semicontinuous on X.
As for the the second ⇔, the ⇒ is obvious and we only need to prove
the part ⇐. If y
0
∈ {x : f(x) > f(x
0
) − ε}, using the condition, ∃ open
set B(y
0
) ⊂ {x : f(x) > f(y
0
) − [f(y
0
) − (f(x
0
) − ε)]}, i.e. ∃ open set
B(y
0
) ⊂ {x : f(x) > f(x
0
) − ε}, so {x : f(x) > f(x
0
) − ε} is open set,
according to the above result we get f is lower semicontinuous on X.
(b) is true. In fact, if f
1
and f
2
are l.s.c, then ∀ x
0
∈ X, ∀ ε > 0,
∃ open sets V and W , x
0
∈ V ∩ W , s.t. V ⊂ {x : f
1
(x) > f
1
(x
0
) −
ε
2
},
W ⊂ {x : f
2
(x) > f
2
(x
0
) −
ε
2
}. Note V ∩ W is also open, x
0
∈ V ∩ W , then
V ∩ W ⊂ {x : f
1
(x) > f
1
(x
0
) −
ε
2
} ∩ {x : f
2
(x) > f
2
(x
0
) −
ε
2
}
⊂ {x : f
1
(x) + f
2
(x) > f
1
(x
0
) + f
2
(x
0
) − ε}
According to the above proposition, we conclude that f
1
+ f
2
is l.s.c. In an
analogous way, we can prove that (a) is true. Moreover we must notice that
(a) and (b) hold without the hypothesis that f
1
and f
2
are nonnegative.
(d) is true. Set S
n
(x) =
P
n
i=1
f
i
, since f
i
is l.s.c, according to (b), S
n
is
l.s.c on X, so ∀ a ∈ R
1
, {x : S
n
(x) ≤ a} = X − {x : S
n
(x) > a} is closed set,
then g(x) =
P
∞
i=1
f
i
(x) = lim
n→∞
S
n
(x) always exists. The following is well
known: g(x) : X → [0, ∞], g(x) l.s.c on X ⇔ ∀ a ∈ R
1
, {x : g(x) ≤ a} is a
closed set. We will show that
{x : g(x) ≤ a} =
+∞
\
n=1
{x : S
n
(x) ≤ a}
On one hand, ∀ x
0
∈ {x : g(x) ≤ a}, then a ≥ g(x
0
) = lim
n→∞
S
n
(x
0
) ≥
S
m
(x
0
), ∀ m ∈ N, since f
i
≥ 0. So ∀ m ∈ N, one has x
0
∈ {x : S
m
(x) ≤ a},
then x
0
∈
T
+∞
n=1
{x : S
n
(x) ≤ a}.
On the other hand, if x
0
∈
T
+∞
n=1
{x : S
n
(x) ≤ a}, we get ∀ n, S
n
(x
0
) ≤ a,
hence g(x
0
) = lim
n→∞
S
n
(x
0
) ≤ a, x
0
∈ {x : g(x) ≤ a}. Thus {x : g(x) ≤
a} =
T
+∞
n=1
{x : S
n
(x) ≤ a}. Note that {x : S
n
(x) ≤ a} is closed, then
{x : g(x) ≤ a} is closed, which entails
P
∞
1
f
n
is lower semicontinuous.
If f
n
≤ 0, u.s.c on X, then −f
n
≥ 0 l.s.c on X. hence
P
+∞
n=1
(−f
n
) =
−
P
+∞
n=1
f
n
l.s.c, then
P
+∞
n=1
f
n
u.s.c.
(c) is false. If f
n
≥ 0 u.s.c, g(x) =
P
+∞
n=1
f
n
(x). Note that g(x) u.s.c ⇔ ∀
REAL AND COMPLEX ANALYSIS 19
a ∈ R
1
, {x : g(x) ≥ a} is a closed set. It is readily to show that f : R
n
→ R
1
u.s.c ⇔ ∀ x
0
∈ R
n
, lim sup
x→x
0
f(x) ≤ f(x
0
), where
lim sup
x→x
0
f(x) = inf
δ>0
sup
0<|x−x
0
|<δ
f(x) = lim
δ>0
sup
0<|x−x
0
|<δ
f(x)
If
P
+∞
n=1
f
n
(x) convergences uniformly on R
1
, then ∀ x
0
∈ R
1
, x
m
→ x
0
but
x
m
6= x
0
, we want to prove that
lim sup
m→+∞
+∞
X
n=1
f
n
(x
m
) ≤
+∞
X
n=1
lim sup
m→+∞
f
n
(x
m
) ≤
+∞
X
n=1
f
n
(x
0
)
Set {x
m
} ⊂ {x : g(x) ≥ a}, x
m
→ x
0
. If for some m, x
m
= x
0
holds, then
x
0
∈ {x : g(x) ≥ a}. If x
m
6= x
0
, ∀ m, then a ≤ g(x
m
) and hence
a ≤ lim sup
m→+∞
g(x
m
) ≤
+∞
X
n=1
lim sup
m→+∞
f
n
(x
m
) ≤
+∞
X
n=1
f
n
(x
0
) = g(x
0
)
since f
n
u.s.c, we see x
0
∈ {x : g(x) ≥ a}, so {x : g(x) ≥ a} is closed and g
is u.s.c.
Let f
n
(x) = χ
[
1
n+1
,
1
n
]
(x), n = 1, 2, ..., then [
1
n+1
,
1
n
] is the closed set in R
1
and f
n
is u.s.c. Note that
g(x) =
+∞
X
n=1
f
n
(x) =
1, if x = 1
2, if x =
1
k
, k = 2, 3, ...,,
1, if
1
k+1
< x <
1
k
, k = 1, 2, 3, ..,
0, otherwise.
we have
{x : g(x) ≥ 2} = {x : g(x) = 2} =
+∞
[
k=1
{
1
k
} = {1,
1
2
,
1
3
, ···} , A.
It is obvious that A is not closed beacuse the limit point 0 is not in A. So
P
+∞
n=1
f
n
(x) is not u.s.c and we conclude that (c) is false in general.
Note (a) (b) (d) are true if R
1
is replaced by a general topological space
X. Moreover, (a) and (b) also hold without the condition that f
1
and f
2
are
nonnegative. Since f is L ·S ·C ⇔ −f is U ·S ·C, we can explain the result
in (d) is not true without the hypothesis f
i
≥ 0 by the inverse example given
in (c). In fact, set f
n
(x) = −χ
[
1
n+1
,
1
n
]
(x), n = 1, 2, ..., then χ
[
1
n+1
,
1
n
]
U ·S ·C ⇒
20 POSITIVE BOREL MEASURES
f
n
is L · S ·C. If
+∞
X
n=1
f
n
(x) = −
+∞
X
n=1
χ
[
1
n+1
,
1
n
]
(x) = −g(x)
(see the notation in (c)) is l.s.c , then g(x) is u.s.c, according to the inverse
example in (c), g is not u.s.c, hence
P
+∞
n=1
f
n
(x) is not l.s.c.
Remark:(b)can be also proved by writing {x; f
1
+ f
2
> a} =
S
({x; f
1
>
r
i
}
T
{x; f
1
> a−r
i
}),where r
1
, r
2
, ··· , is an enumeration of rational numbers.
To prove (d),conclusion 2.8(c) can be applied directly to collection S
n
(x)
∞
n=1
.
Here gives another counterexample of (c) which is left the reader to verify
by oneself:Let f
n
= χ
[
1
n
,1−
1
n
]
and g(x) = Σf
n
(x) 2
2. Let f be arbitrary complex function on R
1
, and define
ϕ(x, δ) = sup{|f(s) − f(t)| : s, t ∈ (x − δ, x + δ)},
ϕ(x) = inf{ϕ(x, δ) : δ > 0}
Prove that ϕ is upper semicontinuous, that f is continuous at a point x if
and only if ϕ(x) = 0, and hence that the set of points of continuity of an
arbitrary complex function is a G
δ
.
Formulate and prove an analogous statement for general topological s-
paces in place of R
1
.
Proof: We prove this for an arbitrary function on metric space (X, d) first.
Let f : X → Y ((Y, ρ) is metric space), ϕ(x, δ) = sup{ρ(f(s), f(t)), s, t ∈
B
δ
(x)}, where B
δ
(x) = {y ∈ X : d(x, y) < δ}, ϕ(x) = inf{ϕ(x, δ) : δ > 0}.
(1) ϕ(x) is upper semicontinous on X.
∀ a ∈ R
1
, we show that {x : ϕ(x) < a} is an open set. In fact, ∀
x
0
∈ {x : ϕ(x) < a}, ∃ δ
0
= δ(x
0
, a) > 0 s.t. ϕ(x
0
, δ
0
) < a. For any
y ∈ B(x
0
,
δ
0
2
), B(y,
δ
0
2
) ⊂ B(x
0
, δ
0
), by triangle inequality we have ϕ(y) ≤
ϕ(y,
δ
0
2
) ≤ ϕ(x
0
, δ
0
) < a and B(y,
δ
0
2
) ⊂ {x : ϕ(x) < a}, which implies that
{x : ϕ(x) < a} is open and ϕ is upper semicontinous on X.
(2) f(x) is continuous at x
0
if and only if ϕ(x
0
) = 0.
On one hand, if f(x) is continuous at x
0
, then ∀ ε > 0 ∃ δ = δ(x
0
, ε),
剩余255页未读,继续阅读
juney2009
- 粉丝: 1
- 资源: 2
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- JDK 17 Linux版本压缩包解压与安装指南
- C++/Qt飞行模拟器教员控制台系统源码发布
- TensorFlow深度学习实践:CNN在MNIST数据集上的应用
- 鸿蒙驱动HCIA资料整理-培训教材与开发者指南
- 凯撒Java版SaaS OA协同办公软件v2.0特性解析
- AutoCAD二次开发中文指南下载 - C#编程深入解析
- C语言冒泡排序算法实现详解
- Pointofix截屏:轻松实现高效截图体验
- Matlab实现SVM数据分类与预测教程
- 基于JSP+SQL的网站流量统计管理系统设计与实现
- C语言实现删除字符中重复项的方法与技巧
- e-sqlcipher.dll动态链接库的作用与应用
- 浙江工业大学自考网站开发与继续教育官网模板设计
- STM32 103C8T6 OLED 显示程序实现指南
- 高效压缩技术:删除重复字符压缩包
- JSP+SQL智能交通管理系统:违章处理与交通效率提升
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功