Cup product of level-constant 1-cocycles is level-constant
ProvedgroupCohomology.cup_mem_levelCocycles2Let be a commutative ring and a group, and let be a group homomorphism into the group of -algebra automorphisms of AlgebraicClosure ℚ (the level map). Let , , be -linear representations of and let be a -bilinear map which satisfies Rep.IsEquivariantBilinear, i.e. for all , , . Assume is smooth for in the following sense: for every there is an intermediate field of with finite-dimensional over such that for every with in the fixing subgroup of . Finally let be a -cocycle of and a -cocycle of , both level-constant for in the sense of the predicate IsLevelConstant₁. The conclusion is that the underlying function of the cup product cup φ hφ f g, namely , lies in levelCocycles₂ r N, the set of level-constant -cocycles of for .
This is the statement that the degree cup product of group cohomology preserves level-constancy, so that it descends to a pairing on the continuous (level-constant) cohomology groups attached to the level map . It is used in the comparison results identifying continuous cohomology of induced, coinduced and retracted modules with the corresponding algebraic cohomology.
import Mathlib import Definitions.Def_GroupCohomology_ContinuousH2 import Definitions.Def_GroupCohomology_CupProduct set_option maxHeartbeats 4000000 set_option synthInstance.maxHeartbeats 400000 set_option backward.isDefEq.respectTransparency.types false set_option autoImplicit false universe u open CategoryTheory groupCohomology
theorem groupCohomology.cup_mem_levelCocycles2
{k G : Type u} [CommRing k] [Group G]
(r : G →* (AlgebraicClosure ℚ ≃ₐ[ℚ] AlgebraicClosure ℚ))
{A B N : Rep.{u} k G} (φ : A →ₗ[k] B →ₗ[k] N) (hφ : Rep.IsEquivariantBilinear A B N φ)
(hB : ∀ b : B, ∃ F : IntermediateField ℚ (AlgebraicClosure ℚ), FiniteDimensional ℚ F ∧
∀ s, r s ∈ F.fixingSubgroup → B.ρ s b = b)
(f : cocycles₁ A) (g : cocycles₁ B)
(hf : IsLevelConstant₁ r (⇑f)) (hg : IsLevelConstant₁ r (⇑g)) :
(cup φ hφ f g : G × G → N) ∈ levelCocycles₂ r N := by sorry