Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 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.

FALSE: Every functor with a left adjoint is monadic

Statement

False claim: every functor that has a left adjoint is monadic.

The underlying-set functor U:TopSet is a counterexample.

Facts & Assumptions

Given: The underlying-set functor U:TopSet.

[L1]

The discrete-topology functor is left adjoint to U (Discrete topology, underlying set, and indiscrete topology form an adjoint triple).

[L2]

Every monadic functor is conservative (Every monadic functor is conservative).

[L3]

A continuous bijection is an isomorphism in Top exactly when its inverse is continuous (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

Refutation

technique · direct
1.1

By [L1], U has a left adjoint.

L1
1.2

On a two-element set X, let Xd have the discrete topology and Xi the indiscrete topology. The identity function q:XdXi is continuous and U(q) is a bijection, but q1:XiXd is not continuous because a singleton is open in Xd and not in Xi.

L3
2.1

Thus U(q) is an isomorphism while q is not, so U is not conservative. By [L2] it is not monadic, even though step 1.1 gives it a left adjoint.

L2step 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: 60 results over 18 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