Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Positive-degree homology of a finite group is order-torsion

Statement

For finite G and n>0, G annihilates Hn(G;Z).

Facts & Assumptions

Given: Let G be finite and n>0.

[L1]

Weibel's Theorem 6.5.8 states that G annihilates Hn(G;A) for every finite group G, every G-module A, and every n>0.

Proof

technique · direct
1.1

The cited theorem of Weibel states that, for a finite group G, multiplication by G annihilates Hn(G;A) for every n>0 and every G-module A. Apply it to the trivial module A=Z.

L1given
2.1

Thus multiplication by G is zero on Hn(G;Z), as claimed.

step 1.1

Depends on

Used by

Dependency tree · two levels

5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources