Download data/lean/OAI/Algebra/Finitistic/Rectification/DiagramAssembly.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.77 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algebra/Finitistic/Rectification/DiagramAssembly.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Algebra/Finitistic/Rectification/DiagramAssembly.lean
-
curl -L -o DiagramAssembly.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algebra/Finitistic/Rectification/DiagramAssembly.lean
3.77 kB
| import OAI.Algebra.Finitistic.Rectification.ColumnComplex | |
| namespace OAI | |
| open CategoryTheory CategoryTheory.Limits HomologicalComplex | |
| noncomputable section | |
| namespace ExternalTensor.Section4 | |
| universe u | |
| variable {k : Type u} [Field k] | |
| variable {C : Type u} [Category C] [Preadditive C] [Linear k C] [HasFiniteBiproducts C] [HasBinaryBiproducts C] | |
| variable {A J R : Type} [Fintype A] [Fintype J] [Fintype R] | |
| /-- The concrete column/map interface. No composite or null-homotopy is assumed. | |
| The three equations are path naturality, the algebra relations, and the chosen | |
| relation homotopies after column induction. -/ | |
| structure AssemblyData where | |
| Vβ : C | |
| Vβ : C | |
| Vβ : C | |
| U : A β C | |
| V : J β C | |
| W : R β C | |
| paβ : β a, U a βΆ Vβ | |
| paβ : β a, U a βΆ Vβ | |
| pbβ : β b, V b βΆ Vβ | |
| pbβ : β b, V b βΆ Vβ | |
| qa : β relation arrow, J β (W relation βΆ U arrow) | |
| qb : β relation, A β β arrow, W relation βΆ V arrow | |
| rel : β r, W r βΆ Vβ | |
| middle : β r a b, qa r a b β« paβ a = qb r a b β« pbβ b | |
| first : β r, β a, β b, qa r a b β« paβ a = 0 | |
| last : β r, β a, β b, qb r a b β« pbβ b = rel r | |
| namespace AssemblyData | |
| variable (s : AssemblyData (C := C) (A := A) (J := J) (R := R)) | |
| abbrev Lβ := s.Vβ β (s.Vβ β s.Vβ) | |
| abbrev Lβ := (β¨ s.U) β (β¨ s.V) | |
| abbrev Lβ := β¨ s.W | |
| abbrev inβ : s.Vβ βΆ s.Lβ := biprod.inl | |
| abbrev inβ : s.Vβ βΆ s.Lβ := biprod.inl β« biprod.inr | |
| abbrev inβ : s.Vβ βΆ s.Lβ := biprod.inr β« biprod.inr | |
| def p : s.Lβ βΆ s.Lβ := | |
| biprod.desc | |
| (biproduct.desc fun a => s.paβ a β« s.inβ - s.paβ a β« s.inβ) | |
| (biproduct.desc fun b => s.pbβ b β« s.inβ - s.pbβ b β« s.inβ) | |
| def q : s.Lβ βΆ s.Lβ := | |
| biproduct.desc fun r => β a, β b, | |
| (s.qa r a b β« biproduct.ΞΉ s.U a β« biprod.inl + | |
| s.qb r a b β« biproduct.ΞΉ s.V b β« biprod.inr) | |
| /-- The complete cancellation in Section 4, including the minus sign. -/ | |
| theorem composite : s.q β« s.p = | |
| -(biproduct.desc fun r => s.rel r β« s.inβ) := by | |
| apply biproduct.hom_ext' | |
| intro r | |
| simp only [q, biproduct.ΞΉ_desc_assoc, Preadditive.comp_neg, | |
| biproduct.ΞΉ_desc] | |
| simp only [Preadditive.sum_comp, Preadditive.add_comp, Category.assoc, p, | |
| biprod.inl_desc, biprod.inr_desc, biproduct.ΞΉ_desc, Preadditive.comp_sub, | |
| ] | |
| simp only [β Category.assoc, s.middle] | |
| simp only [Category.assoc] | |
| have cancel (a : A) (b : J) : | |
| s.qa r a b β« s.paβ a β« s.inβ - s.qb r a b β« s.pbβ b β« s.inβ + | |
| (s.qb r a b β« s.pbβ b β« s.inβ - s.qb r a b β« s.pbβ b β« s.inβ) = | |
| s.qa r a b β« s.paβ a β« s.inβ - s.qb r a b β« s.pbβ b β« s.inβ := by abel | |
| simp_rw [cancel, Finset.sum_sub_distrib] | |
| have hf := congrArg (fun z => z β« s.inβ) (s.first r) | |
| have hl := congrArg (fun z => z β« s.inβ) (s.last r) | |
| simp only [Preadditive.sum_comp, Category.assoc, zero_comp] at hf hl | |
| rw [hf, hl] | |
| simp | |
| /-- A componentwise specified finite sum of homotopies. -/ | |
| def sumHomotopy {E : Type*} [Category E] [Preadditive E] | |
| {X Y : CochainComplex E β€} {I : Type} [Fintype I] | |
| (f : I β (X βΆ Y)) (H : β i, Homotopy (f i) 0) : | |
| Homotopy (β i, f i) 0 where | |
| hom n m := β i, (H i).hom n m | |
| zero n m h := by simp [fun i => (H i).zero n m h] | |
| comm n := by | |
| change Hom.fAddMonoidHom n (β i, f i) = _ | |
| rw [map_sum] | |
| change (β i, (f i).f n) = _ | |
| calc | |
| _ = β i, (dNext n (H i).hom + prevD n (H i).hom + (0 : X βΆ Y).f n) := | |
| Finset.sum_congr rfl (fun i _ => (H i).comm n) | |
| _ = _ := by | |
| simp [dNext, prevD, Preadditive.comp_sum, Preadditive.sum_comp, | |
| Finset.sum_add_distrib] | |
| end AssemblyData | |
| end ExternalTensor.Section4 | |
| end | |
| end OAI | |