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

ex-derived-tensor-of-two-cyclic-abelian-groups.md

Example

For m,n>0, Z/mZLZ/n is represented by (Z/nmZ/n) in degrees 1,0. Both H1 and H0 are isomorphic to Z/gcd(m,n), and all other cohomology vanishes.

Facts & Assumptions

Given: For m,n>0, Z/mZLZ/n is represented by (Z/nmZ/n) in degrees 1,0. Both H1 and H0 are isomorphic to Z/gcd(m,n), and all other cohomology vanishes.

[F1]

A supplied projective replacement represents the bounded derived tensor (Derived tensor product in the bounded above setting).

[F2]

The degree-i cohomology of the module derived tensor is Tori (Homology of the derived tensor product is tor).

Verification

1.1

Use the free resolution (ZmZ)Z/m and tensor with Z/n. This gives exactly the displayed two-term complex; since m>0 the resolution is exact at its left endpoint. Its cohomology is its kernel at 1 and cokernel at zero.

F1algebra
2.1

Put g=gcd(m,n). The cokernel is Z/(mZ+nZ)=Z/g. The kernel consists of the multiples of n/g modulo n, and Z/gker(m), kˉkn/g, is an isomorphism: nmk iff n/gk. The kernel in degree 1 is Tor1, and the cokernel in degree zero is Tor0. If either modulus is one both groups are zero; all other degrees have zero terms.

F2step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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