Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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 product of finitely many compact spaces is compact in the product topology

Statement

For every n∈N (The natural numbers N (von Neumann)) and every family (Xk)k<n of compact topological spaces (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), the product

∏k<nXk

with the product topology (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space) is compact. In particular a binary product X×Y of compact spaces is compact, and the empty product, a one-point space, is compact.

No choice principle is used beyond Every natural-number-indexed list of nonempty sets has a choice function on its family of values, which is a theorem of ZF. That is what separates the finite case from the arbitrary one, where the Axiom of Choice is genuinely spent.

Facts & Assumptions

Given: A natural number n, a family (Xk)k<n of compact topological spaces, and the product Pn:=∏k<nXk with the product topology and projections πk.

[A1]

An element of ∏k<nXk is a function x with domain n and x(k)∈Xk for every k<n; the von Neumann natural satisfies σ(n)=n∪{n} with n∉n; and the empty product is a one-point space (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, The natural numbers N (von Neumann)).

[L1]

The projections of a product are continuous, and a map h into a product is continuous exactly when every component πi∘h is continuous (A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice, claims 1 and 2).

[L5]

Tube lemma: if K⊆X is compact, N⊆X×Z is open and K×{z0}⊆N, then K×W⊆N for some open W∋z0 (Tube lemma: if K is compact and an open N⊆X×Z contains K×{z0}, then N contains K×W for some open W∋z0).

[L6]

A is a compact subset of a space Z exactly when every family U of open subsets of Z with A⊆⋃U has finitely many members whose union contains A, or else A=∅ (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, claim 1).

[L7]

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).

[L8]

A space is compact exactly when every open cover of it has a finite subcover; a one-point space and the empty space are compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[L9]

If 0∈S⊆N and σ(m)∈S whenever m∈S, then S=N (The principle of mathematical induction).

Proof

technique · induction
1.1

At n=0 the index set is empty, so ∏k<0Xk is a one-point space by [A1] and is compact by [L8]; this is the case n=0 of the statement.

A1L8base
1.2

Let m∈N and assume, as the induction hypothesis, that ∏k<mYk is compact for every family (Yk)k<m of compact spaces.

ih
1.3

For the binary case let X and Z be compact, let U be an open cover of X×Z, and for z∈Z let jz:X→X×Z be jz(x):=(x,z); its components are the identity of X and the constant map with value z, so it is continuous by [L1] and [L3], and X×{z}=jz[X] is therefore a compact subset of X×Z by [L4].

L1L3L4construct
1.4

Put W:={ W⊆Z:W is open and X×W⊆⋃V for some finite V⊆U }, a family cut out by a property of W and not by any selection.

construct
1.5

For the splitting, let p∈N, let (Xk)k<σ(p) be a family of spaces, and define r:∏k<σ(p)Xk→(∏k<pXk)×Xp by r(x):=(x↾p, x(p)) and s in the opposite direction by s(y,a):=y∪{(p,a)}; by [A1] these are mutually inverse bijections, since σ(p)=p∪{p} and p∉p.

A1construct
2.1

Z⊆⋃W: given z∈Z, the set X×{z} is compact by step 1.3 and lies in ⋃U, so [L6] supplies a finite V⊆U with X×{z}⊆N:=⋃V, an open set, the case X=∅ being covered by V=∅; since X is compact, [L5] gives an open W∋z with X×W⊆N, and that W lies in W.

L5L6step 1.3step 1.4
2.2

r is continuous: by [L1] it suffices that its two components are, and they are x↦x↾p and πp; the second is a projection, and the first is continuous by [L1] applied again, its own components being πk for k<p.

L1step 1.5
2.3

s is continuous: by [L1] it suffices that πk∘s is continuous for every k<σ(p); for k<p that map is the k-th projection of ∏k<pXk composed with the first projection of the binary product, a composite of continuous maps, and for k=p it is the second projection of the binary product.

L1L2step 1.5
3.1

If Z=∅ then X×Z=∅ is compact by [L8]; otherwise W is an open cover of the compact Z by step 2.1, so [L8] gives q∈N and W0,…,Wq∈W with Z=W0∪⋯∪Wq.

L8step 2.1
3.2

So r is a continuous bijection with continuous inverse s, hence a homeomorphism, and ∏k<σ(p)Xk is homeomorphic to (∏k<pXk)×Xp.

L4step 1.5step 2.2step 2.3
4.1

For each j≤q the set Tj of finite subfamilies V⊆U with X×Wj⊆⋃V is nonempty because Wj∈W, and j↦Tj is a function with domain the natural number σ(q), so [L7] supplies V0,…,Vq; their union V is a finite subfamily of U, a union of finitely many listable families being listed by concatenation, and X×Z=(X×W0)∪⋯∪(X×Wq)⊆⋃V. So every open cover of X×Z has a finite subcover and X×Z is compact.

L7L8step 3.1
5.1

Now let (Xk)k<σ(m) be a family of compact spaces. By step 1.2 the product ∏k<mXk is compact, and Xm is compact, so step 4.1 makes (∏k<mXk)×Xm compact; by step 3.2 with p:=m the product ∏k<σ(m)Xk is homeomorphic to it, and a continuous image of a compact space is compact by [L4], so ∏k<σ(m)Xk is compact.

L4step 1.2step 3.2step 4.1
6.1

The set of n∈N for which the statement holds contains 0 by step 1.1 and contains σ(m) whenever it contains m by step 5.1, so by [L9] it is all of N; the binary case is n=2 and the empty product is n=0.

L9step 1.1discharge-induction: step 5.1∎

Remarks

Where the tube lemma does the work. Compactness of X alone thins a cover on one slice X×{z}; what is needed is a cover of a whole band around that slice, and producing the band is exactly Tube lemma: if K is compact and an open N⊆X×Z contains K×{z0}, then N contains K×W for some open W∋z0. Compactness of Z then thins the family of bands. Both factors are used, and in different ways.

Why the bands are collected rather than chosen. The family W of step 1.4 consists of every open W admitting some finite subfamily of U over X×W; it is defined by a formula. Writing Wz for each z∈Z instead would select a band for every point of Z at once, which for an arbitrary Z is the Axiom of Choice. The only selection made is over the finite index set σ(q) at step 4.1.

The hypothesis "finitely many" is not removable by this argument. The induction runs on N and gives nothing about an infinite index set; Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice, later on this page, handles that case and pays the Axiom of Choice for it.

Depends on

Used by

Dependency tree · two levels

48 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