General algebraic systems Definition
Polynomial operation
Builds on Term operationCongruence relationPolynomial function
Definition
Let be an algebra and let . An operation is an -ary polynomial operation of if the following holds. There are , an -ary term operation of , and elements such that for all .
Remarks
Equivalently, the polynomial operations of are the term operations of the algebra obtained from by adding a constant symbol for each element of . Every term operation is a polynomial operation, with . An equivalence relation on is a congruence exactly when it is preserved by every unary polynomial operation of . For a commutative ring , the polynomial operations of are the polynomial functions given by polynomials with coefficients in .
Example: in the group , the map is a polynomial operation. Take and ; then .
Non-example: on the map is not a polynomial operation. By induction on terms, every unary polynomial operation of this group has the form with . The map is not of this form, since its values at are not in arithmetic progression.
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
- Congruence relation concept
- Polynomial function concept
- Term operation concept
- Polynomial operation definition
Further reading
About this page
| Tag | FC34XP2DQV |
|---|---|
| URI | m2://FC34XP2DQV |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08A40 |
| Defines | Polynomial operation |
| Uses | Term operation, Congruence relation, Polynomial function |
| 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.