File size: 3,558 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 | import OAI.Algebra.Finitistic.Rectification.CanonicalArrowCompatibility
import OAI.Algebra.Finitistic.Rectification.TotalFinite
namespace OAI
noncomputable section
open CategoryTheory CategoryTheory.Limits HomologicalComplex
namespace LittleFinitistic.RectificationLemma
open ExternalTensor.Section4 QuadraticEncoding CanonicalArrowCompatibility
universe u
variable {k : Type u} [Field k] {d t : β} (P : Relations k d t)
variable (Dβ Dβ Dβ : RightComplex (B P))
variable (f : Fin (d+1) β (Dβ βΆ Dβ)) (g : Fin (d+1) β (Dβ βΆ Dβ))
variable (H : β r, Homotopy (relationMap (ConcreteQuadraticDiagram.quadratic P) Dβ Dβ Dβ f g r) 0)
/-- The conclusions of the paper's rectification lemma for the explicitly constructed
bimodule complex and original vertex insertion maps. -/
structure Verified (lo hi : β€) : Prop where
bounded : β n, n < lo-2 β¨ hi < n β IsZero
((InducedRectification.total (ConcreteQuadraticDiagram.quadratic P) Dβ Dβ Dβ f g H).X n)
projective : β n, Projective
((InducedRectification.rightTotal (ConcreteQuadraticDiagram.quadratic P) Dβ Dβ Dβ f g H).X n)
finite : β n, FiniteDimensional k ((forgetK k (B P)).obj
((InducedRectification.total (ConcreteQuadraticDiagram.quadratic P) Dβ Dβ Dβ f g H).X n))
vertices : β v : Fin 3, β j :
VertexHomotopyEquivalence.target P Dβ Dβ Dβ f g H v βΆ
VertexHomotopyEquivalence.source P Dβ Dβ Dβ v,
Nonempty (Homotopy (VertexHomotopyEquivalence.iota P Dβ Dβ Dβ f g H v β« j) (π _)) β§
Nonempty (Homotopy (j β« VertexHomotopyEquivalence.iota P Dβ Dβ Dβ f g H v) (π _))
arrows01 : β a, Nonempty (Homotopy
(FirstVertex.iota P Dβ Dβ Dβ f g H β« arrow01Map P Dβ Dβ Dβ f g H a)
(f a β« SecondVertex.iota P Dβ Dβ Dβ f g H))
arrows12 : β b, Nonempty (Homotopy
(SecondVertex.iota P Dβ Dβ Dβ f g H β« arrow12Map P Dβ Dβ Dβ f g H b)
(g b β« ThirdVertex.iota P Dβ Dβ Dβ f g H))
/-- Full rectification for arbitrary bounded finite projective input complexes,
using only the assigned relation homotopies. No conclusion about the constructed
P, its vertices, or its arrow homotopies is assumed. -/
theorem rectification (lo hi : β€)
(bβ : β n, n < lo β¨ hi < n β IsZero (Dβ.X n))
(bβ : β n, n < lo β¨ hi < n β IsZero (Dβ.X n))
(bβ : β n, n < lo β¨ hi < n β IsZero (Dβ.X n))
(pβ : β n, Module.Projective (B P)α΅α΅α΅ (Dβ.X n))
(pβ : β n, Module.Projective (B P)α΅α΅α΅ (Dβ.X n))
(pβ : β n, Module.Projective (B P)α΅α΅α΅ (Dβ.X n))
(fβ : β n, Module.Finite (B P)α΅α΅α΅ (Dβ.X n))
(fβ : β n, Module.Finite (B P)α΅α΅α΅ (Dβ.X n))
(fβ : β n, Module.Finite (B P)α΅α΅α΅ (Dβ.X n)) :
Verified P Dβ Dβ Dβ f g H lo hi := by
have := QuadraticEncoding.finiteDimensional P
exact {
bounded := InducedRectification.total_bounded _ _ _ _ _ _ _ lo hi bβ bβ bβ
projective := InducedRectification.rightTotal_projective _ _ _ _ _ _ _ pβ pβ pβ
finite := induced_total_finite _ _ _ _ _ _ _ fβ fβ fβ
vertices := fun v => VertexHomotopyEquivalence.homotopy_inverse P Dβ Dβ Dβ f g H
v lo hi bβ bβ bβ pβ pβ pβ
arrows01 := fun a => β¨CanonicalArrowCompatibility.compatibility01 P Dβ Dβ Dβ f g H aβ©
arrows12 := fun b => β¨CanonicalArrowCompatibility.compatibility12 P Dβ Dβ Dβ f g H bβ© }
end LittleFinitistic.RectificationLemma
end
end OAI
|