Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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 SRS \subseteq \mathbb{R} be nonempty, let cRc \in \mathbb{R} with c0c \ne 0, and write cS:={cs:sS}cS := \{cs : s \in S\}.

  1. If c>0c > 0 and SS is bounded above, then cScS is nonempty and bounded above and sup(cS)=csupS\sup(cS) = c \sup S.
  2. If c<0c < 0 and SS is bounded below, then cScS is nonempty and bounded above and sup(cS)=cinfS\sup(cS) = c \inf 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 SRS \subseteq \mathbb{R}, a nonzero cRc \in \mathbb{R}, and the dilate cS={cs:sS}cS = \{cs : s \in S\}; in claim 1 the set SS is bounded above and in claim 2 it is bounded below.

[L1]

Supremum and the least-upper-bound property: v=supXv = \sup X means vv is an upper bound of XX with vvv \le v' for every upper bound vv' of XX, and every nonempty XRX \subseteq \mathbb{R} bounded above has such a vv (Complete ordered field (least-upper-bound property)).

[L2]

Multiplying an inequality by a nonzero constant, in equivalence form: for c>0c > 0 one has x<y    xc<ycx < y \iff xc < yc, and for c<0c < 0 one has x<y    yc<xcx < y \iff yc < xc (claims 4 and 5 of Sign rules for products and monotonicity of multiplication). Adjoining the case x=yx = y, in which xc=ycxc = yc, gives the nonstrict implications used below: for c>0c > 0, xyxcycx \le y \Rightarrow xc \le yc; for c<0c < 0, xyycxcx \le y \Rightarrow yc \le xc.

[L3]

Epsilon characterisation of the supremum: for a nonempty XRX \subseteq \mathbb{R} bounded above and an upper bound vv of XX, one has v=supXv = \sup X if and only if for every ε>0\varepsilon > 0 there is xXx \in X with vε<xv - \varepsilon < x (Epsilon characterisation of the supremum).

[L4]

Infimum: every nonempty XRX \subseteq \mathbb{R} bounded below has a greatest lower bound infX\inf X, that is, a lower bound with infX\ell' \le \inf X for every lower bound \ell' of XX (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)).

[L5]

Trichotomy: for a,bRa, b \in \mathbb{R} exactly one of a<ba < b, a=ba = b, b<ab < a holds, so the negation of aba \le b is b<ab < a, and a nonzero cc satisfies exactly one of c>0c > 0, c<0c < 0 (Complete ordered field (least-upper-bound property), Ordered field).

[L6]

Field and order arithmetic: a nonzero cc has an inverse c1c^{-1} with c1c=1c^{-1} c = 1, and multiplication distributes over addition (Field); 0c=00 \cdot c = 0 (Multiplication by zero: 0a=00 \cdot 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>0c > 0, in which SS is nonempty and bounded above: the least-upper-bound property supplies u:=supSu := \sup S, an upper bound of SS that is \le every upper bound of SS.

assume-case posL1
1.2

Case c<0c < 0, in which SS is nonempty and bounded below: SS has a greatest lower bound, and we set :=infS\ell := \inf S, a lower bound of SS with \ell' \le \ell for every lower bound \ell' of SS.

assume-case negL4
2.1

In the case c>0c > 0, every sSs \in S satisfies sus \le u, hence scucsc \le uc, that is cscucs \le cu; since the elements of cScS are exactly these cscs and SS \ne \emptyset, the set cScS is nonempty and cucu is an upper bound of it.

step 1.1L2
2.2

In the case c<0c < 0, every sSs \in S satisfies s\ell \le s, and multiplying by the negative cc reverses this to sccsc \le \ell c, that is csccs \le c\ell; so cScS is nonempty and cc\ell is an upper bound of it.

step 1.2L2
2.3

In the case c>0c > 0, let ε>0\varepsilon > 0 and put δ:=εc1\delta := \varepsilon c^{-1}, so that δc=ε\delta c = \varepsilon; from 0c=0<ε=δc0 \cdot c = 0 < \varepsilon = \delta c and c>0c > 0 the equivalence form of [L2] gives δ>0\delta > 0, so the epsilon characterisation applied to SS and uu yields sSs \in S with uδ<su - \delta < s, and multiplying that inequality by c>0c > 0 gives cuε=(uδ)c<sc=cscu - \varepsilon = (u - \delta)c < sc = cs, an element of cScS.

step 1.1L2L3L6algebra
2.4

In the case c<0c < 0, let ε>0\varepsilon > 0 and put δ:=εc1\delta := -\varepsilon c^{-1}, so that δc=ε<0=0c\delta c = -\varepsilon < 0 = 0 \cdot c, which for the negative multiplier cc gives δ>0\delta > 0 by [L2]; then <+δ\ell < \ell + \delta, and +δ\ell + \delta cannot be a lower bound of SS, since greatestness of \ell would force +δ\ell + \delta \le \ell and hence δ0\delta \le 0; so some sSs \in S fails +δs\ell + \delta \le s, which by trichotomy means s<+δs < \ell + \delta, and multiplying by c<0c < 0 reverses it to cε=(+δ)c<sc=csc\ell - \varepsilon = (\ell + \delta)c < sc = cs, an element of cScS.

step 1.2L2L4L5L6algebra
3.1

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

step 2.1step 2.3L1L3
3.2

In the case c<0c < 0, the set cScS is nonempty and bounded above by cc\ell, and for every ε>0\varepsilon > 0 some element of cScS exceeds cεc\ell - \varepsilon, so sup(cS)\sup(cS) exists and equals c=cinfSc\ell = c \inf S, which is claim 2.

step 2.2step 2.4L1L3
4.1

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

step 3.1step 3.2L5cases-exhaustive

Remarks

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

Depends on

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