File size: 4,122 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 103 104 105 106 107 108 109 110 111 112 113 114 | import Mathlib
namespace OAI
open scoped Classical BigOperators ComplexConjugate MonoidAlgebra
namespace PartialPermutation
noncomputable section
def IsUnitary {G V : Type*} [Group G] [NormedAddCommGroup V]
[InnerProductSpace β V] (Ο : Representation β G V) : Prop :=
β g x y, inner β (Ο g x) (Ο g y) = inner β x y
section
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace β V]
[FiniteDimensional β V]
def hsNormSq (A : Module.End β V) : β :=
(LinearMap.trace β V (LinearMap.adjoint A * A)).re
end
def complexFourier {G V : Type*} [Group G] [Fintype G] [AddCommGroup V] [Module β V]
(Ο : Representation β G V) (f : G β β) : Module.End β V := β g, f g β’ Ο g
section
variable {G V : Type*} [Group G] [Fintype G] [AddCommGroup V] [Module β V]
[FiniteDimensional β V] (Ο : Representation β G V)
noncomputable def componentSimple (c : isotypicComponents β[G] Ο.asModule) :
Submodule β[G] Ο.asModule := c.property.choose
instance components_finite : Finite (isotypicComponents β[G] Ο.asModule) := by
let : IsNoetherian β[G] Ο.asModule := isNoetherian_of_tower β inferInstance
infer_instance
end
section
variable (G : Type*) [Group G] [Fintype G]
def regularRep : Representation β G (EuclideanSpace β G) where
toFun g :=
{ toFun := fun f => WithLp.toLp 2 (fun h => f (gβ»ΒΉ * h))
map_add' := by intros; rfl
map_smul' := by intros; rfl }
map_one' := by ext f h; simp
map_mul' := by
intro x y
ext f h
change f ((x * y)β»ΒΉ * h) = f (yβ»ΒΉ * (xβ»ΒΉ * h))
simp [mul_assoc]
end
section
variable {G : Type*} [Group G] [Fintype G]
abbrev IrreducibleIndex (G : Type*) [Group G] [Fintype G] :=
isotypicComponents β[G] (regularRep G).asModule
noncomputable instance irreducibleIndex_fintype : Fintype (IrreducibleIndex G) :=
Fintype.ofFinite _
abbrev irreducibleSpace (c : IrreducibleIndex G) :=
(Subrepresentation.ofSubmodule' (componentSimple (regularRep G) c)).toSubmodule
abbrev irreducibleDegree (c : IrreducibleIndex G) := Module.finrank β (irreducibleSpace c)
end
def mass {G : Type*} [Fintype G] (f : G β β) : β := β g, f g
def LeftCosetCap {G : Type*} [Group G] [Fintype G]
(f : G β β) (H : Subgroup G) (B : β) : Prop :=
by classical exact β g, β h : H, f (g * h) β€ B / H.index
def blockSubgroup {X : Type*} (M : Set X) : Subgroup (Equiv.Perm X) where
carrier := {g | β x, x β M β g x = x}
one_mem' := by simp
mul_mem' := by
intro g h hg hh x hx
simp only [Set.mem_ofPred_eq] at hg hh β’
simp [Equiv.Perm.mul_apply, hh x hx, hg x hx]
inv_mem' := by
intro g hg x hx
exact ((Equiv.eq_symm_apply g).mpr (hg x hx)).symm
def inverseDegreeSum (G : Type*) [Group G] [Fintype G] (u : β) : β :=
β c : IrreducibleIndex G, (irreducibleDegree c : β)^(-u)
def symmetricInverseDegreeSum (n : β) (u : β) : β :=
inverseDegreeSum (Equiv.Perm (Fin n)) u
def symmetricDegreeConstant (u : β) : β :=
sSup {x : β | β n : β, 1 β€ n β§ x = symmetricInverseDegreeSum n u}
def ComplementaryCosetsFiniteStatement : Prop :=
β (X : Type*) [Fintype X] [DecidableEq X] (b : β) (_ : 0 < b) (M : Fin b β Set X),
(β i, (M i).Nonempty) β
Pairwise (fun i j => Disjoint (M i) (M j)) β (β i, M i) = Set.univ β
β (V : Type) [NormedAddCommGroup V] [InnerProductSpace β V]
[FiniteDimensional β V] (Ο : Representation β (Equiv.Perm X) V),
Representation.IsIrreducible Ο β IsUnitary Ο β
β (f : Equiv.Perm X β β) (B u : β),
(β g, 0 β€ f g) β mass f β€ 1 β 0 < u β
(β i, LeftCosetCap f (blockSubgroup (M i)) B) β
(hsNormSq (complexFourier Ο (fun g => f g)) β€
b * B * symmetricDegreeConstant u *
(Module.finrank β V : β)^(-1+(u+2)/(b : β))) β§
(βLinearMap.toContinuousLinearMap (complexFourier Ο (fun g => f g))β^2 β€
b * B * symmetricDegreeConstant u *
(Module.finrank β V : β)^(-1+(u+2)/(b : β)))
end
end PartialPermutation
end OAI
|