Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coprime vanishing of Hn(G,A)H^n(G,A)Hn(G,A) (Proposição 4.4.1(ii))

Open
Castro2006.cohomology_vanishes

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

group-cohomologyrepresentation-theory

If GGG is finite, AAA is a finite ZG\mathbb{Z}GZG-module, and gcd⁡(∣G∣,∣A∣)=1\gcd(|G|,|A|)=1gcd(∣G∣,∣A∣)=1, then Hn(G,A)=0H^n(G,A)=0Hn(G,A)=0 for every n≥1n\ge1n≥1.

Preamble
import Mathlib
open CategoryTheory
Formal statement
namespace Castro2006
theorem cohomology_vanishes {G : Type} [Group G] [Fintype G] (A : Rep ℤ G) [Fintype A] (n : ℕ)
    (hn : 1 ≤ n) (hcop : (Fintype.card G).Coprime (Fintype.card A)) :
    ∀ x : groupCohomology A n, x = 0 := by sorry
end Castro2006
Source
https://web.archive.org/web/20070509023602/http://www.mat.ibilce.unesp.br/posgraduacao/dissertacoes/dissertacao_Francielle.pdf
Read-back

What the Lean code literally says, in plain math · Qwen (same-model blind pass; not an independent sub-agent)

Let GGG be a finite group and AAA a ZG\mathbb{Z}GZG-representation whose underlying type is also finite. Let n≥1n\ge1n≥1 and assume gcd⁡(∣G∣,∣A∣)=1\gcd(\lvert G\rvert,\lvert A\rvert)=1gcd(∣G∣,∣A∣)=1. Then every element x∈Hn(G,A)x\in H^{n}(G,A)x∈Hn(G,A) equals 000; i.e. the cohomology group is trivial. Both GGG and the carrier of AAA are required finite, and the coprimality is between their cardinalities. The conclusion is for n≥1n\ge1n≥1.

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