Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)
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.

For n≥1 every bounded sequence in Rn has a convergent subsequence

Statement

Let n∈N with n≥1 and let (x(j))j∈N be a sequence in Rn whose range { x(j):j∈N } is a bounded subset of (Rn,d2) (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it). Then there are a strictly increasing i:N→N (Sequences of reals: bounded, eventually, frequently, tails, subsequences, A strictly increasing index map satisfies nk≥k) and a point p∈Rn with

x(ij)⟶pin (Rn,d2)

(Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R). By For n≥1 all norms on Rn are equivalent the same statement holds with d2 replaced by the metric of any norm on Rn, boundedness and convergence both being unchanged by that replacement (Equivalent norms, and the dictionary with equivalent metrics).

This is assembled from published theorems and is not proved again by bisection. The bisection is in Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, published at order 120; what is added here is the passage from compactness to sequential compactness and the reading of the conclusion in Rn.

Choice cost: none. Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line is proved by bisection and uses no choice principle, and "compact implies sequentially compact" is a theorem of ZF (In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle). The five-way equivalence For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice is not used, precisely because it is stated under countable choice and dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) and would overcharge this corollary; the arrow-by-arrow account is What each implication between the compactness properties of a metric space costs: which are theorems of ZF, which use countable choice, and which use dependent choice.

Facts & Assumptions

Given: A natural n≥1; a sequence (x(j)) in Rn whose range is bounded in (Rn,d2).

[L1]

Boundedness: a nonempty A⊆X is bounded when A⊆B(q,r) for some q∈X and real r>0 (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Open ball, closed ball and sphere in a metric space).

[L3]

Closed boxes are compact: for reals ak≤bk (k<n) the set Q={ y∈Rn:ak≤yk≤bk for every k<n } is a compact subset of (Rn,d2) (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line clause 1, Open cover, subcover, compact metric space, and compact subset of a metric space).

[L5]

A compact subset A of X is one for which the metric subspace (A,dA) is a compact metric space, dA being the restriction of d (Open cover, subcover, compact metric space, and compact subset of a metric space, Isometry, isometric embedding, and the subspace metric on a subset).

Proof

technique · direct
1.1

The range of the sequence is nonempty and bounded, so there are q∈Rn and a real r>0 with d2(x(j),q)<r for every j∈N.

L1
2.1

Put M:=r+∥q∥2, a real with M>0. By the triangle inequality for the norm, ∥x(j)∥2≤∥x(j)−q∥2+∥q∥2=d2(x(j),q)+∥q∥2<M for every j.

step 1.1L2
3.1

For every j and every k<n: ∣xk(j)∣≤∥x(j)∥2<M, hence −M≤xk(j)≤M.

step 2.1L2
4.1

Let Q:={ y∈Rn:−M≤yk≤M for every k<n }. Since −M≤M, Q is a compact subset of (Rn,d2), and by step 3.1 every term x(j) lies in Q.

step 3.1L3
5.1

By [L5] the metric subspace (Q,dQ) is a compact metric space, and by [L4] it is sequentially compact.

step 4.1L4L5
6.1

(x(j)) is a sequence in Q, so there are a strictly increasing i:N→N and p∈Q with x(ij)→p in (Q,dQ).

step 4.1step 5.1L4L6
7.1

Since dQ is the restriction of d2 to Q×Q, the reals dQ(x(ij),p) and d2(x(ij),p) are equal for every j, so x(ij)→p in (Rn,d2) as well.

step 6.1L5L6
8.1

So the bounded sequence (x(j)) has a subsequence converging in (Rn,d2), which is the claim.

step 6.1step 7.1∎

Remarks

Depends on

Used by

Dependency tree · two levels

124 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