Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

The group coequalizer of doubling and zero on the integers is not its underlying-set coequalizer

Counterexample

In groups, the coequalizer of f,g:ZZ defined by f(n)=2n and g(n)=0 is Z/2Z. In sets, the coequalizer of the same underlying functions is infinite. Thus the underlying-set functor from groups does not preserve this coequalizer.

Facts & Assumptions

Given: The group homomorphisms f(n)=2n and g(n)=0.

[L1]

A coequalizer is universal among arrows q satisfying qf=qg (Equalizers and coequalizers as limits and colimits of a parallel pair).

[L2]

Reduction modulo 2 is the quotient homomorphism ZZ/2Z (For every nN, the congruence-class group (Z/n,+) is the quotient group (Z,+)/nZ).

[L3]

The Eilenberg–Moore category of the free-group monad is the category of groups (The free-group monad has groups as its Eilenberg–Moore algebras).

Verification

technique · direct
1.1

Reduction modulo 2 coequalizes f and g. If a group homomorphism h:ZH satisfies hf=hg, then h(2n) is the identity for every n, so h kills 2Z and factors uniquely through Z/2Z. Thus this is the group coequalizer by [L1]–[L2].

L1L2
1.2

In Set, the generated equivalence relation identifies every even integer with 0, because the generating pairs are (2n,0). No odd integer occurs in such a pair, so each odd integer remains a singleton equivalence class. The quotient map coequalizes f and g, and every function u with uf=ug is constant on the even class and therefore factors uniquely through this quotient, proving its Set universal property.

L1
2.1

The set coequalizer is therefore infinite, while the underlying set of the group coequalizer has the residue classes of 0 and 1. The underlying-set functor, including the one in the free-group adjunction of [L3], does not preserve this coequalizer.

L3step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 58 results over 14 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.