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

Topological abelian groups are additive but not abelian

Statement refuted

The category of topological abelian groups is abelian.

Facts & Assumptions

Given: The category TAb of topological abelian groups and continuous homomorphisms.

[L1]

A topological group is a group with continuous multiplication and inverse (Topological group: multiplication and inversion are continuous).

[L2]

An abelian category is in particular additive, and it requires the canonical coimage-to-image map to be an isomorphism (Additive category, Abelian category).

Counterexample

1.1L1L2

The category TAb is additive: hom-sets add pointwise, the one-point group is a zero object, and finite products agree with finite coproducts because for finitely many abelian groups the direct product and direct sum carry the same topology.

2.1L1L2step 1.1∎

Let Rd be the additive group of real numbers with the discrete topology and let R carry its usual topology. The identity homomorphism ι:Rd→R is continuous, bijective, has zero kernel and zero cokernel, so its canonical coimage-to-image map is again ι. But ι is not an isomorphism in TAb, because the inverse map R→Rd is not continuous. Hence TAb is additive but not abelian.

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