Ternary Cantor Set #
This file defines the Cantor ternary set and proves a few properties.
Main Definitions #
preCantorSet n
: The ordern
pre-Cantor set, defined inductively as the union of the images under the functions(· / 3)
and((2 + ·) / 3)
, withpreCantorSet 0 := Set.Icc 0 1
, i.e.preCantorSet 0
is the unit interval [0,1].cantorSet
: The ternary Cantor set, defined as the intersection of all pre-Cantor sets.
The order n
pre-Cantor set, defined starting from [0, 1]
and successively removing the
middle third of each interval. Formally, the order n + 1
pre-Cantor set is the
union of the images under the functions (· / 3)
and ((2 + ·) / 3)
of preCantorSet n
.
Equations
- preCantorSet 0 = Set.Icc 0 1
- preCantorSet n.succ = (fun (x : ℝ) => x / 3) '' preCantorSet n ∪ (fun (x : ℝ) => (2 + x) / 3) '' preCantorSet n
Instances For
@[simp]
theorem
preCantorSet_succ
(n : ℕ)
:
preCantorSet (n + 1) = (fun (x : ℝ) => x / 3) '' preCantorSet n ∪ (fun (x : ℝ) => (2 + x) / 3) '' preCantorSet n
The Cantor set is the subset of the unit interval obtained as the intersection of all
pre-Cantor sets. This means that the Cantor set is obtained by iteratively removing the
open middle third of each subinterval, starting from the unit interval [0, 1]
.
Equations
- cantorSet = ⋂ (n : ℕ), preCantorSet n
Instances For
Simple Properties #
The ternary Cantor set is a subset of [0,1].
The preCantor sets are closed.