Hi! I am Jianzhi from Singapore, currently an undergraduate studying CS and Mathematics at UC Berkeley.
Notes from Own Readings
1. Axioms of Measurable Sets
Every open set in Rn is measurable. Every closed set in Rn is measurable.
If Ω is measurable, then Rn\Ω is also measurable.
[Boolean algebra property] If (Ωj) is any finite collection of measurable sets, then the union and intersection are measurable.
[σ-algebra property] If (Ωj) is any countable collection of measurable sets, then the union and intersection are measurable.
[Empty set] The empty set ϕ has measure 0
[Positivity] For every measurable set Ω, 0≤m(Ω)≤+∞
[Monotonicity] If A,B measurable and A⊂B, then m(A)≤m(B)
[Finite sub-additivity]
[Finite additivity]
[Countable sub-additivity]
[Countable additivity]
[Normalization] The unit cube [0,1]n has measure m([0,1]n)=1
[Translational invariance] If Ω measurable set, m(x+Ω)=m(Ω).
2. Properties of Outer Measure
[Empty set] The empty set ϕ has measure 0
[Positivity] For every measurable set Ω, 0≤m∗(Ω)≤+∞
[Monotonicity]
[Finite sub-additivity]
[Countable sub-additivity]
[Translational invariance]
Definitions (Lebesgue)
0. [Open box] An open box in Rn is any set of the form B=Π(ai,bi). Define volume of the box to be vol(B)=Π(bi−ai)
1, [Outer measure] Let Ω⊂Rn, then
m∗(Ω)=inf{i∑∣Bi∣,Ω⊂i⋃Bi,Bi⊂Rn open boxes}
The nice thing about outer measure is that it is defined for any set, not just measurable ones.
2. [σ-algebra] A σ-algebra is a collection of sets that includes the empty set, is closed under complement and closed under countable union.
3. [Zero set] Say Z⊂Rn is a zero set if it has outer measure 0.
4. [Measurability] Let E be a subset of Rn. Say E is asurable if and only if ∀A⊂Rn, we have the identity m∗(A)=m∗(A∩E)+m∗(A\E). Denote its asure as mE=m∗E.
5. [Abstract outer measure] An abstract outer measure on M is a function ω:2M→[0,∞] that satisfies ω(ϕ)=0, ω is monotone, and ω is countably additive. Say a set E⊂M is measurable wrt ω if it satisfies (4) but with M instead of Rn.
6. [Measurable function] Let Ω⊂Rn be a measurable set. A function f:Ω→Rm is measurable if and only if f−1(V) is measurable for every open set V⊂Rm.
7. The collection M of measurable sets with respect to any outer measure on any set M is a σ-algebra and the outer measure restricted to this σ-algebra is countably additive. All zero sets are measurable and have no effect on measurability. In particular, asure has these properties.
Proof (written in my own words)
TODO
7.5 [Measure space] A measure space is a triple (M,M,μ) where M is a set, M is a σ-algebra of subsets of M and mu is a measure on M (i.e. μ:M→[0,∞]).
7.6 [Gδ set] A Gδ set is a countable intersection of open sets.
7.7 [Fσ set] A Fσ set is a countable union of closed sets.
Example: (just so that I can remember) In probability, M is the set of outcomes. M is the set of events (defined as the set of subsets of outcomes). P (the probability measure) is a measure.
7.8 [Inner measure] Inner measure can be thought of as a dual to outer measure. m∗(A)=sup{m(F):F closed,F⊂A}
7.9 [Hull] Denote the hull of A as HA: the Gδ set that achieves the infimum of the measure of open sets that contain A. The Gδ set is unique up to a measure zero set. (note that HAachieves the infimum)
7.10 [Kernel] Denote the kernel of A as KA: the Fσ set that achieves the supremum of the measure of closed sets that is contained in A. The Fσ set is unique up to a measure zero set. (note that KAachieves the supremum)
7.11 [Measure Theoretic Boundary] The measure theoretic boundary of A is δm(A)=HA\KA. A bounded subset of Rn is measurable if and only if m∗(A)=m∗(A) (i.e. m(δm(A))=0).
7.12 [Slice] Define the slice of E⊂Rn×Rk at x∈Rn to be Ex={y∈Rk:(x,y)∈E}
7.13 [Undergraph] The undergraph of f:R→[0,∞) is defined to be Uf={(x,y)∈R×[0,∞):0≤y<f(x)}. Intuitively, the positive region bounded between f(x) and the x-axis. Then f is asurable if Uf is measurable w.r.t. the planar asure, and denote the gral to be ∫f=m(Uf) (permit ∞).
7.135 [Completed Undergraph] The completed undergraph is just the undergraph plus the graph.
7.14 [grable] A function f is Lebesgue integrable if its integral is finite. Note by definition f must also be measurable.
7.15 [Lower and Upper Envelope Sequence] Let f:X→[0,∞) be a sequence of functions. Then define the lower and upper envelope sequences to be fn(x)=inf{fk(x):k≥n} and fˉn(x)=sup{fk(x):k≥n}. Permit fˉn(x)=∞.
8. [Simple function] Let Ω be a measurable subset of Rn and f:Ω→R. Say f is a simple function if the image f(Ω) is finite (i.e. ∃ a finite set {c1,…,cN} s.t. ∀x∈Ω, f(x)=ci for some 1≤i≤N).
9. [Lebesgue integral (of simple function)] Let Ω⊂Rn be a measurable set and f:Ω→R be a simple nonnegative function. Define the Lebesgue integral of f to be ∫Ωf=Σλ∈f(Ω);λ>0λm({x∈Ω∣f(x)=λ}).
10. [Majorization] Let f:Ω→R and g:Ω→R. Say fmajorizesg if and only if f(x)≥g(x)∀x∈Ω.
11. [Lebesgue integral (of nonnegative function)] Let Ω⊂Rn be a measurable set and f:Ω→[0,∞] be measurable and nonnegative. Define the Lebesgue integral of f to be ∫Ωf=sup{∫Ωs∣s simple, nonnegative and s.t. f majorizes s}.
Let T:M→M′ be a mapping between measure spaces (M,M,μ) and (M′,M′,μ′).
12. [Mesemorphism] Say T is a mesemorphism if ∀E∈M to TE∈M′. Intuitively, T sends a subset of M to a subset of M′.
13. [Meseomorphism] Say T is a meseomorphism if both T and T−1 are mesemorphisms. Intuitively, T is an invertible mapping between the measure spaces.
14. [Mesisometry] Say T is a mesisometry if T is a meseomorphism and μ′(TE)=μ(E)∀E∈M. Intuitively, besides preserving measure structures, T also preserves the measure. T can be thought of isomorphisms between measure spaces, similar to orthogonal transformation of vector spaces in Linear Algebra. Note: mesisometry may disrespect topology (Pugh Ex 6.19)
15. [Diffeomorphism] A mapping that preserves smooth structure.
16. [Isomorphism] A mapping that preserves algebraic structure.
17. [Homeomorphism] A mapping that preserves topological structure.
18. [Absolutely Integrable Functions] Let Ω be a measurable subset of Rn. A measurable function f:Ω→R is absolutely integrable if the integral ∫Ω∣f∣<∞. (i.e. is finite)
19. [Lebesgue integral]
Definitions (Multivariable)
[Norm of Operator] For A∈L(Rn,Rm), define its norm as ∥A∥:=supx:∥x∥≤1∥Ax∥. Hence ∥Ax∥≤∥A∥∥x∥
[k-surface in E] A k-surface in E is a continuously differentiable mapping Φ:D→E where D⊂Rk is compact. Say D is the parameter domain of Φ and denote its points as (u1,…,uk). (intuitively, a function with k arguments, defines a surface that is of dimensionk)
[∧] The ∧ means exterior product; can think of it as a cross product. Basically, there is a direction involved.
[k-form in E] Let E be an open set in Rn. A differential form of order k≥1 in E is a function ω:k-surface →R. Symbolically, ω=Σai1…ik(x)dxi1∧…∧dxik and ω(Φ)=∫Φω=∫DΣai1,…,ik(Φ(u))∂(u1,…,uk)∂(xi1,…,xik)du. (intuitively, it's the sum of functions coupled with the exterior product of k differentials)
u∈D⊂Rk, Φ(u)∈E⊂Rn
ai1,…,ik:E⊂Rn→R continuous; don't be scared about the index, they are just to say there are (kn) functions.
∂(u1,…,uk)∂(xi1,…,xik) is just the Jacobian
du means integrate over the u-cell
Intuitively, saying that for each infinitesimal volume in D, we take its value after being mapped to E, then weighted by the volume in E (that's what the Jacobian calculates).
[Properties of k-form]
∫Φcω=c∫Φω
∫Φω1+ω2=∫Φω1+∫Φω2
∫Φ−ω=−∫Φω
dxi∧dxj=−dxj∧dxi
dxi∧dxi=0
dxj1∧…∧dxjk=ϵ(j1,…,jk)dxJ (i.e. every k-form can be represented in terms of basic k-forms.
[Basic k-form] Say dxI=dxi1∧…∧dxik is a basic k-form in Rn if I={i1,…,ik} is an increasing tuple. (intuitively, this is just to standardize the permutations since due to the anti-commutative relation, most are the same)
[Standard Presentation of k-form] ω=ΣIbI(x)dxI where the summation is over all increasing k-index I.
[Product of basic k-forms] Suppose I={i1,…,ip} and J={j1,…,jq}, then the product of dxI and dxJ in Rn is dxI∧dxJ=dxi1∧…∧dxip∧dxj1∧…∧dxjq, a (p+q)-form in Rn.
[Multiplication of k-forms] Let ω=ΣIbI(x)dxI and λ=ΣJcJ(x)dxJ. Then ω∧λ=ΣI,JbI(x)cJ(x)dxI∧dxJ, a (p+q)-form in E.
[Differentiation] Let ω=ΣbI(x)dxI be the standard presentation of a k-form ω, and bI∈C′(E) for each increasing k-index I, then define dω=ΣI(dbI)∧dxI. (intuition: give a k-form, get back a k+1 form; as expected in differential analysis)
Example: 0-form f is just a real function. df=Σi=1n∂xi∂f(x)dxi
[Change of Variables] Let E⊂Rn be open, V⊂Rm be open and T:E→V. Let T(x)=(t1(x),t2(x),…,tm(x))=(y1,y2,…,ym)=y. Let ω=ΣIbI(y)dyI be a k-form in V, then the corresponding k-form in E is ωT=ΣIbI(T(x))dti1∧…∧dtik.
[Oriented affine k-simplex] σ=[p0,p1,…,pk] is the k-surface in Rn with parameter domain Qk given by σ(α1e1+…+αkek)=p0+Σi=1kαi(pi−p0). (intuitively, just the normal standard simplex, but defined somewhere else in space, can be distorted a bit)
σ(0)=p0
σ(ei)=pi
σ(u)=p0+Au where Aei=pi−p0
[Integration over a simplex] A zero simplex is just [p0]. Define ∫σf=ϵf(p0), where ϵ=±1 depending on the orientation of the simplex.
[Affine k-chain] An affine k-chainΓ in an open set E⊂Rn is a collection of finitely many oriented affine k-simplexes {σ1,…,σr} in E (need not be distinct; i.e. simplexes can occur with multiplicity). Write as Γ=σ1+…+σr. (Γ is still a k-surface)
[Integration of k-chain] Define ∫Γω=Σi=1r∫σiω (intuition: just sum over all the individual small simplexes)
[Boundary of affine k-simplex] For k≥1, the boundary of the oriented affine k-simplex σ=[p0,p1,…,pk] is defined to be the affine (k−1)-chain ∂σ=Σj=0k(−1)j[p0,p1,…,pj−1,pj+1,…,pk] (intuition: a solid becomes a surface; lowers dimension by 1)
[Differentiable simplex] Let T∈C“:E⊂Rn→V⊂Rm, not necessarily 1-1. Let σ be an oriented affine k-simplex in E. Say Φ=T∘σ is an oriented k-simplex of class C”. Note that Φ=T∘σ is a k-surface in V.
[Differentiable chain] Say Ψ is a k-chain of class C“ in V if it is a finite collection of oriented k-simplex Φ1, …, Φr of class C”. Write Ψ=ΣΦi. For k-form ω, define ∫Ψω=Σi=1r∫Φiω.
[Boundary of oriented k-simplex] ∂Φ=T(∂σ)
[Boundary of k-chain] ∂Ψ=Σ∂Φi
[Positively oriented boundaries]
For Qn (the standard simplex), let σ0 be the identity mapping with domain Qn. Then ∂σ0 (an affine (n−1)-chain) is the positively oriented boundary of set Qn.
For E=T(Qn), the positively oriented boundary of set E, denoted by ∂E, is the (n−1)-chain ∂T=T(∂σ0
For Ω=E1∪…∪Er where Ei=Ti(Qn) pairwise disjoint, then ∂Ω=∂T1+…+∂Tr is the positively oriented boundary of Ω.
Definitions (Fourier)
<in progress>
Theorems and Lemmas (Lebesgue)
1. [Tao 7.1.1]
2. [Tao 7.4.4] Properties of measurable sets
If E measurable, then Rn\E also measurable.
If E measurable and x∈Rn, then x+E measurable with m(x+E)=m(E).
If E1,E2 measurable, then union and intersection also measurable.
Similarly fo of measurable sets.
Every open box and every closed box is measurable.
Any set E with m∗(E)=0 is measurable.
3. [Pugh 2.5] The collection M of measurable sets wrt any other measure on any set M is a σ-algebra and the outer measure restricted to this σ-algebra is countably additive.
4. [Tao 7.5.2] Let Ω⊂Rn and f:Ω→Rm be continuous. Then f is measurable.
5. [Tao 7.5.3] f is measurable if and only if f−1(B) is measurable for every open box B.
Proof (I came up with this by myself; please forgive any errors)
By Lemma 7.4.10, every open set can be written as a countable or finite union of open boxes.
If ∀B open box, f−1(B) is measurable, then ∀V⊂Rm open, V can be expressed as the union of countab of boxes, say (Bn)n. Then, since f−1(B) are all measurable by assumption, the sequence of sets (f−1(Bn))n are all measurable, hence the union of all of these, which is exactly f−1(V), is measurable.
On the other hand, if f is measurable, then ∀V∈Rn, f−1(V) is measurable. Then simply just take V as any open box. ()
6. [Pugh 6.11] Each measurable set E can be sandwiched between an Fσ-set (say F) and a Gδ-set (say G) (i.e. F⊂E⊂G), such that m∗(G\F)=0 (i.e. G\F is a zero set). Conversely, if ∃G∈Gδ,F∈Fσ s.t. F⊂E⊂G, then E is measurable.
Corollary: A bounded subset E⊂Rn is measurable if and only if it has a regularity sandwich F⊂E⊂G s.t. F∈Fσ, G∈Gδ and m(E)=m(G).
Corollary: All measurable sets are Fσ-sets and Gδ sets modulo measure zero sets.
Proof of Unbounded Case
TODO
7. [Pugh 6.15] An affine motion T:Rn→Rn is a meseomorphism and multiplies measure by ∣det(T)∣.
8. If A⊂B where B is a box, then m(B)=m∗(A)+m∗(B\A).
9. If A⊂B⊂Rn and B is a box, then A is measurable if and only if it divides B cleanly (i.e. m(A)=m(A∩B)+m(A\B))
10. [Measurable Product Theorem] If A⊂Rn and B⊂Rk are measurable, then A×B is measurable and m(A×B)=m(A)⋅m(B). We treat 0⋅∞=0.
11. [Zero Slice Theorem] If E⊂Rn×Rk is measurable, then E is a zero set if and only if almost every slice of E is a (slice) zero set.
12. [Measure Continuity Theorem] Let ω be any outer measure. If {Ek} and {Fk} are sequences of measurable sets, then upward measure continuity yields Ek↑E⇒ω(Ek)↑ω(E); downward measure continuity yields Fk↓F and ω(F1)<∞⇒ω(Fk)↓ω(F). (Notation: Ek↑E means E1⊂E2⊂… and E=⋃Ek. Fk↓F means F1⊃F2⊃… and F=⋂Fk)
Proof TODO Key Idea Disjointize
Trinity of Theorems (MCT, DCT, FL)
12. [Monotone Convergence Theorem] Assume that (fn)n is a sequence of measurable functions with fn:R→[0,∞) and fn↑f as n→∞, then ∫fn↑∫f
PROOF TODO!!
12.1 [Corollary] If (fn)n is a sequence of integrable functions that converges monotonically downward to a limit function f almost everywhere, then ∫fn↓∫f.
5. [Monotone Convergence Theorem] Let Ω⊂Rn be a measurable set and (fn)n be a sequence of nonnegative measurable functions, where fi:Ω→R are increasing s.t. fi+1 majorizes fi. Then:
0≤∫Ωf1≤∫Ωf2≤…
∫Ωsupnfn=supn∫Ωfn
13. [Dominated Convergence Theorem] If ∀nfn:R→[0,∞) is a measurable functions such that (fn)n→f (what is a.e.) and if ∃g:R→[0,∞) whose integral is finite and is an upper bound ∀fn, then f is integrable and ∫fn→∫f as n→∞.
PROOF TODO!!
14. [Fatou's Lemma] Let Ω be a measurable set. If fn:R→[0,∞) is a sequence of nonnegative measurable functions then ∫lim inffn≤lim inf∫fn.
PROOF TODO!!
15. [Borel-Cantelli Lemma] Let Ω1,Ω2,…, be measurable subsets of Rn such that Σn=1∞m(Ωn) is finite. Then the set {x∈Rn:x∈Ωn for infinitely many n} is a set of measure 0. (i.e. almost every point belongs to only finitely many Ωn. (Proof: see below)
16. [Fubini] Let f:Rn→R be an absolutely integrable function. Then exists absolutely integrable functions F:R→R and G:R→R s.t. for almost every x, f(x,y) is absolutely integrable in y with F(x)=∫Rf(x,y)dy and for almost every y, f(x,y) is absolutely integrable in x with G(y)=∫Rf(x,y)dx. We also have: ∫RF(x)dx=∫R2f=∫RG(y)dy.
Theorems and Lemmas (Multivariable)
[Contraction Principle]
[Inverse Function Theorem]
[Implicit Function Theorem]
[Rank Theorem]
[Differentiation of Integrals]
[Primitive Mapping]
[Partitions of Unity]
[Change of Variables]
[Differential Forms]
[Uniqueness] Suppose ω=ΣIbI(x)dxI is the standard presentation of a k-form ω in an open set E⊂Rn. If ω=0 in E, then ∀I increasing k-index and ∀x∈E, bI(x)=0.
Proof: Assume on the contrary that ∃v∈E⊂Rn s.t. bJ(v)>0 for some increasing k-index J={j1,…,jk}.
Since bJ continuous (by definition of k-form), ∃h>0 s.t. for all x∈Rn s.t. ∣xi−vi∣<h, bJ(x)>0. (i.e. inside the cube of dimension 2h centered at v, bJ>0) Let D′⊂Rk s.t. u∈D′⇔∣ur∣≤h.
Define Φ:D′⊂Rk→Rn s.t. Φ(u)=v+Σr=1kurejr. (i.e. Φ is a k-surface in E with parameter domain D′ and bJ(Φ(u))>0∀u∈D′ since ∣(Φ(u))i−vi∣<h)
Note that ∫Φω=∫D′b{j1,…,jk}(Φ(u))u1,…,uk∂(xj1,…,xjk)du=∫D′bJ(Φ(u))det(I)du=∫D′bJ(Φ(u))du>0. Hence, contradiction! (since ∃ increasing J s.t. bJ(x)=0⇒ω=0 in E)
Let ω and λ be k- and m-forms of class C′ in E, then d(ω∧λ)=(dω)∧λ+(−1)kω∧dλ.
If ω is of class C′′ in E, then d2ω=0.
[Change of Variables] Let E⊂Rn be open, T be a C′-mapping of E into V⊂Rm open and ω,λ be k- and m-forms in V. Then:
(ω+λ)T=ωT+λT
(ω∧λ)T=ωT∧λT
d(ωT)=d(ω)T
Let ω be a k-form in open E⊂Rn, Φ be a k-surface in E (parameter domain D⊂Rk→E) and Δ be k-surface in Rk (parameter domain D⊂Rk→Rk) defined by Δ(u)=u (i.e. just maps the vector to itself). Then ∫Φω=∫ΔωΦ
Proof: Suffices to consider ω=a(x)dxi1∧…∧dxik, since if we can prove so, then every other term will be equal.
Note ωΦ=a(Φ(u))dϕi1∧dϕi2∧…∧dϕik.
Define α(p,q)=∂xq∂ϕip(u). Then dϕip=Σqα(p,q)duq. The k×k matrix with entries α(i,j) has determinant J(u)
[Composition Theorem] Note the name composition is made up by me. Suppose T is a continuous differentiable mapping of open E⊂Rn→V⊂Rm open. Let Φ be a k-surface in E (i.e. Φ:D⊂Rk→E⊂Rn) and thus TΦ is also a k-form but in V instead (TΦ:D⊂Rk→V⊂Rm). Let ω be a k-form in V. Then ∫TΦω=∫ΦωT.
Proof: ∫TΦω=∫ΔωTΦ=∫Δ(ωT)Φ=∫ΦωT
[Simplexes and Chains]
If σ is an oriented k-simplex in open E⊂Rn and if σˉ=ϵσ, then ∫σˉω=ϵ∫σω for every k-form ω in E.
Theorem: Let E⊂Rn×Rk be measurable. Denote by Ex:=E∩({x}×Rk)⊂{x}×Rk≈Rk. Let Z={x∈Rn:mRk(Ex)=0} be a measure 0 set in Rn. Then m(E)=0.
Proof: (I took down Prof Peng's proof in class and tried to fill in some missing steps which I didn't catch and some of my own commentary)
Let E~=E\(Z×Rk). Then, since m(Z×Rk)=0, so m(E~)=m(E), because these two differ by a measure 0 set. Suffices to show m(E~)=0.
WLOG, we can assume E in place of E~ with Z=ϕ. Hence, now, mRk(Ex)=0∀x (as Z=ϕ).
Assume E is bounded and n=1,k=1 (i.e. E⊂R×R). Further assume E⊂[0,1]2 (i.e. E is in the unit square; we make this because we can always scale our ϵ later).
Know mR(Ex)=0∀x. Want to show ∀ϵ>0,mR×R(E)<ϵ.
By inner-regularity of E (since E is measurable), we can always find closed K⊂E such that m(E\K)≤ϵ/2. Then, K is bounded, so K is compact. Also, mR×R(Kx)≤mR×R(Ex)=0 by monotonicity, hence mR×R(Kx)=0.
Claim: We can cover K by boxes of total volume (actually, area in this case since n=k=1) ≤ϵ/2
Proof of Claim:
∀x∈R, if Kx=ϕ, then we can find an open set V(x)∈R s.t. mR(V(x))≤ϵ/2 and V(x) contains Kx.
Lemma: ∃ an enlargementU(x)⊂R with x∈U(x) s.t. π−1(U(x))∩K⊂U(x)×V(x) (i.e. ∀x~∈U(x),Vx⊃Kx~). Note that here π:R2→R, so what the claim is saying is that we can always find an interval containing x such that the intersection of the vertical strip with K is entirely contained in the Cartesian product U(x)×V(x). Another way of putting it is: suppose K is a potato. Then a slice with width as the orange interval across Rn in the direction of Rk cuts the potato. Then the potato strip is entirely contained in U(x)×V(x).
Proof of Lemma: Suppose not true, i.e. does not exist U(x)⊂R containing x with this property. That means for every interval (x−n1,x+n1),n∈Z containing x, ∃x~n∈(x−n1,x+n1) s.t. Kx~ is not strictly contained in V(x). Then ∃ a sequence (x~n,y~n)n∈K s.t. limn→∞x~n=x and y~n∈/V(x). Since this sequence exists in a compact set, ∃ a subsequence that converges, i.e. ∃(x~nk,y~nk)k∈K that converges to, say, (x,y)∈K. But y~n∈V(x)c⇒y∈V(x)c. (Contradiction! since by assumption Kx∈V(x), so y∈V(x))
Thus, ∀x∈R, ∃V(x)⊃Kx s.t. V(x) is open and mR(V(x))<ϵ/2. Also, ∃U(x)⊂R containing x s.t. U(x)×V(x)⊃π−1(U(x))∩K.
Hence, K⊂⋃x∈R(V(x)×U(x)). Since K is compact, we can obtain a finite subcover by Heine-Borel theorem ⇒K⊂(V(x1)×U(x1))∪(V(x2)×U(x2))∪…∪(V(xN)×U(xN)), N∈N.
Now define Ui′=U(xi)\(⋃k=1i−1U(xk)). The motivation is to disjointize K. Then K⊂(V(x1)×U1′)⊔(V(x2)×U2′)⊔…⊔(V(xN)×UN′). This is possible because for any point x∈(V(x1)×U(x1))∪…∪(V(xN)×U(xN)), suppose x first appeared in (V(xi)×U(xi)) for some i, then x will only appear in (V(xi)×Ui′).
The union of Ui′ are contained in the unit interval. Hence, Σim(V(xi)×Ui′)=Σim(V(xi))×m(Ui′)≤2ϵΣim(Ui′)≤2ϵ. (The last inequality is due to the disjointness of Ui′). Hence m(K)<ϵ/2.
Finally, since we obtained m(K)<2ϵ, we have m(E)≤m(K)+m(E\K)=2ϵ+2ϵ=ϵ. Hence, m(E)=0 as desired.
Key Ideas: Approximate E from the inside by compact set K. Generate an open covering of K by slices along Rn in the direction of Rk such that these slices approximate K really well. Apply Heine-Borel and disjointness.
Monotone Convergence Theorem (Lecture 7) Proof
In progress
Dominated Convergence Theorem (Lecture 7) Proof
Theorem: Let (fn)n be a sequence of measurable functions with fn:R→[0,∞) and (fn)n→f almost everywhere. Suppose ∃g:R→[0,∞) s.t, ∣fn(x)∣≤g(x) almost everywhere and ∫g<∞. Then f is integrable and ∫fn→∫f as n→∞.
Proof: (in my own words)
Firstly, fnˉ≤g almost everywhere, thus U(fn)⊂U(g)⇒m(U(fn))≤m(U(g))=∫g<∞ by assumption. Hence, fn are all integrable, since m(U(fn))<∞.
Consider fn and fnˉ. Since (fn)n is a sequence of measurable functions that converges to f almost everywhere and fn+1≥fn (infimum of a smaller set), fn↑f. Similarly, (fnˉ)n is a sequence of measurable functions that converges to f almost everywhere and fn+1ˉ≤fnˉ (supremum of a smaller set), so fnˉ↓f.
Applying Monotone Convergence Theorem, ∫fn↑∫f and ∫fnˉ↓∫f.
We also have: U(fn)⊂U(fn)⊂U^(fnˉ).
This is because fn(x)=inf{fm(x):m≥n}≤fn(x), hence ∀(x,y)∈U(fn), (x,y)∈U(fn). Similarly, fnˉ(x)=sup{fm(x):m≥n}≥fn(x), hence ∀(x,y)∈U(fn), (x,y)∈U^(fnˉ).
Since U(fn)⊂U(fn)⊂U^(fnˉ) and ∫fn↑∫f and ∫fnˉ↓∫f, ∫fn→∫f.
Let E⊂Rn be measurable. For p∈Rn, define the density of E at p as: δ(p,E)=limQ↓pm(Q)m(E∩Q)
Q↓p denotes Q as a cube that shrinks down to p. I visualize it as a sequence of cubes (Qn)n s.t. p∈Qn∀n and limn→∞∣Qn∣=0. Note that the cubes need not be centered at p; see diagram below.
Define the lower densityδ(p,E)=lim infQ↓pm(Q)m(E∩Q).
Say p is a density point of E if p∈E and δ(p,E)=1. Pugh denoted the set of density points as dp(E).
Properties
0≤δ≤1
δ(p,E) exists ⇒∀ϵ>0, ∃l>0 s.t. if Q is a cube containing p with side length less than l, then ∣m(Q)m(E∩Q)−δ(p,E)∣<ϵ.
Suppose otherwise, then ∃ϵ>0 s.t. ∀i1 with i∈N, exists a cube Qi with side length less than i1 s.t. ∣m(Qi)m(E∩Qi)−δ(p,E)∣≥ϵ. Then, this sequence of cubes converge to p since the side length converges to 0, but limi→∞(m(Qi)m(E∩Qi)−δ(p,E))=0>ϵ. (contradiction!)
Theorem [Lebesgue Density]: If E is measurable, then almost every p∈E is a density point of E.
Examples:
Every interior point of E is a density point: Let p be an interior point. Then ∃r>0 s.t. Br(p)⊂E. Then, for all cube Q containing p with side l<2nr, Q⊂E. Hence m(Q)m(Q∩E)=m(Q)m(Q)=1⇒p is density point.
The irrationals: Let Qc denote the set of irrational numbers and p∈Qc. Then, for every cube Q s.t. p∈Q, m(Q)m(Q∩Qc)=m(Q)m(Q)−m(Q∩Q)=m(Q)m(Q)=1. Thus, every point is a density point.
Proof: WLOG, assume E is bounded (will justify this later, don't worry). Take a s.t. 0≤a<1 and consider Ea={p∈E∣δ(p,E)<a}. Want to show m∗(Ea)=0. (The reason why we use outer measure is because we do not know a priori that Ea is measurable.)
For every p∈Ea, δ(p,E)<a⇒ exists arbitrarily small cubes {Qα} in which m(Qαm(E∩Qα)<a. (This is the reason why Ea was constructed with strict inequality, otherwise we are unable to have strict inequality here.) Let S be the set of all such cubes ∀p. Then S is a Vitali covering of Ea, since ∀p∈Ea,∀r>0,∃Q∈S s.t. p∈Q⊂Br(p).
By Vitali Covering Lemma, for an arbitrarily chosen ϵ>0, we can select a countable collection Q1,Q2,Q3,… from S s.t.: (1) Qi∩Qj=ϕ for i=j, (2) m(⋃i=1∞m(Qi))=Σi=1∞m(Qi)≤m∗(Ea)+ϵ and (3) Ea\(⋃i=1∞Qi) is a null set.
Thus, we have the following: m∗(Ea)≤Σi=1∞m∗(Ea∩Qi)≤Σi=1∞m(E∩Qi)=Σi=1∞m(Qk)m(E∩Qk)⋅m(Qk)<aΣi=1∞m(Qi)≤a(m∗(Ea)+ϵ)
Note that in the above, the first inequality is due to sub-additivity of outer measure. The second is due to monotonicity of outer measure, where we used m∗(E∩Qi)=m(E∩Qi) since E∩Qi measurable.
Hence, m∗(Ea)<1−aaϵ⇒m∗(Ea)=0 since ϵ is chosen arbitrarily. We also demonstrated that Ea is in fact measurable, since it has outer measure 0.
Now consider the sequence (an)n where an=1−1/n. Then m(Ean)=0∀n as discussed above. Since Eai⊂Eai+1, the sequence (m(Ean))n converges m(⋃nEan) by upward measure continuity ⇒m(⋃nEan)=0.
Consider E\(⋃nEan). Then lim infQ↓pm(Q)m(E∩Q)=1⇒limQ↓pm(Q)m(E∩Q)=1⇒δ(p,E)=1∀p∈E\(⋃nEan). Thus, almost every point of E is a density point of E.
We assumed E is bounded, because we can always divide E into countable disjoint sets. Then, for each set, the measure of non-density points is 0, thus the union of all non-density points is also 0. Hence, almost all p∈E is a density point of E.
Corollary:
If E is measurable, then for almost every p∈Rn, we have: χE(p)=limQ↓pm(Q)m(E∩Q). Here χE(p) refers to the indicator function that returns 1 if p∈E and 0 else.
Proof:
From above, for almost every p∈E, we have limQ↓pm(Q)m(E∩Q)=1=χE(p). Since E measurable ⇒Ec measurable, for almost every p∈Ec, limQ↓pm(Q)m(Ec∩Q)=1. The measurability of E implies m(Q∩E)+m(Q∩Ec)=m(Q)⇒m(Q)m(Q∩E)+m(Q)m(Q∩Ec)=1. Hence, m(Q)m(Q∩E)=1−m(Q)m(Q∩Ec)=0=χE(p). And, we are done.
The General Stokes Formula Part I: Review (04/05 Class Presentation)
In this presentation, I will cover Stokes' Theorem including closed forms and exact forms. If I can present the following properly and well, I would be really satisfied.
Differential k-form: A function that takes in a k-dimensional surface and sends it to R.
It is of the form fi1,…,ikdxi1…dxik. In particular, it has k differentials.
(fi1,…,ikdxi1…dxik)(C)=∫Cfi1,…,ikdxi1…dxik i.e. evaluate this integral over the k-dimensional surface C∈Rn. You can think of fi1,…,ik as a weight function.
A k-cell in Rn is a smooth map ϕ:[0,1]k→Rn i.e. think of it as the transformation of the k-dimensional cube to n dimensional space.
We can now evaluate k-forms over k-cells via change of variables: (fi1,…,ikdxi1…dxik)(C)=∫Cfi1,…,ikdxi1…dxik=∫[0,1]kfi1,…,ik∂u∂ϕIdu=∫01…∫01fi1,…,ik∂(u1,…,uk)∂(ϕi1,…,ϕik)du1du2…duk
x=(x1,…,xk)∈Ik, y=(y1,…,yn)∈Rn. ϕ:[0,1]k→Rn is a k-cell in Rn. y=ϕ(x). ϕi(x)=ϕi(x1,…,xk)=yi.
Proposition [Pugh 37]: Each k-form ω has a unique expression as a sum of simple k-forms with ascending k-tuple indices, ω=ΣfAdyA.
Proof: For every k tuple (i1,…,ik), it can be arranged such that it ascends. Hence, existence is guaranteed.
Let A=(i1,…,ik) be ascending. Fix y∈Rn and L:Rk→Rn be s.t. L(u)=u1ei1+…+ukeik. For r>0, define function gr,y(u)=y+rL(u), i.e. gr,y sends [0,1]k to a k-dimensional cube of side length r at y.
k-form wedge product with l-form gives a (k+l)-form
Exterior derivative:
If f is k-form. Then df is (k+1)-form. Think of it as one more differential.
df=∂x1∂fdx1+…+∂xn∂fdxn
For a k-form ω=Σfi1,…,ikdyi1,…,ikdω=Σdfi1,…,ik∧dyi1,…,ik
Intuitively, it is how the coefficient fi1,…,ik changes.
Example d(fdx+gdy)=fydy∧dx+gxdx∧dy=(gx−fy)dx∧dyd(dΩ)=0∀ωk-form on Rn.
Pushforward and Pullback
Consider T:Rn→Rm be smooth. Then since ϕ:[0,1]k→Rn is a k-cell in Rn, we have an induced k-cell T∘ϕ:[0,1]k→Rm. This inducing function, we call it T∗:ϕ→T∘ϕ is a transformation of k-cells.
Pullback is the dual of pushforward. Let α be a k-form on Rm, then its pullback to Rn is a k-form on Rn, denoted by T∗(α) that sends each k-cell ϕ to α(T∘ϕ)
i.e. (T∗(α))(ϕ)=α(T∘ϕ)=α(T∗(ϕ))
The General Stokes Formula Part II: Mechanics (04/05 Class Presentation)
Definition: A k-chain is a linear combination of k-cells. i.e. Φ=Σj=1Najϕj, where ai∈R. ∫Φω=Σj=1Naj∫ϕjω (i.e. just integrate separately)
Definition: The boundary of a (k+1)-cell ϕ is the k-chain ∂ϕ=Σj=1k+1(−1)j+1(ϕ∘ij,1−ϕ∘ij,0), where ij,0(u1,…,uk)→(u1,…,uj−1,0,uj,…,uk) and ij,1(u1,…,uk)→(u1,…,uj−1,1,uj,…,uk)
Here, ij,0(u1,…,uk)=(u1,…,uj−1,0,uj,…,uk) and ij,1(u1,…,uk)=(u1,…,uj−1,1,uj,…,uk). They are k-cells in Rk+1 because they map the unit cube in Rk i.e. [0,1]k to Rk+1.
Geometrically, they map to the faces of the unit cube in Rk+1, which is why ∂ϕ is called the boundary.
Definition: The jth dipole of ϕ to be δjϕ=ϕ∘ij,1−ϕ∘ij,0, i.e. the jth term or the function representing the jth faces, so ∂ϕ=Σj=1k+1(−1)j+1δjϕ.
Claim: δjϕ is the pushforward of δji; i.e. δjϕ=ϕ∗(δji)
If ω is a (n−1)-form in Rn (i.e. taking k=n−1) and i:[0,1]n→Rn is the identity inclusion n-cell in Rn, then ∫idω=∫∂iω.
Proof:
Write ω=Σi=1nfi(x)dx1∧…∧dxi^∧…∧dxn in standard, ascending form (this is why ω can be written as the sum of n terms). The exterior derivative is then dω=Σi=1ndfi(x)∧dx1∧…∧dxi^∧…∧dxn=Σi=1n∂xi∂fidxi∧dx1∧…∧dxi^∧…∧dxn=Σi=1n(−1)i−1∂xi∂fidx1∧…∧dxn=(Σi=1n(−1)i−1∂xi∂fi)dx1∧…∧dxn.
Hence ∫idω=Σi=1n(−1)i−1∫[0,1]n∂xi∂fi⋅1⋅dx1…dxn. It's worth emphasizing that the Jacobian is the identity matrix since it is the inclusion map, so determinant is 1.
We have now settled one side of the equation. For the other side:
∫∂iω=∫Σj=1n(−1)j+1δjiω=Σj=1n(−1)j+1∫δjiω
Note that δji=i∘ij,1−i∘ij,0=ij,1−ij,0 and ij,0,ij,1:Rn−1→Rn
Then when we calculate the Jacobians: ∂(u1,…,un−1)∂(ij,0)x1,…,xi^,…,xn=1 if i=j and 0 otherwise. Similarly, ∂(u1,…,un−1)∂(ij,1)x1,…,xi^,…,xn=1 if i=j and 0 otherwise. This is because for the jth face (which is represented by the jth dipole), the jth coordinate is fixed at either 0 or 1. Deleting the ith component for i=j will still result in the jth component being constant, so Jacobian =0. Otherwise, since it is inclusion, the Jacobian is 1.
In the second last equality, we used the fundamental theorem of calculus to split up the difference of fj(u1,…,uj−1,1,uj,…,un−1)−fj(u1,…,uj−1,0,uj,…,un−1)=∫01∂y∂f(u1,…,uj−1,y,uj,…,un−1)dy where y refers to jth coordinate.
In the last equality, we used Fubini's Theorem i.e. order of integration in ordinary multiple integration is irrelevant. Also, y,u1,…,un−1 are just arbitrary variables that can be looked at as x1,…,xn
Hence, ∫∂iω=Σj=1n(−1)j−1∫δjiω=Σj=1n(−1)j−1∫01…∫01∂xj∂fjdx1…dxn=Σj=1n(−1)j−1∫[0,1]n∂xj∂fjdx1…dxn, exactly the same as what we've got before.
So, ∫∂iω=∫idω for cubes.
Stoke's Formula for General Cell: Let ω be a (n−1)-form in Rm and ϕ an n-cell in Rm, then ∫ϕdω=∫∂ϕω.
The first equality is because ϕ=ϕ∘i since i is the identity inclusion map from [0,1]n→Rn. Second equality follows from 43d since ∫T∘ϕα=∫ϕT∗(α). Third equality follows from 43c commutativity property of exterior derivative and pullback operator ϕ∗dω=dϕ∗ω. The fourth equality follows from Stoke's Formula for Cubes. The fifth equality follows from duality equation T∗(α)(ϕ)=α(T∗(ϕ)), so ∫ϕT∗α=∫T∗(ϕ)α.
The final equality follows from the fact that ϕ∗(δi)=ϕ∗(Σj=1k+1(−1)j+1(i∘ii,1−i∘ii,0))=ϕ∗(Σj=1k+1(−1)j+1(ij,1−ij,0))=ϕ∘(Σj=1k+1(−1)j+1(ij,1−ij,0))=Σj=1k+1(−1)j+1(ϕ∘ij,1−ϕ∘ij,0)=∂ϕ
Stoke's Formula for Manifolds: Let ω be a (m−1)-form in Rn and M⊂Rn divides into m-cells diffeomorphic to [0,1]m and its boundary divides into (m−1)-cells diffeomorphic to [0,1]m−1, then ∫Mdω=∫∂Mω.
The General Stokes Formula Part III: Applications (04/05 Class Presentation)
Stoke's Theorem: ∫Mdω=∫∂Mω
Fundamental Theorem of Calculus
Take M=[a,b]⊂R and ω=f (i.e. a zero-form). Then ∫∂Mω=f(b)−f(a) (since it is the evaluation of f on the boundaries of M which is just {a,b}). dω=f′dx. Hence, ∫Mdω=∫abf′(x)dx=f(b)−f(a) as we know from FTC.
Let f:R2→R be smooth. Then df=fxdx+fydy. Let M represent a path in R2 from point p to q (i.e. M is a 1-cell in R2), then ∂M=p,q. By Stoke's Theorem, ∫Mdf=∫∂Mf=f(q)−f(p). For any two paths, their boundaries are the same. Hence, we can say df=fxdx+fydy is path independent, which corresponds with what we know.
Green's Theorem
Take ω=fdx+gdy. Take M=D a region. Then ∂M=C, the curve bounding D. Then:
We call LHS the flux. Intuitively, it is a statement about the conservation of flow. For an surface, the total flow out of the surface (i.e. flux) is equal to the integral of the divergence (measure of source / sink) across the whole enclosed surface.
Stoke's Curl Theorem
Take ω=fdx+gdy+hdz and M=S (a surface), then ∂M=C a curve (the boundary of the surface).
∫Cfdx+gdy+hdz=∫∂Mω=∫Mdω=∫Sd(fdx+gdy+hdz)=∫Sfydy∧dx+fzdz∧dx+gxdx∧dy+gzdz∧dy+hxdx∧dz+hydy∧dz=∫S(hy−gz)dy∧dz+(fz−hx)dz∧dx+(gx−fy)dx∧dy as desired.
Intuitively, it is saying that the line integral of a loop in a vector field is equal to the flux of the curl of the vector field through the enclosed surface.
The General Stokes Formula Part IV: Closed and Exact Forms (04/05 Class Presentation)
Definition: Say a k-form ω is closed if its exterior derivative is 0. (i.e. dω=0)
Definition: Say a k-form ω is exact if it is the exterior derivative of a (k−1)-form. (i.e. ∃α s.t. d(α)=ω)
Proposition: Every exact form is closed.
Proof: Let ω be an exact form, then ∃α s.t. d(α)=ω. Since d2=0, dω=d(d(α))=0 as desired.
Motivation: Exact always implies closed. But when does closed imply exact? When can we find an anti-derivative for a closed form ω? i.e. find an α s.t. ω=dα?
Ans: If forms are defined on Rn, then the answer is always, by Poincaré Lemma.
Poincaré Lemma: If ω is a closed k-form (k>0) on Rn, then it is exact.
Motivation: We can show for a k-form ω in Rn, we have an integral operator Lk such that (Lk+1d+dLk)(ω)=ω. Hence, if ω is closed, then dω=0, hence dLk(ω)=d(Lk(ω))=ω, so ω has an anti-derivative. Suffices to show the construction of such Lk.
Claim: ∃Lk that maps k-form on Rn to (k−1)-form on Rn with the property that ∀ω s.t. ω is a k-form, (Lk+1d+dLk)(ω)=ω.
If such function Lk exists, then since ω is closed, dω=0, so ω=(Lk+1d+dLk)(ω)=Lk+1dω+dLkω=d(Lkω), in particular, ω has an anti-derivative, so it is exact.
Proof of Claim:
Let β be a k-form on Rn+1 instead. Let (x,t) be the representation of a point in Rn+1, where x∈Rn and t∈R. Then β=Σi1,…,ikfi1,…,ikdxi1,…,ik+Σj1,…,jk−1dt∧dxj1,…,jk−1.
Then dβ=Σi1,…,ik,l∂xlfi1,…,ikdxl∧dxi1,…,ik+Σi1,…,ik∂t∂fi1,…,ikdt∧dxi1,…,ik+Σj1,…,jk−1,l∂xl∂gj1,…,jk−1dxl∧dt∧dxj1,…,jk−1 where 1≤l≤n.
Define operators N:Ωk(Rn+1)→Ωk−1(Rn) (i.e. N maps k-forms in Rn+1 to k−1-forms in Rn) as the following:
N(β)=Σj1,…,jn−1(∫01gj1,…,jn−1(x,t)dt)dxj1,…,jn−1 i.e. N is defined to ignore terms which dt doesn't appear. In the terms that dt appears, it integrates them and reduces the form by 1 differential. Here, β, a k-form in Rn+1 is reduced to a (k−1)-form in Rn.
The first term in dβ is ignore since it has no dt term. The second and third term contain dt, hence are integrated. The − sign appears due to the shifting of dt forward by one position.
In the last equality, we interchanged the integration and differentiation, because g is smooth so it and its partial derivatives are continuous.
Hence: (dN+Nd)(β)=Σi1,…,ik(∫01∂t∂fIdt)dxi1,…,ik=Σi1,…,ik(fi1,…,ik(x,1)−fi1,…,ik(x,0))dxi1,…,ik as desired, where the last inequality comes from the Fundamental Theorem of Calculus. (whew!)
Now we define the cone map ρ(x,t)=tx. ρ:Rn+1→Rn.
Claim: L=N∘ρ∗ is our desired construction i.e. (Ld+dL)ω=ω
Proof of Claim:
Ld+dL=Nρ∗d+dNρ∗=Ndρ∗+dNρ∗=(Nd+dN)ρ∗ where the second equality comes from the commutativity of ρ∗ (a pullback) and d.
=h(tx)((tdxi1+xi1dt)∧…∧(tdxik+xikdt))=h(tx)(tkdxi1,…,ik)+terms with dt
I'm not sure about the second equality. I think it's due to my lack of understanding of pushforward and pullback.
Hence (Nd+dN)∘ρ∗(hdxi1,…,ik)=(Nd+dN)(h(tx)(tkdxi1,…,ik)+terms with dt)=(Nd+dN)(h(tx)(tkdxi1,…,ik))=(h(1⋅x)1k−h(0⋅x)0k)dxi1,…,ik=hdxi1,…,ik.
Since L,d are linear, we have (Ld+dL)(ω)=ω, hence closed forms on Rn are exact. Reminder that L=N∘ρ∗.
I am very grateful to Professor Morgan Weiler for her YouTube video on Poincaré Lemma, in which she proved Poincaré Lemma inductively and helped me visualize the key steps in the proof: https://www.youtube.com/watch?v=C-LhZ9Tkc2g (she's also previously from Berkeley! )
The General Stokes Formula Part V: Final Touches (04/05 Class Presentation)
Corollary 47: If U diffeomorphic to Rn, then all exact forms on U are exact.
Proof of Corollary 47: Let T:U→Rn be a diffeomorphism and assume ω closed k-form on U.
Let α=(T−1)∗ω be a k-form on Rn. Since ω closed, dω=0, hence dα=d((T−1)∗ω)=(T−1)∗dω=(T−1)∗0=0, so α is closed. By Poincaré Lemma, ∃(k−1)-form μ in Rn with α=dμ.
Then dT∗μ=T∗dμ=T∗α=T∗∘(T−1)∗ω=(T−1∘T)∗ω=ω, hence ω has an antiderivative T∗μ.
Hence, ω is exact.
Corollary 48: Locally, closed forms defined on open subsets of Rn are exact.
Proof of Corollary 48: Locally, an open subset of Rn is diffeomorphic to Rn. (Why?)
Corollary 49: If U⊂Rn is open and star-like (in particular, if U is convex), then closed forms on U are exact. A starlike set U⊂Rn contains a point p s.t. the line segment from each q∈U to p lies in U.
Proof of Corollary 49: Every starlike open sets in Rn is diffeomorphic to Rn. (Why?)
Corollary 50: A smooth vector field F on R3 (or on an open set diffeomorphic to R3 is the gradient of a scalar function if and only if its curl is everywhere zero.
Proof of Corollary 50:
(⇐)
Let F=(f,g,h). Define ω=fdx+gdy+hdz. Then dω=fydy∧dx+fzdz∧dx+gxdx∧dy+gzdz∧dy+hxdx∧dz+hydy∧dz=(gx−fy)dx∧dy+(hy−gz)dy∧dz+(fz−hx)dz∧dx=0
The last equality follows since ∇×F=0, so gx−fy=0, hy−gz=0 and fz−hx=0. Hence, ω is closed and therefore exact, i.e. it has an antiderivative ϕ. Note ∇ϕ=ω⇔ϕxdx+ϕydy+ϕzdz=fdx+gdy+hdz, hence ∇ϕ=F as desired.
(⇒)
For completeness, let F=∇ϕ=[ϕx,ϕy,ϕz]T. Then ∇×F=[ϕzy−ϕyz,ϕxz−ϕzx,ϕyx−ϕxy]=0 where the last equality holds by equivalence of partial derivatives.
Corollary 51: A smooth vector field on R3 (or on an open set diffeomorphic to R3) has everywhere zero divergence iff it is the curl of some other vector field.
Proof of Corollary 51:
(⇐)
Let G=(A,B,C). Define ω=Ady∧dz+Bdz∧dx+Cdx∧dy. Since ∇⋅G=Ax+By+Cz=0, dω=Axdx∧dy∧dz+Bydy∧dz∧dx+Czdz∧dx∧dy=(Ax+By+Cz)dx∧dy∧dz=0, hence ω closed and therefore exact. Hence, exists anti-derivative α=fdx+gdy+hdz with dα=fydy∧dx+fzdz∧dx+gxdx∧dy+gzdz∧dy+hxdx∧dz+hydy∧dz=(gx−fy)dx∧dy+(hy−gz)dy∧dz+(fz−hx)dz∧dx=Ady∧dz+Bdz∧dx+Cdx∧dy=ω.
So, A=(hy−gz), B=(fz−hx) and C=(gx−fy). Define F=(f,g,h), then ∇×F=[hy−gz,fz−hx,gx−fy]T=G.
(⇒)
For completeness, let F=(f,g,h) and G=∇×F. Then G=[hy−gz,fz−hx,gx−fy]T so ∇⋅G=hyx−gzx+fzy−hxy+gxz−fyz=0.
FFT, Wavelet Transformation, Uncertainty Principle (The Last Presentation)
We start with developing further the theory of Fourier series for functions of a fixed period L, so as to (hopefully) motivate the Discrete Fourier Transform. Then, I will introduce FFT. If there is enough time, I will go through Wavelet Transform and Uncertainty Principle.
Fourier series for functions of fixed period L
A good example is to solve Tao 5.5.6.
Let L>0 and f:R→C be continuous, L-periodic. Define cn=L1∫[0,L]f(x)eL2πinxdx.
(a)
Define g(x)=f(Lx). Note that g(x)∈C(R/Z;C). Hence, by Fourier's Theorem, limN→∞∥g−Σn=−Nn=Ng^(n)en∥2=0⇒limN→∞∥g−Σn=−Nn=Ng^(n)en∥22=0⇒limN→∞∫[0,1]∣g(x)−Σn=−NNg^(n)en(x)∣2dx=0.
Applying a change of variable x→Lx, we have: ∫[0,1]∣g(x)−Σn=−NNg^(n)en(x)∣2dx=∫[0,L]∣g(Lx)−Σn=−NNg^(n)en(Lx)∣2Ldx=L1∫[0,L]∣f(x)−Σn=−NNg^(n)en(Lx)∣2dx
This is exactly what we want to show, that Σn=−∞∞cneL2πinx converges in L2 to f.
(b, c) Subsequently, the proof for these two parts are exactly similar to the proof in Tao with the change of variables.
Discrete Fourier Transform
The discrete Fourier transform (DFT) converts a sequence of N numbers (yj)j=0N−1=(y0,…,yN−1)∈C to a new sequence of N numbers c0,…,cN−1∈C, given by: ck=Σj=0N−1yjeN−2πijk
Think of (yj) as the values of a function or signal at equally spaced times x=0,…,N−1. The output ck encodes the amplitude and phase of eN2πikx. Key idea: approximate the signals by a linear combination of waves that has wavelength that are an integer factor of N i.e. all such waves has wavelength that are an integer
Normally, we know the wave equation as y(x)=cos(kx)+i⋅sin(kx)=eikx where k=λ2π is the wavenumber; λ is the wavelength.
Hence, the wave corresponding to ck, which is eN2πikx has wavenumber k=N2πik, thus it has a wavelength of λ=kN. Suffices to compute ck to find the coefficients of an approximation of the original signal (yj)j by a linear combination of the waves
For the encoding of signals, suffices to solve a system of linear equations. Hence, introduce the Vandermonde Matrix for roots of unity
Suffices to matrix multiply the Vandermonde matrix for roots of unity with the signal vector.
Remark: This problem is also equivalent to evaluating a polynomial at the roots of unity, the so-called changing from coefficient representation to value representation.
Fast Fourier Transform
A naive implementation of the Discrete Fourier Transform takes O(N2). However, Fast Fourier Transform performs it in O(NlogN) by exploiting the symmetry of the roots of unity.
An illustration of idea is: break down the polynomial into even and odd terms. We can recycle many computations. Use 1 and −1 as an example.
Inverse Fourier Transform
yj=N1Σk=0N−1ckeN2πijk
The trick here is to notice that the inverse matrix is just another Vandermonde matrix with ωˉ instead of ω.
Applications
Many applications come from the ability to encode a signal:
Digital files can be shrunk by eliminating contributions from the least important waves in the combination.
Comparing different sound files by comparing coefficients Xk of DFT.
De-noising radio waves
Wavelet Transformation and the Uncertainty Principle
The problem with Fourier Transform is that it produces a periodic function over the whole space. What if we just want a localized wave? This is so called a “wavelet”.
A function ψ:R→C∈L2(R (square integrable functions i.e. ∫−∞∞∣ψ∣2<∞) is said to be an orthonormal wavelet if it can be used to define a Hilbert basis.
The Heisenberg Uncertainty Principle from Physics states: ΔEΔt≥4πℏ. Translated to signal processing, that becomes ΔωΔt≥21. Intuitively, it means we cannot measure and clearly resolve both the frequency and the time to a very large degree.
k-surface in E: a C′ mapping from compact D⊂Rk→E⊂Rn.
k-form in E: a function :k-surface →R. Think of it as an integral of terms with k differentials. For each infinitesimal volume in D⊂Rk, map it to the point in E, take the value and weight it by the scaling of the volume.
Affine k-simplex: just a simplex but somewhere else in space. It's a k-surface in Rn with parameter domain Qk (the standard simplex)
Affine k-chain: a collection of simplexes
Motivation: why consider simplex? The partitioning of sets into simplexes is called triangulation, which plays important role in topology. Also, it allows for the introduction of boundaries.
Theorem [Stokes]: If Φ is a k-chain of class C“ in open set V⊂Rm and if ω is a (k−1)-form of class C′ in V, then ∫Ψdω=∫∂Ψω.
Remark: k=m=1 is Fundamental Theorem of Calculus. k=m=2 is Green's Theorem.
Proof (here we go):
Firstly, we perform some reductions. We know Ψ=ΣΦi and ∂Ψ=Σ∂Φi. Suffices to show ∫Φdω=∫∂Φω for every oriented k-simplex Φ of class C” in V. This is because then ∫Ψdω=Σi=1r∫Φidω=Σi=1r∫∂Φiω=∫∂Ψω (the middle equality is due to the result).
Fix an oriented k-simplex Φ and let σ=[0,e1,…,ek] be the oriented affine k-simplex with parameter domain Qk which is defined by the identity mapping. (?)
Do some work on LHS:
∫Tσdω=∫σ(dω)T=∫σd(ωT)
Do some work on RHS:
∫∂(Tσ)ω=∫T(∂σ)ω=∫∂σd(ωT)
Suffices to show:
∫σdλ=∫∂σλ for the special simplex and for every (k−1)-form λ of class C′ in E.
…
Definition [exact]: Let ω be a k-form in open set E⊂Rn. If there is a (k−1)-form λ∈E s.t. ω=dλ, then say ω is exact in E.
Definition [closed]: If ω is of class C′ and dω=0, then ω is closed.
Theorem: Suppose E⊂Rn convex and open, f∈C′(E), p∈Z s.t. 1≤p≤n and ∂xj∂f(x)=0 for p<j≤n,x∈E. Then, ∃F∈C′(E) s.t. ∂xp∂F(x)=f(x) and ∂xj∂F(x)=0 for p<j≤n,x∈E.
Proof:
Theorem [Poincare's Lemma]: If E⊂Rn convex and open, k≥1, ω is a k-form of class C′ in E and dω=0, then there is a (k−1)-form λ in E s.t. ω=dλ.
Closed forms are exact in convex sets.
Proof:
Theorem: Fix k with 1≤k≤n. Let E⊂Rn be an open set in which every closed k-form is exact. Let T be 1-1 C“-mapping of E onto open set U⊂Rn whose inverse S is of class C“. Then every closed k-form in U is exact in U.
Proof:
Summary of Lebesgue Theory (HW4)
Riemann integral of a function f is defined to be the upper Darboux integral (U(f)=inf{U(f,P)∣P partition of [a,b]}) or the lower Darboux integral (L(f)=sup{L(f,P)∣P partition of [a,b]}) (both should agree if the function is integrable). It relies heavily on the notion of a partition of an interval [a,b].
On the other hand, the al of a function f is defined to be the measure of the undergraph of f (i.e. m(U(f))). It relies heavily on the concept of measure and measurability.
I feel that Lebesgue's integral is more intuitive in defining integral, because unlike Riemann integral, it does not rely heavily on an axis. In Riemann integral, we will run into problem when we take the sup or inf over an interval on an axis, which may result in the upper and lower integrals disagreeing, but for gral, we can fundamentally only care about the region under the graph, so integrals like ∫f(x)dx=0 where f(x)=1∀x∈Q and f(x)=0 elsewhere can be defined.
I also feel that Lebesgue Theory is richer, so it feels more interesting.
Main Results of Lebesgue Measure Theory (HW6)
<to be updated after Spring Break, where I will do a formal compilation>
Littlewood's Three Principles (HW8)
First Principle [Regularity]: Every measurable set is nearly a finite sum of boxes. “Nearly” here means “except for an ϵ-set”.
Second Principle [Lusin's Theorem]: A measurable function is nearly continuous i.e. given any ϵ>0, we can discard an ϵ-set from its domain of definition and the result is a continuous function.
Third Principle: Every convergent sequence of measurable functions is nearly uniformly convergent i.e. except for an ϵ-set the convergence is uniform.
Egoroff's Theorem: Almost everywhere convergence implies nearly uniform convergence.
Tao Chapter 8 Problems and Solutions
Here I complete the proofs of several lemmas which Tao left as exercises. (Some of the proofs are presented by Prof Peng in class.)
Ex 8.1.1
If f and g are simple functions, their images are finite. Let the image of f be {c1,…,cN} and the image of g be {d1,…,dM}. Then the image of f+g is a subset of {ci+dj:1≤i≤N,1≤j≤M} which is finite, hence f+g is a simple function. Similarly, the set {c⋅c1,…,c⋅cN} is finite, so cf is also a simple function.
Ex 8.1.2
For each i∈{1,…,N}, consider the open interval Ii=(ci−ϵ,ci+ϵ). Then since f is measurable, f−1(Ii) is measurable. Denote Ei=f−1(Ii). Then, note that Ei∩Ej=ϕ for i=j, since if x∈Ei and x∈Ej implies f(x)=ci and f(x)=cj (contradiction!). Hence, the Eis are disjoint. Thus f=Σi=1NciχEi as desired.
Ex 8.1.3
Consider fn(x):=sup{2nj:j∈Z+∪{0},2nj≤min(f(x),2n)} (i.e. fn(x) is the greatest integer multiple of 2−n that does not exceed both f(x) or 2n. Clearly, fn are nonnegative and increasing (since the restriction on multiple of 2−n is relaxed as n increases). fn are also simple functions, s of possible values fn(x) can take on is a subset of {2nj:j∈Z∪{0},0≤j≤(2n)2} For each point x∈Ω, ∃N∈N s.t. 2N>f(x), hence n>N implies ∣f(x)−fn(x)∣=f(x)−fn(x)≤2−n. Hence, limn→∞∣f(x)−fn(x)∣=0 by squeeze lemma. Thus, exists a sequence of nonnegative, increasing functions (fn)n that converges pointwise to f.
Ex 8.2.1
(a') Note that 0 as a function minorizes f, hence 0≤∫Ωf≤∞. If f(x)=0 a.e., then for any simple function s majorized by f, if s=Σci1Ei for some ci>0, then Ei⊂Z where Z is a measure zero set (due to definition of almost everywhere). Hence Ei is a null set, and ∫Ωf=0. On the other hand, if ∫Ωf=0, then let En be the open pre-image of (n1,∞), n∈N. Then En is measurable (since f is measurable function). Thus En must have measure 0, else, the simple function g=n11En minorizes f. Since this holds true ∀n, the pre-image of (0,∞) must have measure 0 (due to upward measure continuity), hence f=0 a.e.
(b') For any simple function s that is majorized by f, cs is also majorized by cf and vice-versa. Hence, ∫Ωcf=c∫Ωf.
(c') Any simple function s that is majorized by f is also majorized by g. Hence ∫Ωf≤∫Ωg simply because the latter is the sup of a bigger set.
(d') Let Z={x∣f(x)=g(x)}, therefore Z is a zero set (by definition of a.e.). Let Zc denote Ω∖Z. Then ∀s simple function, ∫s=∫Zcs. Then ∫f=∫Zcf=∫Zcg=∫g.
(e') Similar to (c'), any simple function that is majorized by fXΩ′ is also majorized by f. Hence ∫Ω′f=∫ΩfχΩ′≤∫Ωf.
Ex 8.2.2
By definition, for any simple function s that minorizes f and t that minorizes g, s+t (which is also a simple function) minorizes f+g. Thus, let ϵ>0, then let ∫Ωf=A and ∫Ωg=B, then ∃s,t simple functions s.t. s minorizes f and t minorizes g and ∫Ωs≥A−2ϵ and ∫Ωt≥B−2ϵ. Thus, ∫Ω(f+g)≥A+B−ϵ∀ϵ>0. Thus, ∫Ω(f+g)≥∫Ωf+∫Ωg.
Ex 8.2.3 Consider the partial sum sN=Σn=1Ngn. Then sN is nonnegative and (sn)n is a sequence of increasing functions. By Monotone Convergence Theorem, ∫Ωsupsn=sup∫Ωsn. Note supsn=limn→∞Σi=1ngi=Σi=1∞gi. Also, ∫Ωsn=∫ΩΣi=1ngi=Σi=1n∫Ωgi (interchange of addition and integration), hence sup∫Ωsn=Σi=1∞∫Ωgi. Thus ∫ΩΣi=1∞gi=Σi=1∞∫Ωgi, as desired.
Ex 8.2.4
Consider the function Σn=1∞fn. The function s=χ[1,2) minorizes it, therefore, ∫ΩΣn=1∞fn≥1. However, ∫Rfn=0 (actually, it might not even be defined in this case, since no simple function minorizes it). Thus, ∫ΩΣn=1∞fn=Σn=1∞∫Rfn.
Ex 8.2.5 Firstly, note that the set E={x∈Ω:f(x)=+∞} is measurable. Let En be the preimage of (n,∞), then En are all measurable (since f measurable). Thus, since En↓E, E is measurable by downward measure continuity. Suppose otherwise, that the set E has nonzero measure. Then consider the simple function sn=n⋅χE. Then, ∀n∈N, sn minorizes f. Hence, ∫Ωf≥∫Ef≥∫Esn=n⋅m(E). If m(E) nonzero, limn→∞n⋅m(E)=∞. (contradiction!) Hence, f must be almost finite a.e.
Ex 8.2.6 Consider the indicator functions χΩn.
Ex 8.2.7 HW5
Ex 8.2.8
Ex 8.2.9 HW5
Ex 8.2.10 HW5
Tao Chapter 8 Problems and Solutions II
Ex 8.3.1∣∫Ωf∣=∣∫Ωf+−∫Ωf−∣≤∣∫Ωf+∣+∣∫Ωf−∣=∫Ωf++∫Ωf−=∫Ω(f++f−)=∫Ω∣f∣ as desired.
The first equality is by definition. The first inequality is by the triangle inequality of R.
Ex 8.3.2 HW6
Ex 8.3.3 HW6
Measure Theory applied to Probability
One of the main reasons why I took this course is to gain a deeper understanding of probability, so here are some of my attempts in making this connection.
Preliminaries: The Borel sets on R, denoted as B(R) is the σ-field on R that is generated by all open intervals of the form (a,b) with a<b.
Let (Ω,F,P) be a measure space. F is a σ-algebra denoting a collection of subsets of Ω, i.e. F satisfies the following:
Ω∈F
A∈F⇒Ac∈F
(An)n∈F⇒⋃An∈F
The sets in F are measurable sets. P:F→[0,1] is a probability measure which satisfies all the axioms of measure and the following:
P[ϕ]=0
If (An)n∈F disjoint, then P[⋃nAn]=ΣnP[An]
P[Ω]=1
A random variableX is a measurable function X:F→R, i.e. X−1(B)=ω∈Ω:X(ω)∈B∈F∀B∈B(R).
Let (Xn)n be a sequence of random variables. For ω∈Ω, then the sequence of random variables acting on this ω gives a sequence os: (Xn(ω))n. Say (Xn)nconverges almost surely to X if limn←∞P[{ω:Xn(ω)=X(ω)}]=1.
- Tao Section 3: Here I attempt to write a concise summary/key idea of Tao Section 3 without all the (why?)
Say a set A is a coset of Q if A=x+Q for some x∈R.
Claim 1: x+Q and y+Q are either disjoint or entirely the same
Suppose they intersect at w. Then w=x+q1=y+q2 for some q1,q2. Then x−y=q2−q1, so y∈x+Q. Consequently, for any z∈x+Q, z=x+q3=y+q2−q1+q3∈y+Q. Similarly for the opposite direction. Hence, we can conclude they are the same set if they have a nonempty intersection.
Claim 2: Every coset has a non-empty intersection with [0,1]
In any interval [a,b],a<b, we can find a rational number. Hence, if A=x+Q, consider the rational number q∈[−x,1−x]. Then, q+x∈[0,1] as desired.
Consider the set of all cosets, and from each of them pick a representative xA such that xA∈[0,1] (by axiom of choice; there are an uncountably infinite of cosets, corresponding to an uncountably infinite number of x∈R). Construct E={xA}. Construct X=⋃q∈Q∩[−1,1](q+E).
The key idea here is that, due to this construction of X, [0,1]⊂X⊂[−1,2], hence we can bound the outer measure of X by monotonicity (if it exists).
On one hand, any element x∈X can be expressed as x=q+e where q∈Q∩[−1,1] and e∈E, hence, x∈[−1,2], hence m∗(X)<3 by monotonicity.
On the other hand, for any x∈[0,1], x∈x+Q, so ∃y∈E∩[0,1] s.t. x=y+q where q∈Q. (in particular, this y is the representative of the coset that x belongs to) Then, since ∣x−y∣≤1, q∈[−1,1], so x∈X. Hence, since [0,1]⊂X, m∗(X)≥1 by monotonicity.
This yields 1≤m∗(X)≤3.
The nail in the coffin comes from the assumption that if m∗(⋅) satisfies countable additivity, then since X=⋃q∈Q∩[−1,1](q+E), and Q∩[−1,1] is countable (because Q is countable, so is its intersection with another set) then m∗(X)=Σm∗(q+E). (*) But by the translational invariance property of outer measure, m∗(q+E)=m∗(E) where q∈Q∩[−1,1] is a subset of R. Hence, the RHS is summing the same thing m∗(E) many times. Thus, RHS takes on either the value 0 or ∞, corresponding to when m∗(E)=0 or m∗(E)>0 respectively. Either way, it does not fall in the bounds 1≤m∗(X)≤3.
(*) Note that only here did we use Claim 1. It shows that for two rational numbers q1,q2∈[−1,1], the two sets q1+E and q2+E are disjoint. Suppose otherwise, then ∃xA,xB∈E s.t. q1+xA=q2+xB, then xA−xB=q2−q1∈Q which implies xA,xB belong to the same coset! This is impossible since only one representative is chosen from each coset by construction.
The failure of finite additivity follows directly (but non-trivially though, in my honest opinion).
Since 1≤m∗(X)≤3, by countable subadditivity X=⋃q∈Q∩[−1,1](q+E)≤Σm∗(q+E)=Σm∗(E), we can eliminate the case where m∗(E)=0, otherwise m∗(X)=0.
Since we know m∗(X) now takes a finite value, say ϵ, we can upset it by taking a finite number of rational numbers ∈Q∩[−1,1], say a set J with ⌈4/ϵ⌉ elements. Then, by countable subadditivity again, ⋃q∈J(q+E)⊂⋃q∈[−1,1](q+E)=X, so Σq∈Jm∗(q+E)≤m∗(X). But if finite additivity works, Σq∈Jm∗(q+E)=∣J∣m∗(E)≥(4/ϵ)ϵ=4>3≥m∗(X). (Contradiction!)
Toolbox (Lemmas, Tricks, Methods) in Analysis
ϵ-room trick
2nϵ trick for Borel Cantelli lemma
[Heine-Borel] If E is compact and E⊂⋃αUα for open Uα, then E is covered by a finite subset of the open sets.
[Princeton Measure Theory Theorem 1.4] Every open subset U of Rd,d≥1 can be written as a countable union of almost disjoint closed cubes.
Let E,F⊂Rd be such that dist(E,F)>0, where dist(E,F):=inf{∣x−y∣:x∈E,y∈F} is the distance between E,F. Then m∗(E∪F)=m∗(E)+m∗(F)
[Tao 7.4.10] Every open set can be written as the countable or finite union of open boxes
[Princeton Measure Theory Theorem 1.4] Every open subset U⊂Rd can be written as a countable union of almost disjoint open sets.
Proof (I followed the proof given in Princeton Measure Theory but filled in some in-between steps):
Let {Bi} denote the set of boxes that are (0,1/2k)d but translated by some integer multiple of 1/2k possibly in each of the d coordinates. Then, for any point u∈U, since U is open, ∃r>0 s.t. Br(u)⊂U. We can always pick a power of 2 such that 2k1<2dr. Hence, u is either contained in Bi for some i or u has a coordinate that is exactly an integer multiple of 2k1.
Let P be the set of all planes such that one coordinate is a multiple of 2k1. This set is countable (since Q is countable). We have proven before that we can cover a plane with a coun of open boxes with outer measure 0.
Just for completeness, for the plane x1=0. The consider open boxes centered at 0, with each dimension other than x1 being length 2k and x1 being dimension ϵ/(2k)d. Then enumerating k=1,2,3,… covers the whole plane, and the total volume of all open boxes that we used is ϵ.
Hence, from the set of all {Bi}, we choose the boxes that completely fits in the open set U as described above, and denote it as the set B. Then we have the following relationship: B⊂U⊂B∪P. By monotonicity and subadditivity of outer measure, m∗(B)≤m∗(U)≤m∗(B∪P)≤m∗(B)+m∗(P)=m∗(B). Hence m∗(U)=m∗(B). This shows that every open set U can be written as a countable union of almost disjoint open boxes.
[Pugh Lemma 6.17] Every open subset is a countable disjoint union of balls plus a zero set. (Prove by algorithm and previous lemma from Princeton Measure Theory)
[Princeton Measure Theory Lemma 3.1] If F closed and K compact and F,K disjoint, then dist(F,K)>0.
Proof (I followed the proof given in Princeton Measure Theory but filled in some in-between steps):
F is closed, so for any x∈K, ∃δx s.t. d(x,F)>3δx. (Suppose otherwise that δx does not exist, then for every n, we can find fn∈F s.t. d(x,fn)<n1. Then since F closed and by Bolzano Weierstrass, ∃ subsequence fn′ s.t. limfn′=x∈F. Contradiction!)
Since ⋃x∈KB2δx(x) covers K and K is compact, by Heine-Borel Theorem, exists a finite subcover ⋃i=1nB2δxi(xi).
Pick δ=minδxi. Then, for any x∈K and y∈F, then for any j an index in the finite subcover, ∣y−x∣≥∣y−xj∣−∣xj−x∣≥3⋅δxj−2⋅δxj=δxj≥δ. Hence, dist(F,K)≥δ>0.
[Tao Ex 7.2.3] For increasing sequence of measurable sets (Ai) (i.e. Ai⊂Ai+1), we have m(⋃j=1∞Aj)=limj→∞m(Aj)
[Tao Ex 7.2.3] For decreasing sequence of measurable sets (Ai) (i.e. Ai⊃Ai+1) with m(A1)<∞, we have m(⋂j=1∞Aj)=limj→∞m(Aj)
[Tao Theorem 2.1.4] Let f:X→Y be a continuous function from metric space X to Y. Then f is continuous at x0 is equivalent to for every open set V⊂Y s.t. f(x0)∈V, ∃U⊂X open containing x0 s.t. f(U)⊂V
Proof (I came up with this by myself; please forgive any errors)
Suppose f is continuous at x0, then for every sequence (xn) that converges to x0, we have (f(xn))n→f(x0). Suppose otherwise, that for some open set V⊂Y s.t. f(x0)∈V but does not exist open U⊂X containing x0 with the image f(U)⊂V. Since V is open, suffices to consider a smaller set V′=Br(f(x0))⊂V for some r∈R. Consider open sets Un=B1/n(x0) in X with n∈N. None of these balls map entirely into V′, so we can pick a point xn′ s.t. f(xn′)∈/V′. This gives us a sequence (xn′)n. It is clear that (xn′)n→x0 since limn→∞n1=0, hence by continuity of f at x0, limn→∞f(xn′)=f(x0). But this is impossible, since the value sequence all lies outside V′=Br(f(x0)), contradicting the assumption that f is continuous at x0.
Now let's consider the case: for every open set V⊂Y s.t. f(x0)∈V, ∃U⊂X open containing x0 s.t. f(U)⊂V. Suppose otherwise that f is not continuous at x0. Then, it means that ∃(xn′)n s.t. (xn′)→x0 but f(xn′) does not converge to f(x0). Then exists a subsequence of (xn′)n, say (yn′)n such that dY(f(x0),yn′)=δ>0 (for if otherwise, the sequence (f(xn′))n converges to f(x0)). Consider the open ball Bδ/2(f(x0)). By assumption, ∃U⊂X containing x0 such that f(U)⊂Bδ/2(f(x0)). This means none of the values yi′ falls in U (for if otherwise their image falls in Bδ/2(f(x0)). Thus limyi′=x0. Contradiction, since (yn′)n is a subsequence of (xn′)n which must converge to x0 too.
[Tao Theorem 2.1.5] Let f:X→Y be a continuous function from metric space X to Y. Then whenever V is open (closed) set in Y, the pre-image f−1(Y) is an open (closed) set in X.
Resolved Thoughts
A metric space is sequentially compact if and only if it is compact.
Lemma
If the metric space (X,d) is compact and an open cover of X is given, then ∃δ>0 s.t. every subset of X with diameter less than δ is contained in some member of its cover. (Wiki)
If subspace of a metric space, say K, is compact/sequentially compact, then for any open cover {Ui} of K, ∃δ>0, s.t. for ∀x∈K, Bδ(x)⊂Uα for some α. (Prof Peng's notes)
Key idea of proof: Prove by contradtion. Suppose otherwise, then ∀n∈Z, ∃xk s.t. B1/n is not contained within all open sets Ui. Consider this sequence, then apply triangle inequality at the limit point x=limk→∞xk.
- δ is referred to as the of this cover. Intuitively, it's like a breathing space () for the compact set within the cover.
- Diameter is the supremum of the distance between pairs of points
If A and B are measurable, then A\B is measurable.
Idea by @selenajli on Discord: B is measurable ⇒Rn\B is measurable (complement) ⇒Rn\B∩A=A−B is measurable (finite union)
✅ What are all the -morphisms? Are there intuitive pictures so that I can have a better idea?
See definitions
Unresolved Thoughts
Banach-Tarski paradox (Tao 163)
✅ Lebesgue number (Pugh)
From David's non-measurable presentation rehearsal: why are these two definitions equivalent to the definition we know from Tao?
m∗(P)=inf{m(G)∣P⊂G,G open}
m∗(P)=sup{m(G)∣P⊃G,G closed}
Lipschitz constant
Lipschitz condition
locally Lipschitz
Homeomorphism and diffeomorphism: are they connected? It seems they preserve measurability.
✅ A diffeomorphism T:U→V is a meseomorphism, i.e. preserves measurability. Prove by n-dimensional mean value theorem (TODO!!!!) (Pugh Ex 6.23)