Download data/lean/OAI/GroupTheory/SimpleAmenable/Configurations/LabelledStringEquiv.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.87 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/GroupTheory/SimpleAmenable/Configurations/LabelledStringEquiv.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/GroupTheory/SimpleAmenable/Configurations/LabelledStringEquiv.lean
-
curl -L -o LabelledStringEquiv.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/GroupTheory/SimpleAmenable/Configurations/LabelledStringEquiv.lean
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 | |