The Cantor set consists of the reals with ternary digits 0 and 2
ProvedFamousTheorems.cantor_set_ternary_digits_6bThe Cantor set consists of the reals with ternary digits and . The middle-thirds Cantor set , where and removes the open middle third of each interval of , is
This description is the standard way to work with the Cantor set. It gives a bijection between and the infinite binary sequences, so is uncountable. It also gives the Cantor function and shows that is homeomorphic to .
Formalization note. Mathlib's cantorSet_eq_zero_two_ofDigits. cantorSet is defined as the intersection of the iterated middle-third sets, and Real.ofDigits a is for a digit sequence a : ℕ → Fin 3. The condition says that every digit is or .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem cantor_set_ternary_digits_6b : cantorSet = {x : ℝ | ∃ a : ℕ → Fin 3, (∀ i, a i ≠ 1) ∧ Real.ofDigits a = x} := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `cantorSet_eq_zero_two_ofDigits`. Proof here reduces to that Mathlib result.