Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)
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 S⊆R be nonempty, let c∈R with c≠0, and write cS:={cs:s∈S}.

  1. If c>0 and S is bounded above, then cS is nonempty and bounded above and sup⁡(cS)=csup⁡S.
  2. If c<0 and S is bounded below, then cS is nonempty and bounded above and sup⁡(cS)=cinf⁡S.

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 S⊆R, a nonzero c∈R, and the dilate cS={cs:s∈S}; in claim 1 the set S is bounded above and in claim 2 it is bounded below.

[L1]

Supremum and the least-upper-bound property: v=sup⁡X means v is an upper bound of X with v≤v′ for every upper bound v′ of X, and every nonempty X⊆R bounded above has such a v (Complete ordered field (least-upper-bound property)).

[L2]

Multiplying an inequality by a nonzero constant, in equivalence form: for c>0 one has x<y  ⟺  xc<yc, and for c<0 one has x<y  ⟺  yc<xc (claims 4 and 5 of Sign rules for products and monotonicity of multiplication). Adjoining the case x=y, in which xc=yc, gives the nonstrict implications used below: for c>0, x≤y⇒xc≤yc; for c<0, x≤y⇒yc≤xc.

[L3]

Epsilon characterisation of the supremum: for a nonempty X⊆R bounded above and an upper bound v of X, one has v=sup⁡X if and only if for every ε>0 there is x∈X with v−ε<x (Epsilon characterisation of the supremum).

[L4]

Infimum: every nonempty X⊆R bounded below has a greatest lower bound inf⁡X, that is, a lower bound with ℓ′≤inf⁡X for every lower bound ℓ′ of X (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).

[L5]

Trichotomy: for a,b∈R exactly one of a<b, a=b, b<a holds, so the negation of a≤b is b<a, and a nonzero c satisfies exactly one of c>0, c<0 (Complete ordered field (least-upper-bound property), Ordered field).

[L6]

Field and order arithmetic: a nonzero c has an inverse c−1 with c−1c=1, and multiplication distributes over addition (Field); 0⋅c=0 (Multiplication by zero: 0⋅a=0); and adding a constant preserves the order (Order is preserved by adding a constant and by adding inequalities).

Proof

technique · cases
1.1

Case c>0, in which S is nonempty and bounded above: the least-upper-bound property supplies u:=sup⁡S, an upper bound of S that is ≤ every upper bound of S.

assume-case posL1
1.2

Case c<0, in which S is nonempty and bounded below: S has a greatest lower bound, and we set ℓ:=inf⁡S, a lower bound of S with ℓ′≤ℓ for every lower bound ℓ′ of S.

assume-case negL4
2.1

In the case c>0, every s∈S satisfies s≤u, hence sc≤uc, that is cs≤cu; since the elements of cS are exactly these cs and S≠∅, the set cS is nonempty and cu is an upper bound of it.

step 1.1L2
2.2

In the case c<0, every s∈S satisfies ℓ≤s, and multiplying by the negative c reverses this to sc≤ℓc, that is cs≤cℓ; so cS is nonempty and cℓ is an upper bound of it.

step 1.2L2
2.3

In the case c>0, let ε>0 and put δ:=εc−1, so that δc=ε; from 0⋅c=0<ε=δc and c>0 the equivalence form of [L2] gives δ>0, so the epsilon characterisation applied to S and u yields s∈S with u−δ<s, and multiplying that inequality by c>0 gives cu−ε=(u−δ)c<sc=cs, an element of cS.

step 1.1L2L3L6algebra
2.4

In the case c<0, let ε>0 and put δ:=−εc−1, so that δc=−ε<0=0⋅c, which for the negative multiplier c gives δ>0 by [L2]; then ℓ<ℓ+δ, and ℓ+δ cannot be a lower bound of S, since greatestness of ℓ would force ℓ+δ≤ℓ and hence δ≤0; so some s∈S fails ℓ+δ≤s, which by trichotomy means s<ℓ+δ, and multiplying by c<0 reverses it to cℓ−ε=(ℓ+δ)c<sc=cs, an element of cS.

step 1.2L2L4L5L6algebra
3.1

In the case c>0, the set cS is nonempty and bounded above by cu, and for every ε>0 some element of cS exceeds cu−ε, so sup⁡(cS) exists and the epsilon characterisation identifies it: sup⁡(cS)=cu=csup⁡S, which is claim 1.

step 2.1step 2.3L1L3
3.2

In the case c<0, the set cS is nonempty and bounded above by cℓ, and for every ε>0 some element of cS exceeds cℓ−ε, so sup⁡(cS) exists and equals cℓ=cinf⁡S, which is claim 2.

step 2.2step 2.4L1L3
4.1

A nonzero c satisfies exactly one of c>0 and c<0, so the two cases are mutually exclusive and together exhaust the hypothesis c≠0, and each has been settled; both claims therefore hold.

step 3.1step 3.2L5cases-exhaustive∎

Remarks

  • The value c=0 is excluded because it is degenerate rather than difficult: for nonempty S one has 0⋅S={0}, so sup⁡(0⋅S)=0 whatever S is, and no information about sup⁡S or inf⁡S survives.
  • Claim 2 needs S bounded below, not bounded above: for c<0 the image cS is bounded above exactly when S is bounded below (Reflection through zero exchanges upper and lower bounds is the case c=−1).
  • Companion identities for the infimum, with their own hypotheses. Write inf⁡X=−sup⁡(−X) (Every nonempty set bounded below has an infimum), so inf⁡(cS)=−sup⁡((−c)S). For c>0 the multiplier −c is negative, so this is claim 2 applied to −c, and it needs S nonempty and bounded below; it gives inf⁡(cS)=cinf⁡S. For c<0 the multiplier −c is positive, so this is claim 1 applied to −c, and it needs S nonempty and bounded above; it gives inf⁡(cS)=csup⁡S. Note that each companion carries the OPPOSITE boundedness hypothesis to the supremum claim for the same multiplier: for c>0 claim 1 assumes S bounded above while the companion assumes S bounded below, and for c<0 claim 2 assumes S bounded below while the companion assumes S bounded above. Neither companion follows from the supremum claim for its own sign of c; each goes through the claim for the opposite sign, together with inf⁡X=−sup⁡(−X).

Depends on

Used by

Dependency tree · two levels

14 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