Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29
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: a short exact sequence splits whenever its middle object is isomorphic to the biproduct of the outer two

Statement

If 0→A→B→C→0 is a short exact sequence in an abelian category and B is merely isomorphic as an object to A⊕C, then the sequence splits.

Facts & Assumptions

Given: The ring R=k[ε]/(ε2), the quotient q:R→k=R/(ε), and the inclusion i:k→R with image (ε).

[L1]

Module categories are abelian (Modules over a ring form an abelian category).

[L2]

A short exact sequence splits exactly when the epimorphism has a section (Splitting lemma in an abelian category, Split short exact sequence in an abelian category).

Refutation

technique · direct
1.1L1givenalgebra

In R-Mod, the sequence 0→k→iR→qk→0 is short exact: q is the quotient by (ε) and i identifies k with that ideal. By [L1], this is a short exact sequence in an abelian category.

2.1L2step 1.1assume-hypalgebra

If this sequence split, a section s:k→R of q would satisfy q(s(1))=1 while R-linearity would force εs(1)=s(ε⋅1)=0, so s(1) would lie in (ε), contradiction. Hence [L2] says the sequence is nonsplit.

3.1L2step 2.1constructalgebra

Let T:=R(N)⊕k(N). Direct-summing step 1.1 with 0→T→1TT→0→0 gives 0→k⊕T→R⊕T→q⊕0k→0. Any section of q⊕0 would project to a section of q, so this stabilized sequence is still nonsplit by step 2.1.

4.1step 3.1algebra

Countable shifts give R⊕T≅T, k⊕T≅T, and (k⊕T)⊕k≅T, because adding finitely many R- or k-summands does not change R(N)⊕k(N). Hence R⊕T≅(k⊕T)⊕k.

5.1step 3.1step 4.1∎

Step 3.1 gives a nonsplit short exact sequence, while step 4.1 shows that its middle object is abstractly isomorphic to the biproduct of its outer objects. Therefore the statement is false.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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