introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.91 kB
import Mathlib
import OAI.RepresentationTheory.Saxl.Main
import OAI.RepresentationTheory.UniversalSquare.Balance.BalanceLeaves
import OAI.RepresentationTheory.UniversalSquare.Balance.BalanceLift
namespace OAI
/-! Balance Packing. -/
section
noncomputable section
open scoped TensorProduct
namespace Saxl.Balance
structure Packing {n d e : β„•} (v : WordSpace n d)
(A : Fin (d*d) β†’ Prop) (label : Fin (d*d) β†’ β„•) (w : WordSpace n e) where
G : Type
[groupG : Group G]
[finiteG : Finite G]
Y : Type
[addY : AddCommGroup Y]
[moduleY : Module β„‚ Y]
[finiteY : FiniteDimensional β„‚ Y]
c : Fin n β†’ β„•
Οƒ : β„• β†’ β„€
Ο† : G β†’* fiberGroup c
Ο„ : Representation β„‚ G Y
piece : Piece v c A label Οƒ Ο† Ο„
support : SupportLE (cyclic (wordRep n e) w).toRepresentation
(Representation.coind ((fiberGroup c).subtype.comp Ο†) Ο„)
attribute [instance] Packing.groupG Packing.finiteG Packing.addY Packing.moduleY Packing.finiteY
def Packing.join {n a b d E : β„•} {v : WordSpace a d} {u : WordSpace b d}
{A : Fin (d*d) β†’ Prop} {label : Fin (d*d) β†’ β„•}
{w : WordSpace a E} {z : WordSpace b E}
(P : Packing v A label w) (Q : Packing u A label z)
(e : Fin n ≃ Fin a βŠ• Fin b) (hd : βˆ€ i j, P.c i β‰  Q.c j) :
Packing (positionProduct e v u) A label (positionProduct e w z) := by
letI : AddCommGroup (P.Y βŠ—[β„‚] Q.Y) := Module.addCommMonoidToAddCommGroup β„‚
exact {
G := P.G Γ— Q.G
Y := P.Y βŠ—[β„‚] Q.Y
c := joinedLabels e P.c Q.c
Οƒ := P.Οƒ + Q.Οƒ
Ο† := (joinedFiberHom e P.c Q.c).comp (P.Ο†.prodMap Q.Ο†)
Ο„ := outer P.Ο„ Q.Ο„
piece := P.piece.join Q.piece e hd
support := product_supportLE_coind
((fiberGroup P.c).subtype.comp P.Ο†) ((fiberGroup Q.c).subtype.comp Q.Ο†)
P.Ο„ Q.Ο„ e w z P.support Q.support }
def Packing.map {n d e E : β„•} {v : WordSpace n d}
{A : Fin (d*d) β†’ Prop} {label : Fin (d*d) β†’ β„•} {w : WordSpace n e}
(P : Packing v A label w)
(T : Representation.IntertwiningMap (wordRep n e) (wordRep n E)) :
Packing v A label (T w) :=
{ P with support := P.support.cyclic_image w T }
def Packing.lift {n d D e : β„•} {v : WordSpace n d} {w : WordSpace n e}
(f : Fin d β†’ Fin D) (hf : βˆ€ a, (f a).val = a.val)
(A : Fin (D*D) β†’ Prop) (label : Fin (D*D) β†’ β„•)
(P : Packing v (A ∘ pairLetterMap f f) (label ∘ pairLetterMap f f) w) :
Packing (letterLift f v) A label w :=
{ P with piece := P.piece.lift f hf A label }
def Packing.replace {n d e E : β„•} {v : WordSpace n d}
{A : Fin (d*d) β†’ Prop} {label : Fin (d*d) β†’ β„•}
{w : WordSpace n e} (P : Packing v A label w) (z : WordSpace n E)
(h : SupportLE (cyclic (wordRep n E) z).toRepresentation
(cyclic (wordRep n e) w).toRepresentation) : Packing v A label z :=
{ P with support := h.trans P.support }
def boundedPacking {n e : β„•} {ΞΌ : YoungDiagram} (t : Tableau n ΞΌ)
(k : β„•) (I : Set β„•)
(A : Fin (ΞΌ.colLen 0 * ΞΌ.colLen 0) β†’ Prop)
(label : Fin (ΞΌ.colLen 0 * ΞΌ.colLen 0) β†’ β„•)
(h : βˆ€ a, (A a ∧ label a = k) ↔ output a ∈ I)
(hs : SupportLE (wordRep n e)
(projectedSpechtTensor t t (inOutputs I) (inOutputs_invariant I)).toRepresentation)
(w : WordSpace n e) : Packing (polytabloid t) A label w := by
let W := projectedSpechtTensor t t (inOutputs I) (inOutputs_invariant I)
let Ο† := (fiberGroup (fun _ : Fin n => k)).subtype.comp (singleFiberHom n k)
have hi : Function.Injective (coindLift (ρ := W.toRepresentation) Ο† (Representation.IntertwiningMap.id W.toRepresentation)) := by
intro x y hxy
have he := congrArg (fun z : Representation.coindV Ο† W.toRepresentation => z.val 1) hxy
change W.toRepresentation 1 x = W.toRepresentation 1 y at he
simpa only [map_one,Module.End.one_apply] using he
refine {
G := Equiv.Perm (Fin n)
Y := W.toSubmodule
c := fun _ => k
Οƒ := columnOutputSums t (fun _ => k)
Ο† := singleFiberHom n k
Ο„ := W.toRepresentation
piece := projectedPiece t k I A label h
support := ?_ }
exact ((SupportLE.of_injective (subrepInclusion (cyclic (wordRep n e) w))
Subtype.val_injective).trans hs).trans (SupportLE.of_injective _ hi)
theorem Packing.kronecker_pos {n : β„•} {lam ΞΌ ΞΈ : YoungDiagram}
(a : Tableau n lam) (t : Tableau n ΞΌ)
{A : Fin (lam.colLen 0 * lam.colLen 0) β†’ Prop}
{label : Fin (lam.colLen 0 * lam.colLen 0) β†’ β„•}
(w : Fin n β†’ Fin (ΞΈ.colLen 0))
(P : Packing (polytabloid a) A label (Pi.single w 1))
(ho : βˆ€ x y, A x β†’ A y β†’ label x < label y β†’ output x < output y)
(hc : ΞΌ.card = ΞΈ.card) (hd : Dominates ΞΌ ΞΈ)
(e : Equiv.Perm (Fin (ΞΈ.colLen 0)))
(hw : βˆ€ j, (Finset.univ.filter (fun i => w i = e j)).card = ΞΈ.rowLen j) :
0 < kronecker a a t :=
P.piece.kronecker_pos a t ho ΞΈ hc hd w e hw P.support
end Saxl.Balance
end
end
end OAI