File size: 2,748 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
import Mathlib.Algebra.Category.ModuleCat.Biproducts
import OAI.Algebra.Finitistic.Rectification.InducedDiagram
import OAI.Algebra.Finitistic.Rectification.ColumnProperties
import OAI.Algebra.Finitistic.Rectification.RectificationTotal

namespace OAI
noncomputable section
open CategoryTheory CategoryTheory.Limits
namespace LittleFinitistic.InducedRectification
open ExternalTensor.Section4
universe u
variable {k B : Type u} [Field k] [Ring B] [Algebra k B]
variable {A J R : Type} [Fintype A] [Fintype J] [Fintype R]
variable (s : Quadratic k B (A := A) (J := J) (R := R))
variable (Dβ‚€ D₁ Dβ‚‚ : RightComplex B)
variable (f : A β†’ (Dβ‚€ ⟢ D₁)) (g : J β†’ (D₁ ⟢ Dβ‚‚))
variable (H : βˆ€ r, Homotopy (relationMap s Dβ‚€ D₁ Dβ‚‚ f g r) 0)

/-- The actual three-column induced bimodule complex of Section 4. -/
def total : BiComplex k B :=
  RectificationTotal.total (p s Dβ‚€ D₁ Dβ‚‚ f g) (q s Dβ‚€ D₁ Dβ‚‚ f g)
    (nullHomotopy s Dβ‚€ D₁ Dβ‚‚ f g H)

/-- Its right-module restriction, retaining the original bimodule construction. -/
def rightTotal : RightComplex B :=
  ((forgetRight k B).mapHomologicalComplex (.up β„€)).obj (total s Dβ‚€ D₁ Dβ‚‚ f g H)

theorem total_bounded (lo hi : β„€)
    (hβ‚€ : βˆ€ n, n < lo ∨ hi < n β†’ IsZero (Dβ‚€.X n))
    (h₁ : βˆ€ n, n < lo ∨ hi < n β†’ IsZero (D₁.X n))
    (hβ‚‚ : βˆ€ n, n < lo ∨ hi < n β†’ IsZero (Dβ‚‚.X n)) :
    βˆ€ n, n < lo-2 ∨ hi < n β†’ IsZero ((total s Dβ‚€ D₁ Dβ‚‚ f g H).X n) := by
  have hc := columns_bounded s Dβ‚€ D₁ Dβ‚‚ f g lo hi hβ‚€ h₁ hβ‚‚
  exact RectificationTotal.total_bounded _ _ _ lo hi
    (fun n hn => (hc n hn).1) (fun n hn => (hc n hn).2.1)
    (fun n hn => (hc n hn).2.2)

/-- Termwise projectivity holds for the actual right restriction of the total. -/
theorem rightTotal_projective
    (hβ‚€ : βˆ€ n, Module.Projective Bᡐᡒᡖ (Dβ‚€.X n))
    (h₁ : βˆ€ n, Module.Projective Bᡐᡒᡖ (D₁.X n))
    (hβ‚‚ : βˆ€ n, Module.Projective Bᡐᡒᡖ (Dβ‚‚.X n)) :
    βˆ€ n, Projective ((rightTotal s Dβ‚€ D₁ Dβ‚‚ f g H).X n) := by
  have hc := columns_right_projective s Dβ‚€ D₁ Dβ‚‚ f g hβ‚€ h₁ hβ‚‚
  exact RectificationTotal.total_projective_after _ _ _ (forgetRight k B)
    (fun n => (hc n).1) (fun n => (hc n).2.1) (fun n => (hc n).2.2)

/-- The entire zero column has its original chain inclusion. -/
def inclusion : L0Prime s Dβ‚€ D₁ Dβ‚‚ f g ⟢ total s Dβ‚€ D₁ Dβ‚‚ f g H :=
  RectificationTotal.inclusion _ _ _

/-- The prescribed first boundary becomes null-homotopic in the actual total. -/
def boundaryHomotopy : Homotopy
    (p s Dβ‚€ D₁ Dβ‚‚ f g ≫ inclusion s Dβ‚€ D₁ Dβ‚‚ f g H) 0 :=
  RectificationTotal.boundaryHomotopy _ _ _
end LittleFinitistic.InducedRectification

end

end OAI