Documentation

Mathlib.Topology.CantorBendixson

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 #

Main statements #

Notation #

Implementation notes #

TODO #

The transfinite iteration of the relative derived-set operator on a set.

Equations
Instances For
    @[deprecated iteratedDerivedSet (since := "2026-11-11")]

    Alias of iteratedDerivedSet.


    The transfinite iteration of the relative derived-set operator on a set.

    Equations
    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
        @[deprecated iteratedDerivedSet_zero (since := "2026-11-11")]

        Alias of iteratedDerivedSet_zero.

        @[deprecated iteratedDerivedSet_succ (since := "2026-11-11")]

        Alias of iteratedDerivedSet_succ.

        theorem iteratedDerivedSet_limit {X : Type u} [TopologicalSpace X] {s : Set X} {a : Ordinal.{u}} (ha : Order.IsSuccLimit a) :
        iteratedDerivedSet s a = ⋂ (b : Ordinal.{u}), ⋂ (_ : b < a), iteratedDerivedSet s b
        @[deprecated iteratedDerivedSet_limit (since := "2026-11-11")]

        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.

        @[deprecated iteratedDerivedSet_constant_iff_preperfect (since := "2026-11-11")]

        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.

        @[deprecated isClosed_iteratedDerivedSet (since := "2026-11-11")]

        Alias of isClosed_iteratedDerivedSet.

        @[deprecated iteratedDerivedSet_antitone (since := "2026-11-11")]

        Alias of iteratedDerivedSet_antitone.

        @[deprecated iteratedDerivedSet_mono (since := "2026-11-11")]

        Alias of iteratedDerivedSet_mono.

        If the iterated derived set stops changing at a successor stage, then sᵈ[a] is a fixed point of relDerivSet.

        @[deprecated mem_fixedPoints_of_iteratedDerivedSet_succ_eq (since := "2026-11-11")]

        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.

        @[deprecated iteratedDerivedSet_mem_fixedPoints (since := "2026-11-11")]

        Alias of iteratedDerivedSet_mem_fixedPoints.

        def perfectKernel {X : Type u} [TopologicalSpace X] (s : Set X) :
        Set X

        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
          @[deprecated perfectKernel (since := "2026-11-11")]

          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
            @[deprecated perfectKernel_subset_iteratedDerivedSet (since := "2026-11-11")]

            Alias of perfectKernel_subset_iteratedDerivedSet.

            @[deprecated perfectKernel_subset (since := "2026-11-11")]

            Alias of perfectKernel_subset.

            theorem perfectKernel_mono {X : Type u} [TopologicalSpace X] {s t : Set X} (hst : s ⊆ t) :
            @[deprecated perfectKernel_mono (since := "2026-11-11")]

            Alias of perfectKernel_mono.

            @[deprecated isClosed_perfectKernel (since := "2026-11-11")]

            Alias of isClosed_perfectKernel.

            @[deprecated perfectKernel_empty (since := "2026-11-11")]

            Alias of perfectKernel_empty.

            Once sᵈ[a] is a fixed point of relDerivSet, the perfect kernel equals sᵈ[a].

            @[deprecated perfectKernel_eq_iteratedDerivedSet_of_mem_fixedPoints (since := "2026-11-11")]

            Alias of perfectKernel_eq_iteratedDerivedSet_of_mem_fixedPoints.


            Once sᵈ[a] is a fixed point of relDerivSet, the perfect kernel equals sᵈ[a].

            theorem Perfect.subset_perfectKernel {X : Type u} [TopologicalSpace X] {s P : Set X} (hP : Perfect P) (hPs : P ⊆ s) :

            Every perfect subset of a set is contained in its perfect kernel.

            theorem perfect_perfectKernel {X : Type u} [TopologicalSpace X] {s : Set X} (hs : IsClosed s) :

            The perfect kernel of a closed set is perfect.

            @[deprecated perfect_perfectKernel (since := "2026-11-11")]

            Alias of perfect_perfectKernel.


            The perfect kernel of a closed set is perfect.

            Taking the perfect kernel of a closed set is idempotent.

            @[deprecated perfectKernel_idem (since := "2026-11-11")]

            Alias of perfectKernel_idem.


            Taking the perfect kernel of a closed set is idempotent.