An infinite product of copies of [0,1] is formed. Which statement correctly describes its compactness?
ACompact in the product topology but not in the box topology
BCompact in the box topology but not in the product topology
CCompact in both topologies, since [0,1] is compact
DCompact in neither topology, since infinite products cannot preserve compactness
By Tychonoff's theorem, any product of compact spaces is compact in the product topology — including this infinite product. However, the theorem explicitly fails for the box topology on infinite products. In the box topology, basic open sets restrict every coordinate, making open covers much harder to reduce to finite subcovers. The distinction between these two topologies is the crux of the theorem.
Question 2 Multiple Choice
A student argues: 'I proved the finite product case by extracting finite subcovers from each factor independently and combining them. The same argument generalizes to infinite products.' What is the flaw?
ANo flaw — the finite case argument does generalize immediately to infinite products
BThe argument works but requires explicitly constructing a choice function, which is straightforward
CFor infinite products the argument would require making infinitely many simultaneous choices, which needs the Axiom of Choice and cannot be done constructively
DInfinite products are never compact regardless of the topology, so the premise fails
In the finite case, you handle factors one at a time: finitely many steps, no choice principle required. For infinite products, the analogous argument requires simultaneously selecting a finite subcover for each of infinitely many factors — which requires a choice function over an infinite collection. This is precisely what the Axiom of Choice supplies but cannot be built constructively. Tychonoff's theorem is in fact equivalent to the Axiom of Choice over ZF set theory.
Question 3 True / False
Tychonoff's theorem holds for finite products without invoking the Axiom of Choice.
TTrue
FFalse
Answer: True
The finite case is elementary: given a product X₁ × X₂ × ... × Xₙ of compact spaces and an open cover of the product, one can extract finite subcovers for each factor by a finite number of sequential arguments, with no choice principle needed. The depth of the theorem lies entirely in the infinite case.
Question 4 True / False
Tychonoff's theorem holds for infinite products in the box topology.
TTrue
FFalse
Answer: False
The theorem fails for the box topology. The product topology has fewer open sets than the box topology — basic open sets restrict only finitely many coordinates. This weaker topology is what allows open covers to be controlled. In the box topology, the standard counterexample is a countable product of copies of [0,1]: a specific open cover can be found with no finite subcover, demonstrating non-compactness.
Question 5 Short Answer
Why does the proof of Tychonoff's theorem for infinite products require the Axiom of Choice, while the finite case does not?
Think about your answer, then reveal below.
Model answer: In the finite case, factors are handled one at a time through finitely many sequential steps — no simultaneous selection is needed. For infinitely many factors, the argument must select finite subcover data from each factor all at once, which amounts to choosing an element from each of infinitely many non-empty sets simultaneously. This is exactly the Axiom of Choice. The theorem is in fact equivalent to AC over ZF: assuming AC proves Tychonoff, and assuming Tychonoff (even for Hausdorff spaces) proves AC.
The logical equivalence between Tychonoff and AC is one of the famous results in set-theoretic topology, establishing that the theorem's depth is not merely technical but foundational.