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.
The empty set is bounded and has no supremum
Statement refuted
Refuted claim: every subset of has a supremum in (FALSE: every subset of has a supremum).
The witness here is , and it fails for the opposite reason to the unbounded witness An unbounded set has no supremum: the naturals inside . The empty set is bounded, in fact bounded above and below by every real number at once (Lower bound, bounded below, bounded set), so the set of its upper bounds is all of . A supremum would be a least element of that set, and has no least element, because for every . What fails is therefore the nonemptiness hypothesis of the least-upper-bound property (Complete ordered field (least-upper-bound property)), not boundedness.
Facts & Assumptions
Given: The complete ordered field and its empty subset .
Upper bound, lower bound, bounded, supremum: is an upper bound of when for every and is a lower bound when for every ; is bounded when it has both; and a supremum of is an upper bound of with for every upper bound of (Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set).
Order: ; adding a constant preserves the order, so gives for every ; and trichotomy holds, so and cannot both be true (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Ordered field, Complete ordered field (least-upper-bound property)).
The refuted claim: every has a supremum in (FALSE: every subset of has a supremum).
Counterexample
Every is both an upper bound and a lower bound of : the defining condition quantifies over no elements and so holds vacuously. In particular is bounded, and its set of upper bounds is all of .
Let be an arbitrary upper bound of .
The number is also an upper bound of , by 1.1, and , since gives on adding to both sides.
Hence fails by trichotomy, so is not every upper bound of and is therefore not a supremum of ; as was an arbitrary upper bound, and every real is one, no real number is a supremum of .
So is a bounded subset of with no supremum in : the claim that every subset of has a supremum is refuted, this time by a set that is bounded but not nonempty, and the nonemptiness hypothesis of the least-upper-bound property cannot be dropped either.
Remarks
- The same argument, applied to lower bounds, shows that has no infimum either: every real is a lower bound and there is no greatest real, since for every .
- Together with An unbounded set has no supremum: the naturals inside this shows that both hypotheses of the least-upper-bound property are load bearing, and that they fail independently: is bounded and not nonempty, while the naturals inside are nonempty and not bounded above. Neither witness alone would establish that.
- Some texts repair the refuted claim by declaring in the extended reals. That convention is consistent and is discussed in Conventions: , unbounded sets, and the extended reals; this library does not adopt it, because is not an element of .
- The convention is exactly the assertion that the empty set has a least upper bound in a larger ordered set in which every element bounds above and is least. That larger set is not a field, which is why Conventions: , unbounded sets, and the extended reals keeps it out of the statements proved here rather than adopting it by default.
Depends on
- FALSE: every subset of $\mathbb{R}$ has a supremum
- An unbounded set has no supremum: the naturals inside $\mathbb{R}$
- Lower bound, bounded below, bounded set
- Complete ordered field (least-upper-bound property)
- Ordered field
- The multiplicative identity is positive
- Order is preserved by adding a constant and by adding inequalities
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: 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
- Least-upper-bound property (Wikipedia) (standard reference, not scraped)
- Extended real number line (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (standard reference, not scraped)
- John K. Hunter, An Introduction to Real Analysis (standard reference, not scraped)