Cantor-Bendixson derivatives and perfect kernel #
This file defines the transfinite iteration of the relative derived-set operator and the associated perfect kernel.
For closed sets, the relative derived set agrees with derivedSet, so this recovers the usual
Cantor-Bendixson derivative sequence of a closed set.
Main definitions #
CantorBendixson.iteratedDerivedSet s a: thea-th transfinite iterate ofrelDerivedSetstarting froms.CantorBendixson.perfectKernel s: the largest perfect subset ofs, defined as the intersection of all iterated derived sets ofs.
Main statements #
CantorBendixson.iteratedDerivedSet_constant_iff_preperfect: a set is preperfect if and only if every iterated derived set is equal to the original set.CantorBendixson.iteratedDerivedSet_stay: the iterated derived-set sequence eventually stabilizes.CantorBendixson.perfect_perfectKernel: the perfect kernel of a closed set is perfect.CantorBendixson.subset_perfectKernel_of_perfect: the perfect kernel is the largest perfect subset.
Notation #
sᵈ[a]: thea-th iterated relative derived set ofs.
Implementation notes #
- We define
iteratedDerivedSetusingOrdinalApprox.gfpApproxapplied torelDerivedSet. This keeps the transfinite sequence antitone for arbitrary sets. - If
sis closed, thenrelDerivedSet s = derivedSet s, so successor stages agree with the ambient derived-set operator.
TODO #
- Pointwise and setwise Cantor-Bendixson ranks.
- A generalized Cantor-Bendixson decomposition theorem for arbitrary topological spaces and arbitrary cardinalities of topological bases.
The transfinite iteration of the relative derived-set operator on a set.
Equations
Instances For
Alias of iteratedDerivedSet.
The transfinite iteration of the relative derived-set operator on a set.
Instances For
The transfinite iteration of the relative derived-set operator on a set.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Alias of iteratedDerivedSet_zero.
Alias of iteratedDerivedSet_succ.
Alias of iteratedDerivedSet_limit.
A set is preperfect if and only if every stage of its iterated relative derived-set sequence is equal to the original set.
Alias of iteratedDerivedSet_constant_iff_preperfect.
A set is preperfect if and only if every stage of its iterated relative derived-set sequence is equal to the original set.
Alias of isClosed_iteratedDerivedSet.
Alias of iteratedDerivedSet_antitone.
Alias of iteratedDerivedSet_mono.
If the iterated derived set stops changing at a successor stage, then sᵈ[a] is a fixed
point of relDerivSet.
Alias of mem_fixedPoints_of_iteratedDerivedSet_succ_eq.
If the iterated derived set stops changing at a successor stage, then sᵈ[a] is a fixed
point of relDerivSet.
Alias of iteratedDerivedSet_mem_fixedPoints.
The perfect kernel of a set, defined as the intersection of all iterated derived sets. It is the largest perfect subset of the original set.
Equations
- perfectKernel s = ⋂ (a : Ordinal.{?u.1}), iteratedDerivedSet s a
Instances For
Alias of perfectKernel.
The perfect kernel of a set, defined as the intersection of all iterated derived sets. It is the largest perfect subset of the original set.
Equations
Instances For
Alias of perfectKernel_subset_iteratedDerivedSet.
Alias of perfectKernel_subset.
Alias of perfectKernel_mono.
Alias of isClosed_perfectKernel.
Alias of perfectKernel_empty.
Once sᵈ[a] is a fixed point of relDerivSet, the perfect kernel equals sᵈ[a].
Alias of perfectKernel_eq_iteratedDerivedSet_of_mem_fixedPoints.
Once sᵈ[a] is a fixed point of relDerivSet, the perfect kernel equals sᵈ[a].
Every perfect subset of a set is contained in its perfect kernel.
The perfect kernel of a closed set is perfect.
Alias of perfect_perfectKernel.
The perfect kernel of a closed set is perfect.
Taking the perfect kernel of a closed set is idempotent.
Alias of perfectKernel_idem.
Taking the perfect kernel of a closed set is idempotent.