Dedekind cuts of Archimedean complete ordered abelian groups (Q1272102): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s000120050014 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jiří Rachůnek / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jiří Rachůnek / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s000120050014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069518619 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S000120050014 / rank
 
Normal rank

Latest revision as of 17:12, 10 December 2024

scientific article
Language Label Description Also known as
English
Dedekind cuts of Archimedean complete ordered abelian groups
scientific article

    Statements

    Dedekind cuts of Archimedean complete ordered abelian groups (English)
    0 references
    0 references
    23 November 1998
    0 references
    If \(G\) is a linearly ordered abelian group, then the breadth of a Dedekind cut \((X,Y)\) of \(G\), written \(B(X,Y)\), is here defined as the largest convex subgroup \(G'\) of \(G\) for which \(x+| g'| \in X\) for all \(x\in X\) and all \(g'\in G'\). A Dedekind cut \((X,Y)\) of \(G\) is called \(B(X,Y)\)-continuous if \((X+B(X,Y),Y+B(X,Y))\) is a continuous cut in the linearly ordered factor group \(G/B(X,Y)\). The author proves that \(G\) is Archimedean complete if and only if every Dedekind cut \((X,Y)\) of \(G\) is \(B(X,Y)\)-continuous. Further he establishes a constructive proof that Dedekind cuts of Hahn groups are \(B(X,Y)\)-continuous.
    0 references
    ordered abelian group
    0 references
    Dedekind cut
    0 references
    Archimedean complete ordered group
    0 references
    Hahn groups
    0 references

    Identifiers