General algebraic systems Definition
Primal algebra
Builds on Functional completenessTerm operationFinite setQuasi-primal algebra
Definition
Let be an algebra whose universe is a finite set with at least two elements. The algebra is primal if every operation with is a term operation of . Equivalently, the set of basic operations of is functionally complete.
Remarks
Example: the ring for a prime is primal. Check: the polynomial equals at and elsewhere, by Fermat's little theorem. Then , and each is a sum of copies of . Non-example: the field with its ring operations is not primal. Its Frobenius map is an automorphism, and term operations commute with automorphisms. A constant operation with value outside does not commute with it, so it is not a term operation. Every primal algebra is quasi-primal.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Finite set concept
- Functional completeness concept
- Quasi-primal algebra concept
- Term operation concept
- Primal algebra definition
Further reading
About this page
| Tag | T440VB9JJM |
|---|---|
| URI | m2://T440VB9JJM |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08A40 |
| Defines | Primal algebra |
| Uses | Functional completeness, Term operation, Finite set, Quasi-primal algebra |
| 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.