introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.8 kB
import Mathlib
import OAI.RepresentationTheory.PartialPermutation.ComponentGeometry
import OAI.RepresentationTheory.PartialPermutation.MatrixDegrees
import OAI.RepresentationTheory.PartialPermutation.Restriction
import OAI.RepresentationTheory.PartialPermutation.IsotypicKernels
import OAI.RepresentationTheory.PartialPermutation.DegreeEstimates
import OAI.RepresentationTheory.PartialPermutation.BlockSubgroups
namespace OAI
section
open scoped Classical
open scoped BigOperators ComplexConjugate MonoidAlgebra
open scoped BigOperators ComplexConjugate
open scoped MonoidAlgebra BigOperators
open scoped BigOperators MonoidAlgebra Classical
attribute [local instance] Classical.propDecidable
open scoped MonoidAlgebra BigOperators
open scoped BigOperators
namespace PartialPermutation
open scoped MonoidAlgebra BigOperators ComplexConjugate
noncomputable section
lemma isotypic_joint_kernels {G M : Type*} [Group G] [Fintype G]
[NormedAddCommGroup M] [InnerProductSpace β„‚ M]
[Module β„‚[G] M] [IsScalarTower β„‚ β„‚[G] M]
[FiniteDimensional β„‚ M] [Nontrivial M]
{b : β„•} (H : Fin b β†’ Subgroup G) (hgen : ⨆ i, H i = ⊀)
(hcomm : βˆ€ i j, i β‰  j β†’ βˆ€ g ∈ H i, βˆ€ k ∈ H j, Commute g k)
(h : IsIsotypic β„‚[G] M)
(hu : βˆ€ (g : G) (x y : M), inner β„‚ ((MonoidAlgebra.single g (1 : β„‚)) β€’ x)
((MonoidAlgebra.single g (1 : β„‚)) β€’ y) = inner β„‚ x y) :
βˆƒ d : Fin b β†’ β„•, (βˆ€ i, 0 < d i) ∧ (∏ i, d i) ≀ Module.finrank β„‚ M ∧
βˆ€ i, βˆƒ k : H i β†’ β„‚,
(βˆ‘ g, β€–k gβ€–^2 = (d i : ℝ)^2 / Fintype.card (H i)) ∧
(βˆ€ g, k g⁻¹ = conj (k g)) ∧
(βˆ€ x : M, βˆ‘ g, k g β€’ (MonoidAlgebra.single (g : G) (1 : β„‚)) β€’ x = x) := by
classical
let (i : Fin b) : Module β„‚[H i] M := restrictGroupModule (H i)
let (i : Fin b) : IsScalarTower β„‚ β„‚[H i] M := restrictGroupModule_tower (H i)
have hmodels (i : Fin b) : Nonempty (IsotypicKernelModel (H i) M) := by
apply exists_isotypicKernelModel (group_isotypic_restrict H hgen hcomm h i)
intro g x y
change inner β„‚ ((MonoidAlgebra.mapDomainAlgHom β„‚ β„‚ (H i).subtype
(MonoidAlgebra.single g (1 : β„‚))) β€’ x)
((MonoidAlgebra.mapDomainAlgHom β„‚ β„‚ (H i).subtype
(MonoidAlgebra.single g (1 : β„‚))) β€’ y) = _
simpa [MonoidAlgebra.mapDomainAlgHom] using hu g x y
let F (i : Fin b) := Classical.choice (hmodels i)
have hAcomm (i j : Fin b) (hij : i β‰  j) (X Y) : Commute ((F i).lift X) ((F j).lift Y) := by
obtain ⟨r, hr⟩ := (F i).lift_image X
obtain ⟨s, hs⟩ := (F j).lift_image Y
rw [hr, hs]
have he (i : Fin b) (r : β„‚[H i]) : Algebra.lsmul β„‚ β„‚ M r =
Algebra.lsmul β„‚ β„‚ M (MonoidAlgebra.mapDomainAlgHom β„‚ β„‚ (H i).subtype r) := by
ext x
rfl
rw [he i r, he j s]
exact (subgroup_algebra_commute (H i) (H j) (hcomm i j hij) r s).map
(Algebra.lsmul β„‚ β„‚ M : β„‚[G] →ₐ[β„‚] Module.End β„‚ M)
refine ⟨fun i => (F i).degree, fun i => (F i).degree_pos, ?_, ?_⟩
Β· exact commuting_degrees_le_finrank (fun i => (F i).degree)
(fun i => (F i).degree_pos) (fun i => (F i).lift) hAcomm Finset.univ
Β· intro i
refine ⟨(F i).kernel, (F i).kernel_norm, (F i).kernel_inv, ?_⟩
intro x
have ht := (F i).kernel_action x
change βˆ‘ g, (F i).kernel g β€’ (MonoidAlgebra.mapDomainAlgHom β„‚ β„‚ (H i).subtype
(MonoidAlgebra.single g (1 : β„‚))) β€’ x = x at ht
simpa [MonoidAlgebra.mapDomainAlgHom] using ht
section ComponentKernel
variable {G V : Type*} [Group G] [Fintype G]
[NormedAddCommGroup V] [InnerProductSpace β„‚ V] [FiniteDimensional β„‚ V]
(ρ : Representation β„‚ G V) {b : β„•} (H : Fin b β†’ Subgroup G)
lemma component_kernel (hb : 0 < b) (hD : 0 < Module.finrank β„‚ V) (hρ : IsUnitary ρ)
(hcomm : βˆ€ i j, i β‰  j β†’ βˆ€ g ∈ H i, βˆ€ k ∈ H j, Commute g k)
(c : isotypicComponents β„‚[β†₯(⨆ i, H i)] (Representation.asModule (ρ.comp (⨆ i, H i).subtype))) :
βˆƒ i, βˆƒ d : β„•, βˆƒ k : H i β†’ β„‚,
(d : ℝ) ≀ (Module.finrank β„‚ V : ℝ) ^ (1 / (b : ℝ)) ∧
(βˆ‘ g, β€–k gβ€–^2 = (d : ℝ)^2 / Fintype.card (H i)) ∧
(βˆ€ g, k g⁻¹ = conj (k g)) ∧
(βˆ€ x ∈ componentSpace (ρ.comp (⨆ i, H i).subtype) c,
complexFourier (ρ.comp (H i).subtype) k x = x) := by
classical
let J := ⨆ i, H i
let ρJ : Representation β„‚ J V := ρ.comp J.subtype
let : NormedAddCommGroup c.val :=
inferInstanceAs (NormedAddCommGroup (componentSpace ρJ c))
let : InnerProductSpace β„‚ c.val :=
inferInstanceAs (InnerProductSpace β„‚ (componentSpace ρJ c))
let : FiniteDimensional β„‚ c.val :=
inferInstanceAs (FiniteDimensional β„‚ (componentSpace ρJ c))
let inc : c.val β†’β‚—[β„‚] V := c.val.subtype.restrictScalars β„‚
have hinc (g : J) (x : c.val) :
inc ((MonoidAlgebra.single g (1 : β„‚)) β€’ x) = ρ (g : G) (inc x) := by
change ρJ.asAlgebraHom (MonoidAlgebra.single g 1) (inc x) = _
rw [Representation.asAlgebraHom_single, one_smul]
rfl
have hu : βˆ€ (g : J) (x y : c.val),
inner β„‚ ((MonoidAlgebra.single g (1 : β„‚)) β€’ x)
((MonoidAlgebra.single g (1 : β„‚)) β€’ y) = inner β„‚ x y := by
intro g x y
change inner β„‚ (inc ((MonoidAlgebra.single g (1 : β„‚)) β€’ x))
(inc ((MonoidAlgebra.single g (1 : β„‚)) β€’ y)) = inner β„‚ (inc x) (inc y)
rw [hinc, hinc]
exact hρ (g : G) (inc x) (inc y)
obtain ⟨d, hdpos, hprod, hkernel⟩ := isotypic_joint_kernels
(M := c.val) (fun i => (H i).subgroupOf J)
(jointFactors_generate H) (jointFactors_commute H hcomm)
(IsIsotypic.isotypicComponents c.property) hu
have hdim : Module.finrank β„‚ c.val ≀ Module.finrank β„‚ V :=
Submodule.finrank_le (componentSpace ρJ c)
obtain ⟨i, hi⟩ := exists_degree_le_rpow hb hD d (hprod.trans hdim)
obtain ⟨k, hk, hki, hka⟩ := hkernel i
let e := Subgroup.subgroupOfEquivOfLe (le_iSup H i)
let k' : H i β†’ β„‚ := fun g => k (e.symm g)
refine ⟨i, d i, k', hi, ?_, ?_, ?_⟩
Β· have he : βˆ‘ g, β€–k' gβ€–^2 = βˆ‘ g, β€–k gβ€–^2 :=
Fintype.sum_equiv e.symm.toEquiv _ _ (fun g => rfl)
rw [he, hk, Fintype.card_congr e.toEquiv]
Β· intro g
simp only [k', map_inv, hki]
Β· intro x hx
have ht := congrArg inc (hka ⟨x, hx⟩)
have hix : inc ⟨x, hx⟩ = x := rfl
have ht' : βˆ‘ g : (H i).subgroupOf J, k g β€’ ρ (g.val.val) x = x := by
simpa only [map_sum, map_smul, hinc, hix] using ht
rw [complexFourier, LinearMap.sum_apply]
calc
_ = βˆ‘ g : (H i).subgroupOf J, k g β€’ ρ (g.val.val) x := by
exact Fintype.sum_equiv e.symm.toEquiv _ _ (fun g => rfl)
_ = x := ht'
end ComponentKernel
end
end PartialPermutation
end
end OAI