simplicial sets, and their application to computing homology
DESCRIPTION
Simplicial Sets, and Their Application to Computing Homology. Patrick Perry November 27, 2002. Simplicial Sets: An Overview. A less restrictive framework for representing a topological space Combinatorial Structure Can be derived from a simplicial complex - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/1.jpg)
Simplicial Sets, and Their Application to Computing
Homology
Patrick Perry
November 27, 2002
![Page 2: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/2.jpg)
Simplicial Sets: An Overview
• A less restrictive framework for representing a topological space
• Combinatorial Structure
• Can be derived from a simplicial complex
• Makes topological simplification easier
• Possibly a good algorithm for Homology computation
![Page 3: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/3.jpg)
Motivation
• If X is a topological space, and A is a contractible subspace of X, then the quotient map X X/A is a homotopy equivalence
• Any n-simplex of a simplicial complex is contractible
![Page 4: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/4.jpg)
Example Simplification
![Page 5: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/5.jpg)
Another Simplification
![Page 6: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/6.jpg)
Geometry Is Not Preserved
• Collapsing a simplex to a point distorts the geometry
• After a series of topological simplifications, a complex may have drastically different geometry
• Does not matter for homology computation
![Page 7: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/7.jpg)
Cannot use a Simplicial Complex!
• Bizarre simplices arrise: face with no edges, edge bounded by only one point
• Need a new object to represent these pseudo-simplices
• Need supporting theory to justify the representation
![Page 8: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/8.jpg)
Simplicial Sets
• A Simplicial Set is a sequence of sets
K = { K0, K1, …, Kn, …}, together with functions
di : Kn Kn-1
si : Kn Kn+1
for each 0 i n
![Page 9: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/9.jpg)
Simplicial Identities
• didk = dk-1di for i < k
• disk = sk-1di for i < k
= identity for i = j, j+1
= skdi-1 for i > k + 1
• sisk = sk+1si for i k
![Page 10: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/10.jpg)
Simplicial Complexes as Simplicial Sets
• A simplicial set can be constructed from a simplicial complex as follows:
Order the vertices of the complex.
Kn = { n-simplices }
di = delete vertex in position i
si = repeat vertex in position i
![Page 11: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/11.jpg)
Homology of Simplicial Set
• Chain complexes are the free abelian groups on the n-simplices
• Boundary operator: (-1)i di
• Degenerate (x = si y) complexes are 0
• Homology of Simplicial Set is the same as the homology of the simplicial complex
![Page 12: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/12.jpg)
Bizarre Simplices are OK
• Simplicial sets allow us to have an
n-simplex with fewer faces than an n-simplex from a simplicial complex
• Our bizarre collapses make sense in the Simplicial Set world
![Page 13: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/13.jpg)
What has Trivial Homology?
V E F 0 1 2
3
2
1
2
1
1
1
2
1
3
3
3
2
2
1
0
1
1
1
1
1
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
0
1
2
0
1
0
0
0
1
0
0
0
0
0
0
1
0
0
![Page 14: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/14.jpg)
Example From Before Makes Sense
![Page 15: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/15.jpg)
New Example: Torus
![Page 16: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/16.jpg)
End Result for Torus
• We have eliminated 8 faces, 16 edges, and 8 vertices
• Cannot simplify any further without affecting homology
![Page 17: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/17.jpg)
Benefit of Simplicial Set
• More flexibility in what we are allowed to do to a complex
• Linear-time algorithm to reduce the size of a complex
• Can use Gaussian Elimination to compute Homology of simplified complex
![Page 18: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/18.jpg)
Can We Simplify Further?
• What about (X X/A) + bookkeeping?
![Page 19: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/19.jpg)
Bookkeeping
• Using Long Exact Sequence, we can figure out how to simplify further:
d(Hn(X)) = d(Hn(A)) + d(Hn(X/A))
+ d(ker in-1*) - d(ker in
*)
• If i* is injective, bookkeeping is easy
![Page 20: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/20.jpg)
Torus (Revisited)
![Page 21: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/21.jpg)
Collapsing the Torus to a Point
• Inclusion map on Homology is injecive in each simplification
• = (0, 0, 0) + (0, 1, 0) + (0, 1, 0) + (0, 0, 1) = (0, 2, 1)
![Page 22: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/22.jpg)
Good News
• Computation of ker i* is local
• Potentially compute homology in
O(n TIME(ker i* ))
![Page 23: Simplicial Sets, and Their Application to Computing Homology](https://reader036.vdocument.in/reader036/viewer/2022062309/56813954550346895da0f402/html5/thumbnails/23.jpg)
Conclusion
• A less restrictive combinatorial framework for representing a topological space
• Can be derived from a simplicial complex
• Makes topological simplification easier
• Possibly a good algorithm for Homology computation