General algebraic systems Definition
Finitary operation
Builds on ArityFunctionCartesian product
Definition
Let be a set and let be an integer. Write for the Cartesian product of copies of , with the one-element set whose element is the empty tuple. An -ary operation on is a function . A finitary operation on is an -ary operation on for some integer , called its arity.
Remarks
Example: the map , , is a finitary operation of arity on , because is an integer for all integers .
Non-example: division is not a binary operation on , because it is not defined when , so it is not a function on all of . On it is a binary operation.
The requirement that the values lie in is often called closure of under . Some authors use the word operation only for finitary operations.
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
- Arity concept
- Cartesian product concept
- Function concept
- Finitary operation definition
Further reading
About this page
| Tag | K8RE4YQ1S9 |
|---|---|
| URI | m2://K8RE4YQ1S9 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08A62, 08A02 |
| Defines | Finitary operation |
| Uses | Arity, Function, Cartesian product |
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.