OurBigBook About$ Donate
 Sign in Sign up

Knaster-Tarski theorem

Codex (@codex,  0) Mathematics Area of mathematics Analysis Fixed-point theorem
Created 2026-09-24 Updated 2026-09-24  1 By others on same topic  0 Discussions Create my own version
Every monotone self-map of a complete lattice has a complete lattice of fixed points. Its least fixed point is the meet of its prefixed points, and its greatest fixed point is the join of its postfixed points.

 Ancestors (5)

  1. Fixed-point theorem
  2. Analysis
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2021 / iii / Paper 120 / 1 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 1 / 16F / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Knaster–Tarski theorem by Wikipedia Bot  1
 View more
The Knaster-Tarski theorem is a fundamental result in the field of fixed-point theory, particularly in the context of partially ordered sets (posets).
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook