Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Integral homology of a finite cyclic group

Example

For Cm=⟨g∣gm=1⟩, m≥1, with trivial integral coefficients, H0(Cm;Z)=Z, H2j+1(Cm;Z)=Z/mZ for j≥0, and H2j(Cm;Z)=0 for j≥1. In particular multiplication by m kills positive homology.

Facts & Assumptions

Given: m is a positive integer; coefficients are trivial integers; the derived-functor convention carries DC and supplied resolutions.

[F1]

The order of a finite group annihilates its positive integral homology. (Positive integral homology is annihilated by the group order).

[F2]

Group homology is the homology obtained by tensoring the supplied projective resolution with the right trivial module (Group homology as a derived functor).

[F3]

Under DC, any two projective resolutions of the same object are chain-homotopy equivalent over that object (Projective resolutions of the same object are homotopy equivalent over that object).

Verification

1.1algebra

Put R=ZCm and N=1+g+⋯+gm−1. Use one copy of R in each nonnegative degree, augmentation ϵ(∑aigi)=∑ai, differential multiplication by g−1 in odd degrees and by N in positive even degrees. Since (g−1)N=gm−1=0 and ϵ(g−1)=0, this is an augmented chain complex.

2.1step 1.1algebra

For a=∑i=0m−1aigi, the coefficient of gi in (g−1)a is ai−1−ai (indices modulo m). Thus its kernel consists exactly of constant coefficient vectors, namely ZN. Also Na=(∑iai)N, so the image of multiplication by N is ZN and its kernel is ker⁡ϵ. If ∑ai=0, then a=∑i=1m−1ai(gi−1)=(g−1)∑i=1m−1ai(1+⋯+gi−1). Hence ker⁡ϵ=(g−1)R, proving exactness in every degree. This also covers m=1: the two maps are zero and identity and the displayed sums are empty.

3.1F2F3step 2.1algebra

Each term is free, so step 2.1 makes this complex P→Z a projective resolution of the trivial left R-module. Let Psup→Z be the supplied resolution used in [F2]. By [F3], P and Psup are chain-homotopy equivalent over Z. The additive functor Z⊗R− carries the comparison maps and their homotopies to comparison maps and homotopies, so H∗(Z⊗RP)≅H∗(Z⊗RPsup)=H∗(Cm;Z). Tensoring P makes multiplication by g−1 zero and multiplication by N multiplication by m. Thus degree zero is Z, every odd degree has kernel Z modulo mZ, and every positive even degree has kernel of m:Z→Z, which is zero.

4.1F1step 3.1algebra∎

Multiplication by m on Z/mZ is zero, and on the zero groups it is zero. This explicitly verifies the conclusion of F1. Degree zero is excluded: m⋅1≠0 in Z. For m=1 all positive groups vanish.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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