OAI/Algebra/Finitistic/Encoding/PresentationReindex.lean
15 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.LittleFinitistic.PresentationReindex.renameHomline 13 - theorem
OAI.LittleFinitistic.PresentationReindex.rename_ιline 16 - def
OAI.LittleFinitistic.PresentationReindex.renameline 20 - theorem
OAI.LittleFinitistic.PresentationReindex.rename_applyline 25 - theorem
OAI.LittleFinitistic.PresentationReindex.rename_wordline 27 - lemma
OAI.LittleFinitistic.PresentationReindex.rename_degreeline 33 - def
OAI.LittleFinitistic.PresentationReindex.renamedRelationline 45 - def
OAI.LittleFinitistic.PresentationReindex.forwardline 47 - def
OAI.LittleFinitistic.PresentationReindex.backwardline 55 - theorem
OAI.LittleFinitistic.PresentationReindex.forward_mkline 63 - theorem
OAI.LittleFinitistic.PresentationReindex.backward_mkline 67 - def
OAI.LittleFinitistic.PresentationReindex.presentationEquivline 72Source documentation
Relabeling finite generators and relations preserves the actual presented algebra.
noncomputable def presentationEquiv : Original k α p ≃ₐ[k] Original k β (renamedRelation e j p) := …
Mentions: OAI.LittleFinitistic.PresentationReindex.renamedRelation
- theorem
OAI.LittleFinitistic.PresentationReindex.exists_relationsline 90Source documentation
Every finite list of quadratic polynomials has the concrete coefficient interface used by the three-vertex algebra.
theorem exists_relations {d t : ℕ} (p : Fin t → FreeAlgebra k (Fin d)) (hp : ∀ i, p i ∈ degreeLE k (Fin d) 2) : ∃ P : QuadraticEncoding.Relations k d t, ∀ i, QuotientAction.polynomial P i = p i := by …Mentions: OAI.LittleFinitistic.QuadraticEncoding.Relations, OAI.LittleFinitistic.QuotientAction.polynomial
- theorem
OAI.LittleFinitistic.PresentationReindex.finite_quadratic_encodingline 103Source documentation
Finite generator and equation types may both be replaced by Fin, and all coefficient choices preserve the exact quotient algebra.
theorem finite_quadratic_encoding [Finite α] [Finite κ] (p : κ → FreeAlgebra k α) (hp : ∀ i, p i ∈ degreeLE k α 2) : ∃ (d t : ℕ) (P : QuadraticEncoding.Relations k d t), Nonempty (Original k (Fin d) (QuotientAction.polynomial P) ≃ₐ[k] Original k α p) := by …Mentions: OAI.LittleFinitistic.QuadraticEncoding.Relations, OAI.LittleFinitistic.QuotientAction.polynomial
- theorem
OAI.LittleFinitistic.PresentationReindex.auxiliaryGroupAlgebra_has_encodingline 121Source documentation
The entire actual complex group algebra feeds the finite directed encoding.
theorem auxiliaryGroupAlgebra_has_encoding : ∃ (d t : ℕ) (P : QuadraticEncoding.Relations ℂ d t), Nonempty (Original ℂ (Fin d) (QuotientAction.polynomial P) ≃ₐ[ℂ] MonoidAlgebra ℂ Presentation.AuxiliaryGroup) := by …Mentions: OAI.LittleFinitistic.QuadraticEncoding.Relations, OAI.LittleFinitistic.QuotientAction.polynomial, OAI.LittleFinitistic.Presentation.AuxiliaryGroup