Corollary 2.2 (1)–(2), p. 13 — group morphisms out of and into a crossed product H #^f_α G
ProvedCrossedProductGroups.Classification.corollary_2_2crossed-productgroup-morphismp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1universal-property
Let be a group and a normalized crossed system.
- A map is a morphism of groups if and only if there are a group morphism and a map with
for all , (conditions (20)–(22)). 2. A map is a morphism of groups if and only if there are a map and a group morphism with
for all (conditions (23)–(24)).
These two descriptions are the working form of Theorem 2.1 and are the basis for computing all morphisms between two crossed products.
Formalization Note. Only items (1) and (2) of the corollary are formalized; items (3) and (4) (isomorphism criteria) are not used later in the paper's route to Theorem 3.8. A morphism of groups out of or into the crossed product is a map preserving the multiplication (8).
Preamble
import Mathlib import Definitions.Def_CrossedProductGroups_Classification_CrossedSystem
Formal statement
namespace CrossedProductGroups.Classification
theorem corollary_2_2 {H G : Type*} [Group H] [Group G] (α : G → MulAut H) (f : G → G → H)
(hc : IsCrossedSystem α f) (hn : f 1 1 = 1) (X : Type*) [Group X] :
(∀ w : H × G → X, (∀ x y : H × G, w (crossedMul α f x y) = w x * w y) ↔
∃ (u : H →* X) (v : G → X),
(∀ g₁ g₂ : G, v g₁ * v g₂ = u (f g₁ g₂) * v (g₁ * g₂)) ∧
(∀ g : G, ∀ h : H, v g * u h = u (α g h) * v g) ∧
∀ h : H, ∀ g : G, w (h, g) = u h * v g) ∧
(∀ ψ : X → H × G, (∀ x y : X, ψ (x * y) = crossedMul α f (ψ x) (ψ y)) ↔
∃ (u : X → H) (v : X →* G),
(∀ x y : X, u (x * y) = u x * α (v x) (u y) * f (v x) (v y)) ∧
∀ x : X, ψ x = (u x, v x)) := by sorry
end CrossedProductGroups.Classification
Source
Agore & Militaru, Crossed product of groups. Applications, arXiv:0805.4077v2, p. 13, Corollary 2.2 (1)–(2), (20)–(24)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.