introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.12 kB
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