Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (openai/gpt-5.4)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.

An unbounded set has no supremum: the naturals inside R

Statement refuted

Refuted claim: every subset of R has a supremum in R (FALSE: every subset of R has a supremum).

The witness here is the canonical copy of the natural numbers inside R, A={ n⋅1 : n≥1 }, where n⋅1 denotes the canonical natural 1+⋯+1⏟n of the field (Canonical naturals are positive and strictly increasing). The set A is nonempty, so the nonemptiness hypothesis of the least-upper-bound property (Complete ordered field (least-upper-bound property)) is satisfied; what fails is boundedness above, and it fails as badly as possible, since A has no upper bound whatsoever. That is precisely the Archimedean property of R (Every complete ordered field is Archimedean), so this failure is a theorem about R, not an accident of the set chosen.

Facts & Assumptions

Given: The complete ordered field R and the set A:={ n⋅1:n≥1 } of its canonical naturals.

[L1]

Canonical naturals: 1⋅1=1 and n⋅1>0 for every n≥1 (Canonical naturals are positive and strictly increasing).

[L2]

Archimedean property: R is a complete ordered field, hence Archimedean, so for every x∈R there is a natural n≥1 with x<n⋅1 (Every complete ordered field is Archimedean, Archimedean ordered field).

[L3]

Upper bound, bounded above, supremum: u is an upper bound of X when x≤u for every x∈X; X is bounded above when it has an upper bound; and a supremum of X is an upper bound of X that is ≤ every upper bound of X, so in particular every supremum is an upper bound (Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set).

[L4]

The refuted claim: every S⊆R has a supremum in R (FALSE: every subset of R has a supremum).

[L5]

Order: trichotomy holds, so a<b and b≤a cannot both be true (Ordered field, Complete ordered field (least-upper-bound property)).

Counterexample

technique · direct
1.1

A is a nonempty subset of R: taking n=1 gives 1⋅1=1∈A.

L1
1.2

Let x∈R be arbitrary.

assume-hyp
2.1

x is not an upper bound of A: the Archimedean property supplies a natural n≥1 with x<n⋅1, and n⋅1 is an element of A, so the requirement n⋅1≤x for an upper bound fails by trichotomy.

step 1.2L2L3L5
3.1

Since x was an arbitrary real number, no real number is an upper bound of A; hence A is not bounded above.

step 2.1step 1.2L3
4.1

A supremum of A would in particular be an upper bound of A, and there is none, so A has no supremum in R even though A is nonempty; the claim that every subset of R has a supremum is refuted, and the boundedness hypothesis of the least-upper-bound property cannot be dropped.

step 3.1step 1.1L3L4∎

Remarks

Depends on

Used by

Dependency tree · two levels

10 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