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.

Reflection through zero exchanges upper and lower bounds

Statement

For S⊆R write −S:={−s:s∈S}. Then −(−S)=S, and S is nonempty if and only if −S is nonempty. Moreover, for all u,ℓ∈R:

  1. u is an upper bound of S if and only if −u is a lower bound of −S;
  2. ℓ is a lower bound of S if and only if −ℓ is an upper bound of −S.

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

Facts & Assumptions

Given: A subset S⊆R, its reflection −S={−s:s∈S}, and elements u,ℓ∈R.

[L1]

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 P: x<y means exactly y−x∈P, and x≤y means x<y or x=y (Ordered field).

[L2]

Upper bound, lower bound, bounded above, bounded below and bounded have their meanings from Lower bound, bounded below, bounded set: u bounds S above when s≤u for all s∈S, and ℓ bounds S below when ℓ≤s for all s∈S.

[L3]

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

Proof

technique · direct
1.1

For all x,y∈R the field identity y−x=(−x)−(−y) holds, and −(−x)=x.

L3algebra
1.2

The map s↦−s sends S onto −S and −S onto −(−S), and since −(−s)=s it is a bijection of S with −S whose inverse is itself; hence −(−S)=S, and S is nonempty exactly when −S is nonempty.

L3algebra
2.1

For all x,y∈R: x<y holds exactly when y−x is positive, which by 1.1 is exactly when (−x)−(−y) is positive, which is exactly −y<−x; and x=y holds exactly when −x=−y; hence x≤y if and only if −y≤−x.

step 1.1L1
3.1

Suppose u is an upper bound of S. Every element of −S has the form −s with s∈S, and s≤u gives −u≤−s; hence −u is a lower bound of −S.

assume-hypstep 2.1L2
3.2

Conversely, suppose −u is a lower bound of −S. For s∈S we have −s∈−S, so −u≤−s, and applying 2.1 to this inequality gives s≤u; hence u is an upper bound of S. This together with 3.1 proves claim 1.

assume-hypstep 2.1L2
3.3

Suppose ℓ is a lower bound of S. For s∈S we have ℓ≤s, hence −s≤−ℓ, and every element of −S is such a −s; hence −ℓ is an upper bound of −S.

assume-hypstep 2.1L2
3.4

Conversely, suppose −ℓ is an upper bound of −S. For s∈S we have −s∈−S, so −s≤−ℓ, and applying 2.1 gives ℓ≤s; hence ℓ is a lower bound of S. This together with 3.3 proves claim 2.

assume-hypstep 2.1L2
4.1

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

step 3.1step 3.2step 3.3step 3.4step 1.2L2∎

Depends on

Used by

Dependency tree · one level

5 results within one dependency step 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