Conjugacy from directed closed approximations
ProvedLocalConjugacy.Proof.LocalConjugacy.conjugate_of_closed_approximationscompactnessgroup-theorylocal-conjugacy-prosolvabletopological-groups
Let be a topological group with compact underlying space, and let . Let and be families of closed subgroups indexed by a nonempty set . Suppose that and . Assume the families are jointly downward directed: for every there is with and . Finally, suppose that for every there is such that and . Then
This compactness lemma assembles compatible approximate conjugacy conditions into an exact conjugacy.
Preamble
import Definitions.Def_LocalConjugacy_Groups import Definitions.Def_LocalConjugacy_Cohomology import Definitions.Def_LocalConjugacy_Examples import Definitions.Def_LocalConjugacy_Proof_Definitions import Definitions.Def_LocalConjugacy_Proof_Bridges import Definitions.Def_LocalConjugacy_Proof_Counterexamples_Heisenberg import Definitions.Def_LocalConjugacy_Proof_Counterexamples_HeisenbergStructure import Definitions.Def_LocalConjugacy_Proof_Counterexamples_HeisenbergSupersolvable import Definitions.Def_LocalConjugacy_Proof_ConcreteGroups import Definitions.Def_LocalConjugacy_Targets import Definitions.Def_LocalConjugacy_Proof_Compactness import Definitions.Def_LocalConjugacy_Proof_ProfiniteSylow import Definitions.Def_LocalConjugacy_Proof_StructuralImages import Definitions.Def_LocalConjugacy_Proof_FiniteAbelianCohomology import Definitions.Def_LocalConjugacy_Proof_AbelianComplement import Definitions.Def_LocalConjugacy_Proof_QuotientReduction import Definitions.Def_LocalConjugacy_Proof_Cohomology import Definitions.Def_LocalConjugacy_Proof_InvariantRestriction import Definitions.Def_LocalConjugacy_Proof_CocycleActions import Definitions.Def_LocalConjugacy_Proof_CoprimeCohomology import Definitions.Def_LocalConjugacy_Proof_CocycleDescent import Definitions.Def_LocalConjugacy_Proof_CocycleZorn import Definitions.Def_LocalConjugacy_Proof_CocycleProducts import Definitions.Def_LocalConjugacy_Proof_FiniteCoefficientSubgroup import Definitions.Def_LocalConjugacy_Proof_CocycleInvarianceSubgroup import Definitions.Def_LocalConjugacy_Proof_CocycleInjectivity import Definitions.Def_LocalConjugacy_Proof_CocycleRebase import Definitions.Def_LocalConjugacy_Proof_FiniteHall import Definitions.Def_LocalConjugacy_Proof_SupersolvableStructure import Definitions.Def_LocalConjugacy_Proof_ProfiniteHall import Definitions.Def_LocalConjugacy_Proof_ActionProductTopology import Definitions.Def_LocalConjugacy_Proof_HallCohomology import Definitions.Def_LocalConjugacy_Proof_SupersolvableRestriction import Definitions.Def_LocalConjugacy_Proof_NilpotentCoefficients import Definitions.Def_LocalConjugacy_Proof_NonabelianComplement import Definitions.Def_LocalConjugacy_Proof_ComplementSupersolvable import Definitions.Def_LocalConjugacy_Proof_Counterexamples_Quaternion import Definitions.Def_LocalConjugacy_Proof_QuaternionCohomology import Definitions.Def_LocalConjugacy_Proof_QuaternionMatrices import Definitions.Def_LocalConjugacy_Proof_QuaternionAction import Definitions.Def_LocalConjugacy_Proof_QuaternionComplements universe u_1 u_2
Formal statement
theorem LocalConjugacy.Proof.LocalConjugacy.conjugate_of_closed_approximations :
∀ {G : Type u_1} [inst : Group.{u_1} G] [inst_1 : TopologicalSpace.{u_1} G] [@IsTopologicalGroup.{u_1} G inst_1 inst]
[@CompactSpace.{u_1} G inst_1] {ι : Type u_2} [Nonempty.{u_2 + 1} ι] (H K : @Subgroup.{u_1} G inst)
(Hs Ks : ι → @Subgroup.{u_1} G inst)
(hHclosed :
∀ (i : ι),
@IsClosed.{u_1} G inst_1
(@SetLike.coe.{u_1, u_1} (@Subgroup.{u_1} G inst) G (@Subgroup.instSetLike.{u_1} G inst) (Hs i)))
(hKclosed :
∀ (i : ι),
@IsClosed.{u_1} G inst_1
(@SetLike.coe.{u_1, u_1} (@Subgroup.{u_1} G inst) G (@Subgroup.instSetLike.{u_1} G inst) (Ks i)))
(hHsep :
∀ (x : G),
(∀ (i : ι),
@Membership.mem.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@SetLike.instMembership.{u_1, u_1} (@Subgroup.{u_1} G inst) G (@Subgroup.instSetLike.{u_1} G inst)) (Hs i)
x) →
@Membership.mem.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@SetLike.instMembership.{u_1, u_1} (@Subgroup.{u_1} G inst) G (@Subgroup.instSetLike.{u_1} G inst)) H x)
(hKsep :
∀ (x : G),
(∀ (i : ι),
@Membership.mem.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@SetLike.instMembership.{u_1, u_1} (@Subgroup.{u_1} G inst) G (@Subgroup.instSetLike.{u_1} G inst)) (Ks i)
x) →
@Membership.mem.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@SetLike.instMembership.{u_1, u_1} (@Subgroup.{u_1} G inst) G (@Subgroup.instSetLike.{u_1} G inst)) K x)
(hdir :
∀ (i j : ι),
@Exists.{u_2 + 1} ι fun (k : ι) =>
And
(@LE.le.{u_1} (@Subgroup.{u_1} G inst)
(@Preorder.toLE.{u_1} (@Subgroup.{u_1} G inst)
(@PartialOrder.toPreorder.{u_1} (@Subgroup.{u_1} G inst) (@Subgroup.instPartialOrder.{u_1} G inst)))
(Hs k) (Hs i))
(And
(@LE.le.{u_1} (@Subgroup.{u_1} G inst)
(@Preorder.toLE.{u_1} (@Subgroup.{u_1} G inst)
(@PartialOrder.toPreorder.{u_1} (@Subgroup.{u_1} G inst) (@Subgroup.instPartialOrder.{u_1} G inst)))
(Hs k) (Hs j))
(And
(@LE.le.{u_1} (@Subgroup.{u_1} G inst)
(@Preorder.toLE.{u_1} (@Subgroup.{u_1} G inst)
(@PartialOrder.toPreorder.{u_1} (@Subgroup.{u_1} G inst) (@Subgroup.instPartialOrder.{u_1} G inst)))
(Ks k) (Ks i))
(@LE.le.{u_1} (@Subgroup.{u_1} G inst)
(@Preorder.toLE.{u_1} (@Subgroup.{u_1} G inst)
(@PartialOrder.toPreorder.{u_1} (@Subgroup.{u_1} G inst) (@Subgroup.instPartialOrder.{u_1} G inst)))
(Ks k) (Ks j)))))
(hloc :
∀ (i : ι),
@Exists.{u_1 + 1} G fun (g : G) =>
And
(@Membership.mem.{u_1, u_1} G (Set.{u_1} G) (@Set.instMembership.{u_1} G)
(@LocalConjugacy.Proof.LocalConjugacy.transporter.{u_1} G inst H (Ks i)) g)
(@Membership.mem.{u_1, u_1} G (Set.{u_1} G) (@Set.instMembership.{u_1} G)
(@LocalConjugacy.Proof.LocalConjugacy.transporter.{u_1} G inst K (Hs i))
(@Inv.inv.{u_1} G
(@InvOneClass.toInv.{u_1} G
(@DivInvOneMonoid.toInvOneClass.{u_1} G
(@DivisionMonoid.toDivInvOneMonoid.{u_1} G (@Group.toDivisionMonoid.{u_1} G inst))))
g))),
@LocalConjugacy.Proof.LocalConjugacy.Conjugate.{u_1} G inst H K := by sorrySource
Michael C. Burkhart, Local conjugacy in prosolvable groups, https://arxiv.org/abs/2609.37678; supporting formalization lemma, LocalConjugacy/Compactness.lean, lines 25–63; source SHA-256 eef0c6ac937d8ae7cd7630c5bb1c65e493dfe169f8a6544ede12021be54df19e.