General algebraic systems Definition
Finitely generated algebra
Definition
Let be an algebra with universe . For , let denote the subuniverse generated by . It is the smallest subset of that contains and is closed under all fundamental operations of . The algebra is finitely generated when there is a finite set with .
Remarks
Example: the group is finitely generated. Indeed contains , all sums , and their negatives, so it is all of .
Non-example: the group is not finitely generated. If with a common denominator , then every element of is an integer multiple of , so .
Every finite algebra is finitely generated, with . In model theory the same notion is used for structures in a signature with relation symbols, where the relations play no role in generation.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Algebraic structure concept
- Finite set concept
- Generated subalgebra concept
- Finitely generated algebra definition
Further reading
About this page
| Tag | W251JWP6PS |
|---|---|
| URI | m2://W251JWP6PS |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08A30, 08A05 |
| Defines | Finitely generated algebra |
| Uses | Algebraic structure, Generated subalgebra, Finite set |
| Changed | 2 November 2026 |
Markdown Β· JSON Β· Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.