Documentation

Mathlib.Topology.Category.Profinite.Nobeling.Induction

Nöbeling's theorem #

This file proves Nöbeling's theorem. For the overall proof outline see Mathlib/Topology/Category/Profinite/Nobeling/Basic.lean.

Main result #

References #

The induction #

Here we put together the results of the sections Zero, Limit and Successor to prove the predicate P I o holds for all ordinals o, and conclude with the main result:

We also define

noncomputable def Profinite.NobelingProof.GoodProducts.Basis {I : Type u} (C : Set (IBool)) [LinearOrder I] [WellFoundedLT I] (hC : IsClosed C) :

GoodProducts C as a -basis for LocallyConstant C ℤ.

Instances For
    theorem Profinite.NobelingProof.Nobeling_aux {I : Type u} [LinearOrder I] [WellFoundedLT I] {S : Profinite} {ι : S.toTopIBool} ( : Topology.IsClosedEmbedding ι) :

    Given a profinite set S and a closed embedding S → (I → Bool), the -module LocallyConstant C ℤ is free.

    noncomputable def Profinite.Nobeling.ι (S : Profinite) :
    S.toTop{ C : Set S.toTop // IsClopen C }Bool

    The embedding S → (I → Bool) where I is the set of clopens of S.

    Instances For

      Nöbeling's theorem. The -module LocallyConstant S ℤ is free for every S : Profinite.