Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

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:CD is continuous, then U necessarily has a left adjoint.

Facts & Assumptions

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

[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 FG 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.1

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].

L1L3L4
1.2

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

assume-contraL5
2.1

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

step 1.1L2
3.1

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.

step 1.2step 2.1L4discharge-contradiction

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: 52 results over 21 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.

Sources