math / data /lean /OAI /Algebra /Finitistic /Rectification /RectificationLemma.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.56 kB
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