Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The trivial cocycle is canonical up to coboundary

Proved
NLabCohomology.trivialCocycle_cohomologous

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

algebraic-topologycategory-theorycohomology

In the general definition of cohomology, when the coefficient object AAA is pointed by a morphism ∗→A* \to A∗→A from the terminal object ∗*∗ of H\mathbf{H}H, the composite X→∗→AX \to * \to AX→∗→A is called the trivial cocycle ctrivc_{\mathrm{triv}}ctriv​ on XXX. The definite article presupposes that the trivial cocycle is canonical up to coboundary: the morphism X→∗X \to *X→∗ is unique up to homotopy because H(X,∗)\mathbf{H}(X,*)H(X,∗) is contractible.

This theorem asserts exactly that: for a terminal object ∗*∗ of H\mathbf{H}H and any object XXX, any two cocycles t1,t2:X→∗t_1, t_2 : X \to *t1​,t2​:X→∗ are cohomologous. Consequently the cohomology class of the trivial cocycle does not depend on the choice of cocycle X→∗X \to *X→∗ used to define it.

Formalization Note. Contractibility of H(X,∗)\mathbf{H}(X,*)H(X,∗) is part of the TerminalObject structure (boundary-extension form); the theorem converts it into connectedness of the space of cocycles into ∗*∗.

Preamble
import Definitions.Def_NLabCohomology_Cohomology

universe u

open CategoryTheory Simplicial Opposite
Formal statement
namespace NLabCohomology

theorem trivialCocycle_cohomologous (H : InfinityOneCategory.{u})
    (T : TerminalObject H) (X : H.Obj) (t₁ t₂ : Cocycle H X T.star) :
    Cohomologous H t₁ t₂ := 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). Trivial-cocycle bullet of 'General definition'.
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