Homology

Reference

Glossary

Every term in the book, in plain words — with a link to the chapter where it first appears.

#

∂∘∂ = 0
The boundary of a boundary is zero: each face of a face lies in exactly two faces, counted twice (mod 2) or with opposite signs (over Consequence: every boundary is a cycle,

C

2-cycle
A set of triangles in which every edge is a side of an even number of them — a closed surface, such as the four faces of a hollow tetrahedron.
Cancellation law
In a group, implies (multiply on the left by and similarly on the right. It is why no element repeats in a row or column of a Cayley table.
Cap product
The operation combining an -chain and a -cochain into an -chain: the cochain is spent on the front face and the back face survives. It satisfies
Cardinality
The size of a set. means there is a bijection two sets have the same cardinality when there is a bijection between them.
Cartesian product (×)
is the set of ordered pairs with — picture a grid. For finite sets, Example: the torus is
Categorification
Promoting a number or polynomial to a homology theory whose Euler characteristic recovers it, as Khovanov homology does for the Jones polynomial. Betti numbers are the original example: their alternating sum is
Category
A collection of objects together with, for each pair of objects, a set of arrows between them, with an identity arrow on each object and an associative composition. Examples: sets and functions ( abelian groups and homomorphisms ( spaces and continuous maps (
Category of chain complexes
The category whose objects are chain complexes of abelian groups and whose arrows are chain maps. Homology is a functor
Cavity
An informal name for a non-zero class in a region enclosed by a 2-cycle that is not filled in, like the inside of a hollow sphere.
Cayley table
The multiplication table of a finite group: the entry in row column is Every element appears exactly once in each row and each column (the “Sudoku property”).
Čech coboundary
The map on Čech cochains, and in general an alternating sum of restrictions. It satisfies
Čech cochain
Data attached to the pieces of a cover (-cochains), to their pairwise overlaps (-cochains), to triple overlaps (-cochains), and so on, with indices in increasing order.
Čech cohomology
Čech cocycles modulo Čech coboundaries for a cover For a good cover of a nice space with constant coefficients it is the ordinary cohomology of the space.
Čech complex
The nerve of the balls of radius around the points of a cloud: points span a simplex when their balls share a point, that is, when they fit in one ball of radius
Cell (n-cell)
An open -dimensional disk used as a building block: a 0-cell is a point, a 1-cell an open arc, a 2-cell an open disk, a 3-cell an open ball.
Cellular boundary formula
where is the degree of “attach the boundary of then collapse everything except how often the boundary runs over with signs.
Cellular chain complex
For a CW complex, the free abelian group on the -cells, with boundary maps built from the long exact sequences of skeleta.
Cellular homology
The homology of the cellular chain complex, isomorphic to singular homology. Hatcher calls it “homology squared”; it computes homology from one generator per cell.
Cellular sheaf
Vector spaces (stalks) on the vertices and edges of a graph — or the cells of a complex — with a linear restriction map from each vertex to each edge at it. is the space of global sections.
Chain (k-chain)
An inventory of k-simplices. Mod 2, a set of k-simplices, added by symmetric difference; with integer coefficients, a formal sum of oriented k-simplices, added coefficient by coefficient.
Chain complex
A sequence of abelian groups (or vector spaces) with maps such that for every k.
Chain group
all integer k-chains of the free abelian group on the k-simplices, Mod 2, is a vector space over of dimension
Chain homotopy
Homomorphisms with for two chain maps Chain homotopic maps induce the same map on homology.
Chain homotopy equivalence
Chain maps and whose composites and are chain homotopic to the identities. Chain homotopy equivalent complexes have isomorphic homology.
Chain map
A family of homomorphisms between two chain complexes that commutes with the boundary: It sends cycles to cycles and boundaries to boundaries, so it induces maps on homology.
Characteristic class
A cohomology class attached to every vector bundle, natural under pulling back along maps and zero for trivial bundles; it measures how the bundle twists.
Chart
A pair where is an open subset of a manifold and is a homeomorphism from onto an open subset of It gives each point of a list of coordinates, like one page of an atlas of the Earth.
Chern number
The integer obtained by evaluating a Chern class on a closed surface — for a bundle over the sphere, the winding number of its transition function
Chern–Weil theory
The principle that curvature forms of a bundle represent its characteristic classes in de Rham cohomology; Gauss–Bonnet is the simplest example.
Chinese remainder theorem
exactly when For example but is not
Chiral knot
A knot that is not equivalent to its mirror image, like the trefoil. A knot equal to its mirror image, like the figure-eight knot, is amphichiral. The Jones polynomial detects the trefoil’s chirality.
Circular coordinates
Angles for the points of a data set, found from an integer 1-cocycle — using — after smoothing it to its harmonic representative by least squares. Introduced by de Silva, Morozov and Vejdemo-Johansson.
Circulation
The sum of an edge flow around a closed loop, each edge counted with the sign of the direction it is walked in; around a single triangle it is also called the curl. In calculus (Chapter 4.3) it is the line integral of a field around a loop: how much the field pushes you along as you go round.
Clash cycle
For any choice of orientations of the triangles of a closed surface, The cycle of clashing edges has a class that does not depend on the choice; it is zero exactly when the surface is orientable, and otherwise has order two.
Classification by χ and orientability
Two closed connected surfaces are homeomorphic exactly when both are orientable or both are not, and they have the same Euler characteristic.
Classification of closed surfaces
Every closed connected surface is homeomorphic to exactly one of: the sphere; a connected sum of tori (orientable, or a connected sum of projective planes (non-orientable,
Classification of finitely generated abelian groups
Every finitely generated abelian group is with and the numbers are determined by the group. So every homology group is a list of numbers.
Clock arithmetic (the group ℤ/n)
The group of an -hour clock: the elements added by adding and then wrapping around past Never written in this book; is also written
Clopen set
A set that is both open and closed, such as and the whole space. A connected space has no other clopen sets.
Closed form
A differential form with A closed 1-form in the plane is one with zero curl; its integral around every small loop that bounds a region is zero.
Closed manifold
A compact manifold with empty boundary, such as a sphere, a torus or a Klein bottle. Not to be confused with a closed set: the plane is not a closed manifold, and neither is the closed disk.
Closed set
A set whose complement is open; equivalently, in a metric space, a set that contains all of its limit points. A set can be open, closed, both or neither.
Closed walk
A route along the edges of a graph that ends where it started. Forgetting the start and the direction, and recording only which edges are used, turns a closed walk into a cycle.
Closure of a braid
The link made by joining the bottom ends of a braid back up to the top ends. Every link is a closed braid (Alexander), and Markov’s moves say when two braids have the same closure.
Cobordism
Two closed -manifolds are cobordant if together they form the boundary of a compact -manifold. Cobordism classes form groups and a generalized homology theory; for surfaces (unoriented), a closed surface bounds exactly when its Euler characteristic is even.
Coboundary (exact cochain)
A cochain of the form for some cochain one degree lower — for an edge labelling, a gradient. Every coboundary is a cocycle because the converse can fail around holes.
Coboundary group
The group of -cochains of the form Since it sits inside the cocycle group. A 1-coboundary is a gradient.
Coboundary matrix
The matrix of in the bases of indicator cochains. It is the transpose of the boundary matrix:
Coboundary operator
The map given by the discrete gradient in degree 0, the discrete curl in degree 1. It satisfies and its matrix is the transpose of a boundary matrix,
Cochain
A -cochain assigns a number (or an element of a group to every -simplex, and is extended to chains by adding up. Chains are places; cochains are measurements.
Cochain complex
A sequence of groups and maps that raise the degree and satisfy The cochains of a complex form one, because follows from
Cochain group
The group of -cochains: homomorphisms from -chains to Concretely, one value in on each -simplex, extended to chains by adding up with multiplicities, so
Cocycle (closed cochain)
A cochain with For an edge labelling: its curl is zero on every filled triangle, so it passes every local test.
Cocycle group
The group of -cochains with zero coboundary. A 1-cocycle is an edge labelling that passes every local test.
Codimension-one face
A face of a simplex obtained by deleting exactly one vertex: a -face of a k-simplex. A k-simplex has of them: a triangle has three edges, a tetrahedron four triangles.
Coefficient explosion
The growth of huge intermediate integers during exact elimination over Computing modulo several primes avoids it and still detects torsion.
Coefficient group
The group that a homology theory assigns to a point. On cell complexes, ordinary homology with coefficients in is the only theory satisfying all five axioms with that coefficient group.
Coefficients
The abelian group in which cochains take their values, such as or It is written after a semicolon: Changing the coefficients changes what a measurement can see.
Coface
A simplex one dimension up that has a given simplex as a face. The coboundary is on the cofaces of and elsewhere: the boundary looks down to faces, the coboundary looks up to cofaces.
Coherent orientation
An orientation of every triangle of a triangulated surface such that any two triangles sharing an edge run along it in opposite directions. Possible exactly when the surface is orientable.
Cohomologous
Two cocycles are cohomologous when they differ by a coboundary, so that they define the same cohomology class. Two 1-cocycles on a graph are cohomologous exactly when they have the same loop sums. For differential forms (Chapter 4.4) the same word means that two closed forms differ by an exact form.
Cohomology
The “dual” of homology: instead of collecting pieces of a shape, it attaches measurements to them, and its groups record the obstructions to fitting local measurements together into global ones.
Cohomology class
An element of a cohomology group: a cocycle up to adding coboundaries.
Cohomology group
The quotient cocycles modulo coboundaries. It collects the global obstructions in degree with all local detail forgotten.
Cohomology ring
The direct sum with the cup product as multiplication. It is an invariant of homotopy type, much sharper than the groups alone.
Cokernel
For a linear map or homomorphism the quotient what is left over in the codomain once the image is collapsed.
Collapsing a subspace
the quotient of in which all points of are glued to a single point. For example
Column reduction
The algorithm that reduces the columns of a boundary matrix from left to right while recording which original columns were added. Columns that become zero give cycles. It is the engine of persistent homology.
Commutative diagram
A picture of sets (dots) and functions (arrows) in which any two paths of arrows with the same start and end give the same composite: “all roads lead to the same place.”
Commutative ring
A ring in which for all elements. and are commutative rings, and serve as coefficients for cohomology rings.
Commutator
The element of a group; it is the identity exactly when and commute. On the figure eight it is a loop that cannot be shrunk although it goes round each circle zero times net.
Compact
Every open cover has a finite subcover. In compact means closed and bounded (Heine–Borel): no escape routes, to infinity or to a missing edge.
Complement
Inside a fixed universe the complement of is De Morgan: and
Complex projective space
the complex lines through the origin in It has one cell in each even dimension so and odd groups vanish. Its cohomology ring is with in degree (Chapter 4.5).
Composition (∘)
For and is read “ after first then Associative, but order matters.
Concatenation of paths
Doing one path and then another, each at double speed: for and for It is the multiplication of the fundamental group.
Cone
the cylinder over with its top collapsed to a point. The cone on a circle is a disk.
Congruence modulo n
means that divides i.e. and leave the same remainder on division by Example:
Conjecture
A precise statement believed to be true but not yet proved. A conjecture may end up proved (Fermat’s last theorem), disproved (Euler’s sum of powers conjecture), shown to be undecidable (the continuum hypothesis), or stay open (Goldbach’s conjecture).
Connected
A space is connected if it cannot be split into two disjoint, non-empty open sets. The maximal connected pieces of a space are its connected components.
Connected sum
The surface made by cutting a small open disk out of each of and and gluing the two boundary circles together. The sphere acts as zero:
Connected sum of knots
The knot made by cutting each knot open at a point and joining the loose ends in pairs. The granny knot is and the square knot Genus adds up under it.
Connecting homomorphism
The map in a long exact sequence: lift a cycle of to take its boundary, and pull the result back to For a pair it literally takes the boundary of a relative cycle.
Conservative field
A vector field that is the gradient of a function. Its line integrals depend only on the endpoints, and its integral around every closed loop is zero.
Constant on classes (factoring through a quotient)
A function is constant on classes if implies Then for exactly one “factors through” the quotient.
Continuous map
A function such that the preimage of every open set is open. It may glue points together but never tears.
Contractible
A space homotopy equivalent to a point; equivalently, its identity map is homotopic to a constant map. disks and trees are contractible; circles and spheres are not.
Contrapositive
The contrapositive of is It always says the same thing as the original — which is how invariants prove that two shapes are different.
Contravariant
Said of a rule that turns maps into homomorphisms going in the opposite direction, as cohomology does: gives Preimages and transposes are contravariant too.
Contravariant functor
A functor that reverses arrows: goes to and Equivalently, a functor Cohomology, dual spaces, and preimages are contravariant.
Converse
The converse of is It is a different statement and may be false when the original is true.
Convex
A solid is convex if the straight segment between any two of its points stays inside it — it has no dents or tunnels. Every convex polyhedron has
Convex set
A subset of that contains the straight segment between any two of its points, like a disk or a ball. Convex sets are contractible.
Coproduct
The dual of a product: an object with arrows from and from such that every pair of arrows comes from exactly one arrow The disjoint union for sets and spaces; the direct sum for abelian groups, where it is also the product.
Corner class
A set of corners of a gluing diagram that end up as one point of the glued surface. The torus square has one corner class, the sphere square three.
Coset
A shifted copy of a subgroup Two cosets are either equal or disjoint, and exactly when The cosets of in are and
Countable, uncountable
A set is countable if it is finite or can be listed as a sequence (a bijection with and are countable; is uncountable (Cantor).
Counterexample
A single case in which a “for all” statement fails. One counterexample disproves it; no number of examples proves it.
Covariant
Said of a rule that turns spaces into groups and maps into homomorphisms going in the same direction, as homology does: gives
Covector (linear functional)
A linear map from a vector space to its field of scalars: a linear measurement. On it has the form and is pictured as a stack of evenly spaced parallel lines.
Cross product (in cohomology)
For classes on and on the class on where are the projections.
Cross-cap
A model of the projective plane in a hemisphere whose opposite rim points are zipped together along a segment ending in two pinch points.
Crossing number
The smallest number of crossings in any diagram of a knot: for the unknot, for the trefoil, for the figure-eight knot. It is the number in a knot’s table name, as in
Császár polyhedron
A polyhedron with 7 vertices, 21 edges and 14 flat triangular faces, found by Ákos Császár in 1949: the seven-vertex torus built in space without self-crossings. It has no diagonals — every pair of corners is an edge.
Cup product
The product of cochains, “front face times back face”: It passes to cohomology and makes a ring.
Cup product table (cup form)
For a surface, the table of products of a basis of degree-1 classes. Mod 2 the torus has and the Klein bottle
Cup square
The product of a class with itself. Over odd-degree classes on orientable surfaces square to zero; over squares can survive, as on and the Klein bottle.
Curl
For an edge flow, its circulation around one filled triangle; a gradient has curl zero on every triangle. In calculus (Chapter 4.3) it is circulation per unit area around a tiny loop; in the plane, and a paddle wheel in the flow spins at half this rate.
Curvature of a curve
The rate at which the direction of a curve turns per unit length; for a circle of radius
Cut point
A point whose removal disconnects a connected space. Homeomorphisms send cut points to cut points, which tells a circle from an interval and T from X.
CW complex
A space built in stages: first some points (0-cells), then arcs glued at their ends (1-cells), then disks glued along their boundary circles (2-cells), and so on. The sphere is one point plus one disk; the torus is one point, two loops and one disk.
Cycle
In a graph (mod 2): a set of edges in which every vertex has even degree — no loose ends. More generally, a k-cycle is a collection of k-dimensional pieces with no loose -dimensional pieces; in symbols, a chain with zero boundary.
Cycle rank (b₁ of a graph)
The number of independent cycles of a graph, also called its cyclomatic number or first Betti number.
Cycle space
The set of all cycles of a graph, added by symmetric difference. It is a vector space over whose dimension is
Cycles Zₖ
the k-chains with zero boundary. Since every 0-chain is a cycle.
Cyclic group
A group generated by a single element: Every cyclic group is isomorphic to or to some
Cylinder
The square with one pair of opposite edges glued straight across, also the product It has two boundary circles.
Δ-complex
A space glued from simplices more freely than a simplicial complex allows: faces of one simplex may be glued together, and several simplices may share the same vertices. The torus is a Δ-complex with 1 vertex, 3 edges and 2 triangles.
ε–δ continuity
is continuous at if for every there is a such that implies close enough inputs give close outputs.

A

Abelian category
An additive category in which every arrow has a kernel and a cokernel and the first isomorphism theorem holds. Abelian groups, vector spaces, chain complexes and sheaves of abelian groups are examples; exact sequences, homology and all of homological algebra make sense in any of them.
Abelian group
A group in which order never matters: for all Named after Niels Henrik Abel. Abelian groups are usually written additively ( all the groups of homology are abelian.
Abelianization
The quotient of a group by the subgroup generated by its commutators: the group made commutative in the most economical way. For a free group it keeps only the exponent sum of each letter, and is the abelianized (Hurewicz).
Abstract simplicial complex
A finite set of vertices with a collection of non-empty subsets (the simplices) that contains every single vertex and every non-empty subset of each of its sets. A shape stored as a list of vertex sets.
Additive category
A category in which arrows between any two objects form an abelian group, composition distributes over addition, there is a zero object, and finite direct sums exist (each both a product and a coproduct).
Additive notation
The convention of writing an abelian group operation as the identity as the inverse as and ( times) as A plus sign promises that the order of terms does not matter.
Aharonov–Bohm effect
A quantum particle travelling around a solenoid acquires a phase per turn, although the magnetic field vanishes along its path. The phase is set by the integral of the vector potential around the solenoid, which depends only on its de Rham class.
Alexander duality
For a compact, locally contractible, nonempty proper subspace of the sphere the homology of the space around depends only on the cohomology of It implies the Jordan curve theorem, and that every knot complement has
Alexander polynomial
A Laurent polynomial attached to a knot, playing the role of the characteristic polynomial of the shift acting on of the infinite cyclic cover of the complement; for a Seifert matrix For the trefoil,
Ambient isotopy
A continuous family of homeomorphisms of space, starting at the identity, that carries one knot to another: the string moves and drags the space along, never passing through itself. Two knots are equivalent when one exists.
Ampère’s law
For a steady current the circulation of the magnetic field around a loop is times the number of times the loop links the current. Outside a wire the field is closed but not exact.
And, or, not (∧, ∨, ¬)
holds when both hold; when at least one holds (“or” is inclusive); when fails. De Morgan:
Angle defect
At a corner of a polyhedron, the amount by which the angles of the faces meeting there fall short of a full turn, (or in radians). A cube has defect at each corner; a corner can also have negative defect. The defects of a closed polyhedron add up to that is the polyhedral Gauss–Bonnet theorem of Chapter 4.8.
Angle excess
For a geodesic triangle, Gauss proved it equals the total curvature inside the triangle.
Angle form
The 1-form on the punctured plane. It is closed but not exact: its integral around any loop is times the loop’s winding number about the origin.
Annihilator
For a set of covectors, the subspace of vectors that every covector in sends to 0. Duality theorem: so a target is unreachable exactly when some measurement certifies it.
Antipodal map
The map of a sphere, sending each point to the opposite point. On it has degree orientation-preserving on odd spheres, reversing on even ones.
Arbitrage
A loop of currency trades that ends with more money than it began with. Using logarithms of exchange rates as an edge labelling, a market is free of arbitrage exactly when the labelling is a gradient.
Associativity
The rule brackets do not matter, so a long product can be written without them. Subtraction is not associative:
Atlas
A collection of charts whose domains cover the whole manifold. The sphere needs at least two charts; the six hemispheres, or the two stereographic projections, form atlases.
Attaching map
The continuous map that says where the boundary of a new -cell is glued onto the part of a CW complex already built. The torus’s 2-cell is attached along the loop
Augmentation
The homomorphism that adds up the coefficients of a 0-chain. It vanishes on boundaries, since

B

Back face
For an ordered simplex the face made of its last vertices. It shares exactly one vertex, with the front face. The right factor of a cup product is read on it.
Barcode
The collection of intervals one for each class in a suitable basis, recording when the homology classes of a filtration are born and die, drawn as horizontal bars. The number of -bars containing is at
Barycentre
The centre of a simplex: the point whose barycentric coordinates are all equal, The barycentre of an edge is its midpoint.
Barycentric coordinates
Numbers with describing the point of a simplex: the balance point of weights hung at the corners. The non-zero coordinates name the face the point lies in.
Barycentric subdivision
The finer complex with a vertex at the barycentre of every simplex of and a simplex for every chain of faces A triangle becomes 6 triangles; an -simplex becomes pieces.
Based space
A space with a chosen point (its basepoint). Based maps send basepoint to basepoint; based spaces and based maps form the category on which the fundamental group is a functor.
Basepoint
A chosen point of a space at which all loops start and end, needed to define the fundamental group
Basis (of a free abelian group)
A set of elements such that every element is a combination of them with integer coefficients in exactly one way. In is a basis but is not, because we may not divide by 2.
Basis (of a vector space)
A linearly independent list of vectors that spans the space. Every vector is then a combination of the basis vectors in exactly one way; the coefficients are its coordinates.
Berry phase
The geometric phase acquired by a quantum system whose parameters are carried slowly around a loop; it is the holonomy of a line bundle over the parameter space, and its curvature integrates to Chern numbers.
Betti number
The rank of the number of independent -dimensional holes. counts pieces, independent loops, cavities. Over a field it is Often written
Bijective (bijection)
Both injective and surjective: a perfect matching between domain and codomain. Exactly the functions that have an inverse.
Binary operation
A rule that combines two elements of a set, in order, into one element Examples: on numbers, composition of moves.
Birth and death
In a filtration, a homology class is born at the first parameter value where it exists without coming from an earlier class, and dies when it becomes zero or merges into an older class.
Bott periodicity
Complex K-theory repeats with period two: is for even and for odd Proved by Raoul Bott in 1959.
Bottleneck distance
The distance between two persistence diagrams: the smallest such that their points can be matched one-to-one, each moving at most in each coordinate, where a point may also be matched to the diagonal at cost
Boundaries Bₖ
the k-chains of the form Because the gap between them is homology.
Boundary
A cycle that is the rim of something filled in: in dimension 1, the rim of a set of filled triangles; in dimension k, the rim of a collection of -dimensional pieces. Every boundary is a cycle; the converse fails exactly where there are holes.
Boundary (of a manifold)
The set of points that a chart sends to the edge of the half-space. It is a manifold of one dimension less, with no boundary of its own: For example
Boundary formula
the alternating sum of the faces, the i-th leaving out the i-th vertex. For an edge, (head minus tail).
Boundary matrix
The matrix of one row per -simplex, one column per k-simplex; column j lists the coefficients of the boundary of the j-th simplex. Consecutive boundary matrices multiply to zero.
Boundary operator ∂
The map sending a simplex to the (signed) sum of its codimension-one faces and extended to chains by linearity. Mod 2, is the set of faces occurring an odd number of times: the loose ends of a set of edges, the rim of a set of triangles.
Boundary orientation
The orientation a boundary inherits from the region it bounds: “outward first”. In the plane the boundary is walked with the region on the left, so the outer edge goes counterclockwise.
Boy’s surface
A smooth immersion of the projective plane in found by Werner Boy in 1901, with three-fold symmetry and a single triple point.
Braid group
The group of braids on strands, multiplied by stacking. Artin showed it is generated by the crossings subject to for and
Bridges of Königsberg
Euler’s 1736 puzzle: a round trip crossing each of seven bridges once is impossible, because a closed walk must touch every land mass an even number of times. The first instance of the parity test for cycles.
Brouwer fixed point theorem
Every continuous map from the closed disk to itself has a fixed point. Proof: otherwise the rays from through would define a retraction of the disk onto its boundary.

D

d∘d = 0
Applying the exterior derivative twice always gives zero. It packages and and mirrors for chains.
de Rham cohomology
The vector space of closed -forms on modulo exact ones: it measures how far closed forms are from being exact, which happens exactly when has holes.
de Rham’s theorem
For every smooth manifold integration over chains gives an isomorphism the smooth and the combinatorial cohomology agree (with real coefficients).
Defined as (:=)
means “ is defined to be not a claim but the introduction of a new name.
Defining a map on a basis
A homomorphism out of a free abelian group can be defined by choosing, freely, where each basis element goes; it then extends uniquely: The boundary map of homology is defined this way.
Definition
A precise membership test that introduces a new word. By an almost-universal convention, definitions are written with “if” but mean “if and only if”.
Deformation retraction
A homotopy that starts at the identity of ends with everything inside a subspace and never moves the points of Then Example: the punctured plane onto a circle.
Degree (of a cohomology class)
A class in has degree written Degrees add under the cup product.
Degree (of a vertex in a set of edges)
The number of edges of the set that touch the vertex.
Degree of a map
For the integer such that is multiplication by It counts preimages of a point with signs; for it is the winding number.
Derivative
The rate of change of a function: the slope of its graph at For a small step it predicts the change
Derived functors
The functors obtained by applying a functor that is only partly exact to a resolution and taking homology: comes from from and sheaf cohomology from taking global sections. They record, degree by degree, how exactness fails.
Descartes’s theorem (total angle defect)
The angle defects of a convex polyhedron add up to exactly More generally, for any closed polyhedral surface they add up to — a discrete version of the Gauss–Bonnet theorem.
Determinant
For a matrix, the signed factor by which the map multiplies areas. It is zero exactly when the columns are dependent, so that the map flattens the plane.
Determinant of a knot
The absolute value of the determinant of the colouring equations with one row and one column struck out; it equals A knot has non-constant -colourings exactly when divides it.
Diagonal map
The map Every space has one; pulling measurements back along it is what lets cohomology multiply.
Diagram chase
A proof that follows a single element around a commutative diagram, using commutativity and exactness at each step. The snake lemma is the classic example.
Differential (of a chain complex)
Another name for the maps of a chain complex, borrowed from the of calculus, which also satisfies
Differential (of a smooth map)
For a smooth map the linear map that sends the velocity of a curve to the velocity of the best linear approximation to near It pushes vectors forward and is also written
Differential 1-form
A covector at every point, varying smoothly: It eats a small step and returns a number, so it can be integrated along oriented curves.
Differential k-form
A smoothly varying measuring device for tiny oriented -dimensional parallelograms, such as A -form is integrated over oriented -dimensional pieces; the space of them is written
Dihedral group D₃
The six symmetries of an equilateral triangle: three rotations and three flips It is the smallest group that is not abelian:
Dimension (of a vector space)
The number of vectors in any basis of a vector space: its number of degrees of freedom. For example and has dimension and elements.
Dimension axiom
The Eilenberg–Steenrod axiom saying that a point has homology only in degree 0. Dropping it gives generalized homology and cohomology theories such as K-theory and cobordism.
Dirac quantisation condition
For a charge and a monopole of strength must be an integer (units with so a single monopole would force all electric charges to be whole multiples of one unit.
Direct sum
the pairs added coordinate by coordinate: two groups side by side, like two independent dials. Examples: and the symmetries of a rectangle.
Discrete curl (circulation)
The sum of an edge labelling around the boundary of a filled triangle It is the coboundary evaluated on the triangle, and the curl of a gradient is always zero.
Discrete gradient
The edge labelling made from a potential on an edge from to “head minus tail”. Edge labellings of this form are called gradients.
Discrete Morse theory
A systematic way of pairing off simplices that can be collapsed, leaving a much smaller complex (or chain complex) with the same homology.
Discrete Stokes theorem
for every cochain and chain measuring the change of over a region equals measuring on the region’s boundary. In degree 0 it is telescoping.
Discrete topology
The topology in which every subset is open: each point is isolated from all the others. It comes from the discrete metric.
Disjoint union
Two spaces side by side, not touching:
Disk (ball)
the points at distance at most from the origin in Its boundary is the sphere
Divergence
Outward flux per unit area (or volume) out of a tiny region; in the plane, Positive at sources, negative at sinks.
Divergence theorem
The flux of a field out through the boundary surface of a solid equals the total divergence inside: Also called Gauss’s theorem.
Divides (n | m)
read “ divides means for some integer It is a statement (true or false), not a fraction.
Domain and codomain
For the domain is where inputs come from and the codomain is where outputs must land. Changing either one changes the function.
Double curve
The set where an immersed surface passes through itself — drawn in rose on the Klein bottle and Boy’s surface.
Double dual
The dual of the dual, For finite-dimensional evaluation is an isomorphism that needs no choice of basis — the standard example of a natural isomorphism.
Double inclusion
To show two sets are equal, show every element of the first is in the second and every element of the second is in the first: and
Dual basis
For a basis the covectors that read off coordinates: is 1 when and 0 otherwise. Each depends on the whole basis.
Dual cell
For a -simplex of a triangulated -manifold, the -dimensional cell built from the barycentric subdivision, running outwards from the barycentre of It crosses in exactly one point: a vertex has a dual face, an edge a dual edge, a triangle of a surface a dual vertex.
Dual cell decomposition
The cell decomposition of a triangulated closed manifold formed by all the dual cells. Matching each simplex with its dual cell turns cochains of into chains of and the coboundary into the boundary — the idea behind Poincaré duality.
Dual graph
For a network drawn on a sphere or in the plane: the graph with one vertex in each face, and one edge crossing each edge of the original. Used in the "two trees" proof of Euler’s formula.
Dual space
The vector space of all covectors on For finite-dimensional vectors are columns and covectors are rows.
Duality map
For a closed oriented -manifold, the map from to The modern statement of Poincaré duality is that it is an isomorphism.
Dunce cap
The space obtained from a triangle by gluing its sides according to the word It is contractible, although no triangulation of it can be collapsed face by face to a point.
Dyck’s theorem
(Walther von Dyck, 1888): in the presence of a cross-cap, a handle can be traded for two cross-caps. So mixing handles and cross-caps produces nothing new.

E

Edge labelling
A choice of a number (or of an element of a group) on every oriented edge — the same thing as a 1-cochain. Reversing the arrow on an edge changes the sign of its number. Also called an edge flow.
Edge word
The letters read once around a gluing diagram (here anticlockwise from the bottom-left corner), written along an arrow and against it; e.g. for the torus.
Eilenberg–MacLane space
A space whose only nonzero homotopy group is It represents cohomology: for cell complexes Examples: and
Eilenberg–Steenrod axioms
Five axioms for a homology theory on pairs of spaces: homotopy invariance, a long exact sequence for every pair, excision, additivity, and the dimension axiom (a point has homology only in degree 0). On cell complexes they determine homology from the coefficient group.
Elder rule
When two classes merge in a filtration, the older one (born earlier) survives and the younger one dies. In a Rips filtration all points are born at once, and ties are broken by labels.
Element (∈)
read “ is an element of means that is one of the things in the set means it is not.
Elementary collapse
Removing a simplex together with a free face, a face that belongs to no other simplex. It does not change homology, and is used to shrink complexes before computing.
Embedding
A one-to-one continuous map that is a homeomorphism onto its image: a faithful copy of one space inside another.
Empty set (∅)
The unique set with no elements, It is a subset of every set. Note that is not empty: it has one element.
Entrance time
The parameter value at which a simplex enters a filtration; a face never enters after the simplices containing it. For Vietoris–Rips it is half the largest distance between the simplex’s points.
Equivalence class
The class of is everything equivalent to Two classes are either equal or disjoint, and exactly when
Equivalence of categories
Functors and whose round trips and are naturally isomorphic to the identity functors. Finite-dimensional vector spaces are equivalent to the category of matrices.
Equivalence relation
A relation that is reflexive, symmetric and transitive: the precise meaning of “declaring things the same.” Example: congruence modulo on
Essential class
A homology class that never dies in a filtration, giving an infinite bar In the full Rips filtration of a point cloud there is exactly one: the class of the single final piece in
Étale cohomology
A cohomology theory built by Grothendieck and his school for shapes defined by polynomial equations over any field, including finite fields. With it Pierre Deligne proved the last of the Weil conjectures in 1974.
Euler characteristic (χ)
The alternating count of the vertices, edges, faces, … of a complex — for a polyhedron, It depends only on the space, not on how it is cut up:
Euler characteristic in odd dimensions
Every closed manifold of odd dimension has in the terms for and have equal Betti numbers but opposite signs, so they cancel.
Euler characteristic of a connected sum
for closed surfaces: cutting out a disk lowers each by 1, and gluing along the circles changes nothing. Adding a handle lowers by 2.
Euler characteristic of a graph
which equals the number of connected pieces minus the number of independent loops. A tree has a circle has
Euler class
The characteristic class of an oriented rank- bundle: the obstruction to a nowhere-zero section, the signed count of zeros of a generic section. For a tangent bundle,
Euler–Poincaré formula
the alternating count of simplices equals the alternating sum of Betti numbers, over any field.
Euler’s polyhedron formula
for every polyhedron whose surface is a sphere in disguise (for instance every convex polyhedron). Announced by Euler in 1750, published in 1758.
Even and odd orderings
An ordering of labels is even or odd according to whether it takes an even or odd number of swaps to reach it from the increasing order — equivalently, whether the number of pairs out of order is even or odd. is even; is odd.
Exact form
A differential form that is the exterior derivative of another, Exact forms are closed, because an exact 1-form has zero integral around every closed loop.
Exact sequence
A chain of homomorphisms in which, at every inner group, the image of the incoming map equals the kernel of the outgoing one: what produces is exactly what kills.
Excision
If and the closure of lies in the interior of then what happens deep inside does not matter. It makes homology local.
Exponent sum
The number of times a letter occurs in a word, counting as and as For a disk glued along a word, it is the coefficient of that edge in the cellular boundary of the face.
Ext
is the cohomology in degree 1 of for a free resolution of It measures how fails to be exact and classifies extensions: and
Ext group
A group built from abelian groups and defined properly in the chapter on homological algebra. For finitely generated groups: and of a direct sum is the direct sum.
Extending linearly
Defining a map on all chains from its values on single simplices by The result respects sums:
Extension
A short exact sequence viewed as a way of building from a subgroup and a quotient For instance and are both extensions of by
Exterior algebra
The ring generated by elements that anticommute and square to zero, like The cohomology ring of the torus is the exterior algebra that of is the exterior algebra on generators.
Exterior derivative
The operator with In it is the gradient, curl and divergence; pictorially it marks where the sheets of a form end.

F

f-vector
The list of the numbers of vertices, edges, triangles, … of a simplicial (or cell) complex. The hollow tetrahedron has f-vector
Face (of a simplex)
A simplex spanned by some (at least one) of the vertices of a given simplex. An -simplex has faces of dimension — row of Pascal’s triangle — and faces in all.
Facet (maximal simplex)
A simplex of a complex that is not a face of any larger simplex in it. Listing the facets describes the whole complex: the hollow triangle has facets
Fence
A picture of a 1-cocycle on a surface: curves crossing the edges, as many times (with sign) as the cocycle’s value on each edge. The value of the cocycle on a closed loop is the number of times the loop crosses the fence, counted with sign. A fence coming from a coboundary looks like the level curves of a function.
Fibre
The vector space of a vector bundle sitting over a point of the base.
Field
A number system in which you can add, subtract, multiply and divide by anything except zero, with the usual rules of arithmetic. Examples: and The integers are not a field, because has no integer reciprocal.
Filtered complex
A chain complex with a nested sequence of subcomplexes — for example the chains of the skeleta of a cell complex. Its spectral sequence computes from the pieces
Filtration
A nested family of subcomplexes (for of a simplicial complex — a “film” of growing complexes, such as the Vietoris–Rips complexes of a point cloud as the radius grows.
Finitely generated
A group is finitely generated if finitely many of its elements generate it. and every finite group are; is not. Homology groups of finite complexes are finitely generated.
First Chern class
The characteristic class of a complex line bundle. Complex line bundles are classified by it; over the sphere it is a single integer, the Chern number.
First Isomorphism Theorem
For a homomorphism the rule is a well-defined isomorphism collapse what cannot see, and what remains is exactly what it reaches.
Fixed point
A point with a point the map does not move.
Fixed-point index
A sign (or integer) attached to an isolated fixed point, measuring how the map turns around it; for a nondegenerate fixed point it is the sign of The indices of all fixed points add up to the Lefschetz number.
Flag complex
A simplicial complex determined by its edges: a set of vertices spans a simplex exactly when every two of them are joined by an edge. Also called a clique complex.
Flattened polyhedron (Schlegel diagram)
The flat network obtained by removing one face of a polyhedron and stretching the rest out on the plane; the removed face becomes the outside region. Used in Cauchy’s proof of Euler’s formula.
Flux
The net amount of a flow crossing a curve or surface, counted positively in the direction of the chosen normal
For all (∀)
“for every To prove a ∀-statement, argue for an arbitrary to disprove it, one counterexample is enough.
Forgetful functor
A functor that forgets structure, such as which sends a group to its underlying set and a homomorphism to its underlying function.
Formal sum
An integer combination of named pieces, such as kept as an inventory rather than evaluated. Formal sums are added coefficient by coefficient. Chains in homology are formal sums of edges, triangles, and so on.
Fox colouring
A labelling of the arcs of a diagram by elements of such that at every crossing twice the over-arc equals the sum of the two under-arcs. Their number is a knot invariant: mod for the trefoil, for the unknot.
Free abelian group
The group of formal sums of the elements of a set with integer coefficients. If has elements it is a copy of The chain groups of homology are free abelian groups.
Free group
The group of reduced words in some letters and their inverses, multiplied by joining words and cancelling. The fundamental group of the figure eight is the free group on two letters it is not abelian.
Free resolution
An exact sequence in which every is free abelian. Every abelian group has one of length one, generators and the relations among them.
Front face
For an ordered simplex the face made of its first vertices. In the left factor is read on the front face.
Function (map)
A rule assigning to each element of the domain exactly one element of the codomain Written
Functor
A map between categories, it sends objects to objects and arrows to arrows, preserving identities and composition, Homology is the motivating example; the word first appears for it in Chapter 3.5.
Functoriality
The rules and homology turns spaces into groups and maps into homomorphisms, respecting composition. This is what it means for homology to be a functor.
Fundamental class
For a closed, connected, orientable -manifold the class of the sum of all top simplices, coherently oriented: the whole manifold as a cycle. Evaluating a top-dimensional cochain on it is the discrete version of integrating over
Fundamental cycle
For a spanning tree and an edge outside it: the cycle formed by and the tree path joining its ends. The fundamental cycles of a spanning tree form a basis of the cycle space.
Fundamental domain
For a sublattice spanned by and the half-open parallelogram It contains exactly one point of each coset, so the number of cosets is its area
Fundamental group
The group of homotopy classes of loops at multiplied by concatenation. It records the one-dimensional holes of for example
Fundamental theorem of calculus
adding up the small changes of over an interval leaves only its values at the two boundary points.

G

Gauss–Bonnet theorem
For a closed surface, total curvature is a topological invariant.
Gauss’s law
The electric flux out of a closed surface is the enclosed charge divided by For a point charge the field is a multiple of the solid-angle form, and the flux counts how often the surface wraps around the charge.
Gaussian curvature
the product of the principal curvatures: positive on a sphere, zero on a cylinder, negative on a saddle. By the Theorema Egregium it can be measured from inside the surface.
General position (affinely independent)
Points are in general position if none of them lies on the line, plane or flat space through the others; then they span an honest -simplex. Three points in a row are not in general position.
Generalized (co)homology theory
A theory satisfying every Eilenberg–Steenrod axiom except the dimension axiom, so that a point may have nonzero groups in many degrees. Examples: K-theory, cobordism, stable homotopy.
Generated equivalence relation
The smallest equivalence relation containing a given relation when or one can walk from to by finitely many steps along pairs of in either direction. Gluing instructions generate equivalence relations.
Generator
An element (or set of elements) from which every element of the group can be built using the group operation and inverses. generates and together generate
Generators of homology
Cycles whose classes generate On the torus the bottom row and the left column of the grid generate Generators are never unique: any homologous cycles work as well.
Genus
The number of handles of a closed orientable surface: for the sphere, for the torus. For the non-orientable surface the number of cross-caps is called its non-orientable genus.
Genus of a knot
The smallest genus of a Seifert surface for the knot. Only the unknot has genus the trefoil and the figure-eight knot have genus Genus adds up under connected sum, so knots cannot cancel each other.
Geodesic
A straightest possible path on a surface; on a sphere, an arc of a great circle.
Geometric realisation
A simplicial complex in space whose simplices correspond to the sets of a given abstract simplicial complex. Every finite abstract complex has one, and any two are homeomorphic.
Global obstruction
A failure that passes every local test but shows up around a loop that bounds nothing, such as the loop sum around the hole of an annulus. It is a nonzero cohomology class.
Global section
A section over the whole space; the global sections form For a sheaf,
Gluing (identification)
Building a new shape as a quotient by declaring points the same. Gluing the ends of gives a circle; gluing opposite sides of a square gives a torus.
Gluing axiom
The second sheaf axiom: sections on the pieces of a cover that agree on every overlap glue to a section on the union.
Gluing diagram
A polygon whose edges carry letters and arrows; edges with the same letter are glued so that their arrows match. Unlabelled edges stay free and form the boundary.
Good cover
A family of sets in which every nonempty intersection of some of the sets is contractible — for example, any finite family of convex sets in such as balls. The nerve theorem applies to good covers by open sets, and to finite families of closed convex sets.
Good pair
A pair with a nonempty closed subspace that is a deformation retract of some neighbourhood in e.g. a subcomplex. For good pairs
Graded commutativity
The rule for cohomology classes of degrees and It holds for classes, not for cochains; over the sign disappears.
Graded ring
A ring split into pieces so that a product of an element of and one of lies in degrees add when you multiply.
Gradient
On a graph or complex, an edge flow that comes from heights on the vertices: each edge carries the climb along it. In calculus (Chapter 4.3) the gradient of a function is the vector of partial derivatives, which points straight uphill and is perpendicular to the level curves.
Gradient test
An edge labelling is a gradient (a difference of potentials) if and only if its sum around every closed loop is zero. It is enough to check the fundamental loops of a spanning tree.
Graph
A collection of points called vertices together with edges, each joining two different vertices. A graph is a simplicial complex with no triangles.
Graph Laplacian
The square matrix one row and column per vertex: the number of edges at each vertex on the diagonal, and in row column whenever an edge joins and Solving finds the gradient closest to an edge flow
Greatest common divisor
the largest whole number dividing both and For example Numbers with are called coprime.
Green’s theorem
For a region in the plane with counterclockwise boundary, circulation around the edge equals total curl inside.
Group
A set with an operation that is closed, associative, has an identity element and inverses. Groups capture symmetry (moves of a triangle) and counting (clock arithmetic) in one definition.

H

H⁰ (zeroth cohomology)
The locally constant functions on a space: the 0-cochains with Its dimension is the number of connected components,
Hairy ball theorem
has a nowhere-zero continuous tangent vector field exactly when is odd. So every tangent field on the ordinary sphere vanishes somewhere, while a torus can be combed flat.
Half-space
The set of points of whose last coordinate is Its edge, the hyperplane is written It is the local model for manifolds with boundary.
Handle
What connected sum with a torus adds to a surface: is with a handle attached. The surface of genus is a sphere with handles.
Harmonic flow
An edge flow with zero curl on every filled triangle and zero net flow at every vertex. Harmonic flows live around the holes; each cohomology class (over contains exactly one, its most spread-out representative.
Harmonic form
A differential form with on a closed manifold this means it is both closed ( and co-closed ( On the flat torus the harmonic 1-forms are the constant forms
Harmonic representative
The unique harmonic cocycle (or form) in a cohomology class. Among all representatives it has the least energy, spreading the class as evenly as possible.
Hat notation
A hat over an entry of a list means “leave it out”:
Hausdorff space
A space in which any two different points have disjoint neighbourhoods. Every metric space is Hausdorff; gluing can destroy the property.
Head minus tail
The boundary of an oriented edge from to Along a path the middle vertices cancel and only the endpoints survive.
Hodge decomposition
Every edge flow splits in exactly one way into a gradient, a curl part (swirls around filled triangles) and a harmonic part, the three being mutually perpendicular. The harmonic part represents the global obstruction.
Hodge Laplacian
On differential forms, on the edges of a simplicial complex, Its kernel is the space of harmonic forms or flows, one dimension for each independent cohomology class.
Hodge theorem
On a closed oriented Riemannian manifold, every de Rham cohomology class contains exactly one harmonic form, and orthogonally. On a simplicial complex the same splitting is computed by least squares.
HodgeRank
A method of Jiang, Lim, Yao and Ye (2011) that ranks items from pairwise comparisons with the Hodge decomposition: the gradient part gives the ranking, the curl and harmonic parts measure local and global inconsistencies.
Hole
Informally, an empty place surrounded by a shape. Precisely, a k-dimensional hole is detected by a k-cycle that is not a boundary: a loop (or closed surface) that is not the rim of anything in the space. Holes are counted by classes of homologous cycles.
Holonomy (loop test)
What you accumulate by going once around a loop of overlaps — for three arcs on a circle, (or a product, for multiplicative groups). It vanishes exactly for coboundaries.
Hom group
For abelian groups and is the set of all homomorphisms made into a group by adding values: Read it as “homs from to
Hom-set
The set also written of all arrows from to in a category The name comes from homomorphism.
Homeomorphism
A bijection with and both continuous: a stretching that can be perfectly undone. If one exists, and are homeomorphic,
Homologous cycles
Two cycles are homologous, if together they bound: (with integers, is a boundary. Picture: they sweep out a surface between them.
Homology
The algebraic measurement of holes. For each dimension the homology group consists of the -dimensional cycles of where two cycles count as the same when they differ by a boundary.
Homology class
The coset of a cycle the cycle together with everything obtained from it by adding boundaries. The elements of are homology classes.
Homology from the Smith normal form
where and the are the invariant factors of
Homology group
The quotient the -cycles, with two cycles counted as the same when their difference is a boundary.
Homology theory
A sequence of functors from pairs of spaces to abelian groups, with natural connecting maps satisfying the Eilenberg–Steenrod axioms.
Homology with coefficients
the same construction with chains whose coefficients lie in for instance (chains are then sets of simplices) or Plain means integer coefficients.
Homomorphism
A function between groups that respects the operation: (or It automatically sends to and to
Homotopic
Two maps are homotopic, written if there is a homotopy from one to the other. This is an equivalence relation.
Homotopy
A continuous deformation of one map into another: a continuous with and Think of it as a film whose frame at time is the map
Homotopy category
The category whose objects are spaces and whose arrows are homotopy classes of continuous maps. Its isomorphisms are exactly the homotopy equivalences, and homology is a functor on it.
Homotopy class
The equivalence class of a map (or of a path, with ends fixed) under the relation "is homotopic to".
Homotopy equivalence
A map with a map back such that and Spaces joined by one are homotopy equivalent, written "the same shape in a broader sense".
Homotopy group
is the group of homotopy classes of maps from the -sphere into that send a chosen point to a chosen point. is the fundamental group; is abelian for Unlike homology, is nonzero for infinitely many
Homotopy invariance
Homotopic maps induce the same homomorphisms on homology. Consequently homotopy equivalent spaces — in particular homeomorphic ones — have isomorphic homology groups.
Homotopy invariance (de Rham)
Homotopic smooth maps induce the same map on de Rham cohomology; hence homotopy-equivalent manifolds have isomorphic de Rham cohomology.
Homotopy invariant
A quantity attached to spaces that is the same for homotopy-equivalent spaces, such as the fundamental group or, later, homology. It may be computed on the simplest space of a homotopy type.
Homotopy type
Two spaces have the same homotopy type when they are homotopy equivalent. A disk has the homotopy type of a point; an annulus, of a circle.
Hopf fibration
The map under which the preimage of every point is a circle, any two of them linked once. Found by Heinz Hopf in 1931, it generates
Hopf invariant
For a map the linking number of the preimages of two points. It does not change under homotopy, and it equals 1 for the Hopf map.
Hurewicz theorem (dimension 1)
For a path-connected space, first homology is the fundamental group made abelian. Loops become cycles, without a chosen basepoint.
Hypothesis and conclusion
In “if [hypotheses], then [conclusion]”, the hypotheses are what may be assumed and the conclusion is what follows. A theorem may be used only when all its hypotheses are checked.

I

Identity arrow
The arrow that every object of a category carries, which changes nothing under composition:
Identity element
The element that does nothing: for every Written (or in general groups and in abelian groups. A group has exactly one.
Identity map
It changes nothing:
If and only if (⇔, iff)
means and the two statements are equivalent, each necessary and sufficient for the other.
Image
For and the image is where the elements of land. The image of is
Image (of a homomorphism)
everything a homomorphism reaches: “the shadow”. It is a subgroup of the target. In homology, boundaries are the image of the boundary map.
Image of a linear map (column space)
The subspace of all outputs what can be reached. It is the span of the columns of and its dimension is the rank.
Immersion
A smooth map of a surface into space whose derivative is one-to-one at every point: near each point it is a faithful embedding, but different sheets may pass through each other along a double curve.
Implication (⇒)
“if then a promise that is broken only when is true and is false. Also read “ only if “ is sufficient for
Index of a subgroup
The number of cosets of in written For finite groups it equals
Index of a zero
The number of turns made by the arrow of a vector field as you walk once anticlockwise around a small loop enclosing an isolated zero: source, sink and centre saddle
Indicator cochain
For a -simplex the cochain that is on and on every other -simplex. Every cochain is a combination over a field the indicators form the dual basis.
Indiscrete topology
The topology whose only open sets are and the whole space: no open set can tell two points apart.
Induced chain map
For a simplicial map the chain map that sends an oriented simplex to (re-sorted, with a sign), or to if two vertices land on the same point. For singular chains it is simply composition,
Induced homomorphism
The homomorphism on homology defined by a map Read “ lower star”. Wrapping a circle twice around another induces multiplication by on
Induced map on cohomology
The homomorphism induced by a map It goes backwards, satisfies and
Induction
To prove a statement for all prove it for (base case) and show that truth for implies truth for (inductive step). Like a row of falling dominoes.
Injective (one-to-one)
is injective if implies different inputs never collide.
Integer chain
A formal sum with integer coefficients: is traversed the other way, is traversed twice. Reducing the coefficients mod 2 gives a mod-2 chain.
Integer lattice
the points of the plane with whole-number coordinates, added coordinate by coordinate. A sublattice is a subgroup of it, such as the integer combinations of two vectors.
Integer row and column operations
Swapping two rows (or columns), negating one, or adding an integer multiple of one to another. These are exactly the moves that can be undone without fractions; they amount to changing bases of the chain groups.
Integers modulo n (ℤ/n)
The quotient of by congruence modulo the -element set pictured as the positions of a clock hand. Its arithmetic comes in §1.3.
Integral
An accumulated total: is the limit of the sums over finer and finer subdivisions of — the signed area under the graph.
Integration map (de Rham map)
The map that turns a -form into the -cochain By Stokes’ theorem it satisfies so it sends closed forms to cocycles and exact forms to coboundaries.
Intersection (∩)
what the two sets have in common. Sets with are disjoint.
Intersection form
For a closed oriented -manifold, the pairing on modulo torsion, written as a square matrix of integers. It is symmetric when is even, antisymmetric when is odd, and unimodular.
Intersection number
For oriented closed curves on an oriented surface, crossing each other cleanly, the sum over crossing points of or according to whether crosses from right to left or from left to right. It depends only on the homology classes, and equals the cup product of the Poincaré duals evaluated on
Intersection pairing
The pairing between and of a closed oriented -manifold that counts signed intersections of cycles. By Poincaré duality it is perfect over a field: every nonzero class is met a nonzero number of times by some class of complementary dimension.
Invariance of dimension
If and are homeomorphic then Proof: removing a point leaves spaces homotopy equivalent to and which homology tells apart.
Invariance of domain
Brouwer’s theorem that a continuous one-to-one map from an open subset of to has open image. In particular a continuous bijection is a homeomorphism.
Invariance of χ
Homeomorphic finite complexes have the same Euler characteristic, so is a number attached to the space itself. The general proof uses homology:
Invariant factors
For a group, the numbers each at least in For an integer matrix, the nonzero diagonal entries of its Smith normal form (Chapter 1.5); entries equal to contribute and the others are the invariant factors of the cokernel.
Inverse (of an element)
The element that undoes with In additive notation it is written Each element has exactly one inverse, and
Inverse (reverse) path
The same journey run backwards: A loop followed by its reverse is homotopic to the constant loop.
Inverse function
with and It exists exactly when is bijective, and is written (not to be confused with the preimage, which always exists).
Isomorphism
A bijective homomorphism: a renaming of the elements of one group as those of another that turns one table into the other. Groups related by one are isomorphic, “the same group with different names”.
Isomorphism (in a category)
An arrow with an inverse and One word for bijections, group isomorphisms, homeomorphisms and (in the homotopy category) homotopy equivalences.

J

Jones polynomial
The knot invariant with discovered by Vaughan Jones in 1984. It tells the trefoil ( from its mirror image; whether it can recognise the unknot is open.
Jordan curve theorem
A simple closed curve in the plane separates it into exactly two connected pieces, a bounded inside and an unbounded outside. In homology:
Jordan–Brouwer separation theorem
A closed connected surface embedded in separates space into a bounded inside and an unbounded outside. Hence closed surfaces in are two-sided and orientable, and the Klein bottle and cannot be embedded there.

K

k-cycle and k-boundary
A k-cycle is a collection of k-dimensional pieces with no loose -dimensional pieces; a k-boundary is the rim of a collection of filled -dimensional pieces. A k-dimensional hole is a k-cycle that is not a k-boundary.
K-theory
A generalized cohomology theory built from vector bundles: consists of formal differences of complex vector bundles over up to stable equivalence. Created by Atiyah and Hirzebruch in 1959–61, after Grothendieck’s algebraic version.
Kauffman bracket
The sum over all states of a diagram (a choice of A- or B-smoothing at every crossing) of where counts the loops. Unchanged by moves II and III; corrected by the writhe it gives the Jones polynomial.
Kernel
everything a homomorphism sends to “what gets crushed”. It is a subgroup, and is injective exactly when In homology, cycles are the kernel of the boundary map.
Kernel of a linear map (null space)
The subspace of inputs that sends to what gets crushed, or the solutions of Its dimension is the nullity.
Khovanov homology
A bigraded homology theory of knots (Mikhail Khovanov, posted 1999, published 2000), built from the cube of states of a diagram, whose graded Euler characteristic is the Jones polynomial. Kronheimer and Mrowka proved in 2011 that it detects the unknot.
Kirchhoff’s formula
A graph with vertices, edges and connected pieces has independent cycles (Kirchhoff, 1847). Rearranged:
Kirchhoff’s voltage law
In an electrical circuit, the voltages around any closed loop add up to zero. It holds because voltages across components are differences of potentials, which telescope.
Klein bottle
The square with one pair of edges glued straight and the other with a flip, word A closed one-sided surface that can be drawn in 3D only by letting it pass through itself.
Knot
A smooth closed curve in (or that does not cross itself. As a space every knot is a circle; what distinguishes knots is how they sit in space, up to ambient isotopy.
Knot diagram
A drawing of a knot’s shadow in the plane, crossing itself in finitely many points, with the lower strand broken at each crossing to show which strand passes under.
Knot group
The fundamental group of a knot’s complement. Its abelianization is always which is all that homology sees; the group itself tells the trefoil from the unknot.
Knot invariant
Anything computed from a knot diagram that does not change under the Reidemeister moves, and therefore depends only on the knot: colourings, the determinant, the Alexander and Jones polynomials, Khovanov homology.
Kronecker pairing
The pairing of a cohomology class with a homology class. It is well defined by Stokes’ formula: coboundaries vanish on cycles, and cocycles vanish on boundaries.
Künneth formula
With field coefficients (and finitely many cells), the cohomology ring of a product is its classes are products of classes of the factors, degrees adding. For example
Künneth theorem
For cell complexes, the homology of a product from the homology of its factors.

L

Lagrange’s theorem
In a finite group the size of every subgroup divides the size of the group, because the cosets cut the group into pieces of equal size. In particular the order of every element divides
Lefschetz duality
Poincaré duality for a compact orientable -manifold with boundary: and On an annulus it matches the core circle with the fence along it (a class that ignores the rim), and a rung from rim to rim with the fence along the rung.
Lefschetz fixed point theorem
If is a finite simplicial complex (or a retract of one, such as a compact manifold) and then has a fixed point. It generalizes Brouwer’s theorem.
Lefschetz number
an alternating sum of traces of the induced maps. For the identity it is the Euler characteristic.
Left exact
A functor is left exact if it turns each short exact sequence into a sequence that is exact except that its last map need not be onto. is left exact: is exact.
Leibniz rule (for the cup product)
The formula for a -cochain — the twin of It is why cocycles multiply to cocycles.
Leray cover (Leray’s theorem)
A cover on whose finite intersections the sheaf has no higher cohomology. Leray’s theorem: the Čech cohomology of such a cover is the true sheaf cohomology.
Level set
The set of points where a function takes one fixed value, such as a contour line on a map. The level sets form the stack of sheets that pictures the 1-form
Lift (of a path)
For a path in the circle, the continuous choice of its angle as a real number, as if walking a spiral staircase above the circle. The total climb of a loop’s lift is its winding number.
Lights Out
A puzzle on a grid of lights in which each press switches a light and its neighbours. Over it is the linear system on the board, has rank 23 and nullity 2.
Limit point
A point is a limit point of a set if every ball around however small, contains a point of other than A set is closed exactly when it contains all of its limit points.
Line bundle
A vector bundle whose fibres are lines (rank 1). Over the circle there are two real ones: the cylinder and the Möbius band.
Line integral
The total of a field along an oriented path: the work done by a force along the path. Reversing the path flips the sign.
Line with two origins
Two copies of glued at every point except It is locally Euclidean but not Hausdorff: the two origins cannot be separated by disjoint open sets, so it is not a manifold.
Linear combination
A sum of scalar multiples of vectors,
Linear independence
Vectors are linearly independent if the only linear combination of them that equals has all coefficients zero. Equivalently, none of them is a combination of the others.
Linear map
A function between vector spaces with and In the plane it keeps grid lines straight, parallel and evenly spaced, and it fixes the origin.
Link
A finite collection of disjoint knots, its components. The Hopf link, the Whitehead link and the Borromean rings are links of two, two and three components.
Linking number
How many times a closed curve winds around a knot counted with signs: the integer with in In a diagram it is half the sum of the signs of the crossings between the two curves; it is also the signed number of times pierces a Seifert surface of
Local homology
The groups which depend only on a neighbourhood of the point In they are for and otherwise, so they detect dimension.
Local obstruction
A failure that can be detected by looking at one small piece at a time — for an edge labelling, a nonzero curl on a single filled triangle.
Locality axiom
The first sheaf axiom: if two sections over restrict to the same section on every piece of a cover of they are equal.
Locally constant function
A function that is constant on each connected piece of a space but may take different values on different pieces. On a graph these are exactly the potentials with
Locally Euclidean
A space is locally Euclidean of dimension if every point has an open neighbourhood homeomorphic to an open subset of — equivalently, to an open ball, or to all of The first and main condition in the definition of a manifold.
Long exact sequence
An exact sequence that goes on in both directions, typically Knowing most of the groups and maps lets you solve for the rest.
Long exact sequence of a pair
coming from the short exact sequence of chains
Longitude (of a torus)
A loop going once around the central hole of a torus. Together with the meridian it gives the two independent holes of the torus surface:
Loop
A path that starts and ends at the same point the basepoint.
Loop sum
The sum of an edge labelling around a closed walk, where edges walked against their arrows count with a minus sign. It is the pairing of the labelling with the loop, and the certificate that a labelling is not a gradient when it is not zero.
Loose end
A vertex of odd degree in a set of edges. A path has loose ends at its two endpoints; a cycle has none. Mod 2, the loose ends of a set of edges are exactly its boundary.
Low of a column
is the row index of the lowest nonzero entry of column of a matrix; for a filtration boundary matrix, the most recently added face in the boundary of the -th simplex.

M

Magnetic monopole
A hypothetical isolated magnetic pole, with field Its vector potential needs two patches, and the patching phase is a complex line bundle with Chern number
Manifold
A space that looks like near every point: a Hausdorff, second countable topological space in which every point has an open neighbourhood homeomorphic to an open subset of The number is its dimension.
Manifold with boundary
A Hausdorff, second countable space in which every point has a neighbourhood homeomorphic to an open subset of the half-space Examples: the closed disk, the cylinder, the Möbius band.
Matrix
A rectangular table of numbers that records a linear map: column is the image of the -th basis vector. An matrix describes a map from -dimensional to -dimensional space.
Matrix multiplication
The product is the matrix of the composite map "first then ". Its entry in row column is row of times column of Order matters: usually
Mayer–Vietoris sequence
For (open sets): the long exact sequence Inclusion–exclusion for holes.
Mayer–Vietoris sequence (de Rham)
For a manifold covered by two open sets a long exact sequence that computes cohomology by cutting and pasting.
Meridian (of a knot)
A small loop going once around the strand of a knot on the surface of a thin tube around it. Its class generates for every knot; the loop that runs once along the tube without linking the knot is the longitude
Meridian (of a torus)
A loop going once around the tube of a torus. It bounds nothing on the hollow torus, but on a solid torus it bounds a disk-shaped slice.
Metric
A rule giving a distance between any two points, which is zero only when is symmetric, and obeys the triangle inequality
Metric space
A set together with a metric. Examples: the line, the plane and with straight-line distance; the plane with taxicab distance; any set with the discrete metric.
Möbius band
The square with one pair of opposite edges glued with a flip, It has a single boundary circle and only one side.
Mod 2 cohomology
Cohomology with values in where It needs no orientations and sees one-sidedness: every group of with coefficients is
Mod-2 fundamental class
The class of the plain sum of all top simplices. It exists for every closed manifold, orientable or not, because mod 2 every face is counted twice and the signs no longer matter.
Mod-2 homology
Homology with coefficients in Chains are sets of simplices and orientations never matter, which makes it the simplest homology to compute; but it forgets torsion of odd order and confuses some different spaces, such as the torus and the Klein bottle.
Mod-p Betti number
for a prime It exceeds the rational Betti number when or has torsion of order divisible by
Monodromy
The change in a local solution after following it continuously around a loop — for example, a branch of comes back as its negative after one turn around
Morphism (arrow)
An arrow of a category: something with a source and a target that can be composed with arrows that start where it ends. In familiar categories the arrows are structure-preserving maps, but in general they need not be functions at all.
Multiples of n (nℤ)
The subgroup of the integers. Every subgroup of is of this form.
Multivalued function
An informal name for a rule like the angle of a point, which can be chosen continuously near each point but changes by a constant (here after a trip around a loop, so it is not a genuine function on the whole space.

N

Natural isomorphism
A natural transformation each of whose components is an isomorphism. A finite-dimensional vector space is naturally isomorphic to its double dual; it is isomorphic to its dual, but not naturally.
Natural transformation
A way of comparing two functors an arrow for each object such that for every arrow Natural maps are the ones defined without arbitrary choices.
Naturality square
For a family of arrows between functors and the square formed by and for an arrow The family is a natural transformation when every such square commutes.
Negation
The statement that says the opposite. Push inward: becomes becomes and becomes
Negative simplex
A -simplex whose boundary was a cycle that did not yet bound. Adding it fills that cycle in, killing a -class and lowering by one.
Neighbourhood
An open set containing a given point — a region that gives the point some room.
Nerve
The nerve of a family of sets is the abstract simplicial complex with one vertex per set, in which a group of vertices spans a simplex exactly when the corresponding sets have a point in common.
Nerve theorem
For a good cover (for instance by finitely many balls in the nerve has the same homotopy type as the union of the sets, and hence the same homology. It is why the Čech complex captures the union of balls.
No-retraction theorem
There is no retraction it would make the identity of factor through A drumskin cannot be pulled onto its rim without tearing.
Non-orientable
Not orientable: no continuous choice of orientation exists, because some loop brings a traveller home as its own mirror image. Examples: the Möbius band, the Klein bottle,
Null-homologous
Homologous to the zero cycle — that is, a boundary.
Null-homotopic
Homotopic to a constant map. A loop is null-homotopic when it can be shrunk to its basepoint within the space — equivalently, when it is the rim of a disk mapped into the space.
Nullity
The dimension of the kernel of a linear map.

O

One-sided surface
A surface sitting in a space on which an ant can walk from one side to the other without crossing an edge, like the Möbius band in One-sidedness depends on the surrounding space; for surfaces in it is the same as non-orientability.
Open ball
The set of all points at distance less than from In the plane with straight-line distance it is a disk without its rim.
Open cover
A collection of open sets whose union is the whole space.
Open set
In a metric space: a set in which every point has some wiggle room — a ball around it inside the set. In a topological space: any member of the chosen collection of open sets.
Opposite category
The category with the same objects as and every arrow reversed: an arrow in is an arrow in
Order of a group
The number of elements of a group written For example and the group has infinite order.
Order of an element
The smallest with (or infinite if there is none. It equals the size of In the element has order
Ordered pair
A pair with a first and a second entry; exactly when and Unlike the set order matters.
Orientable
A manifold is orientable if a sense of "anticlockwise" can be chosen at every point, continuously. The sphere and the torus are orientable; the Möbius band, the Klein bottle and the projective plane are not. A surface is orientable exactly when it contains no Möbius band.
Orientation
For a vector space: a choice of one of the two classes of ordered bases, where two bases are equivalent if the change-of-basis matrix has positive determinant ("anticlockwise" or "clockwise" in the plane). For a manifold: a choice of orientation of every tangent space, varying continuously.
Orientation (of a simplex)
A choice of ordering of the vertices, where two orderings count as the same if they differ by an even number of swaps. Each simplex of dimension at least 1 has exactly two orientations:
Orientation sheaf
The sheaf whose sections over an open set are its orientations. It has a global section exactly when the surface is orientable; on the Möbius band its Čech class is nonzero.
Orientation-reversing loop
A loop in a manifold along which a traveller carrying an orientation comes home mirror-reversed, like the core circle of a Möbius band. A surface is non-orientable exactly when it has one.
Oriented atlas
A smooth atlas all of whose transition maps have positive Jacobian determinant, so that "anticlockwise" means the same thing in every chart. A smooth manifold is orientable exactly when it has an oriented atlas.
χ of the closed surfaces
The orientable surface of genus has the connected sum of projective planes has A sphere with holes cut out has

P

Pairing
for a cochain and a chain measuring over the place like integrating.
Parity
Whether an integer is even or odd. The two parities are the two classes of congruence modulo 2, so
Partial derivative
The slope of a function of several variables in one coordinate direction, with the other coordinates held fixed, written
Particular solution
Any one solution of All solutions are then a coset of the kernel.
Partition
A way of chopping a set into non-empty, non-overlapping pieces (blocks) that together cover it. Partitions and equivalence relations are the same thing: the blocks are the classes.
Path
A continuous map a journey through from to timing included. It may cross itself, double back or stand still.
Path component
A maximal path-connected piece of a space: two points lie in the same path component when some path joins them. Their number is a topological invariant, and counts them.
Path homotopy
A homotopy between two paths with the same ends that keeps both ends fixed throughout ("relative to the endpoints").
Path-connected
Any two points can be joined by a path. Path-connected spaces are connected; for all the spaces in this book the two notions agree.
Penrose staircase
An impossible staircase that climbs at every step yet returns to where it started. Labelling each step gives a loop sum equal to the number of steps, so no height function exists; a real model must hide a cliff.
Penrose triangle (tribar)
Three square beams joined at right angles into an impossible triangle. Roger Penrose (1991) explained it as a nonzero cohomology class whose coefficients are scale factors, combined by multiplication.
Period
The integral of a closed form over a cycle. By Stokes’ theorem it depends only on the cohomology class of and the homology class of a closed form is exact exactly when all its periods vanish.
Persistence (lifetime)
The length of the interval during which a homology class is alive in a filtration. Long-lived classes are candidates for real structure, short-lived ones for noise.
Persistence diagram
The barcode drawn as points in the plane — birth across, death up. All points lie above the diagonal; points far from it are long-lived, points near it short-lived.
Persistent Betti number
The number of independent -dimensional classes alive at that are still alive at the rank of equal to the number of bars containing
Persistent cohomology
The cohomology version of persistent homology. Over a field it has the same barcode, but each bar comes with a cocycle — which is what circular coordinates need.
Persistent homology
The homology of a filtration followed across all parameter values at once: which classes are born, how long they live and when they die, summarised by a barcode or persistence diagram.
Pivot
The leading 1 of a nonzero row in reduced row echelon form. The number of pivots is the rank; the columns without pivots correspond to free variables, one kernel vector each. Over (Chapters 1.5 and 3.4) a pivot is any nonzero entry used to clear its row and column, and it need not be 1.
Planar graph
A graph that can be drawn in the plane without any crossing edges. A connected planar drawing has (counting the outside as a face), which shows that is not planar.
Platonic solids
The five convex polyhedra whose faces are identical regular polygons with the same number at each corner: tetrahedron, cube, octahedron, dodecahedron and icosahedron.
Poincaré dual (of a loop)
For an oriented closed curve on an oriented surface, the class of the fence along that counts each time a path crosses from its left to its right, and the other way.
Poincaré duality
For a closed orientable -manifold, for every with coefficients the same holds for every closed manifold. The isomorphism is cap product with the fundamental class.
Poincaré lemma
On a star-shaped open subset of every closed form of degree at least 1 is exact. A potential is built by integrating along the rays from the centre.
Poincaré–Hopf theorem
For a vector field with finitely many zeros on a closed manifold, the indices of the zeros add up to the Euler characteristic.
Point cloud
A finite set of points in some space together with the distances between them — the typical shape of data in topological data analysis.
Polyhedron
A solid whose surface is made of flat polygons (faces) joined along straight edges, which meet at corners (vertices). For counting, every face should be a disk, and every edge should border exactly two faces.
Polyhedron with tunnels (Lhuilier’s frame)
A polyhedron with holes through it, like a square picture frame ( pointed out by Lhuilier in 1813. Each tunnel lowers by 2, so tunnels give
Poset (as a category)
A partially ordered set — a set with a relation that is reflexive, antisymmetric and transitive — viewed as a category with exactly one arrow when and none otherwise. Transitivity gives composition and reflexivity gives identities.
Positive simplex
When a complex is built one simplex at a time, a -simplex whose boundary was already a boundary. Adding it creates a new -cycle and raises by one.
Potential
A function that assigns a number to every vertex of a graph or simplicial complex, such as a height or a voltage. Also called a height function; it is the same thing as a 0-cochain.
Power set
The set of all subsets of If then each subset is a string of in/out switches.
Preimage
For and everyone who lands in It exists even when has no inverse, and it respects unions, intersections and complements.
Presentation (generators and relations)
the abelian group generated by the given symbols subject only to the given relations (and their consequences). It is the free abelian group on the generators modulo the subgroup generated by the relations.
Presheaf
An assignment of data to every open set with restriction maps for that compose correctly. The arrows run opposite to the inclusions.
Principal curvatures
The largest and smallest curvatures of the curves cut out of a surface by planes through its normal line at a point.
Prism operator
The chain homotopy built from a homotopy it sends a simplex to the prism swept out by cut into simplices. Its boundary is top minus bottom minus sides:
Product (in a category)
An object with arrows and such that every pair of arrows comes from exactly one arrow The Cartesian product of sets and of spaces, the direct product of groups.
Product topology
The topology on whose open sets are unions of open rectangles The torus is the product
Projection to a quotient
The map sending each element to its class. It is surjective, and exactly when
Projective line
In the six-vertex projective plane, any of the ten triangles of edges that are not faces, such as Each represents the non-zero class of
Proof
An argument, each step justified by definitions, earlier results or logic, that convinces a careful skeptic. Its end is marked ∎.
Proof by contradiction
Assume the statement is false and derive an impossibility; then the statement must be true. Classic example: is irrational.
Proof by contrapositive
Proving by proving the equivalent instead.
Pullback
For a map and a cochain on the cochain on to measure a chain of push it into and measure there. Its matrix is the transpose of the matrix of For differential forms (Chapter 4.3), measures a step by measuring its image under
Punctured plane
The plane with one point removed, It is homotopy equivalent to a circle, and generated by the angle form.
Push-off
A copy of a curve moved slightly to one side. The square of a class on a surface counts the crossings of its fence with a push-off; on a torus a push-off never crosses, on it must cross once.

Q

Quantum Hall effect
Hall conductance quantised in whole multiples of discovered by von Klitzing in 1980. TKNN (1982) explained the integers as topological invariants of the filled electron bands, which Simon (1983) recognised as Chern numbers.
Quiet pattern
In Lights Out, a set of presses that changes no light at all: a nonzero element of the kernel of the Lights Out matrix. The board has three of them.
Quotient group
(“ mod the cosets of each treated as a single element, added by It is with every element of declared to be zero. Homology groups are quotient groups.
Quotient homomorphism
The map sending each element to its coset. It is surjective and its kernel is exactly
Quotient set
The set of all equivalence classes, one element per class. Each class is a single element of the quotient, however many members it has.
Quotient space
A quotient set with the quotient topology — the space obtained from by gluing equivalent points together.
Quotient space (of vector spaces)
For a subspace of the vector space whose elements are the cosets parallel copies of Its dimension is and
Quotient topology
The topology on a glued set in which is open exactly when its preimage is open in look back before the glue.

R

Rank (of a matrix)
The dimension of the image of a linear map: the number of independent columns, which is also the number of pivots after row reduction, and also the number of independent rows.
Rank (of an abelian group)
The number of copies of in the size of a basis of the free part. The rank of a homology group is called a Betti number.
Rank formula
Over a field, where is the number of -simplices. It follows from rank–nullity.
Rank over a field
The number of pivots left after row reduction. The same integer matrix can have different ranks over different fields: of the projective plane has rank over and over because one pivot is
Rank–nullity theorem
For a linear map with finite-dimensional, every input dimension is either crushed into the kernel or survives into the image.
Rational Betti number
equal to the rank of the free part of Torsion is invisible over because one may divide.
Real cohomology
Cohomology with real coefficients. It is the dual vector space of has dimension the -th Betti number, and cannot see torsion. It is what differential forms compute.
Real projective plane
a disk with each rim point glued to the opposite one, or the square with word also the space of lines through a point of One-sided; it immerses in (e.g. as Boy’s surface) but does not embed.
Real projective space
the sphere with opposite points identified, i.e. the lines through the origin in It has one cell in each dimension, with cellular boundary
Reduced homology
The homology of the augmented chain complex. counts pieces minus one and for so a point has no reduced homology and is exactly for
Reduced row echelon form
The staircase produced by row reduction: each nonzero row starts with a pivot equal to 1, each pivot lies to the right of the one above, and each pivot is the only nonzero entry in its column.
Reduced word
A word in letters and their inverses with no adjacent pair like left to cancel.
Reduction algorithm
The standard way to compute persistence: in the filtration boundary matrix over add earlier columns to later ones until no two nonzero columns have the same low; then each nonzero column pairs (a birth) with (a death).
Refinement of a cover
A cover each of whose pieces lies inside some piece of a given cover. The Čech cohomology of a space is defined by passing to finer and finer covers.
Reflexive
A relation is reflexive if every element is related to itself: for all In the arrow picture, every dot carries a loop.
Regular level set
A solution set of a smooth function on which the gradient never vanishes. By the implicit function theorem it is a smooth -manifold; the sphere is an example.
Reidemeister moves
Three local changes to a knot diagram: removing a kink (I), pulling two strands apart (II), and sliding a strand across a crossing (III). Two diagrams show the same knot exactly when a sequence of them connects the two.
Relation
A relation on a set is a subset a yes-or-no question about ordered pairs. We write when
Relation matrix
The integer matrix of a presentation, with one row per generator and one column per relation. The group it presents is modulo the span of its columns; integer row and column operations do not change the group.
Relative boundary
A chain of the form with a chain in a boundary, once chains in are ignored.
Relative chains
The quotient groups chains in where chains lying in the subspace count as zero.
Relative cohomology
The cohomology of the cochains that vanish on every simplex of a subspace measurements that ignore For a manifold with boundary, taking gives measurements that ignore the rim.
Relative cycle
A chain in whose boundary lies in (not necessarily zero). The whole disk is a relative cycle of
Relative homology
the homology of the relative chains For good pairs it is the reduced homology of homology after crushing to a point.
Reparametrization
Re-timing a path without changing the trail it traces, for example running it twice as fast. Reparametrized paths are homotopic.
Representative
Any element of an equivalence class, used as a name for the whole class. A class has as many names as members: in
Restriction map
For open sets the map that cuts data on down to
Retraction
A continuous map onto a subspace that fixes every point of There is no retraction of the disk onto its boundary sphere and that is what proves Brouwer’s fixed point theorem.
Riemann surface of a function
The surface made by gluing together all the local branches of a many-valued function such as or on it the function becomes single-valued.
Riemann–Roch theorem
For a line bundle of degree on a compact Riemann surface of genus Sheaf cohomology on the left, topology on the right.
Right exact
A functor is right exact if it turns each short exact sequence into a sequence that is exact except that its first map need not be one-to-one. Tensoring is right exact: is exact.
Rim (of a region)
For a set of filled triangles: the edges that are sides of an odd number of them. Shared inner sides cancel. The rim of any region is a cycle.
Ring
An abelian group with an associative multiplication that distributes over addition and has a unit Examples: polynomials, functions on a set, square matrices.
Ring homomorphism
A map between rings that preserves sums, products and the unit. A continuous map induces a ring homomorphism with
Row reduction (Gaussian elimination)
Simplifying a matrix with row operations (swap two rows, scale a row by a nonzero number, add a multiple of one row to another) until it reaches reduced row echelon form. It reveals the rank, a basis of the kernel and a basis of the image.

S

Seam-crossing count
On a surface drawn as a glued square, the signed number of times a chain crosses a seam. It vanishes on every boundary, so it can prove that a loop does not bound. It is a first example of a cocycle.
Second countable
A space is second countable if it has a countable collection of open sets from which every open set is a union. For a locally Euclidean space this means it can be covered by countably many chart domains. The condition rules out monsters such as the long line.
Section
An element of one piece of data of a presheaf over the open set such as a continuous function on
Section of a bundle
A continuous choice of one vector in every fibre of a vector bundle. The zero section picks everywhere.
Seifert surface
An oriented, connected surface in space whose boundary is a given knot; Seifert’s algorithm builds one from any diagram. It is the fence of the class “linking number with the knot”: a loop’s linking number is the signed number of times it pierces the surface.
Serre spectral sequence
For a fibration with simply connected, a spectral sequence with converging to Serre used it to prove that spheres have infinitely many nonzero homotopy groups.
Set
A collection of objects, its elements. A set is determined by which things belong to it: order and repetition do not matter, so
Set difference (∖)
read “ minus remove from whatever lies in
Set-builder notation
read “the set of all in such that the elements of for which the statement is true. Some books write a colon instead of the bar.
Seven-vertex (Möbius) torus
The smallest triangulation of the torus: 7 vertices, 21 edges, 14 triangles (labels mod 7). Every pair of vertices is joined by an edge. Described by A. F. Möbius.
Sheaf
A presheaf satisfying locality (sections that agree on every piece of a cover are equal) and gluing (sections on the pieces that agree on overlaps come from a section on the union).
Sheaf cohomology
The groups global sections for and obstructions to gluing local data for They can be computed with Čech cochains on a Leray cover.
Sheaf Laplacian
for a cellular sheaf. The heat flow settles on the global section nearest to the starting data.
Short exact sequence
An exact sequence is injective, is surjective and so Example:
Short exact sequence of chain complexes
Chain maps such that is short exact in every degree Example:
Sign of a reordering
if a reordering of a list can be done with an even number of swaps, if it needs an odd number. Reordering an oriented simplex multiplies it (and its boundary) by this sign:
Sign of a symmetry
The homomorphism sending rotations to (the triangle stays face up) and flips to (it is turned over). Its kernel is the subgroup of rotations.
Signature
The number of positive eigenvalues minus the number of negative ones of a symmetric form. The signature of the intersection form is an invariant of a closed oriented 4-manifold: for for
Signed area
The area of the parallelogram spanned by and with a plus sign if is counterclockwise from and a minus sign otherwise: the determinant
Simplex
The simplest solid shape of a given dimension: an -simplex is the filled-in shape spanned by points in general position — a point ( an edge, a triangle, a tetrahedron, …. Plural: simplices.
Simplicial chain complex
The chain groups of a simplicial complex together with its boundary maps (or the same with coefficients mod 2).
Simplicial complex
A finite collection of simplices such that every face of a simplex in it is also in it (rule 1), and any two of its simplices meet in a common face or not at all (rule 2).
Simplicial map
A map between simplicial complexes that sends vertices to vertices so that the images of the vertices of any simplex span a simplex (possibly a smaller one). Extended using barycentric coordinates, it is continuous.
Simply connected
Path-connected with trivial fundamental group: every loop can be shrunk to a point. The sphere is simply connected but not contractible.
Singular homology
Homology built from singular chains (formal sums of singular simplices). It is defined for every space, every continuous map induces homomorphisms on it, and it agrees with simplicial homology on triangulated spaces.
Singular simplex
Any continuous map from the standard -simplex into a space. “Singular” because it need not be a nice embedding: it may crumple or collapse the simplex.
Six-vertex projective plane (hemi-icosahedron)
The smallest triangulation of the real projective plane: 6 vertices, 15 edges, 10 triangles, obtained by gluing opposite points of an icosahedron. Every pair of vertices is joined by an edge.
Skeleton (k-skeleton)
The part of a complex made of all its cells or simplices of dimension at most written The 1-skeleton of a hollow tetrahedron is a graph with 4 vertices and 6 edges.
Small-sphere test
To see whether a point of a space in is a manifold point, look at where a small sphere around it meets the space: two points for a point of a curve, one circle for a point of a surface, an arc for a boundary point. Anything else, however small the sphere, signals a non-manifold point.
Smith normal form
The diagonal form with each dividing the next, that any integer matrix reaches by integer row and column operations. It shows
Smooth manifold
A manifold with an atlas whose transition maps are all smooth (infinitely differentiable). Smooth structure is what makes calculus possible: a function is smooth if it is smooth in every chart.
Snake lemma
For a commuting diagram with exact rows and joined by vertical maps there is a connecting homomorphism making exact.
Solid-angle form
The 2-form on It is closed, and so it is not exact: it generates
Span
The set of all linear combinations of some vectors. It is always a subspace: for one nonzero vector in the plane, a line through the origin.
Spanning tree
A tree made of some of the edges of a connected graph that reaches every vertex. Every connected graph has one.
Sparse matrix
A matrix most of whose entries are zero. Boundary matrices are extremely sparse: each column of has at most non-zero entries.
Spectral sequence
A sequence of pages of groups with differentials each page the homology of the one before, converging to the homology of a filtered complex. It computes homology in stages, each page correcting the last.
Spectrum
A sequence of spaces each equivalent to the loop space of the next. By Brown’s theorem (1962) every generalized cohomology theory is represented by a spectrum; their study is stable homotopy theory.
Sphere
the points at distance from the origin in is the circle and the ordinary sphere, which is also and the square with word
Split short exact sequence
A short exact sequence in which compatibly with the maps. Every short exact sequence of abelian groups ending in a free group such as splits.
Stability theorem
Moving every point of a cloud by at most moves its Rips or Čech persistence diagrams by at most in bottleneck distance (radius convention). Bars longer than therefore survive.
Stalk
The data a sheaf attaches at a single place: in a cellular sheaf, the vector space on one vertex or edge.
Standard simplex Δⁿ
The set of all lists of real numbers with every and the simplex in spanned by the unit coordinate points. Every -simplex is a copy of it.
Star-shaped region
A region containing a point such that the straight segment from to every point of stays inside Convex regions are star-shaped; an annulus is not.
Statement
A sentence that is definitely true or definitely false, such as “7 is prime”. “ becomes a statement only once we know which is meant.
Stereographic projection
Projecting a sphere from its north pole onto a plane through its equator: each point goes to where the ray from through meets the plane. It shows that a sphere minus one point is homeomorphic to for the circle it is
Stiefel–Whitney class w₁
The class of the signs of the transition functions of a real bundle. It vanishes exactly when the bundle is orientable; for the Möbius band it is nonzero.
Stokes’ theorem
For a compact oriented manifold with boundary and a form of one degree less, It contains the fundamental theorem of calculus, Green’s theorem, the Kelvin–Stokes theorem and the divergence theorem.
Straight-line homotopy
The homotopy between two maps into a convex subset of every point slides along a straight segment.
Subcomplex
A sub-collection of the simplices of a simplicial complex that is itself a simplicial complex (it contains all faces of its simplices).
Subdivision moves
Three ways to cut a surface more finely: split an edge ( vertex, edge), cut a face with a new edge ( edge, face), or put a vertex in a -sided face ( None of them changes
Subgroup
A subset of a group that is itself a group with the same operation: it contains the identity and is closed under the operation and under inverses. Written Example: the even integers in
Subgroup generated by an element
the smallest subgroup containing all the multiples for (all powers in multiplicative notation).
Sublevel set
For a function and a level the set As rises these sets grow, forming a filtration; picture water rising in a landscape.
Subscripts push forward, superscripts pull back
Along a map points travel forward and measurements travel backward ( Homology uses lower indices and cohomology uses upper indices and
Subset (⊆)
means every element of is an element of Two sets are equal exactly when each is a subset of the other.
Subspace (of a vector space)
A subset of a vector space that contains and is closed under addition and scaling, such as a line or a plane through the origin.
Subspace topology
The topology on a subset whose open sets are the intersections with open sets of It is how the circle and the sphere get their open sets.
Surface
A 2-dimensional manifold: a space in which every point has a neighbourhood that looks like a piece of the plane. Examples: the sphere, the torus, the Klein bottle.
Surface with g handles
the closed surface glued from a -gon with word — a doughnut with holes. Corners − edges + faces
Surjective (onto)
is surjective if every equals for some nothing in the codomain is missed.
Suspension
(also the cylinder over with its top collapsed to one point and its bottom to another.
Symmetric (relation)
A relation is symmetric if always implies In the arrow picture, every arrow has a partner coming back.
Symmetric difference
The set of elements that lie in exactly one of two sets. Viewing vectors over as sets, it is exactly vector addition:
Symmetries of a rectangle
The four symmetries of a non-square rectangle (two flips and a half turn). Each one is undone by itself, so it is not isomorphic to it is often called the Klein four-group.
Symmetry
A move that leaves an object looking exactly as it did before, such as turning an equilateral triangle by 120°. Doing one symmetry after another gives another symmetry, so the symmetries of an object form a group.
Symmetry of Betti numbers
For a closed orientable -manifold, the list of Betti numbers reads the same backwards (the torus has Mod 2 Betti numbers are palindromes for every closed manifold.

T

Tangent bundle
The vector bundle whose fibre over a point is the tangent space Its sections are vector fields.
Tangent space
The vector space of velocities of smooth curves in passing through at time For an -manifold it has dimension for a surface in it is the tangent plane at
Tangent vector
An element of a tangent space the velocity of some curve in as it passes through It is attached to the point and does not lie in the manifold itself.
Tangent vector field (on a sphere)
A continuous choice of a vector tangent to the sphere at each point i.e. with Picture hair lying flat; a zero is a cowlick.
Taxicab distance
The distance in the plane: how far a taxi drives on a grid of streets. Its balls are diamonds, but it has the same open sets as straight-line distance.
Telescoping sum
A sum in which neighbouring terms cancel, leaving only the first and the last. The climbs along a path telescope: they add up to whatever the route.
Tensor product
The abelian group generated by symbols that add in each slot separately. For example and
The circle ℝ/ℤ
The real numbers modulo the integers: numbers that differ by a whole number are identified. Wrapping the real line around a circle of circumference 1 shows that is a circle; adding cosets adds angles.
Theorem, proposition, lemma, corollary
True statements with proofs, labelled by importance: a theorem is a major result, a proposition a lesser one, a lemma a stepping stone, a corollary a quick consequence.
Theorema Egregium
Gauss’s “remarkable theorem” (1827): bending a surface without stretching it does not change its Gaussian curvature.
There exists (∃, ∃!)
“there is at least one “there is exactly one”. The order of quantifiers matters: lets depend on
Top homology and orientability
A closed connected surface has if it is orientable and if it is not. With coefficients, always.
Topological complexity
Michael Farber’s measure of how many separate continuous rules a motion planner on a configuration space needs. Cup products in cohomology give lower bounds; one rule suffices only for a contractible space.
Topological insulator
A material that insulates in its interior but conducts along its surface, distinguished from ordinary insulators by a topological invariant of its electron bands.
Topological invariance of homology
Homeomorphic spaces have isomorphic homology groups, so Betti numbers and torsion belong to the space, not to the chosen triangulation.
Topological invariant
A quantity or property of a shape that no allowed deformation can change, such as the number of pieces or the Euler characteristic. If two shapes have different invariants, they are not the same shape.
Topological property
A property or number that homeomorphic spaces always share — also called a topological invariant. Connectedness, compactness and the number of cut points are examples; if two spaces differ in one of them, they are not homeomorphic.
Topological quantum field theory
In Atiyah’s axioms (1988), in effect a functor from a category whose objects are manifolds and whose arrows are cobordisms between them, to vector spaces.
Topological space
A set together with a topology: points plus a precise notion of nearness, with no distances, angles or sizes.
Topology
The study of the properties of shapes that survive stretching, bending and squeezing — but not tearing or gluing.
Topology (on a set)
A collection of subsets of called open sets, that contains and and is closed under arbitrary unions and finite intersections. (The subject is also called topology.)
Tor
is the homology in degree 1 of for a free resolution of It measures how tensoring with fails to be exact: and if or is free.
Torsion (in homology)
The finite part of made of all classes of finite order. The Klein bottle has torsion in the torus has none.
Torsion class
A homology class with for some whole number the cycle does not bound, but its multiple does. The smallest such is its order.
Torsion element
An element of finite order: some multiple with is In the element is torsion and is not.
Torsion shift
The fact that torsion in homology degree appears in integer cohomology in degree For the projective plane, but and The same entry of a boundary matrix is responsible for both.
Torsion subgroup
The subgroup of all torsion elements of an abelian group: the finite part of the classification. In homology it detects “twisting”, such as the in the first homology of the Klein bottle.
Torsion-free
Having no torsion elements other than A finitely generated torsion-free abelian group is free, without “finitely generated” this fails ( is torsion-free but not free).
Torus
The surface of a doughnut, the square with both pairs of opposite edges glued straight across, word
Transition function
For a bundle trivialised over overlapping open sets the invertible linear maps comparing the two coordinate systems on They satisfy the cocycle condition
Transition map
For two overlapping charts and the map which converts the coordinates of a point in the first chart into its coordinates in the second.
Transitive
A relation is transitive if and always imply every two-step path has a one-step shortcut. “Close to” is not transitive.
Transpose
For the map which pulls measurements back. As a matrix it is flipped across its diagonal. Arrows reverse:
Tree
A connected graph with no nonempty cycles. A tree with vertices has edges, and any two of its vertices are joined by exactly one path.
Triangulation
A simplicial complex together with a homeomorphism from its underlying space to a given space The hollow tetrahedron is a triangulation of the sphere.
Trivial bundle
A vector bundle isomorphic to a product A line bundle is trivial exactly when it has a nowhere-zero section.
Trivial group
The group with only one element, its identity: (or usually written simply
Truncated polynomial ring
polynomials in in which and higher powers are set to Examples: and
Turning number
The total turning of a closed plane curve divided by always an integer, for a simple closed curve.

U

Underlying space |K|
The union of all the simplices of a simplicial complex the actual set of points in space that the complex describes.
Unimodular
A square integer matrix (or pairing) is unimodular if its determinant is so that its inverse also has integer entries. Poincaré duality makes every intersection form unimodular.
Union (∪)
everything in at least one of the two sets (“or” is inclusive).
Union of balls
For a point cloud and a radius the set of all points within distance of some point of the cloud thickened by Two balls of radius meet exactly when their centres are at distance at most
Unit (of a ring)
The element with for all In a cohomology ring it is the class of the constant function in
Universal Coefficient Theorem
For every simplicial complex, With integer cohomology in degree is the free part of plus the torsion of The isomorphism is not natural.
Universal coefficient theorems
and Integral homology determines (co)homology with any coefficients; the splittings exist but are not natural.
Universal coefficients (counting form)
where counts the torsion summands of of order divisible by Integer homology determines homology with any coefficients.
Universal property
A description of an object by the arrows into it or out of it: for example, a map into a product is the same thing as a pair of maps into the factors. An object with a universal property is unique up to a unique isomorphism.

V

Vacuous truth
An implication whose hypothesis is false is true, because its promise cannot be broken. So “every element of is purple” is true.
Vector
An element of a vector space. Depending on the space, it can be pictured as an arrow, as a list of numbers, or (over as a row of on/off switches.
Vector bundle
A continuously varying family of vector spaces (the fibres) over a base space, which over small open sets looks like a product Examples: the tangent bundle of a surface, the cylinder and the Möbius band over a circle.
Vector field
A choice of arrow at every point of a region, such as a wind map or a force field: On a surface or manifold the arrows are tangent to it: a section of the tangent bundle (Chapter 4.8).
Vector potential
A field with as forms, a 1-form with Outside a solenoid so is closed — but it is not exact.
Vector space
A set of vectors that can be added and scaled by numbers from a field, following the usual rules: under addition it is an abelian group, and scaling distributes over addition. Examples: and
Vertex bound for triangulated surfaces
A triangulated closed surface has edges, and at most are possible; so a torus needs at least 7 vertices, a projective plane 6, a sphere 4.
Vietoris–Rips complex
The complex in which points span a simplex when every two of them are within distance (radius convention; many sources write It is a flag complex, and
Void
A 2-dimensional hole: a cavity enclosed by a 2-cycle that is not the rim of anything in the space. The hollow sphere has one void; filling in the solid ball removes it.

W

Wedge product
The product of covectors, measuring oriented area: It is antisymmetric, so
Wedge sum
the disjoint union with one chosen point of glued to one chosen point of The wedge of two circles is the figure eight.
Well-defined
A rule is well defined when it gives one unambiguous answer, however its input is presented. A rule on equivalence classes, is well defined when equivalent representatives give the same answer.
Whitney embedding theorem
Every smooth -manifold can be embedded in (Whitney, 1944), and immersed in when So every surface fits without self-crossings in
Winding number
The net number of times a loop in the punctured plane (or the circle) goes round, counter-clockwise counted positive. It gives the isomorphism
Wirtinger presentation
A presentation of the knot group read off a diagram: one generator for each arc (a lasso around it), and at each crossing one relation between the lassos around the over-arc and the two under-arcs.
Wrapped disk (Moore space)
A disk whose rim is glued around a circle times. Its first homology is for it is the projective plane.
Writhe
The sum of the signs of the crossings of an oriented diagram, for each right-handed crossing and for each left-handed one. Moves II and III keep it; move I changes it by one, so it is not a knot invariant.

Z

Zero chain
The chain with every coefficient (mod 2: the empty set of simplices), written
Zero cycle
The empty set of edges (or simplices). Every vertex has degree 0, which is even, so it is a cycle; it plays the role of the number 0 when cycles are added.
Zeroth homology
where is the number of path components; a basis is given by one vertex from each component.
Zig-zag lemma
A short exact sequence of chain complexes induces a long exact sequence in homology, with connecting maps In homological algebra it is a form of the snake lemma.