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.
On a preorder the comonads are exactly the monotone contractive maps with Gp below G(Gp); on a poset they are exactly the interior operators
Statement
Let be a preorder. A comonad on is equivalently a monotone map such that and for every . These inequalities force and to be mutually comparable. If is a poset, this is equivalently an interior operator: a monotone, contractive, idempotent map.
Facts & Assumptions
Given: A preorder .
A comonad on is a monad on (Comonad on a category).
Monads on a preorder are exactly its monotone extensive maps equipped with the reverse comparison from their square (On a preorder the monads are exactly the monotone extensive maps with T(Tp) below Tp; on a poset they are exactly the closure operators).
Reversing a preorder reverses each inequality (Opposite category ).
In a poset, mutual comparability implies equality (Partial order and partially ordered set).
Proof
By [L1], regard as a monad on , with its counit and comultiplication serving as the unit and multiplication there.
Applying [L2] in the opposite order gives monotonicity, , and . Monotonicity applied to gives , so the two values are mutually comparable.
Conversely, the stated inequalities reverse to the data in [L2] on , hence give a comonad by [L1]. If is a poset, [L4] makes the two comparisons equivalent to , precisely the idempotence condition for an interior operator.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 13 results over 8 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., Example 5.1.7 (standard reference, not scraped)