Download presentation

Presentation is loading. Please wait.

Published byFlora Rose Modified over 2 years ago

1
Lecture 5: Triangulations & simplicial complexes (and cell complexes). in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Target Audience: Anyone interested in topological data analysis including graduate students, faculty, industrial researchers in bioinformatics, biology, business, computer science, cosmology, engineering, imaging, mathematics, neurology, physics, statistics, etc. Isabel K. Darcy Mathematics Department/Applied Mathematical & Computational Sciences University of Iowa http://www.math.uiowa.edu/~idarcy/AppliedTopology.html

2
v2v2 e2e2 e1e1 e3e3 v1v1 v3v3 2-simplex = triangle = {v 1, v 2, v 3 } Note that the boundary of this triangle is the cycle e 1 + e 2 + e 3 = {v 1, v 2 } + {v 2, v 3 } + {v 1, v 3 } 1-simplex = edge = {v 1, v 2 } Note that the boundary of this edge is v 2 + v 1 e v1v1 v2v2 0-simplex = vertex = v Building blocks for a simplicial complex

3
3-simplex = {v 1, v 2, v 3, v 4 } = tetrahedron boundary of {v 1, v 2, v 3, v 4 } = {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n-simplex = {v 1, v 2, …, v n+1 } v4v4 v3v3 v1v1 v2v2 Building blocks for a simplicial complex

4
3-simplex = {v 1, v 2, v 3, v 4 } = tetrahedron boundary of {v 1, v 2, v 3, v 4 } = {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n-simplex = {v 1, v 2, …, v n+1 } v4v4 v3v3 v1v1 v2v2 Building blocks for a simplicial complex v4v4 v3v3 v1v1 v2v2 Fill in

5
Creating a simplicial complex 0.) Start by adding 0-dimensional vertices (0-simplices)

6
Creating a simplicial complex 1.) Next add 1-dimensional edges (1-simplices). Note: These edges must connect two vertices. I.e., the boundary of an edge is two vertices

7
Creating a simplicial complex 1.) Next add 1-dimensional edges (1-simplices). Note: These edges must connect two vertices. I.e., the boundary of an edge is two vertices

8
Creating a simplicial complex 1.) Next add 1-dimensional edges (1-simplices). Note: These edges must connect two vertices. I.e., the boundary of an edge is two vertices

9
Creating a simplicial complex 2.) Add 2-dimensional triangles (2-simplices). Boundary of a triangle = a cycle consisting of 3 edges.

10
Creating a simplicial complex 2.) Add 2-dimensional triangles (2-simplices). Boundary of a triangle = a cycle consisting of 3 edges.

11
Creating a simplicial complex 3.) Add 3-dimensional tetrahedrons (3-simplices). Boundary of a 3-simplex = a cycle consisting of its four 2-dimensional faces.

12
Creating a simplicial complex 3.) Add 3-dimensional tetrahedrons (3-simplices). Boundary of a 3-simplex = a cycle consisting of its four 2-dimensional faces.

13
4.) Add 4-dimensional 4-simplices, {v 1, v 2, …, v 5 }. Boundary of a 4-simplex = a cycle consisting of 3-simplices. = {v 2, v 3, v 4, v 5 } + {v 1, v 3, v 4, v 5 } + {v 1, v 2, v 4, v 5 } + {v 1, v 2, v 3, v 5 } + {v 1, v 2, v 3, v 4 }

14
Creating a simplicial complex n.) Add n-dimensional n-simplices, {v 1, v 2, …, v n+1 }. Boundary of a n-simplex = a cycle consisting of (n-1)-simplices.

15
circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

16
circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

17
circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

18
circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

19
circle = { x in R 2 : ||x || = 1 } Example: Triangulating the circle.

20
disk = { x in R 2 : ||x || ≤ 1 } Example: Triangulating the disk.

21
disk = { x in R 2 : ||x || ≤ 1 } Example: Triangulating the disk.

22
disk = { x in R 2 : ||x || ≤ 1 } Example: Triangulating the disk.

23
disk = { x in R 2 : ||x || ≤ 1 } Example: Triangulating the disk.

24
disk = { x in R 2 : ||x || ≤ 1 } = Example: Triangulating the disk.

25
sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

26
sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

27
sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

28
sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

29
Example: Triangulating the circle. disk = { x in R 2 : ||x || ≤ 1 } =

30
Example: Triangulating the circle. disk = { x in R 2 : ||x || ≤ 1 }

31
Example: Triangulating the circle. disk = { x in R 2 : ||x || ≤ 1 } Fist image from http://openclipart.org/detail/1000/a-raised-fist-by-liftarn

32
sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere.

33
sphere = { x in R 3 : ||x || = 1 } Example: Triangulating the sphere. =

34
Creating a cell complex Building block: n-cells = { x in R n : || x || ≤ 1 } Examples: 0-cell = { x in R 0 : ||x || < 1 } 1-cell =open interval ={ x in R : ||x || < 1 } ( ) 3-cell = open ball = { x in R 3 : ||x || < 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 }

35
v2v2 e2e2 e1e1 e3e3 v1v1 v3v3 2-simplex = triangle = {v 1, v 2, v 3 } Note that the boundary of this triangle is the cycle e 1 + e 2 + e 3 = {v 1, v 2 } + {v 2, v 3 } + {v 1, v 3 } 1-simplex = edge = {v 1, v 2 } Note that the boundary of this edge is v 2 + v 1 e v1v1 v2v2 0-simplex = vertex = v Building blocks for a simplicial complex

36
3-simplex = {v 1, v 2, v 3, v 4 } = tetrahedron boundary of {v 1, v 2, v 3, v 4 } = {v 1, v 2, v 3 } + {v 1, v 2, v 4 } + {v 1, v 3, v 4 } + {v 2, v 3, v 4 } n-simplex = {v 1, v 2, …, v n+1 } v4v4 v3v3 v1v1 v2v2 v4v4 v3v3 v1v1 v2v2 Fill in Building blocks for a simplicial complex

37
Creating a cell complex Building block: n-cells = { x in R n : || x || ≤ 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 } 3-cell = open ball = { x in R 3 : ||x || < 1 } Examples: 0-cell = { x in R 0 : ||x || < 1 } 1-cell =open interval ={ x in R : ||x || < 1 } ( )

38
Creating a cell complex Building block: n-cells = { x in R n : || x || ≤ 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 } Examples: 0-cell = { x in R 0 : ||x || < 1 } 1-cell =open interval ={ x in R : ||x || < 1 } ( ) 3-cell = open ball = { x in R 3 : ||x || < 1 }

39
Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex

40
Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex

41
Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex ( ) U

42
Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex [ ] U

43
Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex [ ] U =

44
Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex [ ] U = U

45
Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex Cell complex [ ] U = U =

46
Euler characteristic (simple form): = number of vertices – number of edges + number of faces Or in short-hand, = |V| - |E| + |F| where V = set of vertices E = set of edges F = set of 2-dimensional faces & the notation |X| = the number of elements in the set X.

47
Example: disk = { x in R 2 : ||x || ≤ 1 } ( ) U = = Simplicial complex 3 vertices, 3 edges, 1 triangle Cell complex 1 vertex, 1 edge, 1 disk. [ ] U = U =

48
Euler characteristic: Given a simplicial complex C, let C n = the set of n-dimensional simplices in C, and let |C n | denote the number of elements in C n. Then = |C 0 | - |C 1 | + |C 2 | - |C 3 | + … = Σ (-1) n |C n |

49
Euler characteristic: Given a cell complex C, let C n = the set of n-dimensional cells in C, and let |C n | denote the number of elements in C n. Then = |C 0 | - |C 1 | + |C 2 | - |C 3 | + … = Σ (-1) n |C n |

50
Example: sphere = { x in R 3 : ||x || = 1 } Simplicial complex 4 vertices, 6 edges, 4 triangles Cell Complex 1 vertex, 1 disk = U =

51
Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex =

52
Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex U =

53
Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex U = =

54
Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex U = = Fist image from http://openclipart.org/detail/1000/a-raised-fist-by-liftarn

55
Example: sphere = { x in R 3 : ||x || = 1 } U = Cell complex U = =

56
Example: sphere = { x in R 3 : ||x || = 1 } U = Cell complex U = =

57
Example: sphere = { x in R 3 : ||x || = 1 } U = Simplicial complex Cell complex Cell complex U = =

Similar presentations

OK

Planar Graphs and Partially Ordered Sets William T. Trotter Georgia Institute of Technology.

Planar Graphs and Partially Ordered Sets William T. Trotter Georgia Institute of Technology.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on new project launch Ppt on history of atomic structure Ppt on power sharing in india download song Ppt on nanotechnology in mechanical engineering Ppt on microsoft surface technology Ppt on employee provident fund act 1952 Ppt on healthy food and junk food Ppt on steve jobs biography pdf Ppt on organizational culture and values Ppt on conservation of biodiversity in india