Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30
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.

FALSE: the boundaries of a complex are a quotient of its cycles

Statement

For every chain complex C∙ and degree n, the boundary object Bn(C) is a quotient of the cycle object Zn(C).

Facts & Assumptions

Given: In the category Ab, the two-term complex 0→Z→ιQ→0, with Z in degree 1, Q in degree 0, and ι the inclusion.

[L1]

Boundaries are the images of the incoming differentials, and cycles are the kernels of the outgoing differentials (Cycle and boundary subobjects of a complex).

Refutation

technique · direct
1.1L1given

In degree 0, the outgoing differential is 0:Q→0, so [L1] gives Z0(C)=ker⁡(0)=Q. The incoming differential is ι:Z→Q, so B0(C)=im⁡(ι)=Z.

1.2algebra

Let ϕ:Q→Z be any group homomorphism. Then for every positive integer n, ϕ(1)=ϕ(n⋅1n)=n ϕ(1n), so ϕ(1) is divisible by every positive integer. The only integer with that property is 0, hence ϕ(1)=0. Therefore ϕ(mn)=m ϕ(1n)=0 for every rational number mn, so ϕ=0. Thus no epimorphism Q→Z exists.

2.1step 1.1step 1.2∎

Step 1.1 shows that in this complex B0(C)=Z and Z0(C)=Q, while step 1.2 shows that Z is not a quotient of Q. Therefore the statement is false.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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