Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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 (R,) and (Z,)

Example

Regard (Z,) and (R,) as preorders and let J:ZR be the inclusion of Z as its canonical copy inside R. Write x for the integer part of a real x and put x:=x. Then

    J    ,

an adjoint triple between (R,) and (Z,): for all mZ and xR,

J(m)x    mx,xm    xJ(m).

Both composites through J are identities, J(m)=m=J(m) — the unit of J and the counit of J — while the counit J(x)x and the unit xJ(x) are in general strict.

Facts & Assumptions

Given: Integers m,d and reals x,y, with N, Z and Q identified with their canonical copies in R along NZQR.

[F1]

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

[F2]

A Galois connection FG between preorders A and B consists of monotone maps F:AB and G:BA such that F(a)b exactly when aG(b), for every aA and bB; under the identification of preorders with thin categories this is exactly an adjunction, with unit aGF(a) and counit FG(b)b (Galois connection between preorders).

[F3]

An adjoint triple LMR consists of categories C,D, functors L,R:DC and M:CD, and adjunctions LM and MR (Adjoint triple LMR).

[F4]

For every real x there is exactly one integer m with mx<m+1; it is written x and called the integer part, or floor, of x (Integer part: for every real x there is exactly one integer m with mx<m+1).

[F5]

The embeddings NZQR are injective and preserve 0, 1, addition, multiplication and order; Z is a totally ordered commutative ring; and every integer 0 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).

[F6]

For all m,nN: m<n exactly when σ(m)n; consequently there is no k with n<k<σ(n) (Discreteness: σ(n) is the immediate successor).

[F7]

In an ordered field the order is total and transitive (Ordered field), and translation invariance holds in the strict form: if a<b then a+c<b+c (Order is preserved by adding a constant and by adding inequalities).

Verification

technique · direct
1.1

Three nonstrict consequences of [F7], each obtained by adjoining the equality case to a strict statement, are used below. (a) tu exactly when t+vu+v: if t<u then t+v<u+v by [F7] and if t=u then t+v=u+v, so t+vu+v; applying the same with v recovers tu. (b) tu exactly when ut: translating by v=tu carries the first to the second by (a), and translating by t+u carries it back. (c) If tu<w then t<w: for t<u this is transitivity of the strict order and for t=u it is immediate.

F7algebra
1.2

An integer d with d<1 satisfies d0. The order of Z is total by [F5], so either d0 or 0<d. In the second case d0 and d0, so [F5] presents d as the image of a unique natural j, with j0 because the embedding is injective and sends 0 to 0; then 0<j, so [F6] with m=0 gives σ(0)=1j, and the embedding preserves order and 1, so 1d. That contradicts d<1 by trichotomy, leaving d0.

F5F6F7algebra
1.3

J(m)=m for every integer m. Indeed mJ(m)<m+1 holds because J(m) is m read in R and 0<1 there, so the uniqueness clause of [F4] identifies J(m) with m.

F4F5F7
2.1

For every integer m and real x: J(m)x exactly when mx. If mx then, since xx by [F4] and J preserves order by [F5], transitivity gives J(m)x. Conversely suppose J(m)x. By [F4] also x<x+1, so m<x+1 by step 1.1(c), and translating by x with [F7] turns this into mx<1. Now mx is an integer by [F5], so step 1.2 gives mx0, that is mx.

step 1.1step 1.2F4F5F7algebra
2.2

J(m)=m for every integer m: m is an integer with J(m)=J(m) by [F5], and step 1.3 gives J(m)=m, whence J(m)=J(m)=J(m)=m.

step 1.3F5F7algebra
3.1

J and are monotone, and J. That J is monotone is part of [F5]. If xy then J(x)xy by [F4], so step 2.1 applied to the integer x and the real y gives xy; thus is monotone. The equivalence of step 2.1 is then exactly the condition in [F2] for J, whose unit is mJ(m) and whose counit is J(x)x.

step 2.1F2F4F5F7
3.2

For every integer m and real x: xm exactly when xJ(m). By step 1.1(b), xJ(m) exactly when J(m)x, and J(m)=J(m) because J preserves addition and 0 by [F5]. Step 2.1, applied to the integer m and the real x, converts J(m)x into mx, and step 1.1(b) converts that into xm, which is xm.

step 1.1step 2.1F5F7algebra
4.1

is monotone and J. If xy then yx by step 1.1(b), so yx by step 3.1, and step 1.1(b) gives xy, that is xy. With J monotone by [F5], the equivalence of step 3.2 is the condition in [F2] for J, whose unit is xJ(x) and whose counit is J(m)m.

step 3.1step 3.2F2F5F7
5.1

Taking C=(Z,) and D=(R,) as thin categories by [F1], with M=J and L=, R=, steps 3.1 and 4.1 supply the two adjunctions LM and MR required by [F3]. Hence J is an adjoint triple.

step 3.1step 4.1F1F3
6.1

The counit of J and the unit of J are in general strict, while steps 1.3 and 2.2 make the other unit and counit equalities. For x=12: [F4] applied to 012<1 gives x=0, so J(x)=0<12; and applied to 112<0 it gives x=1, so x=1 and 12<1=J(x).

step 1.3step 2.2step 3.1step 4.1F4

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: 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