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.

Reflection through zero exchanges upper and lower bounds

Statement

For SRS \subseteq \mathbb{R} write S:={s:sS}-S := \{-s : s \in S\}. Then (S)=S-(-S) = S, and SS is nonempty if and only if S-S is nonempty. Moreover, for all u,Ru, \ell \in \mathbb{R}:

  1. uu is an upper bound of SS if and only if u-u is a lower bound of S-S;
  2. \ell is a lower bound of SS if and only if -\ell is an upper bound of S-S.

Consequently SS is bounded above if and only if S-S is bounded below, SS is bounded below if and only if S-S is bounded above, and SS is bounded if and only if S-S is bounded (Lower bound, bounded below, bounded set).

Facts & Assumptions

Given: A subset SRS \subseteq \mathbb{R}, its reflection S={s:sS}-S = \{-s : s \in S\}, and elements u,Ru, \ell \in \mathbb{R}.

[L1]

R\mathbb{R} is a complete ordered field, in particular an ordered field (Complete ordered field (least-upper-bound property)), and in an ordered field the order is defined by the positive cone PP: x<yx < y means exactly yxPy - x \in P, and xyx \le y means x<yx < y or x=yx = y (Ordered field).

[L2]

Upper bound, lower bound, bounded above, bounded below and bounded have their meanings from Lower bound, bounded below, bounded set: uu bounds SS above when sus \le u for all sSs \in S, and \ell bounds SS below when s\ell \le s for all sSs \in S.

[L3]

Field arithmetic. Additive inverses are unique (Identities and inverses in a field are unique), and (x)+x=0(-x) + x = 0 by the inverse axiom, so xx is the additive inverse of x-x, that is (x)=x-(-x) = x. Addition is commutative and yxy - x abbreviates y+(x)y + (-x) (Field), so yx=y+(x)=(x)+y=(x)+((y))=(x)(y)y - x = y + (-x) = (-x) + y = (-x) + (-(-y)) = (-x) - (-y) for all x,yx, y.

Proof

technique · direct
1.1

For all x,yRx, y \in \mathbb{R} the field identity yx=(x)(y)y - x = (-x) - (-y) holds, and (x)=x-(-x) = x.

L3algebra
1.2

The map sss \mapsto -s sends SS onto S-S and S-S onto (S)-(-S), and since (s)=s-(-s) = s it is a bijection of SS with S-S whose inverse is itself; hence (S)=S-(-S) = S, and SS is nonempty exactly when S-S is nonempty.

L3algebra
2.1

For all x,yRx, y \in \mathbb{R}: x<yx < y holds exactly when yxy - x is positive, which by 1.1 is exactly when (x)(y)(-x) - (-y) is positive, which is exactly y<x-y < -x; and x=yx = y holds exactly when x=y-x = -y; hence xyx \le y if and only if yx-y \le -x.

step 1.1L1
3.1

Suppose uu is an upper bound of SS. Every element of S-S has the form s-s with sSs \in S, and sus \le u gives us-u \le -s; hence u-u is a lower bound of S-S.

assume-hypstep 2.1L2
3.2

Conversely, suppose u-u is a lower bound of S-S. For sSs \in S we have sS-s \in -S, so us-u \le -s, and applying 2.1 to this inequality gives sus \le u; hence uu is an upper bound of SS. This together with 3.1 proves claim 1.

assume-hypstep 2.1L2
3.3

Suppose \ell is a lower bound of SS. For sSs \in S we have s\ell \le s, hence s-s \le -\ell, and every element of S-S is such a s-s; hence -\ell is an upper bound of S-S.

assume-hypstep 2.1L2
3.4

Conversely, suppose -\ell is an upper bound of S-S. For sSs \in S we have sS-s \in -S, so s-s \le -\ell, and applying 2.1 gives s\ell \le s; hence \ell is a lower bound of SS. This together with 3.3 proves claim 2.

assume-hypstep 2.1L2
4.1

Claim 1 says the upper bounds of SS are exactly the negatives of the lower bounds of S-S, so SS is bounded above exactly when S-S is bounded below; claim 2 says likewise that SS is bounded below exactly when S-S is bounded above; combining the two, SS is bounded exactly when S-S is bounded, and (S)=S-(-S) = S with SS nonempty exactly when S-S is nonempty.

step 3.1step 3.2step 3.3step 3.4step 1.2L2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 5 results over 4 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