File size: 4,366 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 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 | import Mathlib.CategoryTheory.Linear.Basic
import OAI.Algebra.Finitistic.Encoding.QuadraticEncoding
import OAI.Algebra.Finitistic.Encoding.QuadraticPresentation
namespace OAI
namespace LittleFinitistic.QuotientAction
open CategoryTheory CategoryTheory.Category CategoryTheory.Limits CategoryTheory.Preadditive
open QuadraticEncoding
variable {k : Type*} [Field k] {C : Type*} [Category C] [Preadditive C] [Linear k C]
variable {Xβ Xβ Xβ : C} {d t : β} (P : Relations k d t)
(s : Xβ βΆ Xβ) (s' : Xβ βΆ Xβ) [IsIso s] [IsIso s']
(a : Fin d β (Xβ βΆ Xβ)) (b : Fin d β (Xβ βΆ Xβ))
(hc : β h, s β« b h = a h β« s')
noncomputable def normalized (h : Fin d) : End Xβ := a h β« inv s
include hc in
omit [Preadditive C] [IsIso s'] in
lemma normalized_product_comp (h l : Fin d) :
(normalized s a h * normalized s a l) β« s β« s' = a l β« b h := by
simp only [normalized,End.mul_def,assoc,IsIso.inv_hom_id_assoc]
rw [β hc h]
simp only [IsIso.inv_hom_id_assoc]
omit [Preadditive C] [IsIso s'] in
lemma normalized_comp (h : Fin d) : normalized s a h β« s β« s' = a h β« s' := by
simp [normalized]
variable (hr : β j,
(β h, β l, P.quadratic j h l β’ (a l β« b h)) +
(β h, P.linear j h β’ (a h β« s')) + P.constant j β’ (s β« s') = 0)
include hc hr in
/-- Normalizing the invertible arrows recovers the original quadratic equations. -/
theorem normalized_relations (j : Fin t) :
(β h, β l, P.quadratic j h l β’ (normalized s a h * normalized s a l)) +
(β h, P.linear j h β’ normalized s a h) + P.constant j β’ (1 : End Xβ) = 0 := by
apply (cancel_mono (s β« s')).mp
dsimp only [End]
simp only [Preadditive.add_comp,Preadditive.sum_comp,Linear.smul_comp,End.one_def,id_comp,zero_comp]
simpa only [β End.mul_def,normalized_product_comp s s' a b hc,normalized_comp] using hr j
/-- The degree-at-most-two defining polynomial with the displayed coefficients. -/
def polynomial (j : Fin t) : FreeAlgebra k (Fin d) :=
(β h, β l, P.quadratic j h l β’ (FreeAlgebra.ΞΉ k h * FreeAlgebra.ΞΉ k l)) +
(β h, P.linear j h β’ FreeAlgebra.ΞΉ k h) + P.constant j β’ 1
noncomputable def freeAction : FreeAlgebra k (Fin d) ββ[k] End Xβ :=
FreeAlgebra.lift k (normalized s a)
include hc hr in
lemma freeAction_polynomial (j : Fin t) : freeAction s a (polynomial P j) = 0 := by
simpa only [freeAction,polynomial,map_add,map_sum,map_smul,map_mul,map_one,
FreeAlgebra.lift_ΞΉ_apply] using normalized_relations P s s' a b hc hr j
/-- The genuine quotient action theta, obtained by descending the free action. -/
noncomputable def quotientAction :
QuadraticPresentation.Original k (Fin d) (polynomial P) ββ[k] End Xβ :=
(QuadraticPresentation.original k (Fin d) (polynomial P)).liftβ (freeAction s a)
(RingCon.ringConGen_le.mpr (by
rintro x y β¨j,rfl,rflβ©
change freeAction s a (polynomial P j) = freeAction s a 0
rw [map_zero,freeAction_polynomial P s s' a b hc hr]))
@[simp] theorem quotientAction_generator (h : Fin d) :
quotientAction P s s' a b hc hr
(QuadraticPresentation.originalMap k (Fin d) (polynomial P) (FreeAlgebra.ΞΉ k h)) =
normalized s a h := by
simp [quotientAction,QuadraticPresentation.originalMap,freeAction]
/-- Transport the descended action through the actual presentation equivalence. -/
noncomputable def presentedAction {R : Type*} [Ring R] [Algebra k R]
(E : QuadraticPresentation.Original k (Fin d) (polynomial P) ββ[k] R) :
R ββ[k] End Xβ := (quotientAction P s s' a b hc hr).comp E.symm.toAlgHom
omit [Preadditive C] in
/-- Evaluation of normalized generators, with the natural vertex identifications. -/
theorem normalized_evaluation {D : Type*} [Category D] (F : C β₯€ D)
{Y : D} (eβ : F.obj Xβ β
Y) (eβ : F.obj Xβ β
Y)
(x : Fin d β (Y βΆ Y))
(hs : F.map s β« eβ.hom = eβ.hom)
(ha : β h, F.map (a h) β« eβ.hom = eβ.hom β« x h) (h : Fin d) :
F.map (normalized s a h) β« eβ.hom = eβ.hom β« x h := by
have hsi : F.map (inv s) β« eβ.hom = eβ.hom := by
apply (cancel_epi (F.map s)).mp
rw [β assoc,β F.map_comp,IsIso.hom_inv_id,F.map_id,id_comp,hs]
change F.map (a h β« inv s) β« eβ.hom = _
rw [F.map_comp,assoc,hsi,ha]
end LittleFinitistic.QuotientAction
end OAI
|