Alphabeta Math
TheoremStatement: 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.

For a nonempty subset of Rn\mathbb{R}^n with n1n\ge1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent

Statement

Let n1n\ge1 and let ARnA\subseteq\mathbb{R}^n be nonempty. The following are equivalent.

  1. AA is compact.
  2. AA is closed and bounded.
  3. AA is pseudocompact.
  4. Every continuous f:ARf:A\to\mathbb{R} attains a maximum and a minimum on AA.

This theorem is a ZF statement. The nonemptiness hypothesis is necessary for condition 4, because the empty image has neither a maximum nor a minimum.

Facts & Assumptions

Given: A nonempty subset ARnA\subseteq\mathbb{R}^n with n1n\ge1, carrying the Euclidean subspace topology.

[L4]

Pseudocompactness means that every continuous real-valued function has bounded image (Pseudocompact space: every continuous real-valued function has bounded image).

Proof

technique · direct
1.1

Conditions 1 and 2 are equivalent by [L1] and [L5].

L1L5
1.2

Condition 3 implies condition 2 by [L2].

L2
1.3

Suppose condition 1 holds. Every continuous f:ARf:A\to\mathbb{R} then attains a maximum and a minimum by [L3], so condition 4 holds.

L3
1.4

Suppose condition 4 holds. For every continuous f:ARf:A\to\mathbb{R}, its maximum and minimum bound f[A]f[A], so AA is pseudocompact and condition 3 holds.

L4
2.1

The implications 121\Leftrightarrow2, 3213\Rightarrow2\Rightarrow1, and 1431\Rightarrow4\Rightarrow3 prove all four conditions equivalent.

step 1.1step 1.2step 1.3step 1.4

Depends on

Used by

Dependency tree · next 3 levels

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