Delta, Nerve, Čech complexes

01 Theory - Delta complexes

The Δ-complex structure is a generalization of simplicial complex structure. Instead of gluing simplices from the same n+1 by causing them to intersect at faces, one glues simplices from disjoint copies of n+1 using a formal quotient topology construction.

This technique allows many common spaces to be represented using fewer simplices. For example, a circle may be given as a Δ-complex by identifying the two vertices of the standard 1-simplex. The torus may be given using just two 2-simplices by identifying each of the pairs of sides.

center

Why not simplicial?

These spaces cannot be formed as simplicial complexes by gluing the given simplices.

They are not literally simplicial complexes because the circle is round and the torus is not a subset of 2.

They are not homeomorphic to simplicial complexes (with the indicated decompositions) because the circle has a 1-loop while the torus has simplices which intersect in more than one face. (Both are impossible features for the homeomorphism type of simplicial complexes with the given decompositions.)

Δ-Complex - Combinatorial

A combinatorial Δ-complex is a sequence of simplex sets {Sn}n together with attaching maps din:Sn+1Sn, for i=0,1,,n+1, one for each facet of a simplex in Sn+1.

Attaching maps join the faces of each simplex to simplices of lower dimension. This works geometrically when the attaching maps preserve adjacency of faces of faces. Preserving adjacency is equivalent to this combinatorial condition:

dindjn+1=dj1ndin+1wheni<j

The adjacency condition may be illustrated with a 2-simplex:

center

Faces are numbered by removing a vertex in the order of vertices. So [v0^,v1,v2] is edge 0 of the 2-simplex [v0,v1,v2], and [v0,v1^,v2] is edge 1, and so on. Thus v1 is face 0 of the 1-simplex [v0,v1], and v0 is face 1, and so on for the other edges.

Now interpret the adjacency condition: Take as input the 2-simplex.

  • With i=0,j=1
    • The condition says “vertex 0 of edge 1 equals vertex 11 of edge 0.”
    • These vertices are the point v2.
  • With i=0,j=2
    • The condition says “vertex 0 of edge 2 equals vertex 21 of edge 0.”
    • These vertices are the point v1.
  • With i=1,j=2
    • The condition says “vertex 1 of edge 2 equals vertex 21 of edge 1.”
    • These vertices are the point v0.

Δ-Complex - Topological

A Δ-complex 𝒦 is the topological space formed from a combinatorial Δ-complex 𝒮={Sn}n as the disjoint union of simplices enumerated by elements of 𝒮, glued together according to the combinatorial attaching maps with canonically defined linear functions interpolating between glued vertices.

𝒦=(nSn×σn)/

where (σ,ιix)(diσ,x), with ιi:σn1σn is the inclusion of the ith face of the standard simplex σn, and xσn1 is any point in that face.

Simplicial vs. Δ complexes

How best to think about simplicial vs. Δ- complexes?

  • Simplicial complex:
    • Collection of geometric simplices in the same background space n+1.
    • A sub-simplex brought to touch another sub-simplex only in one congruent face, where they are glued.
  • Δ-complex:
    • Collection of abstract geometric simplices in distinct background spaces (disjoint union).
    • Simplices in Sn+1 are attached to the lower-dimensional structure by gluing in the faces of new (n+1)-simplices, preserving only the adjacency relation.

Underlying space

Given a complex 𝒦 (simplicial complex or Δ-complex), the underlying topological space of 𝒦 is denoted |𝒦|.

Δ-homology

Homology may be defined for Δ-complexes using the same technique as for simplicial complexes.

When a simplicial complex is also a Δ-complex, their homology groups are canonically isomorphic.

02 Theory - Nerve complex

Nerve complex

Suppose 𝒰={Ui}iI is a collection of sets indexed by I. The nerve complex 𝒩(𝒰) is the collection of finite subsets JI such that jJUj is nonempty.

That is, the nerve is the complex of indices of finite collections of mutually overlapping subsets from 𝒰.

Notes:

  • The definition does not assume that the Ui are subsets of a topological space. If they are, we do not assume that they are open.
  • The nerve complex is a combinatorial complex: the elements are sets of indices, not the subsets themselves.
  • Suppose J𝒩(𝒰) is a subset in the nerve.
    • Then all subsets of J are also in the nerve.
    • I.e. the nerve is closed under taking subsets.
  • Therefore: the nerve is a combinatorial simplicial complex.

As a simplicial complex:

  • vertices of the nerve correspond to individual sets Ui𝒰
  • k-simplices in the nerve correspond to nonempty subsets having k elements

center


Theorem: Geometric realization

Every combinatorial simplicial complex with N vertices can be realized as a geometric simplicial complex in N.

In fact, every combinatorial simplicial complex with maximum simplex dimension equal to d can be realized as a geometric simplicial complex in 2d+1.

03 Theory - Čech complex

Čech complex

Suppose (X,d) is a metric space. Suppose 𝒫={p1,p2,,pn} is a finite set of points in X.

Fix r>0. Define Ui as the open balls:

Ui=𝐁r(pi),r=1,2,,n

The nerve of 𝒰={U1,U2,,Un} is called the Čech complex of 𝒫.

04 Illustration

Let 𝒫 be four points in 2 as in the figure.

center

The Čech complex created using r=2 is 1-dimensional – three of the points are linked.

The Čech complex created using r=5 is 2-dimensional – the three linked points now span a 2-simplex. The fourth point is also connected.

Homotopy type

05 Theory - Homotopy type and homology

Homology can be used to distinguish topological spaces or to measure the topological complexity of a space. From the perspective of computational complexity theory, homology is very easy to compute.

Theorem: Homology depends functionally on |𝒦|

The isomorphism types of the homology groups Hi(𝒦;) of a simplicial complex 𝒦 depend only on |𝒦|, the underlying topological space.

More precisely, a homeomorphism of topological spaces induces an isomorphism of homology groups.

This theorem implies that any two homeomorphic spaces have isomorphic homology groups.

  • %& For a topological space X, we write Hi(X;) for the homology groups of X computed using any simplicial complex structure provided on X.
    • If X does not have a simplicial complex structure, or Δ-complex structure, one can still define singular homology for X, and this homology still depends functionally only on the homeomorphism type.
    • Singular homology is isomorphic to simplicial and Δ-homology when the latter can be defined.

There is an equivalence relation between spaces that is much ‘coarser’ than homeomorphism, namely homotopy equivalence.

Homotopy equivalence

A homotopy equivalence between topological spaces X and Y is a pair (f,g) of continuous maps:

center

such that fg is homotopic to IdX and gf is homotopic to IdY.

We write XY when X and Y are homotopy equivalent.

A homotopy from fg to IdX would be a continuous map F:X×[0,1]X such that F(x,0)=(fg)(x) and F(x,1)=IdX(x)=x. Analogously for a homotopy gf to IdY.

A homeomorphism is actually the special case of a homotopy equivalence where the homotopies fgIdX and gfIdY are both the identity maps.

Theorem: Homology depends functionally on homotopy type

The isomorphism types of the homology groups Hi(𝒦;) of a topological space |𝒦| depend only on the homotopy type of the space.

More precisely, a homotopy equivalence of topological spaces induces an isomorphism of homology groups.

We will see a partial justification of this fact later, after discussing simplicial maps and chain maps.

Contractible spaces

A topological space is contractible if it is homotopy equivalent to a point.

06 Illustration

Contractibility of n

We show that n is contractible.

Let p=0n be the origin. Consider the maps f and g:

center

Then fg:np is the constant map sending everything in n to the origin.

Define F(x,t)=tx. Then F(x,0)0, which agrees with fg, while F(x,1)=x=Idn. Therefore fg is homotopic to Idn.

Now consider that gf=Idp already. No additional homotopy is needed.

The same homotopy formula, namely F(x,t)=tx, can be used to show that any ball in n is contractible, and indeed any convex set in n is contractible.

  • ! Therefore, any simplex is contractible.

Cylinder is homotopic to circle

A cylinder is given by X=𝕊1×[1,1]. Consider the ‘collapse’ map f:X𝕊1 given by projecting to the circle along straight lines, and the map g:𝕊1X given by inclusion:

center

The map fg is equal to the collapse map, and the map gf is the identity on 𝕊1.

Now construct a homotopy from the collapse map to IdX:

F:X×[0,1]XF:(𝕊1×[1,1])×[0,1]𝕊1×[1,1]((x,h),t)(x,th)

Rank of homology

07 Theory - Betti numbers, Euler Characteristic

Rank of an abelian group

Every finitely generated abelian group G is isomorphic to a group with this form:

r(⊕︎i/ki)
  • The r summands give a free abelian part and contain all infinite-order generators.
  • The /ki summands give torsion and contain all finite-order generators.

The rank of G is the number r.

Betti numbers

The Betti numbers βi of a topological space X are the ranks of the homology groups:

βi(X)=rank(Hi(X;))

These Betti numbers may be combined into a single number, the Euler characteristic:

Euler characteristic

The Euler characteristic χ(X) of a topological space X is the alternating sum of Betti numbers:

χ(X)=i(1)iβi(X)

08 Illustration

For convex polyhedra, Euler’s formula for the Euler characteristic is simply vertices minus edges plus faces:

χ=VE+F

For nonconvex polyhedra, this formula can give values other than the actual Euler characteristic defined using Betti numbers.

NameFigureVerticesEdgesFacesχ=VE+F
Tetrahedron4642
Cube81262
Octahedron61282
Dodecahedron2030122
Icosahedron1230202
Tetrahemihexahedron61271
Cubohemioctahedron122410-2
Small stellated dodecahedron123012-6

For a simplicial complex, the Euler characteristic can always be computed using a formula analogous to the Euler formula: count the simplices of each dimension:

χ=k0k1+k2k3+±kn

Here ki is the number of i-simplices in the simplicial complex.

Theorem: Euler = Euler

For a simplicial complex, the same Euler characteristic may be calculated using Betti numbers or using the counts of simplices.

We do not prove this here, although the proof is a straightforward homology calculation.

Maps and homology

09 Theory - Simplicial maps, chain maps

Simplicial map

A map f:𝒦 between simplicial complexes is simplicial if it maps vertices of 𝒦 to vertices of , and it maps simplices of 𝒦 linearly to simplices of .

For example:

  • Inclusions of one simplicial complex into another.
  • Reduction of a simplicial complex to lower dimension, e.g. [v0,v1][v0].

Chain map

A chain map f is a map between chain complexes, which consists of a collection fn,,f0 of homomorphisms:

fi:Ci(𝒦)Ci()

of abelian groups which commute with the boundary operators:

fi1i𝒦=ififor alli.

Such a chain map makes the following diagram commute:

center

  • The homomorphisms can be collected under a single map f, and the commutativity condition expressed simply:
f𝒦=f

Theorem: Induced chain map

A simplicial map f:𝒦 determines a map of chain complexes f:C(𝒦)C().

The simplicial map f is extended linearly from simplices to chains (from generators to linear combinations).

10 Theory - Induced maps on homology

Theorem: Induced map on homology

A chain map f:𝒦 determines a map f of homology groups which splits by degrees:

fi:Hi(𝒦)Hi()

A chain map f sends cycles to cycles and boundaries to boundaries, so it descends to a map of quotient groups.

Proof of Theorem: Induced map on homology

It is sufficient to check that f maps cycles to cycles and boundaries to boundaries:

  • By mapping boundaries to boundaries, f is well-defined on homology groups.
  • By mapping cycles to cycles, f maps elements of homology to elements of homology.

Checking f maps cycles to cycles:

If τIm𝒦, meaning that τ is a cycle, then τ=𝒦(σ) for some σ, whence:

τ=(f𝒦)(σ)τ=(f)(σ),

but this implies τIm.


Checking f maps boundaries to boundaries:

If 𝒦(τ)=0, then:

(f(τ))(f)(τ)(f𝒦)(τ)f(𝒦(τ))f(0)0

but this means the image of τ is a cycle.

Proposition: Homotopic maps are the same on homology

If two maps of simplicial complexes f,g:𝒦 are homotopic, then they induce the same maps on homology groups, f=g:

center

In words: continuous deformations do not change the map induced on homology.

Proposition: Homology respects composition of maps

Given a composition of simplicial maps:

𝒦fg,

the map induced by the composite agrees with the composite of the induced maps:

(gf)=gf:Hi(𝒦)Hi()

The property of respecting composition of maps is called functoriality.

Corollary: Homotopy equivalence implies homology isomorphism

Homotopy equivalent simplicial complexes have isomorphic homology groups:

𝒦Hi(𝒦)Hi()for alli

Proof of Corollary

Suppose we have a homotopy equivalence:

𝒦f,g𝒦gfId𝒦,fgId

Now apply functoriality to the induced maps on homology:

gf(gf)(Id𝒦)=IdHi(𝒦)fg(fg)(Id)=IdHi()

Therefore g is the inverse of f as homomorphisms of abelian groups.

11 Illustration

Contraction to a point

The map f:n{p} for some point pn is a homotopy equivalence, so it induces an isomorphism on homology. Therefore:

Hi(n)={0i>0i=0

Dunce Hat

The Dunce Hat is formed by identifying all sides of a triangle with non-circular identifications:

center

The Dunce Hat is contractible, but it is not collapsible. The contraction can be performed by embedding the Hat in a 3-ball in 4.

Because it is contractible, the Dunce Hat has the homology of a point.

Homology of a cylinder

Recall that the cylinder is homotopic to the circle (§06):

center

A circle is homeomorphic to a triangle.

We have computed the homology of a triangle (§11 of Part I).

Therefore the homology of the cylinder is:

Hi(X)={0i>2i=1i=0

Homology variations

12 Theory - Relative homology

Suppose a simplicial complex 𝒦 is embedded within another simplicial complex . The homology of relative to 𝒦 is given by zeroing (quotienting out) the cycles fully within 𝒦. Only cycles that inescapably involve outside of 𝒦 contribute to the relative homology.

More precisely, suppose that 𝒦, so vertices and simplices of 𝒦 are also vertices and simplices of .

Then observe that chains in 𝒦 are automatically chains in , and thus:

𝒦Ci(𝒦)<Ci()for alli

(A subgroup: because a sum of chains in 𝒦 is still a chain in 𝒦.)

Relative chain complex

Suppose 𝒦 is an inclusion of simplicial complexes.

Define Ci(,𝒦), the relative chain group, as the quotient:

Ci(,𝒦)=Ci()Ci(𝒦)

Proposition: Boundary maps descend to relative chain groups

The boundary maps :Ci()Ci1() send chains in 𝒦 to chains in 𝒦 and thus descend to the quotient groups, giving a relative chain complex:

0Cn(,𝒦),𝒦,𝒦C0(,𝒦)0

(Here ,𝒦 is just the map induced by on the quotient groups.)

Proof of Proposition: Boundary maps descend to relative chain groups

It is sufficient to establish that boundaries from 𝒦 must also reside in 𝒦, i.e. that:

(Ci(𝒦))Ci1(𝒦)

But this is clear because 𝒦 is a simplicial complex, so it is closed under taking boundaries.

Relative homology

Suppose 𝒦 is an inclusion of simplicial complexes.

Define Hk(,𝒦), the relative homology group, as the homology group of the relative chain complex:

Hk(,𝒦)=Ker(k,𝒦)Im(k+1,𝒦)

Remark: Relativizing before homology

It is tempting to try relativizing the homology groups directly.

The inclusion 𝒦 does induce maps Hk(𝒦)Hk(). We could study the groups Hk()/Hk(𝒦).

These quotient groups are not what relative homology is after! See the illustrations.

13 Illustration

Homology of a simplex relative to its boundary

Consider a simple 2-simplex σ and the simplicial complex that it determines:

center

Let 𝒦 be the boundary 1-simplex (the edges only from ).

There are no 2-simplices in 𝒦, so:

C2(,𝒦)=C2()σ

All 0- and 1-simplices in are also in 𝒦, so:

C1(,𝒦)=0,C0(,𝒦)=0

The relative chain complex:

0C2(,𝒦)C1(,𝒦)C0(,𝒦)0

becomes:

0000

It follows that the relative homology is:

Hi(,𝒦)={0i>3i=20i=10i=0

Compare this to the homology of a sphere!

Homology of a sphere:

Hi(𝕊2)={0i>3i=20i=1i=0

Notice that 𝕊2 is homeomorphic to the quotient space /𝒦.

This comparison of homologies is apt; we just need to explain H0(𝕊2) versus H0(,𝒦)0.

Compare this against the quotient of homology groups!

The homology of 𝒦 is:

Hi(𝒦)={0i>1i=1i=0

The homology of , because it is contractible, is:

Hi()={0i>0i=0

The quotient of homology groups is:

Hi()/Hi(𝒦)0for alli
  • Relative homology treats 𝒦 as a single point.
  • The quotient of homology annihilates generators (“holes”) in which are also generators (“holes”) in 𝒦.
  • Different results for different constructions!

14 Theory - Cochain complex

Recall that the chain group Ck(𝒦) is the free abelian group of formal linear combinations of k-simplices in 𝒦:

Ck(𝒦)={iIfiniteniσi|ni,σi𝒦,dim(σi)=k}

One should think of the chains niσi as assignments of integers ni to the various k-simplices in 𝒦.

Thinking in this way, the boundary map k:CiCi1 is given on chains by simple linear extension of its definition for individual simplices. Thus k(niσi)=nik(σi).


Cohomology is created by interpreting the integers ni not as coefficients, but as the outputs of linear functions Ck.

To notate this effectively, define indicator functions φi for each of the k-simplices:

φi:{oriented k-simplices in 𝒦}σi1,σj0forji

Cochains

The space of linear maps Ck is isomorphic to the free abelian group of formal linear combinations of indicator functions:

Ck(𝒦)={iImiφi|mi,φiindicator ofσi}

Elements of this space, written generically as formal sums m1φ1+m2φ2+, are called cochains.

(For cochains it is not necessary that I be finite.)

Since there is a bijective correspondence of sets between oriented simplices and their indicator functions, we see that Ck(𝒦)Ck(𝒦) as abelian groups; we have simply reinterpreted the chains as assignments of integers mi to the indicators of k-simplices in 𝒦.


In both cases, the data of a chain / cochain consists of the assignment of a number (ni or mi) to each of the k-simplices in 𝒦. But the difference in interpretation of this data allows a difference in the construction of boundary operators:

Coboundary operator

Define the coboundary operator thus:

δk:Ck(𝒦)Ck+1(𝒦)φiφiδk+1(extended linearly)

In words: the coboundary of a simplex indicator indicates that simplex in the boundary of a higher simplex.

For example, in the triangular 2-simplex:

center

If φ[v0,v2] is the indicator of [v0,v2], then the coboundary δ1(φ[v0,v2]) indicates the presence of [v0,v2] in the boundaries of 2-simplices. It returns 1 for the triangle itself, [v0,v1,v2], since the boundary of the triangle includes the term [v0,v2].

Thus, in general, δk(miφi)=mi(φik), in contrast to k(niσi)=nik(σi) that we saw for k.


Witness a simple computation, applying δk+1δk to an arbitrary indicator:

(δk+1δk)(φi)δk+1(δk(φi))δk+1(φik)φikk+10

Cochain complex

Given a simplicial (or Δ-) complex 𝒦 of maximal dimension n, we define the cochain complex of 𝒦 as the sequence of morphisms:

0Cnδn1Cn1δn2Cn2C1δ0C00

This sequence is a complex because:

δk+1δk=0for everyk

The image and kernel groups are named in the obvious way:

  • Bk:=Im(δk1) — called the coboundary cochains
  • Zk:=Ker(δk) — called the cocycles

15 Theory - Cohomology

Cohomology

The kth cohomology of 𝒦 is defined as the quotient group of cocycles modulo coboundary chains:

Hk(𝒦)=Ker(δk)Im(δk1)

Cohomology is an upgrade from homology because it has an additional product structure, so cohomology actually gives a collection of rings.

Cup product on cochains, for simplicial complexes

Suppose we are given a simplicial complex 𝒦, together with a chosen ordering O=(v1,,vN) of all vertices of 𝒦.

There are maps of cochain groups Ck×CCk+ defined as follows:

For any pair of cochains φCk and ψC, and any vertices w0<<wk+ ordered according to O, with [w0,,wk+] the (k+)-simplex they form, we have:

(φψ)([w0,,wk+])=φ([w0,,wk])ψ([wk,,wk+])

Note: the oriented simplices here may be written with various orderings, but the splitting into k- and -simplices must follow the order of O.

Cup product using indicators

Let φCk be the indicator of an oriented simplex [ui0,,uik], and let ψC be the indicator of another oriented simplex [vik,,vik+].

Let (w0,,wk+) be the vertices of the total list

ui0,,uik,vik,,vik+

reordered in the ordering of O (allowing repetition), so w0w1wk+.

Then φψ is defined as follows: it is the indicator of [w0,,wk+] provided:

  • (i) the wi are all distinct,
  • (ii) upvq for all p,q;

and φψ=0 if (i) and (ii) do not hold.

The definition is extended bilinearly to all of Ck×C.

Vertex orderings and the cup product

Instead of choosing a total ordering O of all vertices of 𝒦, it is sufficient to choose a partial ordering of the vertices v1,,vN of 𝒦 having the property that O induces a total ordering of each simplex of 𝒦.

A set of compatible orderings of the vertices in each simplex is used to define a ‘front half’ and ‘back half’ of each (k+)-simplex σ, thereby cutting σ into one k-simplex and one -simplex.

The cutting method applied to a given simplex must be compatible with the method applied to every other simplex. A global vertex ordering ensures this compatibility.

Cup product on cohomology

The cup product has the following relation to the coboundary operator, a type of signed Leibniz rule:

δ(φψ)=δφψ+(1)kφδψ

when φCk(𝒦).

This formula implies that if φ and ψ are cocycles (or coboundaries), then φψ is also a cocyle (coboundary). Therefore the cup product descends to cohomology:

Hk(𝒦)×H(𝒦)Hk+(𝒦)

The cup product on cohomology provides a ring structure to the direct sum iHi(𝒦). The product, and the ring structure, do not depend on the choice of ordering used to define the product on cochains.

(Note: The cup product is always zero when k+ is greater than the maximal simplex dimension.)

16 Illustration

Some cohomology classes on the 2-torus

Consider the 2-torus T:

center

The red (poloidal) and pink (toroidal) curves together generate the degree one homology, H1(T)2.

Now recall a simplicial complex representation of the torus:

center

Let φ be the cochain which assigns 1 to every edge in the middle column, and zero to all other edges. (So it is 1 on the edges directly below the φ label, including the diagonals, but excluding all verticals.) Let ψ be the cochain which assigns 1 to every edge in the middle row, and zero to all other edges. (So it is 1 on the edges directly to the right of the ψ label, including the diagonals, but excluding all horizontals.) Accounting now for orientations, let φ give +1 on edges directed rightwards, and ψ give +1 on edges directed upwards.

center

One can check directly, going around the boundaries of each 2-simplex, that δφ=0 and δψ=0: The sum of the numbers on any triangle, accounting for orientations, is zero. So these cochains are both cocycles.

In order to see that φ and ψ are not boundaries, and thus represent nontrivial homology classes, and also to see that they don’t represent the same homology class, we devise a method of representing coboundaries of 0-cochains.

A 0-cochain η is the assignment of integers to each of the vertices. The condition δη=0, which means η10, states that these numbers cannot change as one moves across an edge from vertex to vertex. (Applying 1 to any edge [u,v] gives [v][u]. By linearity, η(1([u,v]))=η([v])η([u]). Therefore η([v])=η([u]) when the condition holds.)

From this it follows that H0(T). The isomorphism is given by sending η to the integer it gives on a vertex.

Return now to H1(T). A boundary in H1(T) is a cochain χ assigning numbers to directed edges such that there is a vertex labeling cochain ηC1 with χ([u,v])=η([v])η([u]). In other words, that it is possible to derive the edge numbers as the differences of a single vertex numbering scheme.

Now one can see that φ is not a coboundary. Vertex integers must increase by one as one passes across the middle column of edges, and stay fixed going across all other edges. This is impossible because the left-most and right-most edges are identified. Similarly ψ is not a coboundary, and φψ is not a coboundary.

(To witness a contrasting case, let ξ be a 1-cochain giving 1 only on the non-vertical edges in the right-most column. This is φ shifted to the right. Now φξ is a coboundary: assign 1 on vertices in the middle-right column, and 0 on all other vertices.)

Much more work would be required to show that φ and ψ have no relations in homology, and that they jointly generate homology.

A cup product on the 2-torus

We study the cup product φψ:

center

We must provide an ordering O of all the vertices of the torus. Order them as in a book: top-to-bottom, then left-to-right.

center

Let us see how to verify the values on the green and yellow 2-simplices. Label the vertices of the inner square as in the figure; the index ordering is compatible with O.

For the green 2-simplex [v0,v1,v2], we have φ([v0,v1])=+1 and ψ([v1,v2])=1, so:

(φψ)([v0,v1,v2])=(+1)(1)=1

For the yellow 2-simplex [v1,v2,v3], we have φ([v1,v2])=1 and ψ([v2,v3])=0, so:

(φψ)([v1,v2,v3])=(+1)(0)=0

A calculation with more details (illustrating bilinearity) can be performed in terms of the indicator functions. Write:

φ=φ1++φ6,ψ=ψ1++ψ6

where φi is the indicator for the edge in the support of φ which is in the ith place from the top (oriented rightwards), and analogously ψj is for the one for ψ in the jth place from the left (oriented upwards).

Applying bilinearity to expand the cup product:

φψ(φ1++φ6)(ψ1++ψ6)i=16j=16φiψj

The edges with indicators φi and ψj could span one of the 2-simplices only when i=3,4,5 and j=3,4,5. And in fact the pairs (i,j)=(3,5),(5,3) can be ruled out as well. The only terms to consider are these six:

i=16j=16φiψjφ3ψ3+φ3ψ4+φ4ψ3+φ4ψ5+φ5ψ4+φ5ψ5
  • Now φ3 is the indicator for [v0,v1] and ψ3 is the indicator for [v0,v2], so φ3ψ3=0 because v1v0 so the total list v0,v1,v0,v2 does not split according to the ordering of O.
  • Then ψ4 is the indicator for [v1,v2], so φ3ψ4 is the indicator for [v0,v1,v2], meaning it returns 1 on the green 2-simplex.
  • Then φ4 is the indicator for [v1,v2], so φ4ψ3=0.
  • Then ψ5 is the indicator for [v1,v3], so φ4ψ5=0 because v2v1.
  • Then φ5 is the indicator for [v2,v3], so φ5ψ4=0 because v2v1.
  • Then φ5ψ5=0 as well, also because v2v1.

By adding these results, we see that φψ is the indicator for the central 2-simplex, oriented clockwise.

This cochain in C2 is automatically a cocycle because C3 is empty.

Is it a coboundary?

To see that the answer is “no,” we can devise another scheme to represent coboundaries, now for 2-simplices. We give here only a sketch. Give a 1-cochain ξ which assigns integers to the edges. Draw oriented paths crossing the edges, with the number of paths crossing ei matching ξ(ei). Then δξ(tj) for a triangle tj counts the total flow of paths into or out from tj; it is a ‘sink’ or ‘source’ number describing extra paths originating or terminating inside tj. The condition δξ(tj)=0 would mean that the paths are conserved in tj, none created or destroyed.

With this perspective, it is obvious that the cochain φψ depicted in the figure cannot be a coboundary. Every 2-cochain which is a coboundary describes a collection of oriented paths that are created or destroyed only in triangles with nonzero assignments, according to that assignment. So φψ would describe a single path terminating in the green triangle, but originating nowhere, since there is no other sink or source.

Another observation is worth making about φψ. It is the generator of H2(T).

Note that the full cohomology of T is given by:

Hi(T){0i>3i=22i=1i=0

Here is a fact: All indicator functions on 2-simplices determine the same cohomology class. To see this, take the difference of any two indicators. Draw a simple oriented path out of one of them into the other. This path will define a 1-cochain by assigning ±1 on any edge it crosses on the way (according to their mutual orientations), and 0 on all edges it does not cross. The coboundary of this cochain gives +1 on the triangle from which the path emanates, and 1 on the triangle in which the path terminates, and zero on all other triangles. That is exactly the difference of indicator 2-simplices we started with.

Since H2(T) is generated by indicator 2-simplices, and they are all equivalent, we deduce that it is generated by φψ.

To see that it is in fact infinite and isomorphic to , we must exclude relations among the multiples of φψ. A relation n(φψ)=m(φψ) is equivalent to the relation (φψ)=0 for =nm. But we can exclude any such relation by the reasoning used above: a cochain (φψ) cannot be a coboundary because it would represent oriented paths terminating in the green 2-simplex, and originating nowhere.

Therefore we have proven that:

H2(T)[φψ]

The cocycle [φψ] is called the fundamental cocycle of T.

Cohomology ring has topological significance

Let X=𝕊1×𝕊1, the 2-torus.

Let Y=𝕊1𝕊1𝕊2, a 2-sphere with two circles attached at one common point.

The cohomology groups are isomorphic:

Hi(X)Hi(Y){0i>2i=2⊕︎i=1i=0

However, the cup product operations differ, so the ring structures differ.

  • In X, the cup product of the two generating cocycles is the fundamental coclass of the 2-torus.
  • In Y, the cup product of the two generating cocycles (dual to the two copies of 𝕊1), is zero.

17 Theory - Coefficients

It is possible to define homology and cohomology with other coefficients. Given an abelian group G, one defines the chain groups thus:

Ck(𝒦,G)={iIfinitegiσi|giG,σi𝒦,dim(σi)=k}

And the cochain groups thus:

Ck(𝒦,G)={iIgiφi|gi,φiindicator ofσi𝒦,dim(σi)=k}

Homology and cohomology are defined in the usual way from these chain groups.

The most important cases are G= (which eliminates torsion), and G=/2 (where coefficients track parity only).

Manifolds

18 Theory - Topological and smooth manifolds

Topological manifold

A (second-countable, Hausdorff) topological space X is an n-dimensional (topological) manifold if every point pX has an open neighborhood U which is homeomorphic to n.

“ the local topology of an n-manifold is that of n ”

Notes:

  • An equivalent definition is that every p has open neighborhood U homeomorphic to the open ball 𝔹1(0)n, since of course 𝔹1(0) is itself homeomorphic to n.
  • It is a theorem that every n-manifold can be embedded in some Euclidean space N, so an equivalent definition states adds the hypothesis that XN for some N.

To define smooth manifolds, we must first define differentiable and smooth maps.

Regular points

Suppose pVn with V open. Let (x1,,xn) give coordinates on n.

Suppose f:Vd is a function given in coordinates by f(x1,,xn)=(f1,,fd).

The differential matrix of f at p=(x1,,xn) is the Jacobi matrix:

[dpf]=(f1x1(p)f1xn(p)fdx1(p)fdxn(p))

The point p is regular for f when [df] has rank n. (No point can be regular when d<n.)

Smooth manifold in d

A subspace Md is a smooth n-manifold if every pM has an open neighborhood in M (open in the subspace topology) that is the image of a smooth injective function φ:Ud, whose domain is an open set Un, and whose differential [dφ] has maximal rank everywhere on U.

Each such function is called a parametrization or a coordinate chart for M, and the image of a parametrization is a coordinate patch on M.


A parametrized surface is a bijective and infinitely differentiable (smooth) injective map:

φ:U3

where the parameter domain U is an open subset of 2. Every parametrized surface defines a 2-manifold in 3.

Using coordinates (x,y) on 2 and (φ1,φ2,φ3) for the images of φ in 3, we have for the differential matrix:

[d(x,y)φ]=(φ1xφ1yφ2xφ2yφ3xφ3y)

The maximum rank of [dφ] is 2, and Rank[dφ]=2 occurs when any of these equivalent conditions are satisfied:

  • The columns of [dφ] are linearly independent (for two columns: not collinear vectors)
  • There are two linearly independent rows in [dφ]
  • There is a 2×2 submatrix of [dφ] with nonzero determinant

If the matrix [dφ] is considered as a linear map [dφ]:23, then the image of [dφ] at p=(x,y) is a plane through the origin which is parallel to the tangent plane to the surface at φ(x,y).

The condition Rank[dφ]=2 ensures that small movements in the parameter space, dx and dy, can generate two dimensions of movement on the surface. In turn this ensures that locally around φ(x,y) the surface is homeomorphic to an open disk in 2, and moreover that such a homeomorphism can be constructed as projection to the tangent plane at φ(x,y) composed with a linear map.

19 Illustration

Wild topological manifolds

Topological spaces can be stranger than one imagines on the basis of simple examples. Here is Alexander’s Horned Sphere (/media/File:Construcción_de_esfera_de_Alexander_con_cuernos.gif; explanatory essay):

center

The horned sphere S is a subset of 3 homeomorphic to 𝕊2. The outside 3S contains non-collapsible loops (so it is not simply connected), which is unlike the standard inclusion of 𝕊2 in 3.

The map f:𝕊23 with f(𝕊2)=S is an embedding of topological spaces and thus topological manifolds. (It is continuous, injective, and induces a homeomorphism onto the image which is endowed with the subspace topology; so the image is homeomorphic to 𝕊2 as a topological manifold.)

The map f is not an embedding of differentiable, smooth, or piecewise linear manifolds.

Parametrized paraboloid

Let φ:23 by φ:(x,y)(x,y,x2+y2).

center

Then [dφ] is given by:

[d(x,y)φ]=(10012x2y)

Notice that the determinant of the upper 2×2 square is nonzero.

Singular curve

Consider φ:2 given by φ(t)=(t2,t3):

center

Then: [dtφ]=[2t3t2] and [d0φ]=[00].

Parametrized 2-sphere

Spherical coordinates define a parametrization of the 2-sphere:

f(θ,φ)=(sinφcosθ,sinφsinθ,cosφ)

The differential:

[d(x,y)φ]=(cosφcosθsinφsinθcosφsinθsinφcosθsinφ0)

Notice that poles of the sphere correspond to points with φ=nπ, and there the right column is all zeros. So poles are not regular points of φ. One can check that every other point is regular by computing the cross product of the column vectors.

Also, at the poles the function is not injective.

Therefore one must restrict the domain, for example to φ(π,π) and θ(0,2π), to get a true parametrization. Unfortunately this does not cover the entire sphere; indeed it is impossible to cover the sphere with a single parametrization.

Parametrized 2-torus in 4

The 2-torus can be parametrized in 4 very easily:

f(φ,θ)=(cosφ,sinφ,cosθ,sinθ)φ,θ(0,2π)

center

This parametrization is regular everywhere, but the domain cannot be extended to cover the entire torus without becoming non-injective (and no longer a homeomorphism onto its image), for topological reasons. The torus cannot be covered by a single parametrization.