Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck pass
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 closed discrete subset of a compact space is finite

Facts & Assumptions

Given: A compact topological space X and a closed subset S⊆X such that for every s∈S there is an open set U⊆X with U∩S={s}.

[F1]

Every open cover of a compact space has a finite subcover, possibly empty when X=∅; a nonempty finite subcover can be listed as U0,…,Un with X=U0∪⋯∪Un (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

Proof

1.1givenF2

By [F2] the complement X∖S is open; form the family U:={X∖S}∪{ U⊆X open: U∩S is a singleton }, a set of open subsets of X defined by comprehension, so forming it selects nothing. It is an open cover of X: a point x∉S lies in X∖S, and a point s∈S lies in some open U with U∩S={s} by the hypothesis, and this U is a member of U.

2.1step 1.1F1∎

By [F1] the cover U has a finite subcover. If it is empty, then X=∅ and S=∅ is finite. Otherwise list it as U0,…,Un. Each Ui is X∖S or open with Ui∩S={si} a singleton, and X∖S meets S in nothing. Intersecting the covering relation X=U0∪⋯∪Un with S gives S⊆{si:Ui∩S is a singleton}, a finite set, so by the listing form of finiteness (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) the set S is finite; if no Ui has a singleton trace then S⊆∅, so S=∅ and S is finite as well.

Depends on

Used by

Dependency tree · two levels

10 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