Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cohomologous cocycles form equivalence classes

Proved
NLabCohomology.cohomologous_equivalence

by LG · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologycategory-theorycohomology

In the general definition of cohomology, the cohomology classes are introduced as the equivalence classes of cohomologous cocycles: two cocycles c1,c2c_1, c_2c1​,c2​ on XXX with coefficients in AAA are cohomologous when they are connected by a coboundary, i.e. by a morphism λ:c1→c2\lambda : c_1 \to c_2λ:c1​→c2​ in the hom ∞-groupoid H(X,A)\mathbf{H}(X,A)H(X,A).

This theorem makes the presupposed fact explicit: for every (∞,1)-category H\mathbf{H}H and all objects X,AX, AX,A, the relation of being cohomologous is an equivalence relation on the type of cocycles on XXX with coefficients in AAA — reflexive, symmetric, and transitive. It is what justifies speaking of the equivalence class [c]∈π0 H(X,A)[c] \in \pi_0\,\mathbf{H}(X,A)[c]∈π0​H(X,A) of a cocycle and of the cohomology set as the set of these classes.

Formalization Note. The relation is SSet.π₀Rel (existence of an edge) on the hom Kan complex; the Kan horn-filling condition is available from the InfinityOneCategory structure.

Preamble
import Definitions.Def_NLabCohomology_Cohomology

universe u

open CategoryTheory Simplicial Opposite
Formal statement
namespace NLabCohomology

theorem cohomologous_equivalence (H : InfinityOneCategory.{u}) (X A : H.Obj) :
    Equivalence (fun c₁ c₂ : Cocycle H X A => Cohomologous H c₁ c₂) := by sorry

end NLabCohomology
Source
nLab, 'cohomology', section 3 (Definition), subsection 'General definition'; https://ncatlab.org/nlab/show/cohomology#Definition (page last revised August 11, 2026). Bullets on coboundaries/cohomologous cocycles and cohomology classes.
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me