Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-16
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.

A reflective inclusion need not preserve even the empty colimit

Counterexample

Let A be the full subcategory of Set whose only object is a fixed singleton 1. Its inclusion I:A↪Set is reflective, but it does not preserve the empty colimit.

Facts & Assumptions

Given: The full singleton subcategory A⊆Set.

[L1]

A full subcategory is reflective when its inclusion has a left adjoint (Reflective full subcategory and reflector).

[L3]

For locally small categories, an adjunction determines hom-set bijections natural in both variables, and conversely every such natural family of bijections determines a unique unit and counit satisfying the triangle identities, hence a unique adjunction structure (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Verification

technique · counterexample
1.1L1L3

The constant functor R:Set→A at 1 is left adjoint to I: for every set X, both Hom⁡A(1,1) and Hom⁡Set(X,1) contain one map, and these bijections are natural in X; by the converse clause of [L3] they determine a unit and counit satisfying the triangle identities, hence an adjunction R⊣I, so [L1] makes A reflective.

1.2L2

The sole object 1 is initial in A, so it is the empty colimit there by [L2]. Its image I(1)=1 is not initial in Set, whose initial object is ∅.

2.1step 1.1step 1.2∎

Therefore the included empty colimit is not an ambient colimit, so I does not preserve even this colimit.

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.