Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck 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:Z→R 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 m∈Z and x∈R,

J(m)≤x  ⟺  m≤⌊x⌋,⌈x⌉≤m  ⟺  x≤J(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 x≤J(⌈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 N→Z→Q→R.

[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 F⊣G between preorders A and B consists of monotone maps F:A→B and G:B→A such that F(a)≤b exactly when a≤G(b), for every a∈A and b∈B; under the identification of preorders with thin categories this is exactly an adjunction, with unit a≤GF(a) and counit FG(b)≤b (Galois connection between preorders).

[F3]

An adjoint triple L⊣M⊣R consists of categories C,D, functors L,R:D→C and M:C→D, and adjunctions L⊣M and M⊣R (Adjoint triple L⊣M⊣R).

[F4]

For every real x there is exactly one integer m with m≤x<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 m≤x<m+1).

[F5]

The embeddings N→Z→Q→R 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,n∈N: 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.1F7algebra

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

1.2F5F6F7algebra

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

1.3F4F5F7

⌊J(m)⌋=m for every integer m. Indeed m≤J(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.

2.1step 1.1step 1.2F4F5F7algebra

For every integer m and real x: J(m)≤x exactly when m≤⌊x⌋. If m≤⌊x⌋ then, since ⌊x⌋≤x 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 m−⌊x⌋<1. Now m−⌊x⌋ is an integer by [F5], so step 1.2 gives m−⌊x⌋≤0, that is m≤⌊x⌋.

2.2step 1.3F5F7algebra

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

3.1step 2.1F2F4F5F7

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

3.2step 1.1step 2.1F5F7algebra

For every integer m and real x: ⌈x⌉≤m exactly when x≤J(m). By step 1.1(b), x≤J(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 −m≤⌊−x⌋, and step 1.1(b) converts that into −⌊−x⌋≤m, which is ⌈x⌉≤m.

4.1step 3.1step 3.2F2F5F7

⌈−⌉ is monotone and ⌈−⌉⊣J. If x≤y then −y≤−x by step 1.1(b), so ⌊−y⌋≤⌊−x⌋ by step 3.1, and step 1.1(b) gives −⌊−x⌋≤−⌊−y⌋, that is ⌈x⌉≤⌈y⌉. With J monotone by [F5], the equivalence of step 3.2 is the condition in [F2] for ⌈−⌉⊣J, whose unit is x≤J(⌈x⌉) and whose counit is ⌈J(m)⌉≤m.

5.1step 3.1step 4.1F1F3

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 L⊣M and M⊣R required by [F3]. Hence ⌈−⌉⊣J⊣⌊−⌋ is an adjoint triple.

6.1step 1.3step 2.2step 3.1step 4.1F4∎

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 0≤12<1 gives ⌊x⌋=0, so J(⌊x⌋)=0<12; and applied to −1≤−12<0 it gives ⌊−x⌋=−1, so ⌈x⌉=1 and 12<1=J(⌈x⌉).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

53 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources