Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Second-countable locally compact Hausdorff spaces admit compact exhaustions

Statement

Let S be locally compact, second countable, and Hausdorff. There is an increasing sequence of compact subsets Kn such that ⋃n≥1Kn=S and every compact subset of S is contained in some Kn.

Facts & Assumptions

Given: A topological space S that is locally compact, second countable, and Hausdorff.

[F1]

Local compactness means each point has a compact neighbourhood, and second countability supplies an at most countable basis. (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Second countability: an at most countable basis for the topology)

Proof

technique · direct
1.1givenF1F2F3choose

Fix an at most countable basis B for S and let U={U∈B:U‾ is compact}. For any x∈S, [F2] with O=S gives an open V containing x whose closure is compact. The basis property gives U∈B with x∈U⊆V; then U‾⊆V‾, and U‾ is closed in the compact space V‾, hence compact by [F3]. Thus U is an at most countable open cover of S.

2.1step 1.1F3construct

If S=∅, take Kn=∅. Otherwise enumerate the subfamily U by filtering the fixed countable basis in its given enumeration; if the subfamily is finite, repeat its last member. Put Kn=⋃j=1nU‾j. An open cover of Kn restricts to an open cover of each of the finitely many compact sets U‾j; taking the union of their finite subcovers gives a finite subcover of Kn. Thus Kn is compact. The sequence is increasing, and its union is S because U covers S.

3.1step 1.1step 2.1F4

Let C⊆S be compact. The open cover U of C has a finite subcover by the ambient-cover criterion in [F4]. Let n be at least every index in that finite subcover. Then C⊆⋃j=1nUj⊆Kn. Thus every compact C is contained in some Kn.

4.1step 2.1step 3.1∎

Steps 2.1 and 3.1 give the required increasing compact exhaustion and its cofinal containment property. The construction uses only a fixed countable basis and finite subcovers, so it invokes no choice principle.

Depends on

Used by

Dependency tree · two levels

29 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