SlideShare a Scribd company logo
Topology for Computing
Chapter 4. Homology
Sangwoo Mo
TDA Study
October 16, 2017
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 1 / 37
Table of Contents
1 Motivation
2 Euler characteristic
3 Homotopy
4 Homology
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 2 / 37
Table of Contents
1 Motivation
2 Euler characteristic
3 Homotopy
4 Homology
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 3 / 37
Classifying Topological Spaces
How to classify topological spaces?
1-manifold has only two types: line and loop
How about higher-dimension manifolds?
The natural way is equivalence class of homeomorphism
Homeomorphism preserves topology by definition
However, it is hard to find homeomorphism in general
Thus, we will classify spaces by topological invariants e.g.
Euler characteristic
Homotopy
Homology (our main focus)
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 4 / 37
Table of Contents
1 Motivation
2 Euler characteristic
3 Homotopy
4 Homology
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 5 / 37
Euler characteristic
Definition (Euler characteristic of simplicial complex)
Let K be a simplicial complex and si = card{σ ∈ K | dim σ = i}. The
Euler characteristic of K is
χ(K) =
dim K
i=0
(−1)i
si =
σ∈K−{∅}
(−1)dim σ
.
Definition (Euler characteristic of manifold)
Given any triangulation K of a manifold M, χ(K) is invariant. We call
χ(M) = χ(K) be the Euler characteristic of M.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 6 / 37
Euler characteristic
Example (basic 2-manifolds)
Here are some popular 2-manifolds. Sphere S2, torus T2, real projective
plane RP2
, and the Klein bottle K2, respectively.
FYI 1: M¨obius strip is homeomorphic to one point removed RP2
.
FYI 2: Klein bottle is homeomorphic to connected sum of two RP2
s.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 7 / 37
Euler characteristic
Example (χ of basic 2-manifolds)
We can compute the Euler characteristic of basic 2-manifolds by
triangulation of the diagram.
Moreover, we can extend this result to the general closed 2-manifolds by
connected sum of basic 2-manifolds.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 8 / 37
Connected Sum
Definition (connected sum)
The connected sum of two n-manifolds M1, M2 is
M1 # M2 = M1 − ˚Dn
1
∂˚Dn
1 =∂˚Dn
2
M2 − ˚Dn
2
where ˚Dn
1 , ˚Dn
2 are n-dimensional closed disks in M1, M2, respectively.
Example (connected sum of torus)
Connected sum of 2 tori. We call it genus 2 torus.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 9 / 37
Connected Sum
Theorem (χ of connected sum)
For compact surfaces M1, M2,
χ(M1 # M2) = χ(M1) + χ(M2) − 2.
Corollary (χ of connected sum of T2
/RP2
)
As corollary, χ(gT2) = 2 − 2g and χ(gRP2
) = 2 − g.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 10 / 37
Classification of 2-manifolds
We can prove that any closed surface are homeomorphic to the connected
sum of T2 or the connected sum of RP2
. (Sphere is genus 0 torus.)
Theorem (classification of 2-manifolds)
The closed 2-manifold M is homeomorphic to
the connected sum of T2 if it is orientable
the connected sum of RP2
if it is not orientable
Using Euler characteristic, we can also identify the number of connection.
Homeomorphism (and Euler characteristic) suceed to classify 2-manifolds.
However, we need better tools to classify higher-dimension manifolds.
Before we move on, we will introduce basic category theory to formally
define invariant, from topological space to algebraic structure.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 11 / 37
Basic Category Theory
Definition (category)
A category C consists of:
(a) a collection Ob(C) of objects
(b) sets Mor(X, Y ) of morphisms for each pair X, Y ∈ Ob(C); including a
distinguished identity morphism 1 = 1X ∈ Mor(X, Y ) for each X
(c) a composition of morphisms function ◦ : Mor(X, Y ) × Mor(Y , Z)
→ Mor(X, Z) for each triple X, Y , Z ∈ Ob(C), satisfying
f ◦ 1 = 1 ◦ f = f , and (f ◦ g) ◦ h = f ◦ (g ◦ h)
Definition (functor)
A (covariant) functor F from a category C to a category D assigns
(a) object X ∈ C to an object F(X) ∈ D
(b) morphism f ∈ Mor(X, Y ) to a morphism F(f ) ∈ Mor(F(X), F(Y ));
such that F(1) = 1 and F(f ◦ g) = F(f ) ◦ F(g)
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 12 / 37
Basic Category Theory
Example (examples of category)
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 13 / 37
Basic Category Theory
Example (visual illustration of functor)
F is a functor mapping category of 2-manifolds to category of 1-manifolds.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 14 / 37
Functor from Topology to Algebra
Transform difficult topological object to well-known algebraic object.
object: topological space → group & module
morphism: homeomorphism → isomorphism (not really!)
Homotopy and homology are easier to compute, but less discriminative
homology ⊂ homotopy ⊂ homeomorphy
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 15 / 37
Table of Contents
1 Motivation
2 Euler characteristic
3 Homotopy
4 Homology
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 16 / 37
Homotopy
Definition (homotopy)
The homotopy of two continuous functions f , g : X → Y is a continuous
function H : X × [0, 1] → Y such that H(x, 0) = f (x) and H(x, 1) = g(x)
for x ∈ X. We can think H as a continuous deformation of f into g.
Example (homotopy vs homeomorphy)
X and Y are homotopy equivalent, but not homeomorphic.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 17 / 37
Homotopy
Definition (homotopy group)
Choose base point s ∈ Sn and x ∈ X. The homotopy group πn(X, x) is
the set of homotopy classes of maps f : (Sn, s) → (X, x). For simply
connected space, πn(X, x) is independent to x, thus we can write πn(X).
We call π1(X) be the fundamental group.
Remark (homotopy ‘group’)
Remark that πn(X) has a group structure. Even more, for n ≥ 2, πn(X)
becomes an abelian group.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 18 / 37
Homotopy
Intuitively, homotopy group counts the number of loops
Example (fundamental group of torus)
The fundamental group of torus is π1(T2) = Z × Z.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 19 / 37
Undecidability of Homeomorphy/Homotopy
Theorem (undecidability of homeomorphy/homotopy)
For manifolds with dimension higher than 4, homeomorphy/homotopy
problem is undecidable.
Proof sketch (Markov’s construction).
For given group, construct a corresponding manifold using Dehn surgery.
It reduces the homeomorphy/homotopy problem to the group isomorphism
problem, which is known to be undecidable.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 20 / 37
Limitation of Homotopy
Homotopy group is one way to classify topological spaces
However, it has several problems:
not combinatorial
hard to compute
infinite description of πn(X)
⇒ It motivates the homology, the combinatorial computable functor with
finite description
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 21 / 37
Table of Contents
1 Motivation
2 Euler characteristic
3 Homotopy
4 Homology
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 22 / 37
Homology
There are several ways to define homology (e.g. CW-complex), but we will
only cover simplicial homology; We only consider a simplicial complex K
First, we will define chain and cycle, the extension of path and loop
Definition (chain group)
The kth chain group Ck(K), + of K is the free abelian group on the
oriented k-simplices. An element of Ck(K) is a k-chain,
c =
q
nq[σq], nq ∈ Z, σq ∈ K.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 23 / 37
Homology
Definition (boundary homomorphism)
The boundary homomorphism ∂k : Ck(K) → Ck−1(K) is
∂kσ =
i
(−1)i
[v0, v1, ..., ˆvi , ..., vn]
where ˆvi indicates that vi is deleted from the sequence.
Example (boundary homomorphism of simplices)
∂1[a, b] = b − a
∂2[a, b, c] = [b, c] − [a, c] + [a, b]
∂3[a, b, c, d] = [b, c, d] − [a, c, d] + [a, b, d] − [a, b, c]
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 24 / 37
Homology
Definition (chain complex)
The chain complex C∗ is a sequence of chain groups
0 −→ Cn
∂n
−→ Cn−1 −→ ... −→ C1
∂1
−→ C0
∂0
−→ 0
Definition (cycle, boundary)
The kth cycle group is Zk = ker ∂k and the kth boundary group is
Bk = im ∂k+1. Elements of Zk and Bk are cycle and boundary.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 25 / 37
Homology
Theorem (nesting of cycle/boundary group)
Zk and Bk are free abelian normal subgroup of Ck such that
Bk ≤ Zk ≤ Ck. Here, Bk ≤ Zk since ∂k−1∂k = 0.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 26 / 37
Homology
Definition (homology group)
The kth homology group is
Hk = Zk/Bk = ker ∂k/im ∂k−1.
Note that homology groups are finitely generated abelian.
Definition (Betti number)
The kth Betti number βk = βk(Hk) is the rank of the free part of Hk.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 27 / 37
Understanding Homology
For simplicity, we only consider subcomplexes of S3
Subcomplexes of S3 easy to handle (torsion-free)
Algorithmically, simple one point compactification converts R3 to S3
For 3-dim torsion-free space, Betti numbers have intuitive meaning
Alexander Duality:
β0 measures the number of components
β1 measures the number of tunnels
β0 measures the number of voids
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 28 / 37
Understanding Homology
Example (Alexander duality)
Homology of basic 2-manifolds.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 29 / 37
Invariance
We hope homology be invariant for same underlying space
First approach was proving that any two triangulations of a
topological space have a common refinement (Hauptvermutung)
However, it was false for manifolds of dimension ≥ 5
For general spaces, singular homology is introduced
Simplical homology is equivalent to singular homology
Algorithmically, we can just compute (easy) simplical homology
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 30 / 37
Relation to Euler characteristic
The sequence of homology groups also forms a chain complex
0 −→ Hn −→ Hn−1 −→ ... −→ H1 −→ H0 −→ 0
Definition (Euler charactersitic of chain complex)
The Euler charactersitic of chain complex C∗ is
χ(C∗) =
i
(−1)i
rank(Ci ).
Theorem (Euler-Poincar´e formula)
χ(C∗) = χ(H∗(C∗)) =
i
(−1)i
βi .
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 31 / 37
Relation to Homotopy
Theorem (Hurewicz theorem)
For any space X and positive integer k there is a group homomorphism
h∗ : πk(X) → Hk(X).
If X is (n − 1)-connected, h∗ is an isomorphism for all 2 ≤ k ≤ n and
abelinization for n = 1. In particular, the theorem says that
H1(X) ∼= π1(X)/[π1(X), π1(X)].
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 32 / 37
Homology with coefficients
We assumed chain group be the free abelian group, which is Z-module
We may replace this ring with any PID D, such as Z2
Definition (homology with coefficients)
The kth homology with ring of coefficients D is
Hk(K; D) = Zk(K; D)/Bk(K; D).
Our goal is to compute Hk(K; D) for arbitrary D, using Hk(K)
If we use Z2, the computation becomes greatly simple (see Chap 7.)
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 33 / 37
Homology with coefficients
Definition (short exact sequence)
The short exact sequence is seqeunce of groups
0
ϕ3
−→ A
ϕ2
−→ B
ϕ1
−→ C
ϕ0
−→ 0
such that im ϕi = ker ϕi−1.
Theorem (splitting lemma)
For short exact sequence, B ∼= A × C.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 34 / 37
Homology with coefficients
Theorem (universal coefficient theorem)
Let G be an Abelian. Then following sequence is short exact
0 → Hk(K) ⊗ G → Hk(K; G) → Hk−1(K) ∗ G → 0
where ⊗ is tensor product and ∗ is torsion product.
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 35 / 37
Homology with coefficients
Using universal coefficient theorem and splitting lemma, we can derive
Hk(K; D) for some special cases
Example (homology with coefficients)
1. Case Hk(K; Zp):
Hk(K; Zp) ∼= (Hk(K; Zp) ⊗ Zp) × (Hk(K; Zp) ∗ Zp)
∼= torsion part × (Zp)βk
2. Case Hk(K; F):
Hk(K; F) ∼= (Hk(K; F) ⊗ F) × (Hk(K; F) ∗ F) ∼= Fβk
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 36 / 37
Questions?
Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 37 / 37

More Related Content

What's hot

Introduction to Topological Data Analysis
Introduction to Topological Data AnalysisIntroduction to Topological Data Analysis
Introduction to Topological Data Analysis
Hendri Karisma
 
Tutorial of topological data analysis part 3(Mapper algorithm)
Tutorial of topological data analysis part 3(Mapper algorithm)Tutorial of topological data analysis part 3(Mapper algorithm)
Tutorial of topological data analysis part 3(Mapper algorithm)
Ha Phuong
 
DM-unit-3.ppt
DM-unit-3.pptDM-unit-3.ppt
DM-unit-3.ppt
sunil sharma
 
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroupsCorrespondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
journal ijrtem
 
Topological data analysis
Topological data analysisTopological data analysis
Topological data analysis
Sunghyon Kyeong
 
topology definitions
 topology definitions topology definitions
topology definitions
RAMYA vetrivel
 
GROUP, SUBGROUP, ABELIAN GROUP, NORMAL SUBGROUP, CONJUGATE NUMBER,NORMALIZER ...
GROUP, SUBGROUP, ABELIAN GROUP, NORMAL SUBGROUP, CONJUGATE NUMBER,NORMALIZER ...GROUP, SUBGROUP, ABELIAN GROUP, NORMAL SUBGROUP, CONJUGATE NUMBER,NORMALIZER ...
GROUP, SUBGROUP, ABELIAN GROUP, NORMAL SUBGROUP, CONJUGATE NUMBER,NORMALIZER ...
SONU KUMAR
 
Introduction to Real Analysis 4th Edition Bartle Solutions Manual
Introduction to Real Analysis 4th Edition Bartle Solutions ManualIntroduction to Real Analysis 4th Edition Bartle Solutions Manual
Introduction to Real Analysis 4th Edition Bartle Solutions Manual
DawsonVeronica
 
Discrete Mathematical Structures - Fundamentals of Logic - Principle of duality
Discrete Mathematical Structures - Fundamentals of Logic - Principle of dualityDiscrete Mathematical Structures - Fundamentals of Logic - Principle of duality
Discrete Mathematical Structures - Fundamentals of Logic - Principle of duality
Lakshmi R
 
Set, Relations and Functions
Set, Relations and FunctionsSet, Relations and Functions
Set, Relations and Functions
suthi
 
Chapter 1, Sets
Chapter   1, SetsChapter   1, Sets
Chapter 1, Sets
Ananya Sharma
 
Integral Domains
Integral DomainsIntegral Domains
Cylindrical and spherical coordinates shalini
Cylindrical and spherical coordinates shaliniCylindrical and spherical coordinates shalini
Cylindrical and spherical coordinates shalini
shalini singh
 
Ring homomorphism
Ring homomorphismRing homomorphism
Ring homomorphism
Muhammad Umar Farooq
 
Group homomorphism
Group homomorphismGroup homomorphism
Group homomorphism
NaliniSPatil
 
An elementary introduction to information geometry
An elementary introduction to information geometryAn elementary introduction to information geometry
An elementary introduction to information geometry
Frank Nielsen
 
Ring-ppt.pptx
Ring-ppt.pptxRing-ppt.pptx
Ring-ppt.pptx
RajaKumar483069
 
Hausdorff and Non-Hausdorff Spaces
Hausdorff and Non-Hausdorff SpacesHausdorff and Non-Hausdorff Spaces
Hausdorff and Non-Hausdorff Spaces
gizemk
 
Dimensionality reduction with UMAP
Dimensionality reduction with UMAPDimensionality reduction with UMAP
Dimensionality reduction with UMAP
Jakub Bartczuk
 

What's hot (20)

Introduction to Topological Data Analysis
Introduction to Topological Data AnalysisIntroduction to Topological Data Analysis
Introduction to Topological Data Analysis
 
Tutorial of topological data analysis part 3(Mapper algorithm)
Tutorial of topological data analysis part 3(Mapper algorithm)Tutorial of topological data analysis part 3(Mapper algorithm)
Tutorial of topological data analysis part 3(Mapper algorithm)
 
DM-unit-3.ppt
DM-unit-3.pptDM-unit-3.ppt
DM-unit-3.ppt
 
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroupsCorrespondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroups
 
Topological data analysis
Topological data analysisTopological data analysis
Topological data analysis
 
topology definitions
 topology definitions topology definitions
topology definitions
 
GROUP, SUBGROUP, ABELIAN GROUP, NORMAL SUBGROUP, CONJUGATE NUMBER,NORMALIZER ...
GROUP, SUBGROUP, ABELIAN GROUP, NORMAL SUBGROUP, CONJUGATE NUMBER,NORMALIZER ...GROUP, SUBGROUP, ABELIAN GROUP, NORMAL SUBGROUP, CONJUGATE NUMBER,NORMALIZER ...
GROUP, SUBGROUP, ABELIAN GROUP, NORMAL SUBGROUP, CONJUGATE NUMBER,NORMALIZER ...
 
Introduction to Real Analysis 4th Edition Bartle Solutions Manual
Introduction to Real Analysis 4th Edition Bartle Solutions ManualIntroduction to Real Analysis 4th Edition Bartle Solutions Manual
Introduction to Real Analysis 4th Edition Bartle Solutions Manual
 
Discrete Mathematical Structures - Fundamentals of Logic - Principle of duality
Discrete Mathematical Structures - Fundamentals of Logic - Principle of dualityDiscrete Mathematical Structures - Fundamentals of Logic - Principle of duality
Discrete Mathematical Structures - Fundamentals of Logic - Principle of duality
 
Set, Relations and Functions
Set, Relations and FunctionsSet, Relations and Functions
Set, Relations and Functions
 
Chapter 1, Sets
Chapter   1, SetsChapter   1, Sets
Chapter 1, Sets
 
Integral Domains
Integral DomainsIntegral Domains
Integral Domains
 
Cylindrical and spherical coordinates shalini
Cylindrical and spherical coordinates shaliniCylindrical and spherical coordinates shalini
Cylindrical and spherical coordinates shalini
 
Ring homomorphism
Ring homomorphismRing homomorphism
Ring homomorphism
 
Group homomorphism
Group homomorphismGroup homomorphism
Group homomorphism
 
An elementary introduction to information geometry
An elementary introduction to information geometryAn elementary introduction to information geometry
An elementary introduction to information geometry
 
Ring-ppt.pptx
Ring-ppt.pptxRing-ppt.pptx
Ring-ppt.pptx
 
Hausdorff and Non-Hausdorff Spaces
Hausdorff and Non-Hausdorff SpacesHausdorff and Non-Hausdorff Spaces
Hausdorff and Non-Hausdorff Spaces
 
Dimensionality reduction with UMAP
Dimensionality reduction with UMAPDimensionality reduction with UMAP
Dimensionality reduction with UMAP
 
Atan2
Atan2Atan2
Atan2
 

Similar to Topology for Computing: Homology

applied mathematics methods.pdf
applied mathematics methods.pdfapplied mathematics methods.pdf
applied mathematics methods.pdf
CyprianObota
 
[SEMINAR] 2nd Tues, 14 May, 2019
[SEMINAR] 2nd Tues, 14 May, 2019[SEMINAR] 2nd Tues, 14 May, 2019
[SEMINAR] 2nd Tues, 14 May, 2019
Naoto Agawa
 
Dialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsDialectica and Kolmogorov Problems
Dialectica and Kolmogorov Problems
Valeria de Paiva
 
Seminar on Motivic Hall Algebras
Seminar on Motivic Hall AlgebrasSeminar on Motivic Hall Algebras
Seminar on Motivic Hall Algebras
Heinrich Hartmann
 
An Overview of Separation Axioms by Nearly Open Sets in Topology.
An Overview of Separation Axioms by Nearly Open Sets in Topology.An Overview of Separation Axioms by Nearly Open Sets in Topology.
An Overview of Separation Axioms by Nearly Open Sets in Topology.
IJERA Editor
 
g-lecture.pptx
g-lecture.pptxg-lecture.pptx
g-lecture.pptx
RadharamanDas5
 
An approach to Fuzzy clustering of the iris petals by using Ac-means
An approach to Fuzzy clustering of the iris petals by using Ac-meansAn approach to Fuzzy clustering of the iris petals by using Ac-means
An approach to Fuzzy clustering of the iris petals by using Ac-means
ijsc
 
Berezin-Toeplitz Quantization On Coadjoint orbits
Berezin-Toeplitz Quantization On Coadjoint orbitsBerezin-Toeplitz Quantization On Coadjoint orbits
Berezin-Toeplitz Quantization On Coadjoint orbits
Hassan Jolany
 
Proect
ProectProect
Density theorems for Euclidean point configurations
Density theorems for Euclidean point configurationsDensity theorems for Euclidean point configurations
Density theorems for Euclidean point configurations
VjekoslavKovac1
 
Notes on Intersection theory
Notes on Intersection theoryNotes on Intersection theory
Notes on Intersection theory
Heinrich Hartmann
 
Group Theory and Its Application: Beamer Presentation (PPT)
Group Theory and Its Application:   Beamer Presentation (PPT)Group Theory and Its Application:   Beamer Presentation (PPT)
Group Theory and Its Application: Beamer Presentation (PPT)
SIRAJAHMAD36
 
FMS_MCQ_QUESTION_BANK.pdf
FMS_MCQ_QUESTION_BANK.pdfFMS_MCQ_QUESTION_BANK.pdf
FMS_MCQ_QUESTION_BANK.pdf
SureshK256753
 
Doubled Geometry and Double Field Theory
Doubled Geometry and Double Field TheoryDoubled Geometry and Double Field Theory
Doubled Geometry and Double Field TheoryLuigi
 
Analysis and algebra on differentiable manifolds
Analysis and algebra on differentiable manifoldsAnalysis and algebra on differentiable manifolds
Analysis and algebra on differentiable manifoldsSpringer
 
Category Theory made easy with (ugly) pictures
Category Theory made easy with (ugly) picturesCategory Theory made easy with (ugly) pictures
Category Theory made easy with (ugly) pictures
Ashwin Rao
 
Lectures on Analytic Geometry
Lectures on Analytic GeometryLectures on Analytic Geometry
Lectures on Analytic Geometry
Anatol Alizar
 
A common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spacesA common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spaces
Alexander Decker
 

Similar to Topology for Computing: Homology (20)

applied mathematics methods.pdf
applied mathematics methods.pdfapplied mathematics methods.pdf
applied mathematics methods.pdf
 
[SEMINAR] 2nd Tues, 14 May, 2019
[SEMINAR] 2nd Tues, 14 May, 2019[SEMINAR] 2nd Tues, 14 May, 2019
[SEMINAR] 2nd Tues, 14 May, 2019
 
project
projectproject
project
 
Dialectica and Kolmogorov Problems
Dialectica and Kolmogorov ProblemsDialectica and Kolmogorov Problems
Dialectica and Kolmogorov Problems
 
Seminar on Motivic Hall Algebras
Seminar on Motivic Hall AlgebrasSeminar on Motivic Hall Algebras
Seminar on Motivic Hall Algebras
 
An Overview of Separation Axioms by Nearly Open Sets in Topology.
An Overview of Separation Axioms by Nearly Open Sets in Topology.An Overview of Separation Axioms by Nearly Open Sets in Topology.
An Overview of Separation Axioms by Nearly Open Sets in Topology.
 
g-lecture.pptx
g-lecture.pptxg-lecture.pptx
g-lecture.pptx
 
An approach to Fuzzy clustering of the iris petals by using Ac-means
An approach to Fuzzy clustering of the iris petals by using Ac-meansAn approach to Fuzzy clustering of the iris petals by using Ac-means
An approach to Fuzzy clustering of the iris petals by using Ac-means
 
Berezin-Toeplitz Quantization On Coadjoint orbits
Berezin-Toeplitz Quantization On Coadjoint orbitsBerezin-Toeplitz Quantization On Coadjoint orbits
Berezin-Toeplitz Quantization On Coadjoint orbits
 
Proect
ProectProect
Proect
 
Density theorems for Euclidean point configurations
Density theorems for Euclidean point configurationsDensity theorems for Euclidean point configurations
Density theorems for Euclidean point configurations
 
hone_durham
hone_durhamhone_durham
hone_durham
 
Notes on Intersection theory
Notes on Intersection theoryNotes on Intersection theory
Notes on Intersection theory
 
Group Theory and Its Application: Beamer Presentation (PPT)
Group Theory and Its Application:   Beamer Presentation (PPT)Group Theory and Its Application:   Beamer Presentation (PPT)
Group Theory and Its Application: Beamer Presentation (PPT)
 
FMS_MCQ_QUESTION_BANK.pdf
FMS_MCQ_QUESTION_BANK.pdfFMS_MCQ_QUESTION_BANK.pdf
FMS_MCQ_QUESTION_BANK.pdf
 
Doubled Geometry and Double Field Theory
Doubled Geometry and Double Field TheoryDoubled Geometry and Double Field Theory
Doubled Geometry and Double Field Theory
 
Analysis and algebra on differentiable manifolds
Analysis and algebra on differentiable manifoldsAnalysis and algebra on differentiable manifolds
Analysis and algebra on differentiable manifolds
 
Category Theory made easy with (ugly) pictures
Category Theory made easy with (ugly) picturesCategory Theory made easy with (ugly) pictures
Category Theory made easy with (ugly) pictures
 
Lectures on Analytic Geometry
Lectures on Analytic GeometryLectures on Analytic Geometry
Lectures on Analytic Geometry
 
A common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spacesA common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spaces
 

More from Sangwoo Mo

Brief History of Visual Representation Learning
Brief History of Visual Representation LearningBrief History of Visual Representation Learning
Brief History of Visual Representation Learning
Sangwoo Mo
 
Learning Visual Representations from Uncurated Data
Learning Visual Representations from Uncurated DataLearning Visual Representations from Uncurated Data
Learning Visual Representations from Uncurated Data
Sangwoo Mo
 
Hyperbolic Deep Reinforcement Learning
Hyperbolic Deep Reinforcement LearningHyperbolic Deep Reinforcement Learning
Hyperbolic Deep Reinforcement Learning
Sangwoo Mo
 
A Unified Framework for Computer Vision Tasks: (Conditional) Generative Model...
A Unified Framework for Computer Vision Tasks: (Conditional) Generative Model...A Unified Framework for Computer Vision Tasks: (Conditional) Generative Model...
A Unified Framework for Computer Vision Tasks: (Conditional) Generative Model...
Sangwoo Mo
 
Self-supervised Learning Lecture Note
Self-supervised Learning Lecture NoteSelf-supervised Learning Lecture Note
Self-supervised Learning Lecture Note
Sangwoo Mo
 
Deep Learning Theory Seminar (Chap 3, part 2)
Deep Learning Theory Seminar (Chap 3, part 2)Deep Learning Theory Seminar (Chap 3, part 2)
Deep Learning Theory Seminar (Chap 3, part 2)
Sangwoo Mo
 
Deep Learning Theory Seminar (Chap 1-2, part 1)
Deep Learning Theory Seminar (Chap 1-2, part 1)Deep Learning Theory Seminar (Chap 1-2, part 1)
Deep Learning Theory Seminar (Chap 1-2, part 1)
Sangwoo Mo
 
Introduction to Diffusion Models
Introduction to Diffusion ModelsIntroduction to Diffusion Models
Introduction to Diffusion Models
Sangwoo Mo
 
Object-Region Video Transformers
Object-Region Video TransformersObject-Region Video Transformers
Object-Region Video Transformers
Sangwoo Mo
 
Deep Implicit Layers: Learning Structured Problems with Neural Networks
Deep Implicit Layers: Learning Structured Problems with Neural NetworksDeep Implicit Layers: Learning Structured Problems with Neural Networks
Deep Implicit Layers: Learning Structured Problems with Neural Networks
Sangwoo Mo
 
Learning Theory 101 ...and Towards Learning the Flat Minima
Learning Theory 101 ...and Towards Learning the Flat MinimaLearning Theory 101 ...and Towards Learning the Flat Minima
Learning Theory 101 ...and Towards Learning the Flat Minima
Sangwoo Mo
 
Sharpness-aware minimization (SAM)
Sharpness-aware minimization (SAM)Sharpness-aware minimization (SAM)
Sharpness-aware minimization (SAM)
Sangwoo Mo
 
Explicit Density Models
Explicit Density ModelsExplicit Density Models
Explicit Density Models
Sangwoo Mo
 
Score-Based Generative Modeling through Stochastic Differential Equations
Score-Based Generative Modeling through Stochastic Differential EquationsScore-Based Generative Modeling through Stochastic Differential Equations
Score-Based Generative Modeling through Stochastic Differential Equations
Sangwoo Mo
 
Self-Attention with Linear Complexity
Self-Attention with Linear ComplexitySelf-Attention with Linear Complexity
Self-Attention with Linear Complexity
Sangwoo Mo
 
Meta-Learning with Implicit Gradients
Meta-Learning with Implicit GradientsMeta-Learning with Implicit Gradients
Meta-Learning with Implicit Gradients
Sangwoo Mo
 
Challenging Common Assumptions in the Unsupervised Learning of Disentangled R...
Challenging Common Assumptions in the Unsupervised Learning of Disentangled R...Challenging Common Assumptions in the Unsupervised Learning of Disentangled R...
Challenging Common Assumptions in the Unsupervised Learning of Disentangled R...
Sangwoo Mo
 
Generative Models for General Audiences
Generative Models for General AudiencesGenerative Models for General Audiences
Generative Models for General Audiences
Sangwoo Mo
 
Bayesian Model-Agnostic Meta-Learning
Bayesian Model-Agnostic Meta-LearningBayesian Model-Agnostic Meta-Learning
Bayesian Model-Agnostic Meta-Learning
Sangwoo Mo
 
Deep Learning for Natural Language Processing
Deep Learning for Natural Language ProcessingDeep Learning for Natural Language Processing
Deep Learning for Natural Language Processing
Sangwoo Mo
 

More from Sangwoo Mo (20)

Brief History of Visual Representation Learning
Brief History of Visual Representation LearningBrief History of Visual Representation Learning
Brief History of Visual Representation Learning
 
Learning Visual Representations from Uncurated Data
Learning Visual Representations from Uncurated DataLearning Visual Representations from Uncurated Data
Learning Visual Representations from Uncurated Data
 
Hyperbolic Deep Reinforcement Learning
Hyperbolic Deep Reinforcement LearningHyperbolic Deep Reinforcement Learning
Hyperbolic Deep Reinforcement Learning
 
A Unified Framework for Computer Vision Tasks: (Conditional) Generative Model...
A Unified Framework for Computer Vision Tasks: (Conditional) Generative Model...A Unified Framework for Computer Vision Tasks: (Conditional) Generative Model...
A Unified Framework for Computer Vision Tasks: (Conditional) Generative Model...
 
Self-supervised Learning Lecture Note
Self-supervised Learning Lecture NoteSelf-supervised Learning Lecture Note
Self-supervised Learning Lecture Note
 
Deep Learning Theory Seminar (Chap 3, part 2)
Deep Learning Theory Seminar (Chap 3, part 2)Deep Learning Theory Seminar (Chap 3, part 2)
Deep Learning Theory Seminar (Chap 3, part 2)
 
Deep Learning Theory Seminar (Chap 1-2, part 1)
Deep Learning Theory Seminar (Chap 1-2, part 1)Deep Learning Theory Seminar (Chap 1-2, part 1)
Deep Learning Theory Seminar (Chap 1-2, part 1)
 
Introduction to Diffusion Models
Introduction to Diffusion ModelsIntroduction to Diffusion Models
Introduction to Diffusion Models
 
Object-Region Video Transformers
Object-Region Video TransformersObject-Region Video Transformers
Object-Region Video Transformers
 
Deep Implicit Layers: Learning Structured Problems with Neural Networks
Deep Implicit Layers: Learning Structured Problems with Neural NetworksDeep Implicit Layers: Learning Structured Problems with Neural Networks
Deep Implicit Layers: Learning Structured Problems with Neural Networks
 
Learning Theory 101 ...and Towards Learning the Flat Minima
Learning Theory 101 ...and Towards Learning the Flat MinimaLearning Theory 101 ...and Towards Learning the Flat Minima
Learning Theory 101 ...and Towards Learning the Flat Minima
 
Sharpness-aware minimization (SAM)
Sharpness-aware minimization (SAM)Sharpness-aware minimization (SAM)
Sharpness-aware minimization (SAM)
 
Explicit Density Models
Explicit Density ModelsExplicit Density Models
Explicit Density Models
 
Score-Based Generative Modeling through Stochastic Differential Equations
Score-Based Generative Modeling through Stochastic Differential EquationsScore-Based Generative Modeling through Stochastic Differential Equations
Score-Based Generative Modeling through Stochastic Differential Equations
 
Self-Attention with Linear Complexity
Self-Attention with Linear ComplexitySelf-Attention with Linear Complexity
Self-Attention with Linear Complexity
 
Meta-Learning with Implicit Gradients
Meta-Learning with Implicit GradientsMeta-Learning with Implicit Gradients
Meta-Learning with Implicit Gradients
 
Challenging Common Assumptions in the Unsupervised Learning of Disentangled R...
Challenging Common Assumptions in the Unsupervised Learning of Disentangled R...Challenging Common Assumptions in the Unsupervised Learning of Disentangled R...
Challenging Common Assumptions in the Unsupervised Learning of Disentangled R...
 
Generative Models for General Audiences
Generative Models for General AudiencesGenerative Models for General Audiences
Generative Models for General Audiences
 
Bayesian Model-Agnostic Meta-Learning
Bayesian Model-Agnostic Meta-LearningBayesian Model-Agnostic Meta-Learning
Bayesian Model-Agnostic Meta-Learning
 
Deep Learning for Natural Language Processing
Deep Learning for Natural Language ProcessingDeep Learning for Natural Language Processing
Deep Learning for Natural Language Processing
 

Recently uploaded

FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdfFIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance
 
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Ramesh Iyer
 
Knowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and backKnowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and back
Elena Simperl
 
Connector Corner: Automate dynamic content and events by pushing a button
Connector Corner: Automate dynamic content and events by pushing a buttonConnector Corner: Automate dynamic content and events by pushing a button
Connector Corner: Automate dynamic content and events by pushing a button
DianaGray10
 
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
Product School
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
UiPathCommunity
 
Neuro-symbolic is not enough, we need neuro-*semantic*
Neuro-symbolic is not enough, we need neuro-*semantic*Neuro-symbolic is not enough, we need neuro-*semantic*
Neuro-symbolic is not enough, we need neuro-*semantic*
Frank van Harmelen
 
Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !
KatiaHIMEUR1
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
Safe Software
 
Designing Great Products: The Power of Design and Leadership by Chief Designe...
Designing Great Products: The Power of Design and Leadership by Chief Designe...Designing Great Products: The Power of Design and Leadership by Chief Designe...
Designing Great Products: The Power of Design and Leadership by Chief Designe...
Product School
 
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyesAssuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyes
ThousandEyes
 
The Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and SalesThe Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and Sales
Laura Byrne
 
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
Sri Ambati
 
UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4
DianaGray10
 
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Tobias Schneck
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Albert Hoitingh
 
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...
James Anderson
 
Accelerate your Kubernetes clusters with Varnish Caching
Accelerate your Kubernetes clusters with Varnish CachingAccelerate your Kubernetes clusters with Varnish Caching
Accelerate your Kubernetes clusters with Varnish Caching
Thijs Feryn
 
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
Product School
 
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
BookNet Canada
 

Recently uploaded (20)

FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdfFIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
 
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
 
Knowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and backKnowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and back
 
Connector Corner: Automate dynamic content and events by pushing a button
Connector Corner: Automate dynamic content and events by pushing a buttonConnector Corner: Automate dynamic content and events by pushing a button
Connector Corner: Automate dynamic content and events by pushing a button
 
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
 
Neuro-symbolic is not enough, we need neuro-*semantic*
Neuro-symbolic is not enough, we need neuro-*semantic*Neuro-symbolic is not enough, we need neuro-*semantic*
Neuro-symbolic is not enough, we need neuro-*semantic*
 
Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
 
Designing Great Products: The Power of Design and Leadership by Chief Designe...
Designing Great Products: The Power of Design and Leadership by Chief Designe...Designing Great Products: The Power of Design and Leadership by Chief Designe...
Designing Great Products: The Power of Design and Leadership by Chief Designe...
 
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyesAssuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyes
 
The Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and SalesThe Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and Sales
 
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...
 
UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4
 
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
 
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...
 
Accelerate your Kubernetes clusters with Varnish Caching
Accelerate your Kubernetes clusters with Varnish CachingAccelerate your Kubernetes clusters with Varnish Caching
Accelerate your Kubernetes clusters with Varnish Caching
 
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
 
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
 

Topology for Computing: Homology

  • 1. Topology for Computing Chapter 4. Homology Sangwoo Mo TDA Study October 16, 2017 Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 1 / 37
  • 2. Table of Contents 1 Motivation 2 Euler characteristic 3 Homotopy 4 Homology Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 2 / 37
  • 3. Table of Contents 1 Motivation 2 Euler characteristic 3 Homotopy 4 Homology Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 3 / 37
  • 4. Classifying Topological Spaces How to classify topological spaces? 1-manifold has only two types: line and loop How about higher-dimension manifolds? The natural way is equivalence class of homeomorphism Homeomorphism preserves topology by definition However, it is hard to find homeomorphism in general Thus, we will classify spaces by topological invariants e.g. Euler characteristic Homotopy Homology (our main focus) Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 4 / 37
  • 5. Table of Contents 1 Motivation 2 Euler characteristic 3 Homotopy 4 Homology Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 5 / 37
  • 6. Euler characteristic Definition (Euler characteristic of simplicial complex) Let K be a simplicial complex and si = card{σ ∈ K | dim σ = i}. The Euler characteristic of K is χ(K) = dim K i=0 (−1)i si = σ∈K−{∅} (−1)dim σ . Definition (Euler characteristic of manifold) Given any triangulation K of a manifold M, χ(K) is invariant. We call χ(M) = χ(K) be the Euler characteristic of M. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 6 / 37
  • 7. Euler characteristic Example (basic 2-manifolds) Here are some popular 2-manifolds. Sphere S2, torus T2, real projective plane RP2 , and the Klein bottle K2, respectively. FYI 1: M¨obius strip is homeomorphic to one point removed RP2 . FYI 2: Klein bottle is homeomorphic to connected sum of two RP2 s. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 7 / 37
  • 8. Euler characteristic Example (χ of basic 2-manifolds) We can compute the Euler characteristic of basic 2-manifolds by triangulation of the diagram. Moreover, we can extend this result to the general closed 2-manifolds by connected sum of basic 2-manifolds. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 8 / 37
  • 9. Connected Sum Definition (connected sum) The connected sum of two n-manifolds M1, M2 is M1 # M2 = M1 − ˚Dn 1 ∂˚Dn 1 =∂˚Dn 2 M2 − ˚Dn 2 where ˚Dn 1 , ˚Dn 2 are n-dimensional closed disks in M1, M2, respectively. Example (connected sum of torus) Connected sum of 2 tori. We call it genus 2 torus. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 9 / 37
  • 10. Connected Sum Theorem (χ of connected sum) For compact surfaces M1, M2, χ(M1 # M2) = χ(M1) + χ(M2) − 2. Corollary (χ of connected sum of T2 /RP2 ) As corollary, χ(gT2) = 2 − 2g and χ(gRP2 ) = 2 − g. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 10 / 37
  • 11. Classification of 2-manifolds We can prove that any closed surface are homeomorphic to the connected sum of T2 or the connected sum of RP2 . (Sphere is genus 0 torus.) Theorem (classification of 2-manifolds) The closed 2-manifold M is homeomorphic to the connected sum of T2 if it is orientable the connected sum of RP2 if it is not orientable Using Euler characteristic, we can also identify the number of connection. Homeomorphism (and Euler characteristic) suceed to classify 2-manifolds. However, we need better tools to classify higher-dimension manifolds. Before we move on, we will introduce basic category theory to formally define invariant, from topological space to algebraic structure. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 11 / 37
  • 12. Basic Category Theory Definition (category) A category C consists of: (a) a collection Ob(C) of objects (b) sets Mor(X, Y ) of morphisms for each pair X, Y ∈ Ob(C); including a distinguished identity morphism 1 = 1X ∈ Mor(X, Y ) for each X (c) a composition of morphisms function ◦ : Mor(X, Y ) × Mor(Y , Z) → Mor(X, Z) for each triple X, Y , Z ∈ Ob(C), satisfying f ◦ 1 = 1 ◦ f = f , and (f ◦ g) ◦ h = f ◦ (g ◦ h) Definition (functor) A (covariant) functor F from a category C to a category D assigns (a) object X ∈ C to an object F(X) ∈ D (b) morphism f ∈ Mor(X, Y ) to a morphism F(f ) ∈ Mor(F(X), F(Y )); such that F(1) = 1 and F(f ◦ g) = F(f ) ◦ F(g) Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 12 / 37
  • 13. Basic Category Theory Example (examples of category) Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 13 / 37
  • 14. Basic Category Theory Example (visual illustration of functor) F is a functor mapping category of 2-manifolds to category of 1-manifolds. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 14 / 37
  • 15. Functor from Topology to Algebra Transform difficult topological object to well-known algebraic object. object: topological space → group & module morphism: homeomorphism → isomorphism (not really!) Homotopy and homology are easier to compute, but less discriminative homology ⊂ homotopy ⊂ homeomorphy Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 15 / 37
  • 16. Table of Contents 1 Motivation 2 Euler characteristic 3 Homotopy 4 Homology Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 16 / 37
  • 17. Homotopy Definition (homotopy) The homotopy of two continuous functions f , g : X → Y is a continuous function H : X × [0, 1] → Y such that H(x, 0) = f (x) and H(x, 1) = g(x) for x ∈ X. We can think H as a continuous deformation of f into g. Example (homotopy vs homeomorphy) X and Y are homotopy equivalent, but not homeomorphic. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 17 / 37
  • 18. Homotopy Definition (homotopy group) Choose base point s ∈ Sn and x ∈ X. The homotopy group πn(X, x) is the set of homotopy classes of maps f : (Sn, s) → (X, x). For simply connected space, πn(X, x) is independent to x, thus we can write πn(X). We call π1(X) be the fundamental group. Remark (homotopy ‘group’) Remark that πn(X) has a group structure. Even more, for n ≥ 2, πn(X) becomes an abelian group. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 18 / 37
  • 19. Homotopy Intuitively, homotopy group counts the number of loops Example (fundamental group of torus) The fundamental group of torus is π1(T2) = Z × Z. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 19 / 37
  • 20. Undecidability of Homeomorphy/Homotopy Theorem (undecidability of homeomorphy/homotopy) For manifolds with dimension higher than 4, homeomorphy/homotopy problem is undecidable. Proof sketch (Markov’s construction). For given group, construct a corresponding manifold using Dehn surgery. It reduces the homeomorphy/homotopy problem to the group isomorphism problem, which is known to be undecidable. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 20 / 37
  • 21. Limitation of Homotopy Homotopy group is one way to classify topological spaces However, it has several problems: not combinatorial hard to compute infinite description of πn(X) ⇒ It motivates the homology, the combinatorial computable functor with finite description Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 21 / 37
  • 22. Table of Contents 1 Motivation 2 Euler characteristic 3 Homotopy 4 Homology Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 22 / 37
  • 23. Homology There are several ways to define homology (e.g. CW-complex), but we will only cover simplicial homology; We only consider a simplicial complex K First, we will define chain and cycle, the extension of path and loop Definition (chain group) The kth chain group Ck(K), + of K is the free abelian group on the oriented k-simplices. An element of Ck(K) is a k-chain, c = q nq[σq], nq ∈ Z, σq ∈ K. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 23 / 37
  • 24. Homology Definition (boundary homomorphism) The boundary homomorphism ∂k : Ck(K) → Ck−1(K) is ∂kσ = i (−1)i [v0, v1, ..., ˆvi , ..., vn] where ˆvi indicates that vi is deleted from the sequence. Example (boundary homomorphism of simplices) ∂1[a, b] = b − a ∂2[a, b, c] = [b, c] − [a, c] + [a, b] ∂3[a, b, c, d] = [b, c, d] − [a, c, d] + [a, b, d] − [a, b, c] Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 24 / 37
  • 25. Homology Definition (chain complex) The chain complex C∗ is a sequence of chain groups 0 −→ Cn ∂n −→ Cn−1 −→ ... −→ C1 ∂1 −→ C0 ∂0 −→ 0 Definition (cycle, boundary) The kth cycle group is Zk = ker ∂k and the kth boundary group is Bk = im ∂k+1. Elements of Zk and Bk are cycle and boundary. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 25 / 37
  • 26. Homology Theorem (nesting of cycle/boundary group) Zk and Bk are free abelian normal subgroup of Ck such that Bk ≤ Zk ≤ Ck. Here, Bk ≤ Zk since ∂k−1∂k = 0. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 26 / 37
  • 27. Homology Definition (homology group) The kth homology group is Hk = Zk/Bk = ker ∂k/im ∂k−1. Note that homology groups are finitely generated abelian. Definition (Betti number) The kth Betti number βk = βk(Hk) is the rank of the free part of Hk. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 27 / 37
  • 28. Understanding Homology For simplicity, we only consider subcomplexes of S3 Subcomplexes of S3 easy to handle (torsion-free) Algorithmically, simple one point compactification converts R3 to S3 For 3-dim torsion-free space, Betti numbers have intuitive meaning Alexander Duality: β0 measures the number of components β1 measures the number of tunnels β0 measures the number of voids Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 28 / 37
  • 29. Understanding Homology Example (Alexander duality) Homology of basic 2-manifolds. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 29 / 37
  • 30. Invariance We hope homology be invariant for same underlying space First approach was proving that any two triangulations of a topological space have a common refinement (Hauptvermutung) However, it was false for manifolds of dimension ≥ 5 For general spaces, singular homology is introduced Simplical homology is equivalent to singular homology Algorithmically, we can just compute (easy) simplical homology Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 30 / 37
  • 31. Relation to Euler characteristic The sequence of homology groups also forms a chain complex 0 −→ Hn −→ Hn−1 −→ ... −→ H1 −→ H0 −→ 0 Definition (Euler charactersitic of chain complex) The Euler charactersitic of chain complex C∗ is χ(C∗) = i (−1)i rank(Ci ). Theorem (Euler-Poincar´e formula) χ(C∗) = χ(H∗(C∗)) = i (−1)i βi . Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 31 / 37
  • 32. Relation to Homotopy Theorem (Hurewicz theorem) For any space X and positive integer k there is a group homomorphism h∗ : πk(X) → Hk(X). If X is (n − 1)-connected, h∗ is an isomorphism for all 2 ≤ k ≤ n and abelinization for n = 1. In particular, the theorem says that H1(X) ∼= π1(X)/[π1(X), π1(X)]. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 32 / 37
  • 33. Homology with coefficients We assumed chain group be the free abelian group, which is Z-module We may replace this ring with any PID D, such as Z2 Definition (homology with coefficients) The kth homology with ring of coefficients D is Hk(K; D) = Zk(K; D)/Bk(K; D). Our goal is to compute Hk(K; D) for arbitrary D, using Hk(K) If we use Z2, the computation becomes greatly simple (see Chap 7.) Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 33 / 37
  • 34. Homology with coefficients Definition (short exact sequence) The short exact sequence is seqeunce of groups 0 ϕ3 −→ A ϕ2 −→ B ϕ1 −→ C ϕ0 −→ 0 such that im ϕi = ker ϕi−1. Theorem (splitting lemma) For short exact sequence, B ∼= A × C. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 34 / 37
  • 35. Homology with coefficients Theorem (universal coefficient theorem) Let G be an Abelian. Then following sequence is short exact 0 → Hk(K) ⊗ G → Hk(K; G) → Hk−1(K) ∗ G → 0 where ⊗ is tensor product and ∗ is torsion product. Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 35 / 37
  • 36. Homology with coefficients Using universal coefficient theorem and splitting lemma, we can derive Hk(K; D) for some special cases Example (homology with coefficients) 1. Case Hk(K; Zp): Hk(K; Zp) ∼= (Hk(K; Zp) ⊗ Zp) × (Hk(K; Zp) ∗ Zp) ∼= torsion part × (Zp)βk 2. Case Hk(K; F): Hk(K; F) ∼= (Hk(K; F) ⊗ F) × (Hk(K; F) ∗ F) ∼= Fβk Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 36 / 37
  • 37. Questions? Sangwoo Mo (TDA Study) Chap 4. Homology October 16, 2017 37 / 37