introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.28 kB
import Mathlib
import OAI.RepresentationTheory.PartialPermutation.Characters
import OAI.RepresentationTheory.PartialPermutation.IsotypicMatrices
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 BigOperators
open scoped MonoidAlgebra BigOperators
namespace PartialPermutation
open scoped MonoidAlgebra BigOperators ComplexConjugate
noncomputable section
variable {G M : Type*} [Group G]
[NormedAddCommGroup M] [InnerProductSpace β„‚ M]
[Module β„‚[G] M] [IsScalarTower β„‚ β„‚[G] M]
lemma ofModule'_algebra : (Representation.ofModule' (k := β„‚) (G := G) M).asAlgebraHom =
Algebra.lsmul β„‚ β„‚ M := by
exact (MonoidAlgebra.lift β„‚ (Module.End β„‚ M) G).apply_symm_apply _
lemma ofModule'_apply (g : G) (x : M) :
Representation.ofModule' (k := β„‚) (G := G) M g x =
(MonoidAlgebra.single g (1 : β„‚)) β€’ x := by
rw [← Representation.asAlgebraHom_single_one, ofModule'_algebra]
rfl
noncomputable def ofModule'ModuleEquiv :
(Representation.ofModule' (k := β„‚) (G := G) M).asModule ≃ₗ[β„‚[G]] M where
toFun x := x
invFun x := x
left_inv _ := rfl
right_inv _ := rfl
map_add' _ _ := rfl
map_smul' a x := by
change (Representation.ofModule' (k := β„‚) (G := G) M).asAlgebraHom a x = a β€’ (show M from x)
rw [ofModule'_algebra]
rfl
lemma ofModule'_irreducible [IsSimpleModule β„‚[G] M] :
Representation.IsIrreducible (Representation.ofModule' (k := β„‚) (G := G) M) := by
rw [Representation.irreducible_iff_isSimpleModule_asModule]
exact IsSimpleModule.congr (ofModule'ModuleEquiv (G := G) (M := M))
structure IsotypicKernelModel (G M : Type*) [Group G] [Fintype G]
[NormedAddCommGroup M] [InnerProductSpace β„‚ M]
[Module β„‚[G] M] [IsScalarTower β„‚ β„‚[G] M] extends IsotypicMatrixModel β„‚[G] M where
kernel : G β†’ β„‚
kernel_norm : βˆ‘ g, β€–kernel gβ€–^2 = (degree : ℝ)^2 / Fintype.card G
kernel_inv : βˆ€ g, kernel g⁻¹ = conj (kernel g)
kernel_action : βˆ€ x : M, βˆ‘ g, kernel g β€’ (MonoidAlgebra.single g (1 : β„‚)) β€’ x = x
variable [Fintype G]
lemma exists_isotypicKernelModel [FiniteDimensional β„‚ M] [Nontrivial M]
(h : IsIsotypic β„‚[G] M)
(hu : βˆ€ (g : G) (x y : M), inner β„‚ ((MonoidAlgebra.single g (1 : β„‚)) β€’ x)
((MonoidAlgebra.single g (1 : β„‚)) β€’ y) = inner β„‚ x y) :
Nonempty (IsotypicKernelModel G M) := by
have : Module.Finite β„‚[G] M := Module.Finite.of_restrictScalars_finite β„‚ β„‚[G] M
obtain ⟨m, hm, S, hS, ⟨e⟩⟩ := h.linearEquiv_fun
let : IsSimpleModule β„‚[G] S := hS
have : Nontrivial S := IsSimpleModule.nontrivial β„‚[G] S
have : FiniteDimensional β„‚ S :=
Module.Finite.of_injective (S.subtype.restrictScalars β„‚) S.subtype_injective
let : NormedAddCommGroup S := inferInstanceAs (NormedAddCommGroup (S.restrictScalars β„‚))
let : InnerProductSpace β„‚ S := inferInstanceAs (InnerProductSpace β„‚ (S.restrictScalars β„‚))
let Οƒ := Representation.ofModule' (k := β„‚) (G := G) S
have : Representation.IsIrreducible Οƒ := ofModule'_irreducible
have hσ : IsUnitary σ := by
intro g x y
change inner β„‚ (Representation.ofModule' (k := β„‚) (G := G) S g x)
(Representation.ofModule' (k := β„‚) (G := G) S g y) = _
rw [ofModule'_apply, ofModule'_apply]
exact hu g x.val y.val
let k : G β†’ β„‚ := fun g => ((Module.finrank β„‚ S : β„‚) / Fintype.card G) * conj (Οƒ.character g)
let F := (isotypicLift e).comp (Matrix.toLinAlgEquiv (Module.finBasis β„‚ S)).toAlgHom
refine ⟨{ degree := Module.finrank β„‚ S
degree_pos := Module.finrank_pos
lift := F
lift_image := fun A => isotypicLift_range e _
orbit := fun v => ⟨LinearMap.range (isotypicOrbitMap e v),
mem_isotypicOrbitMap_range e v, isotypicOrbitMap_range_invariant e v,
finrank_isotypicOrbitMap_range e v⟩
kernel := k
kernel_norm := ?_
kernel_inv := ?_
kernel_action := ?_ }⟩
Β· have hN : (Fintype.card G : ℝ) β‰  0 := by exact_mod_cast Fintype.card_ne_zero
simp only [k, norm_mul, norm_div, Complex.norm_natCast, Complex.norm_conj,
mul_pow, ← Finset.mul_sum, character_norm_sq_sum Οƒ hΟƒ]
field_simp
Β· intro g
simp [k, unitary_character_inv σ hσ]
· have he' := congrArg (isotypicLift e) (character_kernel_identity σ hσ)
have ha (g : G) : isotypicLift e (Οƒ g) =
Algebra.lsmul β„‚ β„‚ M (MonoidAlgebra.single g (1 : β„‚)) := by
change isotypicLift e (Representation.ofModule' (k := β„‚) (G := G) S g) = _
rw [← Representation.asAlgebraHom_single_one, ofModule'_algebra, isotypicLift_action]
change isotypicLift e (complexFourier Οƒ k) = isotypicLift e 1 at he'
simp only [complexFourier, map_sum, map_smul, map_one, ha] at he'
intro x
have ht := congrArg (fun A : Module.End β„‚ M => A x) he'
simpa only [LinearMap.sum_apply, LinearMap.smul_apply, Algebra.lsmul_apply,
Module.End.one_apply] using ht
end
end PartialPermutation
end
end OAI