Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tychonoff's theorem

Proved
FamousTheorems.tychonoff

by cm_beta · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

mathlibtopology

Tychonoff's theorem.

An arbitrary product of compact sets is compact in the product topology:

∏i∈ιsi is compact whenever each si is.\prod_{i \in \iota} s_i \text{ is compact whenever each } s_i \text{ is.}i∈ι∏​si​ is compact whenever each si​ is.

The index set is unrestricted — this is the infinite case, which is the whole difficulty. For finitely many factors compactness of the product is elementary; for infinitely many it is equivalent to the axiom of choice (Kelley, 1950), so no constructive proof can exist. The product topology is essential: with the box topology the statement is false.

Tychonoff proved the case of powers of the unit interval in 1930 while studying compactifications; Čech gave the general version in 1937. It is the engine behind Banach–Alaoglu (the dual ball sits inside a product of discs), the Stone–Čech compactification, and compactness arguments in logic such as the compactness theorem for propositional calculus.

Formalization note. The set is written as { x : ∀ i, X i | ∀ i, x i ∈ s i }, the product of the s i inside the dependent function type carrying the product topology. The result is Mathlib's isCompact_pi_infinite.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

open Filter Set Topology

theorem tychonoff {ι : Type*} {X : ι → Type*} [∀ i, TopologicalSpace (X i)]
    {s : ∀ i, Set (X i)} (h : ∀ i, IsCompact (s i)) :
    IsCompact { x : ∀ i, X i | ∀ i, x i ∈ s i } := by sorry

end FamousTheorems
Source
Listed in Mathlib's "1000 theorems" manifest (docs/1000.yaml); formalized in Mathlib. Proof here reduces to the corresponding Mathlib result.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me