Asymptotic fixed point theorem for infinite partially ordered sets (Q1331973): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points in partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of complete lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4064716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed point theorem for finite partially orderes sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank

Latest revision as of 16:31, 22 May 2024

scientific article
Language Label Description Also known as
English
Asymptotic fixed point theorem for infinite partially ordered sets
scientific article

    Statements

    Asymptotic fixed point theorem for infinite partially ordered sets (English)
    0 references
    0 references
    13 December 1995
    0 references
    If \(P\) is a poset and if \(f:P\to P\) is a comparability preserving map \((x\lesseqqgtr y\) implies \(f(x) \lesseqqgtr f(y)\), where \(x\lesseqqgtr y\) means \(x<y\), \(x=y\) or \(y<x\)), then \(f\) satisfies condition (C1) if there is a finite subset \(P'\) such that for all \(x\in P\), there exists an \(n(x)= n\) such that \(f^n (x)\in P'\). This condition permits the authors to extend certain fixed point results for finite posets to the class of mappings satisfying condition (C1). Fixed point properties of mappings are always of interest and usually powerful tools in many types of further analysis. Classifying posets with suitable fixed point properties for mappings is no exception and has a relatively long history leading from certain lattice examples to classes of lattices and thence to classes of posets. In this paper an ``analogy method'' starting with results obtained via homological methods on order- complexes of finite posets, and thus quite combinatorial in nature, is employed to extend the computations via suitable refinements to a result (Proposition 4.3) from which several corollaries are obtained generalizing results obtained in the case of finite posets. Thus, e.g., if \(P\) is \(Q\)-acyclic then every increasing mapping possesses a fixed point, generalizing a result of Baclawski and Fournier.
    0 references
    comparability preserving map
    0 references
    fixed point
    0 references
    order-complexes
    0 references

    Identifiers