Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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 subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it

Statement

Let (X,d)(X,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric), let AXA \subseteq X and let (A,dA)(A,d_A) be the metric subspace (Isometry, isometric embedding, and the subspace metric on a subset). Then:

  1. Relative openness is a trace. A set VAV \subseteq A is open in (A,dA)(A,d_A) (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) if and only if V=UAV = U \cap A for some UU open in (X,d)(X,d).
  2. Compactness read in the ambient space. AA is a compact subset of XX (Open cover, subcover, compact metric space, and compact subset of a metric space), that is (A,dA)(A,d_A) is a compact metric space, if and only if for every family U\mathcal{U} of open subsets of XX with AUA \subseteq \bigcup \mathcal{U} there are nNn \in \mathbb{N} and U0,,UnUU_0, \dots, U_n \in \mathcal{U} with AU0UnA \subseteq U_0 \cup \dots \cup U_n, or else A=A = \emptyset.
  3. The same in indexed form. AA is a compact subset of XX if and only if for every set II and every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with AiIUiA \subseteq \bigcup_{i \in I} U_i there are nNn \in \mathbb{N} and indices i0,,inIi_0, \dots, i_n \in I with AUi0UinA \subseteq U_{i_0} \cup \dots \cup U_{i_n}, or else A=A = \emptyset.

Claim 3 is the form used by almost every later proof on this page, because a cover is usually produced by a rule that attaches an open set to each point or to each index, and a set of open sets forgets that rule. No choice principle is used anywhere below; the one place a selection is made is over a finite index set, and Every natural-number-indexed list of nonempty sets has a choice function on its family of values is a theorem of ZF.

Facts & Assumptions

Given: A metric space (X,d)(X,d), a subset AXA \subseteq X, and the metric subspace (A,dA)(A, d_A) with dAd_A the restriction of dd to A×AA \times A.

[L1]

Balls of a subspace are traces of ambient balls: BA(a,r)=BX(a,r)AB_A(a,r) = B_X(a,r) \cap A for aAa \in A and r>0r > 0 (Isometry, isometric embedding, and the subspace metric on a subset, Open ball, closed ball and sphere in a metric space).

[L2]

A subset WW of a metric space is open exactly when every point of WW has a ball around it contained in WW (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).

[L4]

(A,dA)(A,d_A) is compact exactly when every family of sets open in (A,dA)(A,d_A) whose union is AA has a finite subfamily whose union is AA; a family is finite when it is empty or listable as {V0,,Vn}\{V_0, \dots, V_n\} (Open cover, subcover, compact metric space, and compact subset of a metric space).

[L5]

A function with domain a natural number all of whose values are nonempty sets has a choice function, and this is a theorem of ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

Proof

technique · direct
1.1

Suppose UU is open in (X,d)(X,d) and put V:=UAV := U \cap A; for aVa \in V we have aUa \in U, so there is r>0r > 0 with BX(a,r)UB_X(a,r) \subseteq U, whence BA(a,r)=BX(a,r)AUA=VB_A(a,r) = B_X(a,r) \cap A \subseteq U \cap A = V, and VV is open in (A,dA)(A,d_A).

L1L2
1.2

Conversely let VAV \subseteq A be open in (A,dA)(A,d_A), and let W:={BX(a,r):aV, r>0, BX(a,r)AV}\mathcal{W} := \{\, B_X(a,r) : a \in V,\ r > 0,\ B_X(a,r) \cap A \subseteq V \,\}, a family cut out by a property of the pair (a,r)(a,r) and not by any selection; put U:=WU := \bigcup \mathcal{W}.

L1construct
2.1

UU is open in (X,d)(X,d), being a union of open balls.

L3step 1.2
2.2

UAVU \cap A \subseteq V, since every member BX(a,r)B_X(a,r) of W\mathcal{W} satisfies BX(a,r)AVB_X(a,r) \cap A \subseteq V by the defining condition of W\mathcal{W}.

step 1.2
2.3

VUAV \subseteq U \cap A: given aVa \in V, openness of VV in (A,dA)(A,d_A) gives r>0r > 0 with BA(a,r)VB_A(a,r) \subseteq V, that is BX(a,r)AVB_X(a,r) \cap A \subseteq V, so BX(a,r)WB_X(a,r) \in \mathcal{W} and aBX(a,r)Ua \in B_X(a,r) \subseteq U, while aAa \in A as well.

L1L2step 1.2
3.1

Claim 1 is proved: by steps 2.2 and 2.3 an open VAV \subseteq A equals UAU \cap A with UU open in XX by step 2.1, and conversely every such trace is open in (A,dA)(A,d_A) by step 1.1.

step 1.1step 2.1step 2.2step 2.3
4.1

For claim 3, suppose first that (A,dA)(A,d_A) is compact, let II be a set and let (Ui)iI(U_i)_{i \in I} be open subsets of XX with AiIUiA \subseteq \bigcup_{i \in I} U_i; then each UiAU_i \cap A is open in (A,dA)(A,d_A) and V:={UiA:iI}\mathcal{V} := \{\, U_i \cap A : i \in I \,\} is a family of open subsets of AA whose union is AA.

step 3.1L4
5.1

If A=A = \emptyset the conclusion of claim 3 holds by its second alternative, so assume AA \ne \emptyset; then V\mathcal{V} is an open cover of (A,dA)(A,d_A), and compactness yields nNn \in \mathbb{N} and V0,,VnVV_0, \dots, V_n \in \mathcal{V} with A=V0VnA = V_0 \cup \dots \cup V_n.

L4step 4.1
6.1

For each jnj \le n the set Sj:={iI:UiA=Vj}S_j := \{\, i \in I : U_i \cap A = V_j \,\} is nonempty by the definition of V\mathcal{V}, and jSjj \mapsto S_j is a function with domain the natural number σ(n)\sigma(n), so a choice function for its values supplies i0,,inIi_0, \dots, i_n \in I with UijA=VjU_{i_j} \cap A = V_j for every jnj \le n.

L5step 5.1
7.1

Hence A=V0Vn=(Ui0A)(UinA)Ui0UinA = V_0 \cup \dots \cup V_n = (U_{i_0} \cap A) \cup \dots \cup (U_{i_n} \cap A) \subseteq U_{i_0} \cup \dots \cup U_{i_n}, which is the conclusion of claim 3 for the family (Ui)iI(U_i)_{i \in I}, so the forward implication of claim 3 holds.

step 5.1step 6.1
8.1

The converse of claim 3 remains, the forward implication having been settled at step 7.1; so assume the displayed condition, let G\mathcal{G} be a family of sets open in (A,dA)(A,d_A) with union AA, and put U:={UX:U is open in (X,d) and UAG}\mathcal{U} := \{\, U \subseteq X : U \text{ is open in } (X,d) \text{ and } U \cap A \in \mathcal{G} \,\}, again a family cut out by a property, indexed by itself.

step 7.1step 3.1construct
9.1

AUA \subseteq \bigcup \mathcal{U}: given aAa \in A there is GGG \in \mathcal{G} with aGa \in G, and by claim 1 there is UU open in XX with UA=GU \cap A = G; that UU lies in U\mathcal{U} and contains aa.

step 3.1step 8.1
10.1

If A=A = \emptyset the empty subfamily of G\mathcal{G} covers AA; otherwise the assumed condition applied to the family U\mathcal{U} indexed by itself gives mNm \in \mathbb{N} and W0,,WmUW_0, \dots, W_m \in \mathcal{U} with AW0WmA \subseteq W_0 \cup \dots \cup W_m.

step 8.1step 9.1
11.1

Putting Gj:=WjAG_j := W_j \cap A for jmj \le m gives members of G\mathcal{G} with A=(W0A)(WmA)=G0GmA = (W_0 \cap A) \cup \dots \cup (W_m \cap A) = G_0 \cup \dots \cup G_m, so G\mathcal{G} has a finite subcover and (A,dA)(A,d_A) is compact.

L4step 10.1
12.1

Claim 3 is proved by steps 7.1 and 11.1, and claim 2 is the special case of claim 3 in which I=UI = \mathcal{U} is a family of open subsets of XX and Ui:=iU_i := i, the conclusion of claim 3 then naming members of U\mathcal{U} itself.

step 7.1step 11.1

Remarks

Why the ambient reading needed a proof at all. A subset AA of XX carries two candidate notions of open cover: families of sets open in (A,dA)(A,d_A), and families of sets open in XX whose union contains AA. Claim 1 is what turns one into the other, and it is the reason compactness of AA does not depend on which space AA is regarded as sitting inside. Every later item on this page that covers a subset by ambient balls is using claim 2 or claim 3, and says so.

The traces do not remember their sources. A single relatively open VV is usually the trace of many different ambient open sets, and that is exactly why step 6.1 has to recover indices at all. Recovering infinitely many at once would be a choice principle; recovering finitely many is not, and the proof is arranged so that only finitely many are ever needed.

Depends on

Used by

Dependency tree · next 3 levels

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