Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

A pseudocompact subset of Rn\mathbb{R}^n is bounded

Statement

Let n1n\ge1. Every pseudocompact subset ARnA\subseteq\mathbb{R}^n is bounded for the Euclidean metric.

Facts & Assumptions

Given: A pseudocompact subset ARnA\subseteq\mathbb{R}^n, where Rn\mathbb{R}^n has the Euclidean metric d2d_2.

[L2]

A pseudocompact space has bounded image under every continuous real-valued map (Pseudocompact space: every continuous real-valued function has bounded image).

[L3]

A subset of a metric space is bounded when it is empty or lies in some open ball (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space); a bounded set of reals has an upper bound (Lower bound, bounded below, bounded set).

Proof

technique · direct
1.1

The restriction N:ARN:A\to\mathbb{R}, N(x)=x2N(x)=\lVert x\rVert_2, is continuous, because the ambient norm is continuous by [L1] and AA has the subspace topology.

L1
1.2

Pseudocompactness gives that N[A]N[A] is bounded. If AA\ne\varnothing, choose an upper bound MM of N[A]N[A]; then M0M\ge0 because every norm is nonnegative.

L2L3choose
2.1

If A=A=\varnothing it is bounded. Otherwise every xAx\in A satisfies d2(x,0)=x2M<M+1d_2(x,0)=\lVert x\rVert_2\le M<M+1, so ABd2(0,M+1)A\subseteq B_{d_2}(0,M+1).

step 1.2L3
3.1

Thus AA is bounded in both cases.

step 2.1

Depends on

Used by

Dependency tree · next 3 levels

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