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 is a counterexample.
Facts & Assumptions
Given: The underlying-set functor .
The discrete-topology functor is left adjoint to (Discrete topology, underlying set, and indiscrete topology form an adjoint triple).
Every monadic functor is conservative (Every monadic functor is conservative).
A continuous bijection is an isomorphism in exactly when its inverse is continuous (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).
Refutation
By [L1], has a left adjoint.
On a two-element set , let have the discrete topology and the indiscrete topology. The identity function is continuous and is a bijection, but is not continuous because a singleton is open in and not in .
Thus is an isomorphism while is not, so is not conservative. By [L2] it is not monadic, even though step 1.1 gives it a left adjoint.
Depends on
- Every monadic functor is conservative
- Discrete topology, underlying set, and indiscrete topology form an adjoint triple
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Continuity of a map of topological spaces at a point and globally
- Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological
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
- E. Riehl, Category Theory in Context, 2nd ed., Definition 5.3.1 and Theorem 5.5.1 (standard reference, not scraped)