Conjugate inclusion detected in finite quotients
ProvedLocalConjugacy.Proof.LocalConjugacy.conjugate_le_of_finite_quotient_inclusionscompactnessgroup-theorylocal-conjugacy-prosolvableprofinite-groups
Let be a profinite group, let be any subgroup, and let be closed. For each open normal , write . Assume that for every , some satisfies . Then
This compactness principle recovers one conjugate inclusion from existence in every finite quotient. The subgroup need not be closed.
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
Formal statement
theorem LocalConjugacy.Proof.LocalConjugacy.conjugate_le_of_finite_quotient_inclusions :
∀ {G : Type u_1} [inst : Group.{u_1} G] [inst_1 : TopologicalSpace.{u_1} G]
[@LocalConjugacy.Proof.LocalConjugacy.Profinite.{u_1} G inst inst_1] (H K : @Subgroup.{u_1} G inst)
(hK :
@IsClosed.{u_1} G inst_1
(@SetLike.coe.{u_1, u_1} (@Subgroup.{u_1} G inst) G (@Subgroup.instSetLike.{u_1} G inst) K))
(hquot :
∀ (U : @OpenNormalSubgroup.{u_1} G inst inst_1),
@Exists.{u_1 + 1}
(@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1 (@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U)))
fun
(q :
@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))) =>
@LE.le.{u_1}
(@Subgroup.{u_1}
(@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1 (@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U)))
(@QuotientGroup.Quotient.group.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1 (@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U)))
(@Preorder.toLE.{u_1}
(@Subgroup.{u_1}
(@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U)))
(@QuotientGroup.Quotient.group.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U)))
(@PartialOrder.toPreorder.{u_1}
(@Subgroup.{u_1}
(@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U)))
(@QuotientGroup.Quotient.group.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U)))
(@Subgroup.instPartialOrder.{u_1}
(@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U)))
(@QuotientGroup.Quotient.group.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U)))))
(@LocalConjugacy.Proof.LocalConjugacy.conjugate.{u_1}
(@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1 (@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U)))
(@QuotientGroup.Quotient.group.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1 (@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U))
q
(@Subgroup.map.{u_1, u_1} G inst
(@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U)))
(@QuotientGroup.Quotient.group.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U))
(@QuotientGroup.mk'.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1
(@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U))
H))
(@Subgroup.map.{u_1, u_1} G inst
(@HasQuotient.Quotient.{u_1, u_1} G (@Subgroup.{u_1} G inst)
(@QuotientGroup.instHasQuotientSubgroup.{u_1} G inst)
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1 (@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U)))
(@QuotientGroup.Quotient.group.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1 (@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U))
(@QuotientGroup.mk'.{u_1} G inst
(@OpenSubgroup.toSubgroup.{u_1} G inst inst_1 (@OpenNormalSubgroup.toOpenSubgroup.{u_1} G inst inst_1 U))
(@OpenNormalSubgroup.instNormal.{u_1} G inst inst_1 U))
K)),
@Exists.{u_1 + 1} G fun (g : G) =>
@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)))
(@LocalConjugacy.Proof.LocalConjugacy.conjugate.{u_1} G inst g H) K := by sorrySource
Michael C. Burkhart, Local conjugacy in prosolvable groups, https://arxiv.org/abs/2609.37678; supporting formalization lemma, LocalConjugacy/FiniteQuotientConjugacy.lean, lines 72–107; source SHA-256 3da38790196a0816d87c4121caf78b023936182eabc6e1998473304af2d601bf.