TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27

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 metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection

Statement

Let $(X, d)$ be a metric space (Metric space: $d (x, y) = 0$ iff $x = y$ , symmetry, and the triangle inequality; pseudometric and ultrametric), with closed sets as in The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement and the finite intersection property as in Finite intersection property. For a family $A$ of subsets of $X$ write

$⋂ A : = {x \in X : x \in F for every F \in A},$

so that $⋂ \emptyset = X$ , matching the convention for the empty finite intersection in Finite intersection property.

Then $(X, d)$ is compact (Open cover, subcover, compact metric space, and compact subset of a metric space) if and only if every family $A$ of closed subsets of $X$ with the finite intersection property satisfies $⋂ A \neq \emptyset$ .

No choice principle is used in either direction: complementation is a canonical bijection, so no member of a family ever has to be selected.

Facts & Assumptions

Given: A metric space $(X, d)$ , families of subsets of $X$ , and the two notions above.

[A1]

Elementary set algebra inside $X$ : $X ∖ (X ∖ S) = S$ for $S \subseteq X$ , and for any family $S$ of subsets of $X$ one has $X ∖ ⋃ S = ⋂ {X ∖ S : S \in S}$ and $X ∖ ⋂ S = ⋃ {X ∖ S : S \in S}$ .

[L1]

$(X, d)$ is compact exactly when every family of open subsets of $X$ with union $X$ has a finite subfamily with union $X$ , the empty subfamily serving when $X = \emptyset$ (Open cover, subcover, compact metric space, and compact subset of a metric space).

[L2]

$F \subseteq X$ is closed exactly when $X ∖ F$ is open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

[L3]

$A$ has the finite intersection property exactly when $⋂_{i \in n} s (i) \neq \emptyset$ for every $n \in N$ and every finite list $s : n \to A$ , the empty list having intersection $X$ (Finite intersection property).

Proof

technique · direct

1.1

Complementation inside $X$ is its own inverse, and it exchanges the open subsets of $X$ with the closed ones: $X ∖ (X ∖ S) = S$ , and $S$ is open exactly when $X ∖ S$ is closed.

A1L2

1.2

For any family $S$ of subsets of $X$ , the union of $S$ is $X$ exactly when the intersection of the complements is empty, and the intersection of $S$ is empty exactly when the union of the complements is $X$ .

2.1

In particular, for $F_{0}, \dots, F_{n} \subseteq X$ one has $F_{0} \cap \dots \cap F_{n} = \emptyset$ exactly when $(X ∖ F_{0}) \cup \dots \cup (X ∖ F_{n}) = X$ .

A1step 1.2

3.1

Assume $(X, d)$ compact, let $A$ be a family of closed subsets of $X$ with the finite intersection property, and suppose for contradiction that $⋂ A = \emptyset$ .

L1L3step 2.1assume-contra

4.1

Applying the finite intersection property to the empty list gives $X \neq \emptyset$ ; and $U : = {X ∖ F : F \in A}$ is a family of open subsets of $X$ whose union is $X ∖ ⋂ A = X$ , hence an open cover of $X$ .

L2L3step 1.1step 1.2step 3.1

5.1

Compactness applied to $U$ , together with $X \neq \emptyset$ , gives $n \in N$ and $U_{0}, \dots, U_{n} \in U$ with $X = U_{0} \cup \dots \cup U_{n}$ .

L1step 4.1

6.1

Each $U_{i}$ is $X ∖ F_{i}$ for the set $F_{i} : = X ∖ U_{i}$ , which lies in $A$ and is determined by $U_{i}$ alone; so $F_{0} \cap \dots \cap F_{n} = \emptyset$ by step 2.1, and the list $i \mapsto F_{i}$ contradicts the finite intersection property of $A$ .

L3step 1.1step 2.1step 5.1discharge-contradiction

7.1

Therefore $⋂ A \neq \emptyset$ , which is the forward implication.

step 6.1

8.1

Conversely assume that every family of closed subsets of $X$ with the finite intersection property has nonempty intersection, let $U$ be a family of open subsets of $X$ with union $X$ , and suppose for contradiction that no finite subfamily of $U$ has union $X$ .

L1step 7.1assume-contra

9.1

Then $X \neq \emptyset$ , since otherwise the empty subfamily would have union $X$ ; and $A : = {X ∖ U : U \in U}$ is a family of closed subsets of $X$ .

L2step 1.1step 8.1

10.1

$A$ has the finite intersection property: the empty list has intersection $X \neq \emptyset$ , and a list $F_{0}, \dots, F_{n}$ of members of $A$ has $F_{i} = X ∖ U_{i}$ with $U_{i} : = X ∖ F_{i} \in U$ , so $F_{0} \cap \dots \cap F_{n} = \emptyset$ would give $U_{0} \cup \dots \cup U_{n} = X$ by step 2.1, a finite subfamily with union $X$ .

L3step 2.1step 9.1

11.1

By the assumed condition $⋂ A \neq \emptyset$ ; but $⋂ A = X ∖ ⋃ U = \emptyset$ because $U$ has union $X$ , and this contradiction is the required one.

step 1.2step 10.1discharge-contradiction

12.1

Hence some finite subfamily of $U$ has union $X$ , so $(X, d)$ is compact, and with step 7.1 both implications are proved.

L1step 7.1step 11.1∎

Remarks

The empty family and the empty space. The conventions are not decoration. $⋂ \emptyset = X$ makes the finite intersection property fail outright for every family of subsets of the empty space, so the right-hand condition is vacuously true there; and the empty space is compact, the empty subfamily covering it. The equivalence therefore holds at $X = \emptyset$ as well, with both sides true.

Why no choice is spent. The natural-looking step "the finite subcover consists of sets $X ∖ F_{i}$ , so pick $F_{i} \in A$ " would be a selection if a member of the family could be the complement of several different members. It cannot: complementation inside $X$ is injective, so $F_{i}$ is recovered from $U_{i}$ by a formula. That is the whole reason this characterisation, and the completeness half of A compact metric space is complete and totally bounded, and neither implication uses any choice principle that runs through it, cost nothing.

Depends on

Used by

Dependency tree · two levels

15 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

Finite intersection property (Wikipedia) (standard reference, not scraped)
Compact space (Wikipedia) (standard reference, not scraped)
J. Munkres, Topology, 2nd ed., §26 (standard reference, not scraped)