introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.95 kB
import OAI.AlgebraicGeometry.CycleClass.Thom.TorAlgebra.ExactSequence
import OAI.AlgebraicGeometry.CycleClass.Thom.TorAlgebra.ExactLength
import OAI.AlgebraicGeometry.CycleClass.Thom.TorAlgebra.BoundedResolution
/-! # Euler -/
namespace OAI.AlgebraicGeometry.CycleClass.Thom.TorAlgebra.Euler
noncomputable section
/-! Additivity of the actual finite Tor Euler characteristic in a short
exact sequence. Finiteness and vanishing assumptions are stated on native
Tor modules, so this lemma applies to the geometric local modules. -/
set_option backward.isDefEq.respectTransparency false
open _root_.CategoryTheory _root_.CategoryTheory.Limits
namespace Tor
open OAI.AlgebraicGeometry.CycleClass.Thom.TorAlgebra.ExactSequence.Tor OAI.AlgebraicGeometry.CycleClass.Thom.TorAlgebra.ExactLength
universe u
variable (R : Type u) [CommRing R]
def euler (M N : ModuleCat.{u} R) (d : β„•) : β„š :=
βˆ‘ i ∈ Finset.range (d + 1), (-1 : β„š) ^ i *
ExactLength.rationalLength R (((Tor (ModuleCat R) i).obj M).obj N)
def connectingLength (N : ModuleCat.{u} R) (S : ShortComplex (ModuleCat R))
(hS : S.ShortExact) (n : β„•) : β„š :=
ExactLength.rationalLength R (.of R (LinearMap.range (ExactSequence.Tor.connecting R N S hS n).hom))
theorem degree_zero (N : ModuleCat.{u} R) (S : ShortComplex (ModuleCat R))
(hS : S.ShortExact)
(h₁ : Module.length R (((Tor (ModuleCat R) 0).obj S.X₁).obj N) β‰  ⊀)
(hβ‚‚ : Module.length R (((Tor (ModuleCat R) 0).obj S.Xβ‚‚).obj N) β‰  ⊀) :
ExactLength.rationalLength R (((Tor (ModuleCat R) 0).obj S.X₁).obj N) +
ExactLength.rationalLength R (((Tor (ModuleCat R) 0).obj S.X₃).obj N) =
ExactLength.rationalLength R (((Tor (ModuleCat R) 0).obj S.Xβ‚‚).obj N) +
connectingLength R N S hS 0 := by
have ha := ExactLength.rationalLength_exact R _ (ExactSequence.Tor.exact_after_connecting R N S hS 0) h₁
have hb := ExactLength.rationalLength_exact R _ (ExactSequence.Tor.exact_middle R N S hS 0) hβ‚‚
let : Epi (((Tor (ModuleCat R) 0).map S.g).app N) := ExactSequence.Tor.epi_zero R N S hS
have hc := ExactLength.rationalLength_range_of_epi R (((Tor (ModuleCat R) 0).map S.g).app N)
change ExactLength.rationalLength R (((Tor (ModuleCat R) 0).obj S.X₁).obj N) =
connectingLength R N S hS 0 + _ at ha
change ExactLength.rationalLength R (((Tor (ModuleCat R) 0).obj S.Xβ‚‚).obj N) =
ExactLength.rationalLength R (.of R (LinearMap.range (((Tor (ModuleCat R) 0).map S.f).app N).hom)) +
ExactLength.rationalLength R (.of R (LinearMap.range (((Tor (ModuleCat R) 0).map S.g).app N).hom)) at hb
linarith
theorem degree_succ (N : ModuleCat.{u} R) (S : ShortComplex (ModuleCat R))
(hS : S.ShortExact) (n : β„•)
(h₁ : Module.length R (((Tor (ModuleCat R) (n + 1)).obj S.X₁).obj N) β‰  ⊀)
(hβ‚‚ : Module.length R (((Tor (ModuleCat R) (n + 1)).obj S.Xβ‚‚).obj N) β‰  ⊀)
(h₃ : Module.length R (((Tor (ModuleCat R) (n + 1)).obj S.X₃).obj N) β‰  ⊀) :
ExactLength.rationalLength R (((Tor (ModuleCat R) (n + 1)).obj S.X₁).obj N) +
ExactLength.rationalLength R (((Tor (ModuleCat R) (n + 1)).obj S.X₃).obj N) =
ExactLength.rationalLength R (((Tor (ModuleCat R) (n + 1)).obj S.Xβ‚‚).obj N) +
connectingLength R N S hS (n + 1) + connectingLength R N S hS n := by
have ha := ExactLength.rationalLength_exact R _ (ExactSequence.Tor.exact_after_connecting R N S hS (n + 1)) h₁
have hb := ExactLength.rationalLength_exact R _ (ExactSequence.Tor.exact_middle R N S hS (n + 1)) hβ‚‚
have hc := ExactLength.rationalLength_exact R _ (ExactSequence.Tor.exact_before_connecting R N S hS n) h₃
dsimp only [ShortComplex.mk, ShortComplex.map_Xβ‚‚, ShortComplex.map_f, ShortComplex.map_g,
Functor.flip_obj_obj, Functor.flip_obj_map] at ha hb hc
change ExactLength.rationalLength R (((Tor (ModuleCat R) (n + 1)).obj S.Xβ‚‚).obj N) =
ExactLength.rationalLength R (.of R (LinearMap.range (((Tor (ModuleCat R) (n + 1)).map S.f).app N).hom)) +
ExactLength.rationalLength R (.of R (LinearMap.range (((Tor (ModuleCat R) (n + 1)).map S.g).app N).hom)) at hb
unfold connectingLength
linarith
theorem alternating_identity (a b c k : β„• β†’ β„š)
(hβ‚€ : a 0 + c 0 = b 0 + k 0)
(hs : βˆ€ n, a (n + 1) + c (n + 1) = b (n + 1) + k (n + 1) + k n)
(d : β„•) :
(βˆ‘ i ∈ Finset.range (d + 1), (-1 : β„š) ^ i * b i) =
(βˆ‘ i ∈ Finset.range (d + 1), (-1 : β„š) ^ i * a i) +
(βˆ‘ i ∈ Finset.range (d + 1), (-1 : β„š) ^ i * c i) - (-1 : β„š) ^ d * k d := by
induction d with
| zero => simpa using (sub_eq_iff_eq_add.mpr hβ‚€).symm
| succ d ih =>
simp only [Finset.sum_range_succ (n := d + 1)]
rw [ih]
simp only [pow_succ]
linear_combination ((-1 : β„š) ^ d) * hs d
theorem additivity (N : ModuleCat.{u} R) (S : ShortComplex (ModuleCat R))
(hS : S.ShortExact) (d : β„•)
(h₁ : βˆ€ n, Module.length R (((Tor (ModuleCat R) n).obj S.X₁).obj N) β‰  ⊀)
(hβ‚‚ : βˆ€ n, Module.length R (((Tor (ModuleCat R) n).obj S.Xβ‚‚).obj N) β‰  ⊀)
(h₃ : βˆ€ n, Module.length R (((Tor (ModuleCat R) n).obj S.X₃).obj N) β‰  ⊀)
(hv : IsZero (((Tor (ModuleCat R) (d + 1)).obj S.X₃).obj N)) :
euler R S.Xβ‚‚ N d = euler R S.X₁ N d + euler R S.X₃ N d := by
have h := alternating_identity
(fun n => ExactLength.rationalLength R (((Tor (ModuleCat R) n).obj S.X₁).obj N))
(fun n => ExactLength.rationalLength R (((Tor (ModuleCat R) n).obj S.Xβ‚‚).obj N))
(fun n => ExactLength.rationalLength R (((Tor (ModuleCat R) n).obj S.X₃).obj N))
(connectingLength R N S hS) (degree_zero R N S hS (h₁ 0) (hβ‚‚ 0))
(fun n => degree_succ R N S hS n (h₁ _) (hβ‚‚ _) (h₃ _)) d
have hk : connectingLength R N S hS d = 0 :=
ExactLength.rationalLength_range_of_zero R _ (hv.eq_of_src _ _)
simpa only [euler, hk, mul_zero, sub_zero] using h
end Tor
end
end OAI.AlgebraicGeometry.CycleClass.Thom.TorAlgebra.Euler