Order, lattices, ordered algebraic structures Definition
Ordered group
Builds on GroupPartial order
Definition
Let be a group with identity , and let be a partial order on . The pair is an ordered group, or partially ordered group, if for all ,
Remarks
Example: under addition, with when and , is an ordered group. If and , then and for each . Non-example: on , let when or . This is a partial order, but while , so adding breaks the condition. The positive cone of is . It satisfies , and for each . Conversely, each subset with these three properties defines an ordered group by . For an abelian group the condition is written additively: implies .
Reading path
To understand this page from the ground up, read these 17 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Group concept
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Preorder definition
- Partial order definition
- Ordered group definition
Where this leads
8 pages build on this one.
Further reading
About this page
| Tag | A49BATWQEH |
|---|---|
| URI | m2://A49BATWQEH |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06F15, 20F60 |
| Defines | Ordered group |
| Uses | Group, Partial order |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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.