Group theory and generalizations Definition
Heap
Builds on SetTernary operationGroup
Definition
A heap is a set with a ternary operation such that, for all :
- (para-associativity);
- and (identity law).
Remarks
Example: a group with . For clause 1, all three expressions equal ; the third one because . For clause 2, and .
Non-example: with . Clause 1 holds, since all three expressions equal . Clause 2 fails: .
Conversely, let be a nonempty heap and fix . Then makes a group with identity and inverse , and the heap operation is recovered as . Different choices of give isomorphic groups. Some authors allow the empty heap, which corresponds to no group.
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
- Element definition
- Group concept
- Ternary operation concept
- Set definition
- Heap definition
Further reading
About this page
| Tag | K9XQKT69WF |
|---|---|
| URI | m2://K9XQKT69WF |
| Kind | definition |
| Writing | W0 stub |
| MSC | 20N10, 08A62 |
| Defines | Heap |
| Uses | Set, Ternary operation, Group |
| 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.