Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

FALSE: in every ordered field a closed bounded set is compact, so Heine-Borel needs no completeness

Statement

False claim: in every ordered field F (Ordered field), a subset of F that is closed in F and bounded is compact in F; consequently the completeness hypothesis in A subset of R is compact if and only if it is closed and bounded is unnecessary.

How the claim must be read. It speaks of an arbitrary ordered field, so the whole vocabulary has to be available there, and it is: for x∈F and ε∈F with ε>0 put NεF(x):={ y∈F:∣y−x∣<ε }, using the absolute value of Absolute value in an ordered field, which is defined in every ordered field; call U⊆F open in F when every x∈U admits ε>0 in F with NεF(x)⊆U, call C⊆F closed in F when F∖C is open in F, call S⊆F bounded when some ℓ,u∈F satisfy ℓ≤s≤u for all s∈S, and call S compact in F when every family of sets open in F whose union contains S has a finite subfamily whose union already contains S. These are the definitions of The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Lower bound, bounded below, bounded set and Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset transposed word for word from R to F; with F=R they are literally those definitions.

The refutation takes F=Q (The rationals as equivalence classes of pairs of integers, The rationals form a totally ordered field) and the set of nonnegative rationals whose square is below 2.

Facts & Assumptions

Given: The ordered field Q and the set S:={ q∈Q:q≥0 and q2<2 }, together with the notions "open in Q", "closed in Q", "bounded" and "compact in Q" as set out in the Statement. Here 2:=1+1 and 4:=2⋅2 in Q.

[A1]

The false claim: in every ordered field, a closed bounded subset is compact.

[L1]

Q is a field and the relation of its order makes it a totally ordered field: the order is total and transitive, adding a constant preserves it, and a product of positives is positive (The rationals form a totally ordered field, The rationals form a field, The rationals as equivalence classes of pairs of integers, Ordered field).

[L2]

Absolute value in an ordered field: ∣z∣≥0; ∣z∣=z for z≥0 and ∣z∣=−z for z<0; and for c>0 one has ∣z∣<c exactly when −c<z<c (Absolute value in an ordered field, Basic properties of the absolute value).

[L3]

No rational number squares to 2 (FALSE: some rational number squares to 2).

[L4]

In an ordered field, squaring is strictly monotone on the nonnegatives: 0≤a<b implies a2<b2, and 0≤a≤b implies a2≤b2 (Squaring is monotone on the nonnegatives).

[L5]

Ordered-field arithmetic: 0<1, hence 0<2<4 and 2≠0; a positive element has a positive inverse; adding a constant and multiplying by a positive preserve an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Inverses of positives are positive, and reciprocation reverses order, Ordered field). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Refutation

technique · direct
1.1

S is nonempty and bounded: 1∈S because 1≥0 and 12=1<2 by [L5]; and every q∈S satisfies 0≤q<2, since q≥2≥0 would give q2≥22=4>2 by [L4] and [L5], contradicting q2<2.

L1L4L5
1.2

S has no greatest element: let q∈S and put h:=min⁡{ 1, (2−q2)(2q+2)−1 }, a definition by cases on the total order of Q; here 2q+2>0 because q≥0, and 2−q2>0, so both entries are positive and h>0 with h≤1. Put r:=q+h, so r>q≥0. Then h2≤h because 0<h≤1, and h(2q+1)≤(2−q2)(2q+1)(2q+2)−1<2−q2 because (2q+1)(2q+2)−1<1 and 2−q2>0; hence r2=q2+2qh+h2≤q2+h(2q+1)<q2+(2−q2)=2, so r∈S and q<r.

L1L4L5
1.3

S is closed in Q: let q∈Q∖S, so q<0, or q≥0 and q2≥2, in which case q2≠2 by [L3] gives q2>2. If q<0, put ε:=−q>0; every y with ∣y−q∣<ε satisfies y<q+ε=0 by [L2], hence y∉S. If q≥0 and q2>2, then q≠0 since 02=0<2, so q>0; put ε:=min⁡{ q, (q2−2)(2q)−1 }>0, again a definition by cases. Every y with ∣y−q∣<ε satisfies y>q−ε≥0, so y2>(q−ε)2 by [L4], and (q−ε)2=q2−2qε+ε2≥q2−2qε≥q2−(q2−2)=2, whence y2>2 and y∉S. In both cases a neighbourhood of q misses S, so Q∖S is open in Q.

L1L2L3L4L5
1.4

For r∈S put Br:={ y∈Q:y<r }; each Br is open in Q, since y∈Br and ε:=r−y>0 give, for every z with ∣z−y∣<ε, the inequality z<y+ε=r by [L2].

givenL1L2
2.1

The family U:={ Br:r∈S } is a cover of S by sets open in Q: given q∈S, step 1.2 supplies r∈S with q<r, so q∈Br.

step 1.2step 1.4L1
2.2

U has no finite subfamily covering S: the empty subfamily fails because S≠∅ by step 1.1; and a nonempty finite subfamily is {Br0,…,Brp} with every ri∈S, so an induction on p using the totality of the order of Q produces R:=max⁡{r0,…,rp}, one of the ri and hence a member of S; for each i one has ri≤R, so R<ri fails and R∉Bri. Thus the element R of S lies in no member of the subfamily.

step 1.1step 1.4L1
3.1

The set S is bounded by step 1.1 and closed in Q by step 1.3, and by steps 2.1 and 2.2 it is not compact in Q, while Q is an ordered field by [L1]. So the claim [A1] fails at F=Q and is false.

step 1.1step 1.3step 2.1step 2.2A1L1∎

Remarks

Depends on

Used by

Dependency tree · two levels

39 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