Loogle!
Result
Found 206 declarations mentioning Profinite. Of these, only the first 200 are shown.
- Profinite 📋 Mathlib.Topology.Category.Profinite.Basic
: Type (u_1 + 1) - CompHaus.toProfiniteObj 📋 Mathlib.Topology.Category.Profinite.Basic
(X : CompHaus) : Profinite - Profinite.instInhabited 📋 Mathlib.Topology.Category.Profinite.Basic
: Inhabited Profinite - Profinite.pi 📋 Mathlib.Topology.Category.Profinite.Basic
{α : Type u} (β : α → Profinite) : Profinite - Profinite.hasColimits 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Limits.HasColimits Profinite - Profinite.hasLimits 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Limits.HasLimits Profinite - Profinite.toTopCat 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Functor Profinite TopCat - Profinite.toTopCat.createsLimits 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.CreatesLimits Profinite.toTopCat - Profinite.toTopCat.reflective 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Reflective Profinite.toTopCat - profiniteToCompHaus 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Functor Profinite CompHaus - CompHaus.toProfinite 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Functor CompHaus Profinite - Profinite.of 📋 Mathlib.Topology.Category.Profinite.Basic
(X : Type u_1) [TopologicalSpace X] [CompactSpace X] [T2Space X] [TotallyDisconnectedSpace X] : Profinite - FintypeCat.toProfinite 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Functor FintypeCat Profinite - Profinite.toCompHaus.createsLimits 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.CreatesLimits profiniteToCompHaus - Profinite.toCompHaus.reflective 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Reflective profiniteToCompHaus - instFaithfulFintypeCatProfiniteToProfinite 📋 Mathlib.Topology.Category.Profinite.Basic
: FintypeCat.toProfinite.Faithful - instFullFintypeCatProfiniteToProfinite 📋 Mathlib.Topology.Category.Profinite.Basic
: FintypeCat.toProfinite.Full - FintypeCat.toProfiniteFullyFaithful 📋 Mathlib.Topology.Category.Profinite.Basic
: FintypeCat.toProfinite.FullyFaithful - Profinite.toProfiniteAdjToCompHaus 📋 Mathlib.Topology.Category.Profinite.Basic
: CompHaus.toProfinite ⊣ profiniteToCompHaus - Profinite.instTotallyDisconnectedSpaceCarrierToTop 📋 Mathlib.Topology.Category.Profinite.Basic
{X : Profinite} : TotallyDisconnectedSpace ↑X.toTop - instFiniteCarrierToTopTotallyDisconnectedSpaceObjFintypeCatProfiniteToProfinite 📋 Mathlib.Topology.Category.Profinite.Basic
(X : FintypeCat) : Finite ↑(FintypeCat.toProfinite.obj X).toTop - Profinite.limitCone 📋 Mathlib.Topology.Category.Profinite.Basic
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J Profinite) : CategoryTheory.Limits.Cone F - Profinite.limitConeIsLimit 📋 Mathlib.Topology.Category.Profinite.Basic
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J Profinite) : CategoryTheory.Limits.IsLimit (Profinite.limitCone F) - FintypeCat.toProfinite_obj 📋 Mathlib.Topology.Category.Profinite.Basic
(A : FintypeCat) : FintypeCat.toProfinite.obj A = Profinite.of A.obj - CompHaus.toProfinite_obj' 📋 Mathlib.Topology.Category.Profinite.Basic
(X : CompHaus) : ↑(CompHaus.toProfinite.obj X).toTop = ConnectedComponents ↑X.toTop - instTotallyDisconnectedSpaceCarrierToTopTrueObjProfiniteCompHausProfiniteToCompHaus 📋 Mathlib.Topology.Category.Profinite.Basic
{X : Profinite} : TotallyDisconnectedSpace ↑(profiniteToCompHaus.obj X).toTop - Profinite.toCompHausEquivalence 📋 Mathlib.Topology.Category.Profinite.Basic
(X : CompHaus) (Y : Profinite) : (X.toProfiniteObj ⟶ Y) ≃ (X ⟶ profiniteToCompHaus.obj Y) - Profinite.forget_preservesLimits 📋 Mathlib.Topology.Category.Profinite.Basic
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget Profinite) - FintypeCat.toProfinite_map_hom_hom_apply 📋 Mathlib.Topology.Category.Profinite.Basic
{X✝ Y✝ : FintypeCat} (f : X✝ ⟶ Y✝) (a : X✝.obj) : (TopCat.Hom.hom (FintypeCat.toProfinite.map f).hom) a = (CategoryTheory.ConcreteCategory.hom f) a - Profinite.epi_iff_surjective 📋 Mathlib.Topology.Category.Profinite.Basic
{X Y : Profinite} (f : X ⟶ Y) : CategoryTheory.Epi f ↔ Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f) - Profinite.isTerminalPUnit 📋 Mathlib.Topology.Category.Profinite.Limits
: CategoryTheory.Limits.IsTerminal (Profinite.of PUnit.{u + 1}) - Profinite.presentation 📋 Mathlib.Topology.Category.Stonean.Basic
(X : Profinite) : Stonean - Stonean.toProfinite 📋 Mathlib.Topology.Category.Stonean.Basic
: CategoryTheory.Functor Stonean Profinite - Stonean.instProjectiveProfiniteObjToProfinite 📋 Mathlib.Topology.Category.Stonean.Basic
(X : Stonean) : CategoryTheory.Projective (Stonean.toProfinite.obj X) - Profinite.projective_of_extrDisc 📋 Mathlib.Topology.Category.Stonean.Basic
{X : Profinite} (hX : ExtremallyDisconnected ↑X.toTop) : CategoryTheory.Projective X - Profinite.presentation.epi_π 📋 Mathlib.Topology.Category.Stonean.Basic
(X : Profinite) : CategoryTheory.Epi (Profinite.presentation.π X) - Profinite.presentation.π 📋 Mathlib.Topology.Category.Stonean.Basic
(X : Profinite) : Stonean.toProfinite.obj X.presentation ⟶ X - Profinite.lift 📋 Mathlib.Topology.Category.Stonean.Basic
{X Y : Profinite} {Z : Stonean} (e : Stonean.toProfinite.obj Z ⟶ Y) (f : X ⟶ Y) [CategoryTheory.Epi f] : Stonean.toProfinite.obj Z ⟶ X - Profinite.lift_lifts 📋 Mathlib.Topology.Category.Stonean.Basic
{X Y : Profinite} {Z : Stonean} (e : Stonean.toProfinite.obj Z ⟶ Y) (f : X ⟶ Y) [CategoryTheory.Epi f] : CategoryTheory.CategoryStruct.comp (Profinite.lift e f) f = e - Profinite.lift_lifts_assoc 📋 Mathlib.Topology.Category.Stonean.Basic
{X Y : Profinite} {Z : Stonean} (e : Stonean.toProfinite.obj Z ⟶ Y) (f : X ⟶ Y) [CategoryTheory.Epi f] {Z✝ : Profinite} (h : Y ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (Profinite.lift e f) (CategoryTheory.CategoryStruct.comp f h) = CategoryTheory.CategoryStruct.comp e h - Profinite.instPreregular 📋 Mathlib.Topology.Category.Profinite.EffectiveEpi
: CategoryTheory.Preregular Profinite - Profinite.instEffectivelyEnoughCompHausProfiniteToCompHaus 📋 Mathlib.Topology.Category.Profinite.EffectiveEpi
: profiniteToCompHaus.EffectivelyEnough - Profinite.instPreservesEffectiveEpisCompHausProfiniteToCompHaus 📋 Mathlib.Topology.Category.Profinite.EffectiveEpi
: profiniteToCompHaus.PreservesEffectiveEpis - Profinite.instReflectsEffectiveEpisCompHausProfiniteToCompHaus 📋 Mathlib.Topology.Category.Profinite.EffectiveEpi
: profiniteToCompHaus.ReflectsEffectiveEpis - Profinite.profiniteToCompHausEffectivePresentation 📋 Mathlib.Topology.Category.Profinite.EffectiveEpi
(X : CompHaus) : profiniteToCompHaus.EffectivePresentation X - Profinite.effectiveEpi_tfae 📋 Mathlib.Topology.Category.Profinite.EffectiveEpi
{B X : Profinite} (π : X ⟶ B) : [CategoryTheory.EffectiveEpi π, CategoryTheory.Epi π, Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom π)].TFAE - Profinite.effectiveEpiFamily_of_jointly_surjective 📋 Mathlib.Topology.Category.Profinite.EffectiveEpi
{α : Type} [Finite α] {B : Profinite} (X : α → Profinite) (π : (a : α) → X a ⟶ B) (surj : ∀ (b : ↑B.toTop), ∃ a x, (CategoryTheory.ConcreteCategory.hom (π a)) x = b) : CategoryTheory.EffectiveEpiFamily X π - Profinite.effectiveEpiFamily_tfae 📋 Mathlib.Topology.Category.Profinite.EffectiveEpi
{α : Type} [Finite α] {B : Profinite} (X : α → Profinite) (π : (a : α) → X a ⟶ B) : [CategoryTheory.EffectiveEpiFamily X π, CategoryTheory.Epi (CategoryTheory.Limits.Sigma.desc π), ∀ (b : ↑B.toTop), ∃ a x, (CategoryTheory.ConcreteCategory.hom (π a)) x = b].TFAE - Condensed.StoneanProfinite.instEffectivelyEnoughStoneanProfiniteToProfinite 📋 Mathlib.Condensed.Equivalence
: Stonean.toProfinite.EffectivelyEnough - Condensed.StoneanProfinite.instPreservesEffectiveEpisStoneanProfiniteToProfinite 📋 Mathlib.Condensed.Equivalence
: Stonean.toProfinite.PreservesEffectiveEpis - Condensed.StoneanProfinite.instReflectsEffectiveEpisStoneanProfiniteToProfinite 📋 Mathlib.Condensed.Equivalence
: Stonean.toProfinite.ReflectsEffectiveEpis - Condensed.StoneanProfinite.stoneanToProfiniteEffectivePresentation 📋 Mathlib.Condensed.Equivalence
(X : Profinite) : Stonean.toProfinite.EffectivePresentation X - Condensed.isSheafProfinite 📋 Mathlib.Condensed.Equivalence
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (X : Condensed A) [∀ (Y : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow Y profiniteToCompHaus.op) A] : CategoryTheory.Presheaf.IsSheaf (CategoryTheory.coherentTopology Profinite) (profiniteToCompHaus.op.comp X.obj) - Condensed.ProfiniteCompHaus.equivalence 📋 Mathlib.Condensed.Equivalence
(A : Type u_1) [CategoryTheory.Category.{v_1, u_1} A] [∀ (X : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X profiniteToCompHaus.op) A] : CategoryTheory.Sheaf (CategoryTheory.coherentTopology Profinite) A ≌ Condensed A - Condensed.StoneanProfinite.equivalence 📋 Mathlib.Condensed.Equivalence
(A : Type u_1) [CategoryTheory.Category.{v_1, u_1} A] [∀ (X : Profiniteᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X Stonean.toProfinite.op) A] : CategoryTheory.Sheaf (CategoryTheory.coherentTopology Stonean) A ≌ CategoryTheory.Sheaf (CategoryTheory.coherentTopology Profinite) A - Profinite.fintypeDiagram 📋 Mathlib.Topology.Category.Profinite.AsLimit
(X : Profinite) : CategoryTheory.Functor (DiscreteQuotient ↑X.toTop) FintypeCat - Profinite.diagram 📋 Mathlib.Topology.Category.Profinite.AsLimit
(X : Profinite) : CategoryTheory.Functor (DiscreteQuotient ↑X.toTop) Profinite - Profinite.asLimitCone 📋 Mathlib.Topology.Category.Profinite.AsLimit
(X : Profinite) : CategoryTheory.Limits.Cone X.diagram - Profinite.lim 📋 Mathlib.Topology.Category.Profinite.AsLimit
(X : Profinite) : CategoryTheory.Limits.LimitCone X.diagram - Profinite.asLimit 📋 Mathlib.Topology.Category.Profinite.AsLimit
(X : Profinite) : CategoryTheory.Limits.IsLimit X.asLimitCone - Profinite.isoAsLimitConeLift 📋 Mathlib.Topology.Category.Profinite.AsLimit
(X : Profinite) : X ≅ (Profinite.limitCone X.diagram).pt - Profinite.asLimitConeIso 📋 Mathlib.Topology.Category.Profinite.AsLimit
(X : Profinite) : X.asLimitCone ≅ Profinite.limitCone X.diagram - Profinite.isIso_asLimitCone_lift 📋 Mathlib.Topology.Category.Profinite.AsLimit
(X : Profinite) : CategoryTheory.IsIso ((Profinite.limitConeIsLimit X.diagram).lift X.asLimitCone) - Profinite.exists_locallyConstant 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) {α : Type u_1} (hC : CategoryTheory.Limits.IsLimit C) (f : LocallyConstant (↑C.pt.toTop) α) : ∃ j g, f = LocallyConstant.comap (TopCat.Hom.hom (C.π.app j).hom) g - Profinite.exists_locallyConstant_finite_nonempty 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) {α : Type u_1} [Finite α] [Nonempty α] (hC : CategoryTheory.Limits.IsLimit C) (f : LocallyConstant (↑C.pt.toTop) α) : ∃ j g, f = LocallyConstant.comap (TopCat.Hom.hom (C.π.app j).hom) g - Profinite.exists_locallyConstant_fin_two 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) (hC : CategoryTheory.Limits.IsLimit C) (f : LocallyConstant (↑C.pt.toTop) (Fin 2)) : ∃ j g, f = LocallyConstant.comap (TopCat.Hom.hom (C.π.app j).hom) g - Profinite.exists_locallyConstant_finite_aux 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) {α : Type u_1} [Finite α] (hC : CategoryTheory.Limits.IsLimit C) (f : LocallyConstant (↑C.pt.toTop) α) : ∃ j g, LocallyConstant.map (fun a b => if a = b then 0 else 1) f = LocallyConstant.comap (TopCat.Hom.hom (C.π.app j).hom) g - Profinite.exists_isClopen_of_cofiltered 📋 Mathlib.Topology.Category.Profinite.CofilteredLimit
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCofiltered J] {F : CategoryTheory.Functor J Profinite} (C : CategoryTheory.Limits.Cone F) {U : Set ↑C.pt.toTop} (hC : CategoryTheory.Limits.IsLimit C) (hU : IsClopen U) : ∃ j V, IsClopen V ∧ U = ⇑(CategoryTheory.ConcreteCategory.hom (C.π.app j)) ⁻¹' V - LightDiagram.toProfinite 📋 Mathlib.Topology.Category.LightProfinite.Basic
(S : LightDiagram) : Profinite - LightDiagram'.toProfinite 📋 Mathlib.Topology.Category.LightProfinite.Basic
(S : LightDiagram') : Profinite - lightDiagramToProfinite 📋 Mathlib.Topology.Category.LightProfinite.Basic
: CategoryTheory.Functor LightDiagram Profinite - instFaithfulLightDiagramProfiniteLightDiagramToProfinite 📋 Mathlib.Topology.Category.LightProfinite.Basic
: lightDiagramToProfinite.Faithful - instFullLightDiagramProfiniteLightDiagramToProfinite 📋 Mathlib.Topology.Category.LightProfinite.Basic
: lightDiagramToProfinite.Full - lightDiagramToProfinite_obj 📋 Mathlib.Topology.Category.LightProfinite.Basic
(S : LightDiagram) : lightDiagramToProfinite.obj S = S.toProfinite - lightToProfinite 📋 Mathlib.Topology.Category.LightProfinite.Basic
: CategoryTheory.Functor LightProfinite Profinite - lightToProfiniteFullyFaithful 📋 Mathlib.Topology.Category.LightProfinite.Basic
: lightToProfinite.FullyFaithful - LightProfinite.instPreservesEpimorphismsProfiniteLightToProfinite 📋 Mathlib.Topology.Category.LightProfinite.Basic
: lightToProfinite.PreservesEpimorphisms - LightProfinite.createsCountableLimits 📋 Mathlib.Topology.Category.LightProfinite.Basic
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.CountableCategory J] : CategoryTheory.CreatesLimitsOfShape J lightToProfinite - LightDiagram.cone 📋 Mathlib.Topology.Category.LightProfinite.Basic
(self : LightDiagram) : CategoryTheory.Limits.Cone (self.diagram.comp FintypeCat.toProfinite) - LightDiagram.isLimit 📋 Mathlib.Topology.Category.LightProfinite.Basic
(self : LightDiagram) : CategoryTheory.Limits.IsLimit self.cone - LightProfinite.instCountableDiscreteQuotient 📋 Mathlib.Topology.Category.LightProfinite.Basic
(S : LightProfinite) : Countable (DiscreteQuotient ↑(lightToProfinite.obj S).toTop) - lightDiagramToProfinite_map 📋 Mathlib.Topology.Category.LightProfinite.Basic
{X✝ Y✝ : CategoryTheory.InducedCategory Profinite LightDiagram.toProfinite} (f : X✝ ⟶ Y✝) : lightDiagramToProfinite.map f = f.hom - LightDiagram.mk 📋 Mathlib.Topology.Category.LightProfinite.Basic
(diagram : CategoryTheory.Functor ℕᵒᵖ FintypeCat) (cone : CategoryTheory.Limits.Cone (diagram.comp FintypeCat.toProfinite)) (isLimit : CategoryTheory.Limits.IsLimit cone) : LightDiagram - instSecondCountableTopologyCarrierToTopTotallyDisconnectedSpacePtOppositeNatProfiniteCone 📋 Mathlib.Topology.Category.LightProfinite.Basic
(S : LightDiagram) : SecondCountableTopology ↑S.cone.pt.toTop - lightDiagramToLightProfinite_obj 📋 Mathlib.Topology.Category.LightProfinite.Basic
(X : LightDiagram) : lightDiagramToLightProfinite.obj X = LightProfinite.of ↑X.cone.pt.toTop - lightProfiniteToLightDiagram_map 📋 Mathlib.Topology.Category.LightProfinite.Basic
{X✝ Y✝ : LightProfinite} (f : X✝ ⟶ Y✝) : lightProfiniteToLightDiagram.map f = CategoryTheory.InducedCategory.homMk (CategoryTheory.InducedCategory.homMk f.hom) - LightDiagram.id_hom_hom_hom_apply 📋 Mathlib.Topology.Category.LightProfinite.Basic
(X : LightDiagram) (a : ↑X.toProfinite.toTop) : (TopCat.Hom.hom (CategoryTheory.CategoryStruct.id X).hom.hom) a = a - LightDiagram.comp_hom_hom_hom_apply 📋 Mathlib.Topology.Category.LightProfinite.Basic
{X Y Z : LightDiagram} (a✝ : X ⟶ Y) (a✝¹ : Y ⟶ Z) (a✝² : ↑X.toProfinite.toTop) : (TopCat.Hom.hom (CategoryTheory.CategoryStruct.comp a✝ a✝¹).hom.hom) a✝² = a✝¹.hom.hom.hom' (a✝.hom.hom.hom' a✝²) - lightDiagramToLightProfinite_map 📋 Mathlib.Topology.Category.LightProfinite.Basic
{X✝ Y✝ : LightDiagram} (f : X✝ ⟶ Y✝) : lightDiagramToLightProfinite.map f = CategoryTheory.InducedCategory.homMk f.hom.hom - LightProfinite.isoMapCone 📋 Mathlib.Topology.Category.LightProfinite.AsLimit
(S : LightProfinite) : lightToProfinite.mapCone S.asLimitConeAux ≅ S.toLightDiagram.cone - LightProfinite.lightToProfinite_map_proj_eq 📋 Mathlib.Topology.Category.LightProfinite.AsLimit
(S : LightProfinite) (n : ℕ) : lightToProfinite.map (S.proj n) = (lightToProfinite.obj S).asLimitCone.π.app ((CategoryTheory.Limits.IsCofiltered.sequentialFunctor (DiscreteQuotient ↑(lightToProfinite.obj S).toTop)).obj (Opposite.op n)) - Profinite.fintypeDiagram' 📋 Mathlib.Topology.Category.Profinite.Extend
(S : Profinite) : CategoryTheory.Functor (CategoryTheory.StructuredArrow S FintypeCat.toProfinite) FintypeCat - Profinite.diagram' 📋 Mathlib.Topology.Category.Profinite.Extend
(S : Profinite) : CategoryTheory.Functor (CategoryTheory.StructuredArrow S FintypeCat.toProfinite) Profinite - Profinite.asLimitCone' 📋 Mathlib.Topology.Category.Profinite.Extend
(S : Profinite) : CategoryTheory.Limits.Cone S.diagram' - Profinite.lim' 📋 Mathlib.Topology.Category.Profinite.Extend
(S : Profinite) : CategoryTheory.Limits.LimitCone S.diagram' - Profinite.asLimit' 📋 Mathlib.Topology.Category.Profinite.Extend
(S : Profinite) : CategoryTheory.Limits.IsLimit S.asLimitCone' - Profinite.Extend.cone 📋 Mathlib.Topology.Category.Profinite.Extend
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profinite C) (S : Profinite) : CategoryTheory.Limits.Cone ((CategoryTheory.StructuredArrow.proj S FintypeCat.toProfinite).comp (FintypeCat.toProfinite.comp G)) - Profinite.Extend.functor 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) : CategoryTheory.Functor I (CategoryTheory.StructuredArrow c.pt FintypeCat.toProfinite) - Profinite.Extend.cone_pt 📋 Mathlib.Topology.Category.Profinite.Extend
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profinite C) (S : Profinite) : (Profinite.Extend.cone G S).pt = G.obj S - Profinite.Extend.functorOp 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) : CategoryTheory.Functor Iᵒᵖ (CategoryTheory.CostructuredArrow FintypeCat.toProfinite.op (Opposite.op c.pt)) - Profinite.Extend.cocone 📋 Mathlib.Topology.Category.Profinite.Extend
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profiniteᵒᵖ C) (S : Profinite) : CategoryTheory.Limits.Cocone ((CategoryTheory.CostructuredArrow.proj FintypeCat.toProfinite.op (Opposite.op S)).comp (FintypeCat.toProfinite.op.comp G)) - Profinite.Extend.cocone_pt 📋 Mathlib.Topology.Category.Profinite.Extend
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profiniteᵒᵖ C) (S : Profinite) : (Profinite.Extend.cocone G S).pt = G.obj (Opposite.op S) - Profinite.Extend.functor_obj 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) (i : I) : (Profinite.Extend.functor c).obj i = CategoryTheory.StructuredArrow.mk (c.π.app i) - Profinite.Extend.functor_initial 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : I), CategoryTheory.Epi (c.π.app i)] : (Profinite.Extend.functor c).Initial - Profinite.Extend.functorOp_final 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : I), CategoryTheory.Epi (c.π.app i)] : (Profinite.Extend.functorOp c).Final - Profinite.exists_hom 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) (hc : CategoryTheory.Limits.IsLimit c) {X : FintypeCat} (f : c.pt ⟶ FintypeCat.toProfinite.obj X) : ∃ i g, f = CategoryTheory.CategoryStruct.comp (c.π.app i) (FintypeCat.toProfinite.map g) - Profinite.Extend.functorOp_obj 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) (X : Iᵒᵖ) : (Profinite.Extend.functorOp c).obj X = CategoryTheory.CostructuredArrow.mk (c.π.app (Opposite.unop X)).op - Profinite.Extend.cone_π_app 📋 Mathlib.Topology.Category.Profinite.Extend
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profinite C) (S : Profinite) (i : CategoryTheory.StructuredArrow S FintypeCat.toProfinite) : (Profinite.Extend.cone G S).π.app i = G.map i.hom - Profinite.Extend.isLimitCone 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profinite C) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : I), CategoryTheory.Epi (c.π.app i)] (hc' : CategoryTheory.Limits.IsLimit (G.mapCone c)) : CategoryTheory.Limits.IsLimit (Profinite.Extend.cone G c.pt) - Profinite.Extend.isColimitCocone 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profiniteᵒᵖ C) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : I), CategoryTheory.Epi (c.π.app i)] (hc' : CategoryTheory.Limits.IsColimit (G.mapCocone c.op)) : CategoryTheory.Limits.IsColimit (Profinite.Extend.cocone G c.pt) - Profinite.instEpiAppDiscreteQuotientCarrierToTopTotallyDisconnectedSpaceπAsLimitCone 📋 Mathlib.Topology.Category.Profinite.Extend
(S : Profinite) (i : DiscreteQuotient ↑S.toTop) : CategoryTheory.Epi (S.asLimitCone.π.app i) - Profinite.Extend.functor_map 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) {X✝ Y✝ : I} (f : X✝ ⟶ Y✝) : (Profinite.Extend.functor c).map f = CategoryTheory.StructuredArrow.homMk (F.map f) ⋯ - Profinite.Extend.cocone_ι_app 📋 Mathlib.Topology.Category.Profinite.Extend
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profiniteᵒᵖ C) (S : Profinite) (i : CategoryTheory.CostructuredArrow FintypeCat.toProfinite.op (Opposite.op S)) : (Profinite.Extend.cocone G S).ι.app i = G.map i.hom - Profinite.Extend.functorOp_map 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) {X✝ Y✝ : Iᵒᵖ} (f : X✝ ⟶ Y✝) : (Profinite.Extend.functorOp c).map f = CategoryTheory.CostructuredArrow.homMk (F.map f.unop).op ⋯ - Condensed.locallyConstantPresheaf 📋 Mathlib.Condensed.Discrete.Colimit
(X : Type (u + 1)) : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1)) - Condensed.finYoneda 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) : CategoryTheory.Functor FintypeCatᵒᵖ (Type (u + 1)) - Condensed.lanPresheaf 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1)) - Condensed.lanSheafProfinite 📋 Mathlib.Condensed.Discrete.Colimit
(X : Type (u + 1)) : CategoryTheory.Sheaf (CategoryTheory.coherentTopology Profinite) (Type (u + 1)) - Condensed.fintypeCatAsCofan 📋 Mathlib.Condensed.Discrete.Colimit
(X : Profinite) : CategoryTheory.Limits.Cofan fun x => Profinite.of PUnit.{u + 1} - Condensed.instPreservesLimitsOfShapeOppositeProfiniteDiscreteCarrierToTopTotallyDisconnectedSpaceOfFinite 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : Profinite) [Finite ↑X.toTop] : CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete ↑X.toTop) F - Condensed.isoFinYoneda 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] : FintypeCat.toProfinite.op.comp F ≅ Condensed.finYoneda F - Condensed.finYoneda_obj 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) (X : FintypeCatᵒᵖ) : (Condensed.finYoneda F).obj X = ((Opposite.unop X).obj → F.obj (FintypeCat.toProfinite.op.obj (Opposite.op (FintypeCat.of PUnit.{u + 1})))) - Condensed.fintypeCatAsCofanIsColimit 📋 Mathlib.Condensed.Discrete.Colimit
(X : Profinite) [Finite ↑X.toTop] : CategoryTheory.Limits.IsColimit (Condensed.fintypeCatAsCofan X) - Condensed.isoFinYonedaComponents 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : Profinite) [Finite ↑X.toTop] : F.obj (Opposite.op X) ≅ ↑X.toTop → F.obj (Opposite.op (Profinite.of PUnit.{u + 1})) - Condensed.locallyConstantIsoFinYoneda 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) : FintypeCat.toProfinite.op.comp (Condensed.locallyConstantPresheaf (F.obj (FintypeCat.toProfinite.op.obj (Opposite.op (FintypeCat.of PUnit.{u + 1}))))) ≅ Condensed.finYoneda F - Condensed.lanPresheafExt 📋 Mathlib.Condensed.Discrete.Colimit
{F G : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))} (i : FintypeCat.toProfinite.op.comp F ≅ FintypeCat.toProfinite.op.comp G) : Condensed.lanPresheaf F ≅ Condensed.lanPresheaf G - Condensed.isColimitLocallyConstantPresheaf 📋 Mathlib.Condensed.Discrete.Colimit
{I : Type u} [CategoryTheory.Category.{u, u} I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) (X : Type (u + 1)) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : I), CategoryTheory.Epi (c.π.app i)] : CategoryTheory.Limits.IsColimit ((Condensed.locallyConstantPresheaf X).mapCocone c.op) - Condensed.isColimitLocallyConstantPresheafDiagram 📋 Mathlib.Condensed.Discrete.Colimit
(X : Type (u + 1)) (S : Profinite) : CategoryTheory.Limits.IsColimit ((Condensed.locallyConstantPresheaf X).mapCocone S.asLimitCone.op) - Condensed.finYoneda_map 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) {X✝ Y✝ : FintypeCatᵒᵖ} (f : X✝ ⟶ Y✝) : (Condensed.finYoneda F).map f = TypeCat.ofHom fun g => g ∘ ⇑(CategoryTheory.ConcreteCategory.hom f.unop) - Condensed.instFinalOppositeDiscreteQuotientCarrierToTopTotallyDisconnectedSpaceCostructuredArrowFintypeCatProfiniteOpToProfiniteOpPtAsLimitConeFunctorOp 📋 Mathlib.Condensed.Discrete.Colimit
{S : Profinite} : (Profinite.Extend.functorOp S.asLimitCone).Final - Condensed.lanPresheafNatIso 📋 Mathlib.Condensed.Discrete.Colimit
{F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))} (hF : (S : Profinite) → CategoryTheory.Limits.IsColimit (F.mapCocone S.asLimitCone.op)) : Condensed.lanPresheaf F ≅ F - Condensed.lanPresheafIso 📋 Mathlib.Condensed.Discrete.Colimit
{S : Profinite} {F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))} (hF : CategoryTheory.Limits.IsColimit (F.mapCocone S.asLimitCone.op)) : (Condensed.lanPresheaf F).obj (Opposite.op S) ≅ F.obj (Opposite.op S) - Condensed.isoLocallyConstantOfIsColimit 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : (S : Profinite) → CategoryTheory.Limits.IsColimit (F.mapCocone S.asLimitCone.op)) : F ≅ Condensed.locallyConstantPresheaf (F.obj (FintypeCat.toProfinite.op.obj (Opposite.op (FintypeCat.of PUnit.{u + 1})))) - Condensed.locallyConstantIsoFinYoneda_hom_app 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) (X : FintypeCatᵒᵖ) : (Condensed.locallyConstantIsoFinYoneda F).hom.app X = TypeCat.ofHom fun f => ⇑f - Condensed.isoFinYonedaComponents_hom 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : Profinite) [Finite ↑X.toTop] : (Condensed.isoFinYonedaComponents F X).hom = TypeCat.ofHom fun y x => (CategoryTheory.ConcreteCategory.hom (F.map (CompHausLike.const (Profinite.of PUnit.{u + 1}) x).op)) y - Condensed.isoLocallyConstantOfIsColimit_inv 📋 Mathlib.Condensed.Discrete.Colimit
(X : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts X] (hX : (S : Profinite) → CategoryTheory.Limits.IsColimit (X.mapCocone S.asLimitCone.op)) : (Condensed.isoLocallyConstantOfIsColimit X hX).inv = CompHausLike.LocallyConstant.counitApp X - Condensed.lanPresheafIso_hom 📋 Mathlib.Condensed.Discrete.Colimit
{S : Profinite} {F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))} (hF : CategoryTheory.Limits.IsColimit (F.mapCocone S.asLimitCone.op)) : (Condensed.lanPresheafIso hF).hom = CategoryTheory.Limits.colimit.desc ((CategoryTheory.CostructuredArrow.proj FintypeCat.toProfinite.op (Opposite.op S)).comp (FintypeCat.toProfinite.op.comp F)) (Profinite.Extend.cocone F S) - Condensed.lanPresheafNatIso_hom_app 📋 Mathlib.Condensed.Discrete.Colimit
{F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))} (hF : (S : Profinite) → CategoryTheory.Limits.IsColimit (F.mapCocone S.asLimitCone.op)) (S : Profiniteᵒᵖ) : (Condensed.lanPresheafNatIso hF).hom.app S = CategoryTheory.Limits.colimit.desc ((CategoryTheory.CostructuredArrow.proj FintypeCat.toProfinite.op (Opposite.op (Opposite.unop S))).comp (FintypeCat.toProfinite.op.comp F)) (Profinite.Extend.cocone F (Opposite.unop S)) - Condensed.isoFinYonedaComponents_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : Profinite) [Finite ↑X.toTop] (y : F.obj (Opposite.op X)) (x : ↑X.toTop) : (CategoryTheory.ConcreteCategory.hom (Condensed.isoFinYonedaComponents F X).hom) y x = (CategoryTheory.ConcreteCategory.hom (F.map (CompHausLike.const (Profinite.of PUnit.{u + 1}) x).op)) y - Condensed.lanPresheafExt_hom 📋 Mathlib.Condensed.Discrete.Colimit
{F G : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))} (S : Profiniteᵒᵖ) (i : FintypeCat.toProfinite.op.comp F ≅ FintypeCat.toProfinite.op.comp G) : (Condensed.lanPresheafExt i).hom.app S = CategoryTheory.Limits.colimMap ((CategoryTheory.CostructuredArrow.proj FintypeCat.toProfinite.op S).whiskerLeft i.hom) - Condensed.lanPresheafExt_inv 📋 Mathlib.Condensed.Discrete.Colimit
{F G : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))} (S : Profiniteᵒᵖ) (i : FintypeCat.toProfinite.op.comp F ≅ FintypeCat.toProfinite.op.comp G) : (Condensed.lanPresheafExt i).inv.app S = CategoryTheory.Limits.colimMap ((CategoryTheory.CostructuredArrow.proj FintypeCat.toProfinite.op S).whiskerLeft i.inv) - Condensed.isoFinYonedaComponents_inv_comp 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] {X Y : Profinite} [Finite ↑X.toTop] [Finite ↑Y.toTop] (f : ↑Y.toTop → F.obj (Opposite.op (Profinite.of PUnit.{u + 1}))) (g : X ⟶ Y) : (CategoryTheory.ConcreteCategory.hom (Condensed.isoFinYonedaComponents F X).inv) (f ∘ ⇑(CategoryTheory.ConcreteCategory.hom g)) = (CategoryTheory.ConcreteCategory.hom (F.map g.op)) ((CategoryTheory.ConcreteCategory.hom (Condensed.isoFinYonedaComponents F Y).inv) f) - Condensed.isColimitLocallyConstantPresheaf_desc_apply 📋 Mathlib.Condensed.Discrete.Colimit
{I : Type u} [CategoryTheory.Category.{u, u} I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) (X : Type (u + 1)) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : I), CategoryTheory.Epi (c.π.app i)] (s : CategoryTheory.Limits.Cocone ((F.comp FintypeCat.toProfinite).op.comp (Condensed.locallyConstantPresheaf X))) (i : I) (f : LocallyConstant (↑(FintypeCat.toProfinite.obj (F.obj i)).toTop) X) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isColimitLocallyConstantPresheaf c X hc).desc s)) (LocallyConstant.comap (TopCat.Hom.hom (c.π.app i).hom) f) = (CategoryTheory.ConcreteCategory.hom (s.ι.app (Opposite.op i))) f - Condensed.isoFinYoneda_hom_app_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCatᵒᵖ) (x : (CategoryTheory.Limits.Fan.mk (F.obj (Opposite.op (Condensed.fintypeCatAsCofan (FintypeCat.toProfinite.obj (Opposite.unop X))).pt)) fun j => F.map ((Condensed.fintypeCatAsCofan (FintypeCat.toProfinite.obj (Opposite.unop X))).inj j).op).pt) (j : ↑(FintypeCat.toProfinite.obj (Opposite.unop X)).toTop) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isoFinYoneda F).hom.app X)) x j = (CategoryTheory.ConcreteCategory.hom (F.map ((Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).inj j).op)) x - Condensed.isColimitLocallyConstantPresheafDiagram_desc_apply 📋 Mathlib.Condensed.Discrete.Colimit
(X : Type (u + 1)) (S : Profinite) (s : CategoryTheory.Limits.Cocone (S.diagram.op.comp (Condensed.locallyConstantPresheaf X))) (i : DiscreteQuotient ↑S.toTop) (f : LocallyConstant (↑(S.diagram.obj i).toTop) X) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isColimitLocallyConstantPresheafDiagram X S).desc s)) (LocallyConstant.comap (TopCat.Hom.hom (S.asLimitCone.π.app i).hom) f) = (CategoryTheory.ConcreteCategory.hom (s.ι.app (Opposite.op i))) f - Condensed.isoFinYoneda_inv_app_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCatᵒᵖ) (a✝ : (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (Profinite.of PUnit.{u + 1}))).cone.pt) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isoFinYoneda F).inv.app X)) a✝ = (CategoryTheory.CategoryStruct.id (F.obj (Opposite.op (Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).pt))).hom' ((((CategoryTheory.Limits.IsLimit.postcomposeHomEquiv (CategoryTheory.Discrete.natIso fun j => CategoryTheory.Iso.refl (F.obj (Opposite.op (Profinite.of PUnit.{u + 1})))) (F.mapCone (CategoryTheory.Limits.Fan.mk (Opposite.op (Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).pt) fun a => ((Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).inj a).op))).symm (CategoryTheory.Limits.isLimitOfPreserves F (CategoryTheory.Limits.Cofan.IsColimit.op (Condensed.fintypeCatAsCofanIsColimit (Profinite.of (Opposite.unop X).obj))))).lift (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (Profinite.of PUnit.{u + 1}))).cone).hom' a✝) - CondensedSet.mem_locallyConstant_essImage_of_isColimit_mapCocone 📋 Mathlib.Condensed.Discrete.Characterization
(X : CondensedSet) (h : (S : Profinite) → CategoryTheory.Limits.IsColimit ((profiniteToCompHaus.op.comp X.obj).mapCocone S.asLimitCone.op)) : CondensedSet.LocallyConstant.functor.essImage X - CondensedSet.isDiscrete_tfae 📋 Mathlib.Condensed.Discrete.Characterization
(X : CondensedSet) : [Condensed.IsDiscrete X, CategoryTheory.IsIso ((Condensed.discreteUnderlyingAdj (Type (u + 1))).counit.app X), (Condensed.discrete (Type (u + 1))).essImage X, CondensedSet.LocallyConstant.functor.essImage X, CategoryTheory.IsIso (CondensedSet.LocallyConstant.adjunction.counit.app X), CategoryTheory.Sheaf.IsConstant (CategoryTheory.coherentTopology Profinite) ((Condensed.ProfiniteCompHaus.equivalence (Type (u + 1))).inverse.obj X), ∀ (S : Profinite), Nonempty (CategoryTheory.Limits.IsColimit ((profiniteToCompHaus.op.comp X.obj).mapCocone S.asLimitCone.op))].TFAE - CondensedMod.isDiscrete_tfae 📋 Mathlib.Condensed.Discrete.Characterization
(R : Type (u + 1)) [Ring R] (M : CondensedMod R) : [Condensed.IsDiscrete M, CategoryTheory.IsIso ((Condensed.discreteUnderlyingAdj (ModuleCat R)).counit.app M), (Condensed.discrete (ModuleCat R)).essImage M, (CondensedMod.LocallyConstant.functor R).essImage M, CategoryTheory.IsIso ((CondensedMod.LocallyConstant.adjunction R).counit.app M), CategoryTheory.Sheaf.IsConstant (CategoryTheory.coherentTopology Profinite) ((Condensed.ProfiniteCompHaus.equivalence (ModuleCat R)).inverse.obj M), ∀ (S : Profinite), Nonempty (CategoryTheory.Limits.IsColimit ((profiniteToCompHaus.op.comp M.obj).mapCocone S.asLimitCone.op))].TFAE - CondensedSet.ofSheafProfinite 📋 Mathlib.Condensed.Explicit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : CondensedSet - CondensedMod.ofSheafProfinite 📋 Mathlib.Condensed.Explicit
(R : Type (u + 1)) [Ring R] (F : CategoryTheory.Functor Profiniteᵒᵖ (ModuleCat R)) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : CondensedMod R - Condensed.ofSheafProfinite 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [∀ (X : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X profiniteToCompHaus.op) A] (F : CategoryTheory.Functor Profiniteᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts F] (hF : CategoryTheory.regularTopology.EqualizerCondition F) : Condensed A - Condensed.equalizerCondition_profinite 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (X : CategoryTheory.Sheaf (CategoryTheory.coherentTopology Profinite) A) : CategoryTheory.regularTopology.EqualizerCondition X.obj - Condensed.instPreservesFiniteProductsOppositeProfiniteObjFunctorIsSheafCoherentTopology 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] (X : CategoryTheory.Sheaf (CategoryTheory.coherentTopology Profinite) A) : CategoryTheory.Limits.PreservesFiniteProducts X.obj - Condensed.ofSheafForgetProfinite 📋 Mathlib.Condensed.Explicit
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] [∀ (X : CompHausᵒᵖ), CategoryTheory.Limits.HasLimitsOfShape (CategoryTheory.StructuredArrow X profiniteToCompHaus.op) A] {FA : A → A → Type u_2} {CA : A → Type u_3} [(X Y : A) → FunLike (FA X Y) (CA X) (CA Y)] [CategoryTheory.ConcreteCategory A FA] [CategoryTheory.Limits.ReflectsFiniteLimits (CategoryTheory.forget A)] (F : CategoryTheory.Functor Profiniteᵒᵖ A) [CategoryTheory.Limits.PreservesFiniteProducts (F.comp (CategoryTheory.forget A))] (hF : CategoryTheory.regularTopology.EqualizerCondition (F.comp (CategoryTheory.forget A))) : Condensed A - Profinite.toCondensed 📋 Mathlib.Condensed.Functors
(S : Profinite) : CondensedSet - profiniteToCondensed 📋 Mathlib.Condensed.Functors
: CategoryTheory.Functor Profinite CondensedSet - Profinite.injective_of_finite 📋 Mathlib.Topology.Category.LightProfinite.Injective
(S : Profinite) [Nonempty ↑S.toTop] [Finite ↑S.toTop] : CategoryTheory.Injective S - Profinite.injective_of_light 📋 Mathlib.Topology.Category.LightProfinite.Injective
(S : LightProfinite) [Nonempty ↑S.toTop] : CategoryTheory.Injective (lightToProfinite.obj S) - Profinite.exists_lift_of_finite_of_mono_of_epi 📋 Mathlib.Topology.Category.LightProfinite.Injective
{X Y S T : Profinite} [Finite ↑S.toTop] (f : X ⟶ Y) [CategoryTheory.Mono f] (f' : S ⟶ T) [CategoryTheory.Epi f'] (g : X ⟶ S) (g' : Y ⟶ T) (h_comm : CategoryTheory.CategoryStruct.comp f g' = CategoryTheory.CategoryStruct.comp g f') : ∃ k, CategoryTheory.CategoryStruct.comp k f' = g' ∧ CategoryTheory.CategoryStruct.comp f k = g - Condensed.profiniteFree 📋 Mathlib.Condensed.Solid
(R : Type (u + 1)) [Ring R] : CategoryTheory.Functor Profinite (CondensedMod R) - Condensed.profiniteSolid 📋 Mathlib.Condensed.Solid
(R : Type (u + 1)) [Ring R] : CategoryTheory.Functor Profinite (CondensedMod R) - Condensed.instIsRightKanExtensionFintypeCatCondensedModProfiniteProfiniteSolidProfiniteSolidCounit 📋 Mathlib.Condensed.Solid
(R : Type (u + 1)) [Ring R] : (Condensed.profiniteSolid R).IsRightKanExtension (Condensed.profiniteSolidCounit R) - Condensed.profiniteSolidIsPointwiseRightKanExtension 📋 Mathlib.Condensed.Solid
(R : Type (u + 1)) [Ring R] : (CategoryTheory.Functor.RightExtension.mk (Condensed.profiniteSolid R) (Condensed.profiniteSolidCounit R)).IsPointwiseRightKanExtension - Condensed.profiniteSolidification 📋 Mathlib.Condensed.Solid
(R : Type (u + 1)) [Ring R] : Condensed.profiniteFree R ⟶ Condensed.profiniteSolid R - Condensed.profiniteSolidCounit 📋 Mathlib.Condensed.Solid
(R : Type (u + 1)) [Ring R] : FintypeCat.toProfinite.comp (Condensed.profiniteSolid R) ⟶ Condensed.finFree R - CondensedMod.IsSolid.isIso_solidification_map 📋 Mathlib.Condensed.Solid
{R : Type (u + 1)} {inst✝ : Ring R} {A : CondensedMod R} [self : CondensedMod.IsSolid R A] (X : Profinite) : CategoryTheory.IsIso ((CategoryTheory.yoneda.obj A).map ((Condensed.profiniteSolidification R).app X).op) - CondensedMod.IsSolid.mk 📋 Mathlib.Condensed.Solid
{R : Type (u + 1)} [Ring R] {A : CondensedMod R} (isIso_solidification_map : ∀ (X : Profinite), CategoryTheory.IsIso ((CategoryTheory.yoneda.obj A).map ((Condensed.profiniteSolidification R).app X).op)) : CondensedMod.IsSolid R A - ProfiniteAddGrp.toProfinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
(self : ProfiniteAddGrp.{u}) : Profinite - ProfiniteGrp.toProfinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
(self : ProfiniteGrp.{u}) : Profinite - ProfiniteAddGrp.mk 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
(toProfinite : Profinite) [addGroup : AddGroup ↑toProfinite.toTop] [topologicalAddGroup : IsTopologicalAddGroup ↑toProfinite.toTop] : ProfiniteAddGrp.{u} - ProfiniteAddGrp.ofProfinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
(G : Profinite) [AddGroup ↑G.toTop] [IsTopologicalAddGroup ↑G.toTop] : ProfiniteAddGrp.{u_1} - ProfiniteGrp.mk 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
(toProfinite : Profinite) [group : Group ↑toProfinite.toTop] [isTopologicalGroup : IsTopologicalGroup ↑toProfinite.toTop] : ProfiniteGrp.{u} - ProfiniteGrp.ofProfinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
(G : Profinite) [Group ↑G.toTop] [IsTopologicalGroup ↑G.toTop] : ProfiniteGrp.{u_1} - ProfiniteAddGrp.instHasForget₂ContinuousAddMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: CategoryTheory.HasForget₂ ProfiniteAddGrp.{u_1} Profinite - ProfiniteGrp.instHasForget₂ContinuousMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: CategoryTheory.HasForget₂ ProfiniteGrp.{u_1} Profinite - ProfiniteAddGrp.instFaithfulProfiniteForget₂ContinuousAddMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: (CategoryTheory.forget₂ ProfiniteAddGrp.{u_1} Profinite).Faithful - ProfiniteAddGrp.instPreservesLimitsProfiniteForget₂ContinuousAddMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ ProfiniteAddGrp.{u_1} Profinite) - ProfiniteAddGrp.instReflectsIsomorphismsProfiniteForget₂ContinuousAddMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: (CategoryTheory.forget₂ ProfiniteAddGrp.{u_1} Profinite).ReflectsIsomorphisms - ProfiniteGrp.instFaithfulProfiniteForget₂ContinuousMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: (CategoryTheory.forget₂ ProfiniteGrp.{u_1} Profinite).Faithful - ProfiniteGrp.instPreservesLimitsProfiniteForget₂ContinuousMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ ProfiniteGrp.{u_1} Profinite) - ProfiniteGrp.instReflectsIsomorphismsProfiniteForget₂ContinuousMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: (CategoryTheory.forget₂ ProfiniteGrp.{u_1} Profinite).ReflectsIsomorphisms - ProfiniteAddGrp.instAddGroupCarrierToTopTotallyDisconnectedSpacePtProfiniteLimitConeCompForget₂ContinuousAddMonoidHomToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J ProfiniteAddGrp.{max v u}) : AddGroup ↑(Profinite.limitCone (F.comp (CategoryTheory.forget₂ ProfiniteAddGrp.{max u v} Profinite))).pt.toTop - ProfiniteGrp.instGroupCarrierToTopTotallyDisconnectedSpacePtProfiniteLimitConeCompForget₂ContinuousMonoidHomToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J ProfiniteGrp.{max v u}) : Group ↑(Profinite.limitCone (F.comp (CategoryTheory.forget₂ ProfiniteGrp.{max u v} Profinite))).pt.toTop - ProfiniteAddGrp.instIsTopologicalAddGroupCarrierToTopTotallyDisconnectedSpacePtProfiniteLimitConeCompForget₂ContinuousAddMonoidHomToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J ProfiniteAddGrp.{max v u}) : IsTopologicalAddGroup ↑(Profinite.limitCone (F.comp (CategoryTheory.forget₂ ProfiniteAddGrp.{max u v} Profinite))).pt.toTop - ProfiniteGrp.instIsTopologicalGroupCarrierToTopTotallyDisconnectedSpacePtProfiniteLimitConeCompForget₂ContinuousMonoidHomToProfiniteContinuousMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J ProfiniteGrp.{max v u}) : IsTopologicalGroup ↑(Profinite.limitCone (F.comp (CategoryTheory.forget₂ ProfiniteGrp.{max u v} Profinite))).pt.toTop - Profinite.forgetCreatesLimits 📋 Mathlib.Topology.Category.Compactum
: CategoryTheory.CreatesLimits (CategoryTheory.forget Profinite) - Profinite.indexFunctor 📋 Mathlib.Topology.Category.Profinite.Product
{ι : Type u} {X : ι → Type} [(i : ι) → TopologicalSpace (X i)] {C : Set ((i : ι) → X i)} [∀ (i : ι), T2Space (X i)] [∀ (i : ι), TotallyDisconnectedSpace (X i)] (hC : IsCompact C) : CategoryTheory.Functor (Finset ι)ᵒᵖ Profinite - Profinite.indexCone 📋 Mathlib.Topology.Category.Profinite.Product
{ι : Type u} {X : ι → Type} [(i : ι) → TopologicalSpace (X i)] {C : Set ((i : ι) → X i)} [∀ (i : ι), T2Space (X i)] [∀ (i : ι), TotallyDisconnectedSpace (X i)] (hC : IsCompact C) : CategoryTheory.Limits.Cone (Profinite.indexFunctor hC) - Profinite.indexCone_isLimit 📋 Mathlib.Topology.Category.Profinite.Product
{ι : Type u} {X : ι → Type} [(i : ι) → TopologicalSpace (X i)] {C : Set ((i : ι) → X i)} [∀ (i : ι), T2Space (X i)] [∀ (i : ι), TotallyDisconnectedSpace (X i)] (hC : IsCompact C) : CategoryTheory.Limits.IsLimit (Profinite.indexCone hC) - Profinite.asLimitindexConeIso 📋 Mathlib.Topology.Category.Profinite.Product
{ι : Type u} {X : ι → Type} [(i : ι) → TopologicalSpace (X i)] {C : Set ((i : ι) → X i)} [∀ (i : ι), T2Space (X i)] [∀ (i : ι), TotallyDisconnectedSpace (X i)] (hC : IsCompact C) : Profinite.indexCone hC ≅ Profinite.limitCone (Profinite.indexFunctor hC) - Profinite.isoindexConeLift 📋 Mathlib.Topology.Category.Profinite.Product
{ι : Type u} {X : ι → Type} [(i : ι) → TopologicalSpace (X i)] {C : Set ((i : ι) → X i)} [∀ (i : ι), T2Space (X i)] [∀ (i : ι), TotallyDisconnectedSpace (X i)] (hC : IsCompact C) : Profinite.of ↑C ≅ (Profinite.limitCone (Profinite.indexFunctor hC)).pt - Profinite.isIso_indexCone_lift 📋 Mathlib.Topology.Category.Profinite.Product
{ι : Type u} {X : ι → Type} [(i : ι) → TopologicalSpace (X i)] {C : Set ((i : ι) → X i)} [∀ (i : ι), T2Space (X i)] [∀ (i : ι), TotallyDisconnectedSpace (X i)] (hC : IsCompact C) : CategoryTheory.IsIso ((Profinite.limitConeIsLimit (Profinite.indexFunctor hC)).lift (Profinite.indexCone hC)) - Profinite.NobelingProof.spanFunctor 📋 Mathlib.Topology.Category.Profinite.Nobeling.Basic
{I : Type u} {C : Set (I → Bool)} [(s : Finset I) → (i : I) → Decidable (i ∈ s)] (hC : IsCompact C) : CategoryTheory.Functor (Finset I)ᵒᵖ Profinite - Profinite.NobelingProof.spanCone 📋 Mathlib.Topology.Category.Profinite.Nobeling.Basic
{I : Type u} {C : Set (I → Bool)} [(s : Finset I) → (i : I) → Decidable (i ∈ s)] (hC : IsCompact C) : CategoryTheory.Limits.Cone (Profinite.NobelingProof.spanFunctor hC) - Profinite.NobelingProof.spanCone_isLimit 📋 Mathlib.Topology.Category.Profinite.Nobeling.Basic
{I : Type u} {C : Set (I → Bool)} [(s : Finset I) → (i : I) → Decidable (i ∈ s)] (hC : IsCompact C) : CategoryTheory.Limits.IsLimit (Profinite.NobelingProof.spanCone hC) - Profinite.NobelingProof.spanFunctorIsoIndexFunctor 📋 Mathlib.Topology.Category.Profinite.Nobeling.Basic
{I : Type u} {C : Set (I → Bool)} [(s : Finset I) → (i : I) → Decidable (i ∈ s)] (hC : IsCompact C) : Profinite.NobelingProof.spanFunctor hC ≅ Profinite.indexFunctor hC - Profinite.NobelingProof.spanFunctorIsoIndexFunctor_inv_app 📋 Mathlib.Topology.Category.Profinite.Nobeling.Basic
{I : Type u} {C : Set (I → Bool)} [(s : Finset I) → (i : I) → Decidable (i ∈ s)] (hC : IsCompact C) (X : (Finset I)ᵒᵖ) : (Profinite.NobelingProof.spanFunctorIsoIndexFunctor hC).inv.app X = (CompHausLike.isoOfBijective (CategoryTheory.ConcreteCategory.ofHom (Profinite.NobelingProof.iso_map C fun x => x ∈ Opposite.unop X)) ⋯).inv - Profinite.NobelingProof.spanFunctorIsoIndexFunctor_hom_app_hom_hom_apply_coe 📋 Mathlib.Topology.Category.Profinite.Nobeling.Basic
{I : Type u} {C : Set (I → Bool)} [(s : Finset I) → (i : I) → Decidable (i ∈ s)] (hC : IsCompact C) (X : (Finset I)ᵒᵖ) (x : ↑(Profinite.NobelingProof.π C fun x => x ∈ Opposite.unop X)) (i : { i // (fun x => x ∈ Opposite.unop X) i }) : ↑((TopCat.Hom.hom ((Profinite.NobelingProof.spanFunctorIsoIndexFunctor hC).hom.app X).hom) x) i = ↑x ↑i - Profinite.Nobeling.ι 📋 Mathlib.Topology.Category.Profinite.Nobeling.Induction
(S : Profinite) : ↑S.toTop → { C // IsClopen C } → Bool
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c