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.
Supremum of a scalar multiple
Statement
Let be nonempty, let with , and write .
- If and is bounded above, then is nonempty and bounded above and .
- If and is bounded below, then is nonempty and bounded above and .
Multiplying by a negative number turns the bottom of a set into the top of its image, which is why claim 2 has an infimum on the right.
Facts & Assumptions
Given: A nonempty , a nonzero , and the dilate ; in claim 1 the set is bounded above and in claim 2 it is bounded below.
Supremum and the least-upper-bound property: means is an upper bound of with for every upper bound of , and every nonempty bounded above has such a (Complete ordered field (least-upper-bound property)).
Multiplying an inequality by a nonzero constant, in equivalence form: for one has , and for one has (claims 4 and 5 of Sign rules for products and monotonicity of multiplication). Adjoining the case , in which , gives the nonstrict implications used below: for , ; for , .
Epsilon characterisation of the supremum: for a nonempty bounded above and an upper bound of , one has if and only if for every there is with (Epsilon characterisation of the supremum).
Infimum: every nonempty bounded below has a greatest lower bound , that is, a lower bound with for every lower bound of (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).
Trichotomy: for exactly one of , , holds, so the negation of is , and a nonzero satisfies exactly one of , (Complete ordered field (least-upper-bound property), Ordered field).
Field and order arithmetic: a nonzero has an inverse with , and multiplication distributes over addition (Field); (Multiplication by zero: ); and adding a constant preserves the order (Order is preserved by adding a constant and by adding inequalities).
Proof
Case , in which is nonempty and bounded above: the least-upper-bound property supplies , an upper bound of that is every upper bound of .
Case , in which is nonempty and bounded below: has a greatest lower bound, and we set , a lower bound of with for every lower bound of .
In the case , every satisfies , hence , that is ; since the elements of are exactly these and , the set is nonempty and is an upper bound of it.
In the case , every satisfies , and multiplying by the negative reverses this to , that is ; so is nonempty and is an upper bound of it.
In the case , let and put , so that ; from and the equivalence form of [L2] gives , so the epsilon characterisation applied to and yields with , and multiplying that inequality by gives , an element of .
In the case , let and put , so that , which for the negative multiplier gives by [L2]; then , and cannot be a lower bound of , since greatestness of would force and hence ; so some fails , which by trichotomy means , and multiplying by reverses it to , an element of .
In the case , the set is nonempty and bounded above by , and for every some element of exceeds , so exists and the epsilon characterisation identifies it: , which is claim 1.
In the case , the set is nonempty and bounded above by , and for every some element of exceeds , so exists and equals , which is claim 2.
A nonzero satisfies exactly one of and , so the two cases are mutually exclusive and together exhaust the hypothesis , and each has been settled; both claims therefore hold.
Remarks
- The value is excluded because it is degenerate rather than difficult: for nonempty one has , so whatever is, and no information about or survives.
- Claim 2 needs bounded below, not bounded above: for the image is bounded above exactly when is bounded below (Reflection through zero exchanges upper and lower bounds is the case ).
- Companion identities for the infimum, with their own hypotheses. Write (Every nonempty set bounded below has an infimum), so . For the multiplier is negative, so this is claim 2 applied to , and it needs nonempty and bounded below; it gives . For the multiplier is positive, so this is claim 1 applied to , and it needs nonempty and bounded above; it gives . Note that each companion carries the OPPOSITE boundedness hypothesis to the supremum claim for the same multiplier: for claim 1 assumes bounded above while the companion assumes bounded below, and for claim 2 assumes bounded below while the companion assumes bounded above. Neither companion follows from the supremum claim for its own sign of ; each goes through the claim for the opposite sign, together with .
Depends on
- Epsilon characterisation of the supremum
- Every nonempty set bounded below has an infimum
- Complete ordered field (least-upper-bound property)
- Sign rules for products and monotonicity of multiplication
- Greatest lower bound (infimum)
- Ordered field
- Field
- Order is preserved by adding a constant and by adding inequalities
- Multiplication by zero: $0 \cdot a = 0$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 14 results over 7 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
- Infimum and supremum (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)