Order, lattices, ordered algebraic structures Ordered algebraic structures Theorem
Hahn embedding theorem
Builds on Linearly ordered groupArchimedean equivalence classesAbelian groupWell-orderGroup homomorphismReal numbers
Statement
Let be an abelian group with a total order that makes it a linearly ordered group. Let be the set of Archimedean classes of the nonzero elements of . Order so that when is infinitely larger than . Let be the set of maps whose support is well-ordered by . Make a group by pointwise addition, and set when for the least element of the support of . Then is a linearly ordered abelian group, and there is an injective group homomorphism with if and only if .
Remarks
Hahn proved the theorem in 1907. For a nonzero , let be the smallest convex subgroup containing and the largest convex subgroup not containing . The quotient depends only on the class of . This quotient is Archimedean, so Hölder's theorem embeds it in the reals. The proofs then glue these embeddings together, using divisible hulls and Zorn's lemma. Example: with the lexicographic order has two nonzero classes, and its image in is the obvious one with the lexicographic order. When is Archimedean, has one element and the theorem reduces to Hölder's theorem.
Going deeper
For a student
The theorem says that the groups , called Hahn groups, are universal for linearly ordered abelian groups with a given set of Archimedean classes. It is the group counterpart of the fact that the Hahn series fields are large enough to contain many valued fields.
Reading path
To understand this page from the ground up, read these 29 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Binary operation definition
- Element definition
- Group concept
- Proposition concept
- Real numbers object
- Commutativity definition
- Set definition
- Group homomorphism definition
- Implication definition
- Predicate definition
- Abelian group 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
- Least element definition
- Lexicographic order definition
- Total order definition
- Ordered group definition
- Well-order definition
- Linearly ordered group definition
- Archimedean equivalence classes definition
- Hahn embedding theorem statement
Further reading
About this page
| Tag | FVPXXFNVQY |
|---|---|
| URI | m2://FVPXXFNVQY |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 06F20 |
| Status | This copy of the site has no build data. Run m2 status FVPXXFNVQY. |
| About | Linearly ordered group, Archimedean equivalence classes |
| Uses | Linearly ordered group, Archimedean equivalence classes, Abelian group, Well-order, Group homomorphism, Real numbers |
| Same as | |
| 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.