math / data /lean /OAI /GroupTheory /SimpleAmenable /Simplicial /FirstBarForwardLow.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.29 kB
import Mathlib
import OAI.GroupTheory.SimpleAmenable.Simplicial.FirstBarDegreeTwoFinite
namespace OAI
section
open _root_.CategoryTheory _root_.OAI.CategoryTheory Limits MonoidalCategory Simplicial Opposite HomologicalComplex
namespace MarkedH1
open FreeChains ComponentTranslation IntervalBar.Diagram
variable {C:Type} [Groupoid.{0} C] [MonoidalCategory C] [SymmetricCategory C]
noncomputable def lowOneHomologyIso :
((RegularCoefficient.double (homologyDiagram (C:=C) 1)).total c).homology 1 β‰…
(homologyRow (C:=C) 1).homology 2 := by
let K := (RegularCoefficient.double (homologyDiagram (C:=C) 1)).total c
let L := homologyRow (C:=C) 1
let e : K.sc' 2 1 0 β‰… L.sc' 3 2 1 :=
ShortComplex.isoMk (gradedIso 2) (gradedIso 1) (gradedIso 0)
(differential2 (C:=C)).symm (differential1 (C:=C)).symm
exact (ShortComplex.homologyFunctor A).mapIso
(K.isoSc' 2 1 0 (c.prev_eq' rfl) (c.next_eq' rfl) β‰ͺ≫ e β‰ͺ≫
(L.isoSc' 3 2 1 (c.prev_eq' rfl) (c.next_eq' rfl)).symm)
lemma row_one_two_finite
[Module.Finite β„€ (ComponentStable.object (C:=C) 1:A)]
(hf:βˆ€i,i≀1 β†’ Module.Finite β„€ ((nerve (SingleObj (Skeleton C))).homology Z i:A)) :
Module.Finite β„€ ((homologyRow (C:=C) 1).homology 2) := by
have : Module.Finite β„€ (colimit (homologyDiagram (C:=C) 1):A) := inferInstanceAs
(Module.Finite β„€ (ComponentStable.object (C:=C) 1:A))
have := RegularCoefficient.total_finite (homologyDiagram (C:=C) 1) 1 (by
intro i hi
have := hf i hi
exact Module.Finite.equiv (CommMonoidOpposite.homologyIso (Skeleton C) i).symm.toLinearEquiv)
exact Module.Finite.equiv (lowOneHomologyIso (C:=C)).toLinearEquiv
end MarkedH1
namespace IntervalBar.Diagram
open FreeChains ComponentTranslation SimplicialDiagonal
variable {C:Type} [Groupoid.{0} C] [MonoidalCategory C] [SymmetricCategory C]
lemma bar_low_finite
[Module.Finite β„€ (ComponentStable.object (C:=C) 1:A)]
[Module.Finite β„€ (ComponentStable.object (C:=C) 2:A)]
(hf:βˆ€i,Module.Finite β„€ ((nerve (SingleObj (Skeleton C))).homology Z i:A))
(n:β„•) (hn:n≀3) : Module.Finite β„€ ((bar (C:=C)).homology Z n:A) := by
let X:=simplicial (C:=C) β‹™ nerveFunctor
apply EilenbergZilber.finite_diagonal (uncurry X) n
intro p q hpq
have hr : Module.Finite β„€ ((homologyRow (C:=C) q).homology p) := by
by_cases hq:q=0
Β· subst q
have := hf p
let e : ((nerve (SingleObj (Skeleton C))).homology Z p:A) β‰… (homologyRow (C:=C) 0).homology p :=
(homologyFunctor A c p).mapIso ((complexIso _) β‰ͺ≫ (componentRowChainIso (C:=C)).symm)
exact Module.Finite.equiv e.toLinearEquiv
Β· by_cases hp:p=0
Β· subst p
have : Subsingleton ((homologyRow (C:=C) q).X 0) := ModuleCat.isZero_iff_subsingleton.mp
(nerve.positive_zero (fun U V:IntervalBar.Diagram C (Fin 1)=>⟨zeroHom C U V⟩) q hq)
have : Module.Finite β„€ ((homologyRow (C:=C) q).X 0) := inferInstance
exact BarHomology.finite_homology _ _
Β· have hq2:q≀2:=by omega
interval_cases q
Β· contradiction
· rcases (show p=1 ∨ p=2 by omega) with rfl|rfl
Β· exact StableBarOne.row_one_finite 1 (by decide)
Β· exact MarkedH1.row_one_two_finite (fun i _=>hf i)
Β· have hp1:p=1:=by omega
subst p
exact StableBarOne.row_one_finite 2 (by decide)
have : Module.Finite β„€ ((AlgebraicTopology.AlternatingFaceMapComplex.obj (X β‹™ SSet.homologyFunctor DiagonalResolution.Z q)).homology p) := hr
exact Module.Finite.equiv (homologyRowHomologyIso X p q).symm.toLinearEquiv
end IntervalBar.Diagram
end
section
open _root_.CategoryTheory _root_.OAI.CategoryTheory Limits MonoidalCategory Simplicial Opposite
namespace SimplicialDiagonal
open FreeChains
variable (X:I β₯€ SSet)
lemma finite_forward (r:β„•)
(hc:βˆ€p,(X.obj p).IsConnected)
(hz:βˆ€q,0<q β†’ IsZero ((X.obj (op ⦋0⦌)).homology Z q))
(hf:βˆ€p q,q≀r β†’ Module.Finite β„€ ((X.obj (op ⦋p⦌)).homology Z q : A)) :
βˆ€n,n≀r+1 β†’ Module.Finite β„€ ((diagonal.obj X).homology Z n:A) := by
intro n hn
apply EilenbergZilber.finite_diagonal (uncurry X) n
intro p q hpq
by_cases hq:q=0
Β· subst q
exact BarHomology.zeroRow_finite _ (rows_connected X hc) p
Β· have : Module.Finite β„€ (SSet.homology ((EilenbergZilber.bisimplicial (uncurry X)).obj (op ⦋p⦌)) Z q:A) := by
by_cases hp:p=0
Β· subst p
have hz' := (hz q (by omega)).of_iso ((SSet.homologyFunctor Z q).mapIso (rowIso X (op ⦋0⦌)))
have : Subsingleton (SSet.homology ((EilenbergZilber.bisimplicial (uncurry X)).obj (op ⦋0⦌)) Z q:A) :=
ModuleCat.isZero_iff_subsingleton.mp hz'
infer_instance
Β· have : Module.Finite β„€ ((SSet.homologyFunctor Z q).obj (X.obj (op ⦋p⦌)) : A) := hf p q (by omega)
exact Module.Finite.equiv ((SSet.homologyFunctor Z q).mapIso (rowIso X (op ⦋p⦌))).symm.toLinearEquiv
exact BarHomology.E2_finite _ p q
end SimplicialDiagonal
namespace IntervalBar.Diagram
open FreeChains BarFinitePower SimplicialDiagonal
variable {C:Type} [Groupoid.{0} C] [MonoidalCategory C] [SymmetricCategory C]
lemma barβ‚‚_finite_forward (r:β„•)
(hf:βˆ€n,n≀r β†’ Module.Finite β„€ ((bar (C:=C)).homology Z n : A)) :
βˆ€q,q≀r+1 β†’ Module.Finite β„€ ((barβ‚‚ (C:=C)).homology Z q : A) := by
apply finite_forward (rowsβ‚‚ (C:=C)) r (fun _=>bar_connected _) zero_bar_acyclic
intro p q hq
apply singleRow_finite
exact fun i hi=>hf i (by omega)
lemma bar₃_finite_forward (r:β„•)
(hf:βˆ€n,n≀r β†’ Module.Finite β„€ ((barβ‚‚ (C:=C)).homology Z n : A)) :
βˆ€q,q≀r+1 β†’ Module.Finite β„€ ((bar₃ (C:=C)).homology Z q : A) := by
apply finite_forward (rows₃ (C:=C)) r (fun _=>barβ‚‚_connected)
(fun q hq=>by
change IsZero (SSet.homology (C:=A) (barβ‚‚ (C:=Diagram C (Fin 1))) Z q)
exact barβ‚‚_acyclic (fun _ _=>inferInstance) q hq)
intro p q hq
apply doubleRow_finite
exact fun i hi=>hf i (by omega)
lemma triple_finite_of_bar
(hf:βˆ€n,n≀3 β†’ Module.Finite β„€ ((bar (C:=C)).homology Z n : A)) :
βˆ€q,q≀5 β†’ Module.Finite β„€ ((bar₃ (C:=C)).homology Z q : A) :=
bar₃_finite_forward 4 (barβ‚‚_finite_forward 3 hf)
end IntervalBar.Diagram
end
end OAI