math / data /lean /OAI /Algebra /Finitistic /Rectification /SecondVertex.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.31 kB
import OAI.Algebra.Finitistic.Rectification.GradedVertexAcyclic
import OAI.Algebra.Finitistic.Rectification.FirstVertex
namespace OAI
noncomputable section
open CategoryTheory CategoryTheory.Limits HomologicalComplex
namespace LittleFinitistic.SecondVertex
open ExternalTensor.Section4 ExternalTensor.Section4.SourceFiltration
universe u
variable {k : Type u} [Field k] {d t : β„•} (P : QuadraticEncoding.Relations k d t)
variable (Dβ‚€ D₁ Dβ‚‚ : RightComplex (QuadraticEncoding.B P))
variable (f : Fin (d+1) β†’ (Dβ‚€ ⟢ D₁)) (g : Fin (d+1) β†’ (D₁ ⟢ Dβ‚‚))
local notation "T" => QuadraticEncoding.B P
local notation "s" => ConcreteQuadraticDiagram.quadratic P
abbrev vertex := BimoduleVertex.functor k (QuadraticEncoding.B P)
(ThreeVertexAlgebra.vertex (QuadraticEncoding.composition P) 1)
abbrev vertexComplex := (vertex P).mapHomologicalComplex (.up β„€)
def intoF1 : (columnComplex k T (s).e₁).obj D₁ ⟢ Exactness.F1 s Dβ‚€ D₁ Dβ‚‚ f g :=
biprod.inl ≫ RectificationTotal.inclusion (p1 (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g)) 0
(h1 (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g))
theorem intoF1_isIso : IsIso ((vertexComplex P).map (intoF1 P Dβ‚€ D₁ Dβ‚‚ f g)) := by
let F := vertex P
let G := vertexComplex P
have hz : IsZero (G.obj (Z (k := k) (B := T))) := by
apply G.map_isZero
apply ZeroColumnTotal.complex_zero
intro n
exact ModuleCat.isZero_iff_subsingleton.mpr inferInstance
have hv : IsZero (G.obj ((columnComplex k T (s).eβ‚‚).obj Dβ‚‚)) :=
VertexColumnComplex.reverse_isZero (QuadraticEncoding.composition P) 1 2 (by decide) Dβ‚‚
have hs : IsZero (G.obj (F1₁ (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g))) := by
apply (G.mapBiproduct _).isZero_iff.mpr
exact sum_isZero _ (fun _ =>
VertexColumnComplex.reverse_isZero (QuadraticEncoding.composition P) 1 2 (by decide) D₁)
have hi := ZeroColumnTotal.mapped_inclusion_isIso
(p1 (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g)) 0 (h1 (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g)) F
(fun n => (HomologicalComplex.eval _ _ n).map_isZero hs)
(fun n => (HomologicalComplex.eval _ _ n).map_isZero hz)
have hj := FirstVertex.mapped_inl_isIso G
((columnComplex k T (s).e₁).obj D₁) ((columnComplex k T (s).eβ‚‚).obj Dβ‚‚) hv
let := hi
let := hj
dsimp [intoF1]
erw [Functor.map_comp]
exact (show IsIso (G.map (biprod.inl :
(columnComplex k T (s).e₁).obj D₁ ⟢ F1β‚€ (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g)) ≫
G.map (RectificationTotal.inclusion (p1 (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g)) 0
(h1 (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g)))) from by
have : IsIso (G.map (biprod.inl :
(columnComplex k T (s).e₁).obj D₁ ⟢ F1β‚€ (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g))) := hj
rw [isIso_comp_left_iff]
exact hi)
variable (H : βˆ€ r, Homotopy (relationMap (ConcreteQuadraticDiagram.quadratic P) Dβ‚€ D₁ Dβ‚‚ f g r) 0)
theorem filtration_inclusion_quasiIso :
QuasiIso ((vertexComplex P).map (Exactness.i1 s Dβ‚€ D₁ Dβ‚‚ f g H)) := by
let S := Complex.source0 s Dβ‚€ D₁ Dβ‚‚ f g H
exact RectificationAcyclic.quasiIso_of_acyclic_quotient (S.map (vertexComplex P))
(Complex.vertex_shortExact ((s).e₁) ((ThreeVertexAlgebra.directedSystem (QuadraticEncoding.composition P)).idem 1) S
(Complex.source0_shortExact s Dβ‚€ D₁ Dβ‚‚ f g H))
(GradedVertexAcyclic.grade0_vertex1_acyclic P Dβ‚€ D₁ Dβ‚‚ f g)
def iota : D₁ ⟢ (vertexComplex P).obj (Exactness.P s Dβ‚€ D₁ Dβ‚‚ f g H) :=
(VertexColumnComplex.diagonalComplexIso (QuadraticEncoding.composition P) 1 D₁).hom ≫
(vertexComplex P).map (intoF1 P Dβ‚€ D₁ Dβ‚‚ f g) ≫
(vertexComplex P).map (Exactness.i1 s Dβ‚€ D₁ Dβ‚‚ f g H)
theorem iota_quasiIso : QuasiIso (iota P Dβ‚€ D₁ Dβ‚‚ f g H) := by
let := intoF1_isIso P Dβ‚€ D₁ Dβ‚‚ f g
let := filtration_inclusion_quasiIso P Dβ‚€ D₁ Dβ‚‚ f g H
let e : D₁ β‰… (vertexComplex P).obj ((columnComplex k T (s).e₁).obj D₁) :=
VertexColumnComplex.diagonalComplexIso (QuadraticEncoding.composition P) 1 D₁
change QuasiIso (e.hom ≫ (vertexComplex P).map (intoF1 P Dβ‚€ D₁ Dβ‚‚ f g) ≫
(vertexComplex P).map (Exactness.i1 s Dβ‚€ D₁ Dβ‚‚ f g H))
infer_instance
/-- The filtration route retains the original vertex-one summand insertion. -/
theorem intoF1_nested : intoF1 P Dβ‚€ D₁ Dβ‚‚ f g ≫ Exactness.i1 s Dβ‚€ D₁ Dβ‚‚ f g H =
(Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g).in₁ ≫
InducedRectification.inclusion s Dβ‚€ D₁ Dβ‚‚ f g H := by
exact (Category.assoc _ _ _).trans (congrArg
(fun h => (biprod.inl : (columnComplex k T (s).e₁).obj D₁ ⟢
F1β‚€ (Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g)) ≫ h)
((include1 (inducedData s Dβ‚€ D₁ Dβ‚‚ f g) (nullHomotopy s Dβ‚€ D₁ Dβ‚‚ f g H)).inclusion_totalMap))
theorem iota_original : iota P Dβ‚€ D₁ Dβ‚‚ f g H =
(VertexColumnComplex.diagonalComplexIso (QuadraticEncoding.composition P) 1 D₁).hom ≫
(vertexComplex P).map ((Exactness.data s Dβ‚€ D₁ Dβ‚‚ f g).in₁) ≫
(vertexComplex P).map (InducedRectification.inclusion s Dβ‚€ D₁ Dβ‚‚ f g H) := by
dsimp only [iota]
erw [← (vertexComplex P).map_comp (intoF1 P Dβ‚€ D₁ Dβ‚‚ f g)
(Exactness.i1 s Dβ‚€ D₁ Dβ‚‚ f g H), intoF1_nested, Functor.map_comp]
rfl
end LittleFinitistic.SecondVertex
end
end OAI