Lecture 2: Addition (and free abelian groups)
description
Transcript of Lecture 2: Addition (and free abelian groups)
![Page 1: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/1.jpg)
Lecture 2: Addition (and free abelian groups)
of 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, 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
![Page 2: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/2.jpg)
A free abelian group generated by the elements x1, x2, …, xk consists of all elements of the form
n1x1 + n2x2 + … + nkxk
where ni are integers.
Z = The set of integers = { …, -2, -1, 0, 1, 2, …} = the set of all whole numbers (positive, negative, 0)
Addition:(n1x1 + n2x2 + … + nkxk) + (m1x1 + m2x2 + … + mkxk)
= (n1 + m1) x1 + (n2 + m2)x2 + … + (nk + mk)xk
![Page 3: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/3.jpg)
Formal sum: 4 cone flower + 2 rose + 3 cone flower + 1 rose
= 7 cone flower + 3 rose
Will add video clips when video becomes available.
![Page 4: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/4.jpg)
A free abelian group generated by the elements x1, x2, …, xk consists of all elements of the form
n1x1 + n2x2 + … + nkxk
where ni are integers.
Z = The set of integers = { …, -2, -1, 0, 1, 2, …} = the set of all whole numbers (positive, negative, 0)
Addition:(n1x1 + n2x2 + … + nkxk) + (m1x1 + m2x2 + … + mkxk)
= (n1 + m1) x1 + (n2 + m2)x2 + … + (nk + mk)xk
![Page 5: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/5.jpg)
A free abelian group generated by the elements x1, x2, …, xk consists of all elements of the form
n1x1 + n2x2 + … + nkxk
where ni are integers.
Example: Z[x1, x2]
4x1 + 2x2
x1 - 2x2
-3x1
kx1 + nx2
Z = The set of integers = { …, -2, -1, 0, 1, 2, …}
![Page 6: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/6.jpg)
A free abelian group generated by the elements x1, x2, …, xk consists of all elements of the form
n1x1 + n2x2 + … + nkxk
where ni are integers.
Example: Z[x , x ]
4 ix + 2 Ix – 2 i
-3 x
k + n iii
Z = The set of integers = { …, -2, -1, 0, 1, 2, …}
![Page 7: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/7.jpg)
A free abelian group generated by the elements x1, x2, …, xk consists of all elements of the form
n1x1 + n2x2 + … + nkxk
where ni are integers.
Example: Z[x1, x2]
4x1 + 2x2
x1 - 2x2
-3x1
kx1 + nx2
Z = The set of integers = { …, -2, -1, 0, 1, 2, …}
![Page 8: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/8.jpg)
Addition:(n1x1 + n2x2 + … + nkxk) + (m1x1 + m2x2 + … + mkxk)
= (n1 + m1) x1 + (n2 + m2)x2 + … + (nk + mk)xk
Example: Z[x1, x2]
(4x1 + 2x2) + (3x1 + x2) = 7x1 + 3x2
(4x1 + 2x2) + (x1 - 2x2) = 5x1
![Page 9: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/9.jpg)
Addition:(n1x1 + n2x2 + … + nkxk) + (m1x1 + m2x2 + … + mkxk)
= (n1 + m1) x1 + (n2 + m2)x2 + … + (nk + mk)xk
Example: Z[x , x2]
(4x + 2x2) + (3 x + x2) = 7 x + 3x2
(4x1 + 2x2) + (x1 - 2x2) = 5x1
![Page 10: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/10.jpg)
Addition:(n1x1 + n2x2 + … + nkxk) + (m1x1 + m2x2 + … + mkxk)
= (n1 + m1) x1 + (n2 + m2)x2 + … + (nk + mk)xk
Example: Z[x1, x2]
(4x1 + 2x2) + (3x1 + x2) = 7x1 + 3x2
(4x1 + 2x2) + (x1 - 2x2) = 5x1
![Page 11: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/11.jpg)
v = vertex e = edge f = face
Example:
4 vertices + 5 edges + 1 faces4v + 5e + f.
![Page 12: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/12.jpg)
v = vertex e = edge
Example 2:
4 vertices + 5 edges4v + 5e
![Page 13: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/13.jpg)
v1 + v2 + v3 + v4 + e1 + e2 + e3 + e4 + e5
e2e1
e5e4
e3v1
v2
v3
v4
![Page 14: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/14.jpg)
v1 + v2 + v3 + v4 in Z[v1, v2, , v3, v4]
e1 + e2 + e3 + e4 + e5 in Z[e1, e2, , e3, e4, e5]
e2e1
e5e4
e3v1
v2
v3
v4
![Page 15: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/15.jpg)
Technical note: In graph theory, the cycle also includes vertices. I.e, this cycle in graph theory is the path v1, e1, v2, e2, v3, e3, v1, . Since we are interested in simplicial complexes (see later lecture), we only need the edges, so e1 + e2 + e3 is a cycle.
Note that e1 + e2 + e3 is a cycle.e2e1
e5e4
e3v1
v2
v3
v4
![Page 16: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/16.jpg)
Technical note: In graph theory, the cycle also includes vertices. I.e, the cycle in graph theory is the path v1, e1, v2, e2, v3, e3, v1, . Since we are interested in simplicial complexes (see later lecture), we only need the edges, so e1 + e2 + e3 is a cycle.
Note that e3 + e4 + e5 is a cycle.
Note that e1 + e2 + e3 is a cycle.e2e1
e5e4
e3v1
v2
v3
v4
![Page 17: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/17.jpg)
Note that e1 + e2 + e3 is a cycle.
Note that – e3 + e5 + e4 is a cycle.
e2e1
e5e4
e3v1
v2
v3
v4
![Page 18: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/18.jpg)
Note that e1 + e2 + e3 is a cycle.
Note that – e3 + e4 + e5 is a cycle.
e2e1
e5e4
e3v1
v2
v3
v4
ei Objects: oriented edges
![Page 19: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/19.jpg)
Note that e1 + e2 + e3 is a cycle.
Note that – e3 + e5 + e4 is a cycle.
e2e1
e5e4
e3v1
v2
v3
v4
ei Objects: oriented edgesin Z[e1, e2, e3, e4, e5]
![Page 20: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/20.jpg)
Note that e1 + e2 + e3 is a cycle.
Note that – e3 + e5 + e4 is a cycle.
e2e1
e5e4
e3v1
v2
v3
v4
ei Objects: oriented edgesin Z[e1, e2, e3, e4, e5]
– ei
![Page 21: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/21.jpg)
(e1 + e2 + e3) + (–e3 + e5 + e4) = e1 + e2 + e5 + e4
e2e1
e5e4
e2e1
e5e4
e3v1
v2
v3
v4
![Page 22: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/22.jpg)
e1 + e2 + e3 + e1 + e2 + e5 + e4 = 2e1 + 2e2 + e3 + e4 + e5
e1 + e2 + e5 + e4 + e1 + e2 + e3 = 2e1 + 2e2 + e3 + e4 + e5
e2e1
e5e4
e3v1
v2
v3
v4
e2e1
e5e4
e3v1
v2
v3
v4
![Page 23: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/23.jpg)
The boundary of e1 = v2 – v1e2e1
e5e4
e3v1
v2
v3
v4
![Page 24: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/24.jpg)
The boundary of e1 = v2 – v1
The boundary of e2 = v3 – v2
The boundary of e3 = v1 – v3
e2e1
e5e4
e3v1
v2
v3
v4
The boundary of e1 + e2 + e3
= v2 – v1 + v3 – v2 + v1 – v3 = 0
![Page 25: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/25.jpg)
e2e1
e5e4
e3v1
v2
v3
v4
Add a face
![Page 26: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/26.jpg)
e2e1
e5e4
e3v1
v2
v3
v4
Add an oriented face
![Page 27: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/27.jpg)
e2e1
e5e4
e3v1
v2
v3
v4
Add an oriented face
e2e1
e5e4
e3v1
v2
v3
v4
![Page 28: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/28.jpg)
e2e1
e5e4
e3v1
v2
v3
v4
Add an oriented face
Note that the boundary of this face is the cycle
e1 + e2 + e3
![Page 29: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/29.jpg)
e2e1
e5e4
e3v1
v2
v3
v4
Simplicial complex
![Page 30: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/30.jpg)
v2
e2e1
e3v1 v3
2-simplex = oriented face = (vi, vj, vk)
Note that the boundary of this face is the cycle
e1 + e2 + e3
1-simplex = oriented edge = (vj, vk) Note that the boundary
of this edge is vk – vj evj vk
0-simplex = vertex = v
![Page 31: Lecture 2: Addition (and free abelian groups)](https://reader035.fdocuments.in/reader035/viewer/2022062305/56815f10550346895dcdd12f/html5/thumbnails/31.jpg)
3-simplex = (v1, v2, v3, v4) = tetrahedron
4-simplex = (v1, v2, v3, v4, v5)
v4
v3v1
v2