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

Assuming the ultrafilter lemma, compactness is equivalent to every net having a cluster point, every net having a convergent subnet, every filter having a cluster point, and every ultrafilter converging

Statement

Assume the ultrafilter lemma. For a topological space X, the following are equivalent:

  1. X is compact;
  2. every net in X has a cluster point;
  3. every net in X has a convergent subnet;
  4. every filter on X has a cluster point;
  5. every ultrafilter on X converges.

Facts & Assumptions

Given: A topological space X and the ultrafilter lemma.

[L1]

Compactness is equivalent to every family of closed sets with the finite-intersection property having nonempty intersection; moreover, a family of subsets of X has the finite-intersection property exactly when it is contained in a filter on X (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection, clauses 1 and 2).

[L2]

A net has p as a cluster point exactly when it has a subnet converging to p (A point is a cluster point of a net if and only if some subnet converges to it).

[L3]

A net and its tail filter have the same cluster points, and a filter and its derived net have the same cluster points (The tail-filter and derived-net constructions preserve convergence and cluster points in both directions).

[L4]

Proof

technique · direct
1.1

Suppose X is compact and F is a filter. The closed family {A‾:A∈F} has the finite-intersection property, because a finite intersection of members of F is nonempty and is contained in the corresponding intersection of closures. By [L1], choose p∈⋂A∈FA‾.

L1
1.2

If every filter has a cluster point, apply this to a net's tail filter and use [L3]; hence 4 implies 2. By [L2], conditions 2 and 3 are equivalent.

L2L3
1.3

Conversely, if every net has a cluster point and F is a filter, its derived net has a cluster point, which is also a cluster point of F by [L3]. Hence 2 implies 4.

L3
1.4

Condition 4 implies 5 because an ultrafilter is a filter and [L4] turns its cluster point into a limit.

L4
1.5

Suppose every ultrafilter converges and let C be a family of closed subsets of X with the finite-intersection property. Clause 2 of [L1] gives a filter containing C, and [L4] extends it to an ultrafilter U.

L1L4
2.1

Every neighbourhood of p meets every A∈F, since p∈A‾; thus p is a cluster point of F. Hence 1 implies 4.

step 1.1L1
2.2

Let p be a limit of U. For C∈C, every neighbourhood of p belongs to U and meets C∈U; therefore p∈C‾=C. Thus ⋂C≠∅, and [L1] gives compactness.

step 1.5L1
3.1

The implications in steps 2.1, 1.2, 1.3, 1.4 and 2.2 establish all five equivalences.

step 2.1step 1.2step 1.3step 1.4step 2.2∎

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