Without considering the geometric meaning, if we just define it plainly, in Algebraic Topology, the Betti Number is merely the rank of the homology group in a chain complex. The problem is that such an explanation does not help those curious about the meaning of Betti numbers, and it’s also difficult to learn through examples because the specific calculation is daunting.
In this post, we introduce a theorem that answers at least the second question—how to calculate Betti numbers—with its detailed proof. According to the theorem introduced below, a certain matrix can be found according to the given chain complex, and through a series of calculations, the following explicit formula can be derived.
βp=rank?1−rank?2
Although the best explanation for mathematical content is to convey it without using mathematics, in the case of Betti numbers, one can realize its fundamental principles through the process of deriving the formula. The proof may be quite difficult for undergraduates to follow, but it is written in detail without omissions, so it is recommended to at least give it a try.
Let’s say n∈N0. Chain
⋯⟶Cn+1⟶∂n+1Cn⟶∂nCn−1⟶⋯⟶C1⟶∂1C0⟶∂00
If it satisfies
∂n∘∂n+1=0
for all n, then C:={(Cn,∂n)}n=0∞ is called a Chain Complex.
The Quotient groupHn:=ker∂n/Im∂n+1 is called the n-th Homology group of C.
Elements of Zn:=ker∂n are called n-Cycles, and elements of Bn:=Im∂n+1 are called n-Boundaries.
Standard Basis Decomposition of Free Chain Complexes
Assuming that all Cp of the Chain ComplexC:={(Cp,∂p)} are Free groups with Finite Rank, there exist SubgroupsUp,Vp,Wp⊂Cp and for all p and Zp:=ker∂p that satisfy the following.
Cp==Up⊕Vp⊕WpUp⊕Zp∂p(Up)⊂Zp=WpVp⊕Wp
Of course, Zp is the Kernel of ∂p, so ∂p(Vp)=0 and ∂p(Wp)=0. Furthermore, the Restriction Function∂p∣Up:Up→Wp−1 from Up to ∂p has the following Smith Normal Form.
b1⋮0⋯⋱⋯0⋮bl
Here, bi∈N and b1∣⋯∣bl.
The Betti Number of Hp(C) is called the p-th Betti Number of C. The βp of a finite ComplexK is as follows.
βp=rankZp−rankBp
Its specific values can be calculated by the Smith Normal Form of ∂p as follows. In the diagram, the blue dotted line represents the diagonal components where 1, the orange solid line represents the diagonal components where 1 is not 0, and all other components are 02.
What is important here is the number rankBp−1 of 1 in the Smith Normal Form, and the number of zero columns rankZp.
Let’s say Zp:=Bp:=Wp:=ker∂pIm∂p+1{cp∈Cp:λcp∈Bp,∀m=0}. In particular, Wp becomes a Subgroup of Cp, and considering only λ=1, it weakens the condition of the Boundary Bp, so it is called a Weak Boundary.
From the definition of Wp, if we consider λ=1Bp⊂Wp
From the definition of Zp, since ∀zp∈Zp is ∂pzp=0 and Zp=ker∂p is ∂p:Cp→Cp−1Zp⊂Cp
Since Cp is assumed to be a Free group, it is Torsion-Free, meaning there does not exist λ=0 that satisfies λzp=0 for any ∀zp∈Zp⊂Cp. Meanwhile, for all cp+1∈Cp+1∂p+1cp+1=λzp∈Wp
If we apply ∂p to both sides,
0=∂p∂p+1cp+1=∂pλzp=λ∂pzp
so ∂pzp=0 must hold. This means if λzp∈Wp then λzp∈Zp,
Wp⊂Zp
From such considerations, we obtain the following inclusion relationships.
Bp⊂Wp⊂Zp⊂Cp
Part 2. Wp⊂Zp is a Direct Summand of Zp
From the definition of the p-th Homology group Hp(C)=Zp/Bpproj1:Zp→Hp(C)
is a Projection with a rank reduced by as much as the CosetBp, and
For the Torsion SubgroupTp(C)⊂Hp(C) of Hp(C)proj2:Hp(C)→Hp(C)/Tp(C)
is also a projection.
Therefore, defined as proj:=proj1∘proj2proj:Zp→Hp(C)/Tp(C)
is also a projection. Elements of Wp are expressed as ∂p+1dp+1, so the kernel of this projection proj is Wp, and since every projection is a Surjection, according to the First Isomorphism Theorem,
Zp/Wp≃Hp/Tp
holds. Here, regardless of how the right side of Hp is formed, it’s reduced by the Torsion SubgroupTp, so it’s torsion-free, thereby ensuring that the left side Zp/Wp is also torsion-free. Therefore, if α1,⋯,αk is the basis of Zp/Wp, and α1′,⋯,αl′∈Wp is the basis of Wp, then α1,⋯,αk,α1′,⋯,αl′ becomes the basis of Zp. Thus, Zp can be expressed as a direct sum of the SubgroupVp with the basis α1,⋯,αk and Wp.
Part 3. Basis of Zp,Bp−1,Wp−1
Homomorphism’s Smith Normal Form: If the ranks of free Abelian groups G and G′ are n,m and f:G→G′, respectively, and g is a homomorphism, then there exists a homomorphism g with the following matrix.
d1000⋮00⋱00⋮000dr0⋮00000⋮0⋯⋯⋯⋯⋱⋯0000⋮0∈Zm×n
Here, d1,⋯,dr∈N and d1∣⋯∣dr, meaning dk must be a divisor of dk+1.
∂p:Cp→Cp−1 has the following Smith Normal Form of the matrix m×n.
Here, we will directly show the following three things:
(1): el+1,⋯,en is the basis of Zp.
(2): b1e1′,⋯,blel′ is the basis of Bp−1.
(3): e1′,⋯,el′ is the basis of Wp−1.
Sub-proof
According to the definition of ∂p, for a general cp∈Cp, the following holds.
cp=i=1∑naiei⟹∂pcp=i=1∑laibiei′
(1): Since bi=0, the necessary and sufficient condition for Zp=ker∂p is for ai=0 for any i=1⋯,l. Therefore, el+1,⋯,en is the basis of Zp.
(2): Every ∂pcp∈Bp−1 can be expressed as a Linear Combination of b1e1′,⋯,blel′, and since bi=0, b1e1′,⋯,blel′ is the basis of Bp−1.
(3): Since biei′=∂ei, first of all, e1′,⋯,el′∈Wp−1. Conversely, if we set cp−1∈Cp−1 as
cp−1=i=1∑mdiei′
and assume cp−1∈Wp−1, then since Wp−1 was defined as Wp−1={cp∈Cp:λcp∈Bp,∀m=0}, cp−1 can be expressed in the form of
λcp−1=∂cp=i=1∑laibiei′
for some λ=0. Comparing coefficients, for i>l, we obtain
λdi=0⟹di=0
Therefore, e1′,⋯,el′ is the basis of Wp−1.
Part 4. Proof of ‘Standard Basis Decomposition of Free Chain Complexes’
For Cp and Cp−1, if we consider the Free group generated by e1,⋯,el appearing in the discussion so far as Up, then since Zp=Vp⊕Wp, we obtain
Cp==Up⊕ZpUp⊕(Vp⊕Wp)
as ∂Vp=∂Wp=0. Here, note that Wp and Zp are unique according to Cp, but Up and Vp do not necessarily have to be unique.
Part 5. Proof of ‘Efficient Computability of Homology groups’
According to Part 4, for the ComplexK, the following decomposition is guaranteed to exist.
Cp(K)=Zp=Up⊕Vp⊕WpVp⊕Wp
Properties of Direct Sum: Let’s say G=G1⊕G2. If H1 is a subgroup of G1 and H2 is a subgroup of G2, then H1 and H2 can also be expressed as a direct sum, especially the following holds.
H1⊕H2G≃H1G1⊕H2G2
[1]: If we say H1≃G1 and H2≃{0}, then G/G1≃G2
[2]: If we say H1≃{0}, then H2G≃G1⊕H2G2
Since it was Bp⊂Wp⊂Zp⊂Cp in Part 1, according to the properties of the Direct Sum,
Hp(K)====Zp/Bp(BpVp⊕Wp)Vp⊕(BpWp)(WpZp)⊕(BpWp)∵[2]∵[1]
is obtained. Here, in Hp(K)=(Zp/Wp)⊕(Wp/Bp),
Therefore, the p-th Betti Number βp of K is calculated as follows.
βp=====rankHp(K)rank[(Zp/Wp)⊕(Wp/Bp)]rank(Zp/Wp)+rank(Wp/Bp)[rankZp−rankWp]+[rankWp−rankBp]rankZp−rankBp
Meanwhile, for the torsion part of Hp−1(K) and b1∣⋯∣bl∈N, the following Isomorphism can be known to exist.
Wp−1/Bp−1≃(b1ZZ)⊕⋯⊕(blZZ)
Here, the fact that bi=1 for i≤l, in other words, the rank of Bp−1 is l, is because
Z/biZ=Z/Z={0}
so the rank of Wp−1 is reduced by l.
■
Example
Torus
β0=β1=β2=121
The Betti numbers of a torus are known as above. Assuming the chain complex of this torus is defined as in the above figure, let’s just calculate β1=2 as an example. There is also a way to calculate it by just mathematically pondering without using the formula derived above, but as you can read, it’s headache-inducingly difficult. In contrast, let’s see how convenient it is to ’efficiently calculate homology’.
Homomorphism’s Smith Normal Form: For Free Abelian groupsG and G′, if a1,⋯,an is the basis of G, and a1′,⋯,am′ is the basis of G′, and if the function f:G→G′ is a Homomorphism, then there exists a unique set of integers {λij}⊂Z that satisfies the following.
f(aj)=i=1∑mλijai′
Here, the matrix (λij)∈Zm×n is called the Matrix of f with respect to the bases of G and G′.
Since β1=rankZ1−rankB1, at least the Boundary Matrices(∂1) and (∂2) need to be found. For all a,b,c∈C1(T),
∂1(a)=∂1(b)=∂1(c)=v−v=0=0vv−v=0=0vv−v=0=0v
is obtained. Zp is the number of zero vectors on the right side of the matrix, and Bp−1 is the number of 1 in the matrix. Considering ∂2 next,
∂2(U)=∂2(L)=−a−b+ca+b−c
is obtained. Combining these, the 1-th Betti Number β1 of the torus is calculated as follows.
β1=rankZ1−rankB1=3−1=2
Of course, this result is guaranteed to match the value obtained by using all sorts of mathematical knowledge, discussing what the Free group is, what an Isomorphism is, and so on, according to the theorems introduced in this post. To speak a bit recklessly, one can ‘calculate’ Betti numbers, that is, ‘homology’, just by following instructions without using the brain. On the other hand, to put it more positively, it opens the way to studying topology through computers.
Munkres. (1984). Elements of Algebraic Topology: p58. ↩︎
Edelsbrunner, Harer. (2010). Computational Topology An Introduction: p104. ↩︎
Munkres. (1984). Elements of Algebraic Topology: p58~61. ↩︎