File size: 4,130 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 | import Mathlib
import OAI.RepresentationTheory.PartialPermutation.ProjectionEnergy
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
namespace PartialPermutation
noncomputable section
variable {G : Type*} [Group G] [Fintype G]
def smallTypeKernel (G : Type*) [Group G] [Fintype G] (R : β) : G β β :=
fun g => β c : IrreducibleIndex G,
if (irreducibleDegree c : β) β€ R then centralCharacterKernel (irreducibleRep c) g else 0
lemma smallTypeKernel_inv (R : β) (g : G) :
smallTypeKernel G R gβ»ΒΉ = conj (smallTypeKernel G R g) := by
simp only [smallTypeKernel, map_sum]
apply Finset.sum_congr rfl
intro c _
split_ifs <;> simp [centralCharacterKernel_inv _ (irreducibleRep_unitary c)]
lemma complexFourier_smallTypeKernel {V : Type*} [AddCommGroup V] [Module β V]
[FiniteDimensional β V] (Ο : Representation β G V) [Representation.IsIrreducible Ο]
(R : β) : complexFourier Ο (smallTypeKernel G R) =
if (Module.finrank β V : β) β€ R then 1 else 0 := by
classical
obtain β¨c, β¨eβ©, hcβ© := irreducibleRep_complete Ο
have hdeg : irreducibleDegree c = Module.finrank β V := e.toLinearEquiv.finrank_eq
have he (d : IrreducibleIndex G) :
Nonempty (Representation.Equiv (irreducibleRep d) Ο) β d = c := by
exact β¨hc d, fun h => h βΈ β¨eβ©β©
unfold smallTypeKernel
rw [complexFourier_sum]
calc
_ = β d : IrreducibleIndex G, if d = c then
(if (Module.finrank β V : β) β€ R then (1 : Module.End β V) else 0) else 0 := by
apply Finset.sum_congr rfl
intro d _
by_cases hd : (irreducibleDegree d : β) β€ R
Β· simp only [hd, ite_true, centralCharacterKernel_fourier]
by_cases hdc : d = c
Β· subst d
rw [hdeg] at hd
simp [he, hd]
Β· simp [he, hdc]
Β· simp only [hd, ite_false, complexFourier]
by_cases hdc : d = c
Β· subst d
simp [hdeg] at hd
simp [hd]
Β· simp [hdc]
_ = _ := by simp
@[simp] lemma hsNormSq_one {V : Type*} [NormedAddCommGroup V] [InnerProductSpace β V]
[FiniteDimensional β V] : hsNormSq (1 : Module.End β V) = Module.finrank β V := by
simp [hsNormSq, LinearMap.trace_one]
lemma degree_le_of_kernel_identity {V : Type*} [NormedAddCommGroup V]
[InnerProductSpace β V] [FiniteDimensional β V]
(Ο : Representation β G V) [Representation.IsIrreducible Ο] (hΟ : IsUnitary Ο)
(k : G β β) (d : β) (hk : β g, βk gβ^2 = (d : β)^2 / Fintype.card G)
(hact : complexFourier Ο k = 1) : Module.finrank β V β€ d := by
have h := fourier_bessel Ο hΟ k
have hN : (Fintype.card G : β) β 0 := by exact_mod_cast Fintype.card_ne_zero
rw [hact, hsNormSq_one, hk] at h
have hd : (Module.finrank β V : β)^2 β€ (d : β)^2 := by
convert h using 1 <;> field_simp
exact_mod_cast (sq_le_sqβ (by positivity) (by positivity)).mp hd
lemma smallTypeKernel_identity_of_kernel {V : Type*} [NormedAddCommGroup V]
[InnerProductSpace β V] [FiniteDimensional β V]
(Ο : Representation β G V) (hΟ : IsUnitary Ο)
(k : G β β) (d : β) (R : β) (hd : (d : β) β€ R)
(hk : β g, βk gβ^2 = (d : β)^2 / Fintype.card G)
(hact : complexFourier Ο k = 1) : complexFourier Ο (smallTypeKernel G R) = 1 := by
apply linearMap_eq_on_simples Ο
intro Ο hΟ x
have := hΟ
have hu : IsUnitary Ο.toRepresentation := fun g x y => hΟ g x y
have hs : complexFourier Ο.toRepresentation k = 1 := by
ext y
rw [complexFourier_subrep, hact]
rfl
have hdeg := degree_le_of_kernel_identity Ο.toRepresentation hu k d hk hs
have hdegR : (Module.finrank β Ο.toSubmodule : β) β€ R := (Nat.cast_le.mpr hdeg).trans hd
rw [β complexFourier_subrep, complexFourier_smallTypeKernel, ite_eq_left hdegR]
rfl
end
end PartialPermutation
end
end OAI
|