Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)verified 2026-09-10 (Codex)
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.

Tor of two cyclic groups from a two-term resolution

Example

Assume AC (The Axiom of Choice) for balanced Tor. Then Tor⁡1Z(Z/12,Z/18)≅Z/6. The fixed two-term resolution calculation is choice-free; AC is inherited only for the balanced comparison in Tor one of two cyclic abelian groups is cyclic of gcd order.

Verification

Given: the two-term resolution 0→Z→12Z→Z/12→0, and AC for balanced comparison.

[L1] The repaired two-cyclic theorem supplies the kernel identification, the explicit cyclic resolutions and the inherited AC comparison (Tor one of two cyclic abelian groups is cyclic of gcd order).

1.1givenL1

By [L1], tensoring with Z/18 gives the degree-one kernel of multiplication by 12 on Z/18. The comparison with balanced Tor uses the stated AC hypothesis; no additional resolution-existence assertion is needed.

2.1step 1.1algebra

The congruence is equivalent to 3∣2x, hence to 3∣x, since x=2(2x)−3x. The kernel residues modulo 18 are therefore 0,3,6,9,12,15.

3.1step 1.1step 2.1algebra∎

The additive map Z/6→Z/18, [t]6↦[3t]18, is well defined because 3⋅6=18, has image the listed kernel, and is injective because 18∣3t iff 6∣t. This proves the isomorphism and the choice-free kernel calculation.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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