The lecture recalls set theory and topology, and then begins real analysis with measurable spaces.
Recap of set theory#
The recap follows Hrbacek and Jech. Its aim is to distinguish between sets with infinitely many elements.
Notation. A⊂B means that A is contained in B or equal to it, while A⊊B means that A is strictly contained in B.
Cardinality#
Definition 1.1 (Comparison of cardinalities). Let X and Y be sets. We write #X≤#Y, and say that the cardinality of X is less than or equal to the cardinality of Y, if there exists an injective map f:X→Y. We write #X=#Y if there exists a bijective map f:X→Y. Finally, #X<#Y means that #X≤#Y and #X=#Y.
Definition 1.3 (Countable and uncountable sets). Let X be a set.
(i) X is countable if X is finite or #X=#N.
(ii) X is uncountable if X is infinite but #N<#X.
Example 1.4. The natural numbers, the integers and the rationals have the same cardinality, #N=#Z=#Q, so Z and Q are countable. The real line is uncountable: #R>#N.
Definition 1.5. Define the set
R=[−∞,+∞]:=R∪{+∞}∪{−∞},
with the following operations in R:
a∈Ra>0a<0⟹a+∞=+∞,a−∞=−∞,⟹a⋅(+∞)=+∞,a⋅(−∞)=−∞,⟹a⋅(+∞)=−∞,a⋅(−∞)=+∞,⟹0⋅(+∞)=0⋅(−∞)=0.
The power set#
Definition 1.6 (Power set). Let X be a set. The power set of X is the family of all subsets of X,
P(X)={A:A⊂X}.
Notation. For a set X, 2X is the set of all functions from X to the set with 2 elements {0,1}:
2X:={f:X→{0,1}}.
Proposition 1.8. Let X be a set.
(i) #P(X)=#2X.
(ii) #P(X)>#X. In particular, there exists no biggest infinity.
Proof (complete). (i) Define
ϕ:P(X)AfA(x)→2X,↦fA:X→{0,1},:={10x∈A,x∈/A.
The map ϕ is a bijection.
(ii) Suppose, by contradiction, that #P(X)≤#X. By Remark 1.2 (i), applied to the nonempty set P(X), there exists a surjective map f:X→P(X). Define
U:={x∈X:x∈/f(x)}⊂X.
Since f is surjective, there exists y∈X with f(y)=U. Is y∈U?
Case 1. If y∈U, then y∈/f(y) by the definition of U, and f(y)=U gives y∈/U, which is impossible.
Case 2. If y∈/U=f(y), then y∈U by the definition of U, which is impossible.
Hence #P(X)≤#X is false. To see that this gives #P(X)>#X, note that x↦{x} is injective, so #X≤#P(X), and #X=#P(X) would give #P(X)≤#X. ■
Countable sets#
Notation. A countable union is written ⋃n=0∞Xn, also ⋃nXn. A sequence is written (xn), and a family of sets is written F={Xα}α∈A.
Proposition 1.9. (i) #R=#P(N)>#N.
(ii) If X and Y are countable, then X×Y={(x,y):x∈X,y∈Y} is countable.
(iii) If X0,X1,X2,… is a sequence of sets such that Xn is countable for every n, then ⋃n=0∞Xn is countable: a countable union of countable sets is countable.
Recap of topology#
The recap follows Manetti. Topology gives an abstract theory of the open, closed and related subsets of some ambient space.
Topological spaces#
Definition 1.10 (Topology). Let X be a set. A topology on X is a family of subsets τ⊂P(X) such that:
(i) ∅,X∈τ;
(ii) for every F={Uα}α∈A⊂τ, the union ⋃α∈AUα belongs to τ;
(iii) if U1,U2,…,Uk∈τ, then ⋂n=1kUn∈τ.
The sets in τ are called open, and the couple (X,τ) is called a topological space.
Example 1.11. On Rn the Euclidean topology τE is defined as follows. We say that U∈τE if for every x∈U there exists r>0 with Br(x)⊂U. Here Br(x) is the open ball of centre x and radius r. Two other topologies on Rn are τ={∅,Rn} and τ=P(Rn).
Definition 1.12 (Closed set, closure, interior, boundary). Let (X,τ) be a topological space. A set V⊂X is closed if X∖V is open. For V⊂X:
(i) the closure V of V is the smallest closed set containing V;
(ii) the interior int(V)=V˚ of V is the biggest open set contained in V;
(iii) the boundary of V is ∂V=V∩X∖V.
Definition 1.13 (Compact set). Let (X,τ) be a topological space and K⊂X. The set K is compact if for every F={Uα}α∈A⊂τ such that ⋃α∈AUα⊃K there exists a finite subfamily F~={V1,…,Vm}⊂F such that ⋃n=1mVn⊃K.
Figure 1.1. K is a triangle, the disks are open sets whose union contains K, and a finite subfamily is then highlighted whose union still contains K. The button draws a new family.
Definition 1.14 (Precompact set). A set V⊂X is precompact if V is compact.
Theorem 1.15 (Heine–Borel). A set K⊂Rn is compact if and only if K is closed and bounded.
Example 1.16 (Topology on R). The following subsets of R are open in R: the intervals (a,b) with a,b∈R; every set that is open in R, which is also defined to be open in R; and the sets [−∞,a) and (a,+∞] for every a∈R, which are also defined to be open.
Definition 1.17 (Continuous map). Let (X,τX) and (Y,τY) be two topological spaces and f:X→Y. The map f is continuous if f−1(A)∈τX for every A∈τY, that is, if the preimage of any open set is open.
Metric spaces#
Definition 1.18 (Metric space). A metric space is a couple (X,d) where X is a set and d is a distance on X, that is, a function d:X×X→[0,+∞) such that, for all x,y,z∈X,
d(x,y)=0⟺x=y,d(x,y)=d(y,x),d(x,y)≤d(x,z)+d(z,y).
Definition 1.19 (Topology induced by a distance). Let (X,d) be a metric space. For x∈X and r>0, define
Br(x):={y∈X:d(x,y)<r}.
A set U in X is open if for every x∈U there exists r>0 such that Br(x)⊂U. These open sets form the topology induced by the distance d.
Figure 1.2. An open set U of the plane with the Euclidean distance, its edge dashed because it does not belong to U, and a ball Br(x) contained in U around a moving point x.
A sequence (xn)⊂X converges to x0∈X, written xn→x0, if limn→∞d(xn,x0)=0.
Lemma 1.20. Let (X,d) be a metric space.
(i) A set V⊂X is closed if and only if V is sequentially closed: if (xn)⊂V and xn→x0, then x0∈V.
(ii) A set K⊂X is compact if and only if K is sequentially compact: every (xn)⊂K has a subsequence (xnk) such that xnk→x0∈K.
(iii) If V is closed, K is compact and V⊂K, then V is compact.
Figure 1.3. Lemma 1.20 (i): a closed set V, its edge solid because it belongs to V, and a sequence of points of V that converges to x0. The limit x0 lies in V.
Lemma 1.21. Let (X,dX) and (Y,dY) be two metric spaces and f:X→Y. The following are equivalent.
(i) f is continuous.
(ii) For every x0∈X and every ε>0 there exists δ>0 such that dX(x,x0)<δ implies dY(f(x),f(x0))<ε.
(iii) For every x0∈X and every (xn)⊂X with xn→x0, that is, dX(xn,x0)→0, the sequence (f(xn))⊂Y is such that f(xn)→f(x0), that is, dY(f(xn),f(x0))→0.
Measurable spaces#
Real analysis begins here, following Folland.
σ-algebras#
Definition 1.22 (σ-algebra, measurable space). Let X be a set. A measurable space is a couple (X,M) where M is a σ-algebra, that is:
(i) M⊂P(X);
(ii) ∅∈M;
(iii) for every A∈M, X∖A∈M;
(iv) for every (An)⊂M, ⋃nAn∈M.
Example 1.23. For every set X, P(X) and M={∅,X} are σ-algebras. Most of the times a topology is not a σ-algebra, for example the Euclidean topology.
Proof (sketch). Intersections are written through complements and unions:
E∩F=X∖(X∖(E∩F))=X∖((X∖E)∪(X∖F)).■
Definition 1.25 (Restricted σ-algebra). Let (X,M) be a measurable space and Ω⊂X. The restricted σ-algebra is
MΩ=M∣Ω:={E∩Ω:E∈M}.
One checks that (Ω,MΩ) is a measurable space. Indeed, ∅=∅∩Ω, Ω∖(E∩Ω)=(X∖E)∩Ω and ⋃n(En∩Ω)=(⋃nEn)∩Ω.
Generated and Borel σ-algebras#
Theorem 1.26 (Generation of σ-algebras). Let X be a set and F⊂P(X). There exists a σ-algebra M on X such that:
(i) F⊂M;
(ii) for every σ-algebra Q on X with F⊂Q, M⊂Q.
In words, M is the smallest σ-algebra containing F. It is denoted σ0(F).
Proof (sketch). Consider
W:={Q⊂P(X):Q is a σ-algebra, F⊂Q}.
Then W=∅, as P(X)∈W. Define
M:=⋂{Q:Q∈W}.■
Definition 1.27 (Borel σ-algebra). Let (X,τ) be a topological space. The Borel σ-algebra is σ0(τ), denoted B(X).
B(R)=σ0({open sets})=σ0({(a,b):a<b})=σ0({[a,b]:a<b})=σ0({(a,+∞):a∈R}).
Similarly,
B(R)B(RN)=σ0({(a,+∞]:a∈R}),=σ0({open rectangles}),
where an open rectangle is a set (a1,b1)×(a2,b2)×⋯×(aN,bN).