A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Singular Cohomology

Research Depth 106 in the knowledge graph I know this Set as goal
4topics build on this
473prerequisites beneath it
See this on the map →
Cochain Complexes and CohomologySingular Homology GroupsPoincare DualityThe Cup Product+1 more
algebraic-topology singular-cohomology topological-invariants duality

Core Idea

Singular cohomology H^n(X; G) is defined by applying Hom(-, G) to the singular chain complex of X. It inherits all the computational tools of singular homology (long exact sequences, Mayer-Vietoris, excision) in dualized form, with arrows reversed. Singular cohomology is the natural home for duality theorems, multiplicative structures, and obstruction theory. Its pairing with homology via the Kronecker pairing provides a bridge between the two theories.

Explainer

Singular cohomology with coefficients in an abelian group G is constructed by dualizing the singular chain complex: C^n(X; G) = Hom(C_n(X), G), the group of all homomorphisms from the singular n-chain group to G. A singular n-cochain assigns an element of G to each singular n-simplex in X. The coboundary dn : Cn -> Cn+1 is defined by (dn f)(sigma) = f(d_{n+1} sigma), and the cohomology groups H^n(X; G) = ker(dn)/im(dn-1) measure the failure of cocycles (cochains vanishing on boundaries) to be coboundaries.

All the computational tools of singular homology have cohomological counterparts, obtained by applying Hom and using the functorial properties. There is a long exact sequence for pairs: ... -> H^n(X, A) -> H^n(X) -> H^n(A) -> Hn+1(X, A) -> ..., with arrows reversed relative to the homology version. There is a Mayer-Vietoris sequence for cohomology: ... -> H^n(X) -> H^n(A) direct sum H^n(B) -> H^n(A intersect B) -> Hn+1(X) -> ..., again with reversed arrows. Excision holds for cohomology (it is inherited from the chain-level excision). These tools are used to compute cohomology in exactly the same way as their homological counterparts, with the direction of maps reversed throughout.

The contravariance of cohomology — the fact that a map f : X -> Y induces f* : H^n(Y) -> H^n(X) in the reverse direction — is not a defect but a feature. It means cohomology classes are "pulled back" along maps, which is the correct behavior for quantities that assign values to cycles. A differential form on Y (in the de Rham setting) pulls back to a differential form on X via f; a characteristic class of a vector bundle pulls back to a characteristic class of the pullback bundle. Contravariance is natural for "measurement" or "evaluation" type quantities, which is why cohomology (not homology) is the correct framework for obstruction theory, characteristic classes, and sheaf theory.

The Kronecker pairing <,> : H^n(X; G) x H_n(X; Z) -> G, defined by evaluating a cocycle representative on a cycle representative, gives a natural bilinear map between cohomology and homology. When G = Z and the homology is free abelian, this pairing identifies H^n(X; Z) with Hom(H_n(X; Z), Z), the algebraic dual. When there is torsion, the universal coefficient theorem introduces a correction term from Ext. Over a field, cohomology and homology are perfectly dual, but over Z, the torsion information in cohomology comes from the torsion of H_{n-1} (shifted by one degree), giving cohomology a slightly different "view" of the same space.

The most important distinguishing feature of singular cohomology is that it carries a natural ring structure via the cup product, which will be developed in the next topic. This ring structure makes H^*(X) a graded ring, and the ring structure is a strictly finer invariant than the individual cohomology groups — spaces with isomorphic cohomology groups can have non-isomorphic cohomology rings. The cup product is the reason cohomology, rather than homology, is the primary algebraic tool in much of modern topology.

Practice Questions 4 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic and Transcendental ElementsSplitting FieldsFinite FieldsGalois GroupsFundamental Theorem of Galois TheorySecond Isomorphism Theorem for GroupsDirect Products of GroupsClassification of Finite Abelian GroupsChain Complexes and the Boundary OperatorSimplicial Homology GroupsSingular Homology GroupsHomology with CoefficientsCochain Complexes and CohomologySingular Cohomology

Longest path: 107 steps · 473 total prerequisite topics

Prerequisites (2)

Leads To (3)