---
title: "Introduction"
canonical: "https://docs.magma-maths.org/v2.30-1/Algebras/FinitelyPresentedAlgebras/introduction.html"
source: "https://docs.magma-maths.org/v2.30-1/Algebras/FinitelyPresentedAlgebras/introduction.md"
part: "Algebras"
chapter: "Finitely Presented Algebras"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "https://docs.magma-maths.org/v2.30-1/index.md"}
  - {"title": "Algebras", "source": "https://docs.magma-maths.org/v2.30-1/Algebras/index-algebras.md"}
  - {"title": "Finitely Presented Algebras", "source": "https://docs.magma-maths.org/v2.30-1/Algebras/FinitelyPresentedAlgebras/index-finitely-presented-algebras.md"}
prev: {"title": "Finitely Presented Algebras", "source": "https://docs.magma-maths.org/v2.30-1/Algebras/FinitelyPresentedAlgebras/index-finitely-presented-algebras.md"}
next: {"title": "Representation and Monomial Orders", "source": "https://docs.magma-maths.org/v2.30-1/Algebras/FinitelyPresentedAlgebras/order.md"}
---

# Introduction

This chapter describes finitely presented algebras (FPAs) in Magma. An FPA is a quotient of a free associative algebra by an ideal of relations. To compute with these ideals, one constructs *noncommutative* Gröbner bases (GBs), which have many parallels with the standard commutative GBs, discussed in Chapter [Gröbner Bases](https://docs.magma-maths.org/v2.30-1/CommutativeAlgebra/GrobnerBases/index-grobner-bases.md#chapgb). At the heart of the theory is a noncommutative version of the *Buchberger algorithm* which computes a GB of an ideal of an algebra starting from an arbitrary basis (generating set) of the ideal. One significant difference with the commutative case is that a noncommutative GB may not be finite for a finitely-generated ideal. For overviews of the theory and the basic algorithms, see [[Li02](https://docs.magma-maths.org/v2.30-1/references.md#cite-li-noncommut), [Mor94](https://docs.magma-maths.org/v2.30-1/references.md#cite-moranoncommut)]. Magma also contains an implementation of a noncommutative generalization of the Faugere $F_4$ algorithm (due to Allan Steel), based on sparse linear algebra techniques, which usually performs dramatically better than the Buchberger algorithm, and so this is used by Magma by default.
