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.
Ceiling inclusion floor: an adjoint triple between and
Example
Regard and as preorders and let be the inclusion of as its canonical copy inside . Write for the integer part of a real and put . Then
an adjoint triple between and : for all and ,
Both composites through are identities, — the unit of and the counit of — while the counit and the unit are in general strict.
Facts & Assumptions
Given: Integers and reals , with , and identified with their canonical copies in along .
A preorder determines a category with at most one morphism between any two objects, and functors between such categories are exactly monotone maps (A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps, Preorder and monotone map).
A Galois connection between preorders and consists of monotone maps and such that exactly when , for every and ; under the identification of preorders with thin categories this is exactly an adjunction, with unit and counit (Galois connection between preorders).
An adjoint triple consists of categories , functors and , and adjunctions and (Adjoint triple ).
For every real there is exactly one integer with ; it is written and called the integer part, or floor, of (Integer part: for every real there is exactly one integer with ).
The embeddings are injective and preserve , , addition, multiplication and order; is a totally ordered commutative ring; and every integer is the image of a unique natural, that map being injective and order preserving (The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals, The integers form a totally ordered ring, The integers as equivalence classes of pairs of naturals).
For all : exactly when ; consequently there is no with (Discreteness: is the immediate successor).
In an ordered field the order is total and transitive (Ordered field), and translation invariance holds in the strict form: if then (Order is preserved by adding a constant and by adding inequalities).
Verification
Three nonstrict consequences of [F7], each obtained by adjoining the equality case to a strict statement, are used below. (a) exactly when : if then by [F7] and if then , so ; applying the same with recovers . (b) exactly when : translating by carries the first to the second by (a), and translating by carries it back. (c) If then : for this is transitivity of the strict order and for it is immediate.
An integer with satisfies . The order of is total by [F5], so either or . In the second case and , so [F5] presents as the image of a unique natural , with because the embedding is injective and sends to ; then , so [F6] with gives , and the embedding preserves order and , so . That contradicts by trichotomy, leaving .
for every integer . Indeed holds because is read in and there, so the uniqueness clause of [F4] identifies with .
For every integer and real : exactly when . If then, since by [F4] and preserves order by [F5], transitivity gives . Conversely suppose . By [F4] also , so by step 1.1(c), and translating by with [F7] turns this into . Now is an integer by [F5], so step 1.2 gives , that is .
for every integer : is an integer with by [F5], and step 1.3 gives , whence .
and are monotone, and . That is monotone is part of [F5]. If then by [F4], so step 2.1 applied to the integer and the real gives ; thus is monotone. The equivalence of step 2.1 is then exactly the condition in [F2] for , whose unit is and whose counit is .
For every integer and real : exactly when . By step 1.1(b), exactly when , and because preserves addition and by [F5]. Step 2.1, applied to the integer and the real , converts into , and step 1.1(b) converts that into , which is .
is monotone and . If then by step 1.1(b), so by step 3.1, and step 1.1(b) gives , that is . With monotone by [F5], the equivalence of step 3.2 is the condition in [F2] for , whose unit is and whose counit is .
Taking and as thin categories by [F1], with and , , steps 3.1 and 4.1 supply the two adjunctions and required by [F3]. Hence is an adjoint triple.
The counit of and the unit of are in general strict, while steps 1.3 and 2.2 make the other unit and counit equalities. For : applied to gives , so ; and applied to it gives , so and .
Depends on
- Galois connection between preorders
- Adjoint triple $L\dashv M\dashv R$
- Preorder and monotone map
- A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- The naturals embed in the integers
- Discreteness: $\sigma(n)$ is the immediate successor
- The integers form a totally ordered ring
- The integers embed in the rationals
- The rationals embed densely in the reals
- The integers as equivalence classes of pairs of naturals
- Order is preserved by adding a constant and by adding inequalities
- Ordered field
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: 82 results over 29 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
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.1.7 (standard reference, not scraped)