The complement projection is an abelian cocycle
ProvedLocalConjugacy.Proof.LocalConjugacy.AbelianComplement.projection_mulgroup-cohomologygroup-theorylocal-conjugacy-prosolvablesemidirect-products
Let be a group, let be abelian, and let complement , so every has a unique expression with and . Define . Then, for all ,
Thus projection onto an abelian normal factor is a -cocycle for the conjugation action of on . This connects complement geometry with cocycle calculations.
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.AbelianComplement.projection_mul :
∀ {G : Type u_1} [inst : Group.{u_1} G] (N H : @Subgroup.{u_1} G inst) [inst_1 : @Subgroup.Normal.{u_1} G inst N]
(hc : @Subgroup.IsComplement'.{u_1} G inst N H)
(hcomm :
∀
(n m :
@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x),
@Eq.{u_1 + 1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@HMul.hMul.{u_1, u_1, u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@instHMul.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subgroup.mul.{u_1} G inst N))
n m)
(@HMul.hMul.{u_1, u_1, u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@instHMul.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subgroup.mul.{u_1} G inst N))
m n))
(x y : G),
@Eq.{u_1 + 1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@LocalConjugacy.Proof.LocalConjugacy.AbelianComplement.projection.{u_1} G inst N H hc
(@HMul.hMul.{u_1, u_1, u_1} G G G
(@instHMul.{u_1} G
(@MulOne.toMul.{u_1} G
(@MulOneClass.toMulOne.{u_1} G
(@Monoid.toMulOneClass.{u_1} G (@DivInvMonoid.toMonoid.{u_1} G (@Group.toDivInvMonoid.{u_1} G inst))))))
x y))
(@HMul.hMul.{u_1, u_1, u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@instHMul.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subgroup.mul.{u_1} G inst N))
(@LocalConjugacy.Proof.LocalConjugacy.AbelianComplement.projection.{u_1} G inst N H hc x)
(@DFunLike.coe.{u_1 + 1, u_1 + 1, u_1 + 1}
(@MulEquiv.{u_1, u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subgroup.mul.{u_1} G inst N) (@Subgroup.mul.{u_1} G inst N))
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(fun
(x :
@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x) =>
@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@EquivLike.toFunLike.{u_1 + 1, u_1 + 1, u_1 + 1}
(@MulEquiv.{u_1, u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subgroup.mul.{u_1} G inst N) (@Subgroup.mul.{u_1} G inst N))
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N x)
(@MulEquiv.instEquivLike.{u_1, u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subgroup.mul.{u_1} G inst N) (@Subgroup.mul.{u_1} G inst N)))
(@DFunLike.coe.{u_1 + 1, u_1 + 1, u_1 + 1}
(@MonoidHom.{u_1, u_1} G
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subgroup.mul.{u_1} G inst N))
(@MulOneClass.toMulOne.{u_1} G
(@Monoid.toMulOneClass.{u_1} G (@DivInvMonoid.toMonoid.{u_1} G (@Group.toDivInvMonoid.{u_1} G inst))))
(@MulOneClass.toMulOne.{u_1}
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N))
(@Monoid.toMulOneClass.{u_1}
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N))
(@DivInvMonoid.toMonoid.{u_1}
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N))
(@Group.toDivInvMonoid.{u_1}
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N))
(@MulAut.instGroup.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N)))))))
G
(fun (x : G) =>
@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subgroup.mul.{u_1} G inst N))
(@MonoidHom.instFunLike.{u_1, u_1} G
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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)) N
x)
(@Subgroup.mul.{u_1} G inst N))
(@MulOneClass.toMulOne.{u_1} G
(@Monoid.toMulOneClass.{u_1} G (@DivInvMonoid.toMonoid.{u_1} G (@Group.toDivInvMonoid.{u_1} G inst))))
(@MulOneClass.toMulOne.{u_1}
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N))
(@Monoid.toMulOneClass.{u_1}
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N))
(@DivInvMonoid.toMonoid.{u_1}
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N))
(@Group.toDivInvMonoid.{u_1}
(@MulAut.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N))
(@MulAut.instGroup.{u_1}
(@Subtype.{u_1 + 1} G fun (x : G) =>
@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))
N x)
(@Subgroup.mul.{u_1} G inst N)))))))
(@MulAut.conjNormal.{u_1} G inst N inst_1) x)
(@LocalConjugacy.Proof.LocalConjugacy.AbelianComplement.projection.{u_1} G inst N H hc y))) := by sorrySource
Michael C. Burkhart, Local conjugacy in prosolvable groups, https://arxiv.org/abs/2609.37678; supporting formalization lemma, LocalConjugacy/AbelianComplement.lean, lines 30–48; source SHA-256 5f3d2bd6c18cdb28379199f9ba0759ae270c1af94f4acaf839a6356c9f0c6128.