Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

FALSE: A continuous functor on a complete category necessarily has a left adjoint

Statement

False claim. If a category C is complete and a functor U:C→D is continuous, then U necessarily has a left adjoint.

Facts & Assumptions

Given: The definable-class category Ordop and the unique functor U:Ordop→1.

[L1]

A category is complete when every small diagram has a limit; this does not assert limits of large diagrams (Finite, small, and large limits and colimits; complete and cocomplete categories).

[L2]
[L3]

Under the library's definable-class convention, a category may have definable-class object and morphism collections (Category, object, morphism, domain, codomain, identity, composition, and hom-collection).

[L4]

For ordinals: α∉α; α+=α∪{α} is an ordinal; if A is any set of ordinals then ⋃A is an ordinal; and α⊆β if and only if α∈β or α=β (Basic closure properties of ordinals).

[L5]

For locally small C and D, an adjunction F⊣G determines bijections D(Fc,d)→C(c,Gd) natural in c and d (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Refutation

technique · contradiction
1.1L1L3L4

Regard the ordinals as a definable-class thin category under their usual order and take its opposite. Let A be the set of object ordinals of a small diagram. By [L4], ⋃A is an ordinal; each α∈A satisfies α⊆⋃A, so α≤⋃A by the inclusion criterion in [L4], and if α⊆β for every α∈A then ⋃A⊆β. Hence ⋃A is the least upper bound of A in Ord, that is, a greatest lower bound and so a limit in the opposite category; for the empty diagram the union is 0. Thus Ordop is complete in the small-diagram sense of [L1].

1.2assume-contraL5

Suppose U had a left adjoint F, and put β=F(∗). Both Ordop and 1 are locally small, being thin, so [L5] applies and gives Hom⁡Ordop(β,α)≅Hom⁡1(∗,U(α)), which is a singleton; hence the left side is nonempty for every ordinal α. In the opposite ordinal order this says α≤β for every ordinal α.

2.1step 1.1L2

The unique functor U:Ordop→1 preserves every small limit, because every cone in the terminal category is limiting. It is therefore continuous by [L2].

3.1step 1.2step 2.1L4discharge-contradiction∎

By [L4] the successor β+=β∪{β} is an ordinal with β∈β+, so β⊆β+, while β≠β+ because β∉β; hence β<β+, contradicting the conclusion of step 1.2 that every ordinal is at most β. Therefore no such left adjoint exists, even though the source is complete and the functor is continuous.

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