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.
Epsilon characterisation of the supremum
Statement
Let be nonempty and bounded above, and let be an upper bound of (Complete ordered field (least-upper-bound property)). Then
In words: among the upper bounds of , the supremum is exactly the one that cannot be lowered by any positive amount and still bound .
Facts & Assumptions
Given: A nonempty that is bounded above, and an upper bound of ; since is nonempty and bounded above, exists.
Supremum: exactly when is an upper bound of and for every upper bound of ; and every nonempty subset of that is bounded above has such a least upper bound (Complete ordered field (least-upper-bound property)).
The least upper bound is unique, so the equation says precisely that is a least upper bound of (Suprema and infima are unique).
The order is total: for exactly one of , , holds, so the negation of is ; and holds exactly when (Complete ordered field (least-upper-bound property), Ordered field). (Translation invariance follows in one line from that last equivalence, since , but no step below uses it and it is not claimed here as a quoted result.)
Proof
For the forward implication assume , that is, is an upper bound of that is every upper bound of , and let be arbitrary.
For the converse implication assume that is an upper bound of such that for every there exists with , and let be an arbitrary upper bound of .
Since , we have .
By totality either or ; in the second case put , so that and .
The element is not an upper bound of : if it were, the leastness of among upper bounds would give , which contradicts by trichotomy.
In that second case the hypothesis applied to yields with , so fails, contradicting that is an upper bound of ; the second case is therefore impossible and .
Failing to be an upper bound of means precisely that some does not satisfy , and by totality that says ; since was arbitrary, the forward implication is proved.
Since was an arbitrary upper bound of , we get for every upper bound ; as is itself an upper bound, is a least upper bound of , hence by uniqueness, which proves the converse implication.
Both implications hold, so for an upper bound of a nonempty set bounded above, if and only if for every there is with .