Download data/lean/OAI/AlgebraicGeometry/CycleClass/Thom/TorAlgebra/Euler.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.95 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/AlgebraicGeometry/CycleClass/Thom/TorAlgebra/Euler.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/AlgebraicGeometry/CycleClass/Thom/TorAlgebra/Euler.lean
-
curl -L -o Euler.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/AlgebraicGeometry/CycleClass/Thom/TorAlgebra/Euler.lean
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 | |