Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-26
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 Yoneda embedding preserves colimits

Statement refuted

That the Yoneda embedding y:C→[Cop,Set] (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding) preserves colimits in general.

The true statement already on disk is the limit half: For a small category, the Yoneda functor preserves and reflects all existing small limits.

Facts & Assumptions

Given: The terminal category 1 with unique object ∗.

[F1]

In the terminal category, the unique object is in particular initial (Initial object, terminal object, and zero object).

[F3]

The Yoneda embedding sends ∗ to the representable presheaf 1(−,∗) (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding).

Refutation

technique · direct
1.1F1assume-hyp

By [F1], the object ∗ is a colimit of the empty diagram in 1. If the Yoneda embedding preserved colimits, then y(∗) would be an initial object of the presheaf category on 1.

1.2F2F3

But by [F3], the presheaf y(∗) takes the value 1(∗,∗), which is the singleton set {1∗}. By [F2], an initial presheaf has value ∅ at ∗. Therefore y(∗) is not initial.

2.1step 1.1step 1.2∎

So the Yoneda embedding does not preserve colimits in general. The published limit-preservation theorem is not contradicted, because it is about limits, not colimits.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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