File size: 2,517 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
import Mathlib

namespace OAI

noncomputable section
open scoped BigOperators MonoidAlgebra

namespace BinaryCoordinateSweeps
namespace Irrep

variable {G V : Type*} [Group G] [Fintype G]
  [AddCommGroup V] [Module β„‚ V] [FiniteDimensional β„‚ V]
  (ρ : Representation β„‚ G V) [ρ.IsIrreducible]

omit [Fintype G] [FiniteDimensional β„‚ V] in
lemma invariant_eq_zero_of_finrank_gt_one (hD : 1 < Module.finrank β„‚ V)
    (v : V) (hv : βˆ€ g, ρ g v = v) : v = 0 := by
  let f : Representation.IntertwiningMap (1 : Representation β„‚ G β„‚) ρ :=
    (LinearMap.toSpanSingleton β„‚ V v).intertwiningMap_of_isIntertwiningMap _ _ (by
      intro g c
      simp only [MonoidHom.one_apply, Module.End.one_apply, LinearMap.toSpanSingleton_apply,
        map_smul, hv])
  rcases Representation.IsIrreducible.surjective_or_eq_zero f with hf | hf
  Β· have hd := LinearMap.finrank_le_finrank_of_surjective (f := f.toLinearMap) hf
    simp only [Module.finrank_self] at hd
    omega
  Β· have hh := congrArg (fun a : Representation.IntertwiningMap
        (1 : Representation β„‚ G β„‚) ρ => a (1 : β„‚)) hf
    simpa [f] using hh

omit [FiniteDimensional β„‚ V] in
lemma sum_apply_eq_zero_of_finrank_gt_one (hD : 1 < Module.finrank β„‚ V) (x : V) :
    βˆ‘ g : G, ρ g x = 0 := by
  apply invariant_eq_zero_of_finrank_gt_one ρ hD
  intro g
  simp only [map_sum, ← Module.End.mul_apply, ← map_mul]
  exact Function.Bijective.sum_comp (Group.mulLeft_bijective g) (fun h : G => ρ h x)

omit [FiniteDimensional β„‚ V] in
lemma sum_eq_zero_of_finrank_gt_one (hD : 1 < Module.finrank β„‚ V) :
    βˆ‘ g : G, ρ g = 0 := by
  ext x
  simpa using sum_apply_eq_zero_of_finrank_gt_one ρ hD x

include ρ in
omit [FiniteDimensional β„‚ V] in
lemma finrank_le_card : Module.finrank β„‚ V ≀ Fintype.card G := by
  let : IsSimpleModule β„‚[G] ρ.asModule := inferInstance
  let : Nontrivial ρ.asModule := IsSimpleModule.nontrivial β„‚[G] ρ.asModule
  obtain ⟨v, hv⟩ := exists_ne (0 : ρ.asModule)
  let f : β„‚[G] β†’β‚—[β„‚] ρ.asModule :=
    (LinearMap.toSpanSingleton β„‚[G] ρ.asModule v).restrictScalars β„‚
  have hf : Function.Surjective f := IsSimpleModule.toSpanSingleton_surjective β„‚[G] hv
  have hd := LinearMap.finrank_le_finrank_of_surjective (f := f) hf
  have he : Module.finrank β„‚ ρ.asModule = Module.finrank β„‚ V :=
    ρ.asModuleEquiv.finrank_eq
  rw [he] at hd
  rw [Module.finrank_eq_card_basis (MonoidAlgebra.basis G β„‚)] at hd
  exact hd

end Irrep
end BinaryCoordinateSweeps

end

end OAI