OAI/Algebra/Finitistic/Localization/QuotientAction.lean
11 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.LittleFinitistic.QuotientAction.normalizedline 17 - lemma
OAI.LittleFinitistic.QuotientAction.normalized_product_compline 21 - lemma
OAI.LittleFinitistic.QuotientAction.normalized_compline 28 - theorem
OAI.LittleFinitistic.QuotientAction.normalized_relationsline 37Source documentation
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 … - def
OAI.LittleFinitistic.QuotientAction.polynomialline 46Source documentation
The degree-at-most-two defining polynomial with the displayed coefficients.
def polynomial (j : Fin t) : FreeAlgebra k (Fin d) := …
- def
OAI.LittleFinitistic.QuotientAction.freeActionline 50 - lemma
OAI.LittleFinitistic.QuotientAction.freeAction_polynomialline 54 - def
OAI.LittleFinitistic.QuotientAction.quotientActionline 59Source documentation
The genuine quotient action theta, obtained by descending the free action.
noncomputable def quotientAction : QuadraticPresentation.Original k (Fin d) (polynomial P) →ₐ[k] End X₀ := …Mentions: OAI.LittleFinitistic.QuadraticPresentation.Original, OAI.LittleFinitistic.QuotientAction.polynomial
- theorem
OAI.LittleFinitistic.QuotientAction.quotientAction_generatorline 67 - def
OAI.LittleFinitistic.QuotientAction.presentedActionline 74Source documentation
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 …Mentions: OAI.LittleFinitistic.QuadraticPresentation.Original, OAI.LittleFinitistic.QuotientAction.polynomial, OAI.LittleFinitistic.QuotientAction.quotientAction
- theorem
OAI.LittleFinitistic.QuotientAction.normalized_evaluationline 80Source documentation
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 …