math / data /lean /OAI /GroupTheory /SimpleAmenable /Configurations /LabelledStringEquiv.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.87 kB
import Mathlib
import OAI.GroupTheory.SimpleAmenable.Configurations.TrajectoryStages
import OAI.GroupTheory.SimpleAmenable.Simplicial.TripleBarMaps
namespace OAI
section
section
open _root_.CategoryTheory _root_.OAI.CategoryTheory MonoidalCategory
namespace SimpleAmenable.PolygonObject.Labelled
variable {a n : β„•}
noncomputable def initialCore : (toStrings (a:=a) (n:=n) β‹™ stringEval).CoreMonoidal :=
Functor.Monoidal.coreMonoidalTransport initialIso
lemma initialCore_unit : (initialCore (a:=a) (n:=n)).Ξ΅Iso.hom=initial (πŸ™_ _) := by
change πŸ™ _ ≫ initial (πŸ™_ _) = _
exact Category.id_comp _
lemma initialCore_tensor (U V : Labelled a n) :
(initialCore.ΞΌIso U V).hom=tensorInitial U V := by
change (inv (initial U) βŠ—β‚˜ inv (initial V)) ≫ πŸ™ _ ≫ initial (UβŠ—V) =
inv (sumArrow (initial U) (initial V)) ≫ initial (UβŠ—V)
simp only [Category.id_comp]
congr 1
apply (cancel_epi (sumArrow (initial U) (initial V))).mp
change (initial U βŠ—β‚˜ initial V) ≫ (inv (initial U) βŠ—β‚˜ inv (initial V)) = _
rw [tensorHom_comp_tensorHom]
simp
rfl
noncomputable def stringsCore : (toStrings (a:=a) (n:=n)).CoreMonoidal where
Ξ΅Iso := @asIso (StringGroupoid a n) _ _ _ unitLadder
(IsIso.of_groupoid (C := StringGroupoid a n) _)
ΞΌIso U V := @asIso (StringGroupoid a n) _ _ _ (tensorLadder U V)
(IsIso.of_groupoid (C := StringGroupoid a n) _)
ΞΌIso_hom_natural_left := by
intro U V f W
apply (stringEval (a:=a) (n:=n)).map_injective
change sumArrow ((ladder f).hom.app 0) (πŸ™ _) ≫ (tensorLadder V W).hom.app 0 =
(tensorLadder U W).hom.app 0 ≫ (ladder (f β–· W)).hom.app 0
rw [tensorLadder_zero,tensorLadder_zero,←initialCore_tensor,←initialCore_tensor]
exact initialCore.ΞΌIso_hom_natural_left f W
ΞΌIso_hom_natural_right := by
intro U V W f
apply (stringEval (a:=a) (n:=n)).map_injective
change sumArrow (πŸ™ _) ((ladder f).hom.app 0) ≫ (tensorLadder W V).hom.app 0 =
(tensorLadder W U).hom.app 0 ≫ (ladder (W ◁ f)).hom.app 0
rw [tensorLadder_zero,tensorLadder_zero,←initialCore_tensor,←initialCore_tensor]
exact initialCore.ΞΌIso_hom_natural_right W f
associativity := by
intro U V W
apply (stringEval (a:=a) (n:=n)).map_injective
change sumArrow ((tensorLadder U V).hom.app 0) (πŸ™ _) ≫
(tensorLadder (UβŠ—V) W).hom.app 0 ≫ (ladder (Ξ±_ U V W).hom).hom.app 0 =
sumAssoc _ _ _ ≫ sumArrow (πŸ™ _) ((tensorLadder V W).hom.app 0) ≫
(tensorLadder U (VβŠ—W)).hom.app 0
simp only [tensorLadder_zero,←initialCore_tensor]
exact initialCore.associativity U V W
left_unitality := by
intro U
apply (stringEval (a:=a) (n:=n)).map_injective
change leftUnit _ = sumArrow (unitLadder.hom.app 0) (πŸ™ _) ≫
(tensorLadder (πŸ™_ _) U).hom.app 0 ≫ (ladder (Ξ»_ U).hom).hom.app 0
rw [unitLadder_zero,tensorLadder_zero,←initialCore_unit,←initialCore_tensor]
exact initialCore.left_unitality U
right_unitality := by
intro U
apply (stringEval (a:=a) (n:=n)).map_injective
change rightUnit _ = sumArrow (πŸ™ _) (unitLadder.hom.app 0) ≫
(tensorLadder U (πŸ™_ _)).hom.app 0 ≫ (ladder (ρ_ U).hom).hom.app 0
rw [unitLadder_zero,tensorLadder_zero,←initialCore_unit,←initialCore_tensor]
exact initialCore.right_unitality U
noncomputable instance : (toStrings (a:=a) (n:=n)).Monoidal := stringsCore.toMonoidal
noncomputable instance : (toStrings (a:=a) (n:=n)).Braided where
braided U V := by
apply (stringEval (a:=a) (n:=n)).map_injective
change (tensorLadder U V).hom.app 0 ≫ (ladder (Ξ²_ U V).hom).hom.app 0 =
sumSwap _ _ ≫ (tensorLadder V U).hom.app 0
rw [tensorLadder_zero,tensorLadder_zero,ladder_zero]
change (inv (sumArrow (initial U) (initial V)) ≫ initial (UβŠ—V)) ≫
(inv (initial (UβŠ—V)) ≫ sumSwap _ _ ≫ initial (VβŠ—U)) =
sumSwap _ _ ≫ inv (sumArrow (initial V) (initial U)) ≫ initial (VβŠ—U)
simp only [Category.assoc,IsIso.hom_inv_id_assoc]
apply (cancel_epi (sumArrow (initial U) (initial V))).mp
simp only [IsIso.hom_inv_id_assoc]
have h := BraidedCategory.braiding_naturality (initial U) (initial V)
change sumArrow (initial U) (initial V) ≫ sumSwap _ _ =
sumSwap _ _ ≫ sumArrow (initial V) (initial U) at h
rw [←Category.assoc (sumArrow (initial U) (initial V)),h]
simp
lemma tripleBar_homology_isIso (j : β„•) :
IsIso (SSet.homologyMap (IntervalBar.Diagram.bar₃Map (toStrings (a:=a) (n:=n)))
DiagonalResolution.Z j) :=
IntervalBar.Diagram.bar₃Map_homology_isIso toStrings j
end SimpleAmenable.PolygonObject.Labelled
end
section
open _root_.CategoryTheory _root_.OAI.CategoryTheory Classical
namespace SimpleAmenable.PolygonObject.LabelledStage
variable {a n : β„•}
variable {I : Type} [Category.{0} I] [Finite I] [βˆ€i j:I,Finite (i ⟢ j)]
theorem exists_common_stage (F : I β₯€ Labelled a n) :
βˆƒ (P : BooleanPartition a) (s : β„•) (L : Fin s β†’ Fin n β†’ CutRing Γ— CutRing),
(βˆ€j i,orbitRepresentative (L j i)=L j i) ∧ Function.Injective L ∧
βˆƒG : I β₯€ UniformObject P L, G β‹™ UniformObject.forget=F := by
let : Fintype I := Fintype.ofFinite I
let (i j : I) : Fintype (i ⟢ j) := Fintype.ofFinite (i ⟢ j)
let Ar := Σi:I,Σj:I,i ⟢ j
let u : Ar β†’ I := fun t => t.1
let v : Ar β†’ I := fun t => t.2.1
let f : βˆ€t:Ar,F.obj (u t) ⟢ F.obj (v t) := fun t => F.map t.2.2
obtain ⟨P,hP,hf⟩ := Labelled.exists_uniform_partition F.obj u v f
let label : (Ξ£i:I,Fin (F.obj i).polygon.tracks) β†’ Fin n β†’ CutRing Γ— CutRing :=
fun t => (F.obj t.1).label t.2
let S := Set.range label
have : Fintype S := (Set.finite_range label).fintype
let L : Fin (Fintype.card S) β†’ Fin n β†’ CutRing Γ— CutRing :=
fun j => ((Fintype.equivFin S).symm j).val
have hL : βˆ€j i,orbitRepresentative (L j i)=L j i := by
intro j i
obtain ⟨⟨k,t⟩,hk⟩ := ((Fintype.equivFin S).symm j).property
change orbitRepresentative (((Fintype.equivFin S).symm j).val i)=(((Fintype.equivFin S).symm j).val i)
rw [←hk]
exact (F.obj k).reduced t i
have hLi : Function.Injective L := by
intro i j h
exact (Fintype.equivFin S).symm.injective (Subtype.ext h)
let obj (i : I) : UniformObject P L := {
obj := F.obj i
uniform := hP i
supported := fun j => ⟨Fintype.equivFin S ⟨label ⟨i,j⟩,⟨⟨i,j⟩,rfl⟩⟩,by
simp only [L,Equiv.symm_apply_apply]; rfl⟩ }
let G : I β₯€ UniformObject P L := {
obj := obj
map {i j} g := ⟨F.map g,hf ⟨i,j,g⟩⟩
map_id i := UniformObject.Hom.ext _ _ (F.map_id i)
map_comp g h := UniformObject.Hom.ext _ _ (F.map_comp g h) }
refine ⟨P,Fintype.card S,L,hL,hLi,G,?_⟩
rfl
end SimpleAmenable.PolygonObject.LabelledStage
end
end
end OAI