Knaster–Tarski theorem

In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: Let (L,≤) be a complete lattice and let f : L → L be an order-preserving function (w.r.t. ≤). Then the set of fixed points of f in L also forms a complete lattice under ≤. The theorem has important applications in formal semantics of programming languages and abstract interpretation.

Knaster–Tarski theorem

In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: Let (L,≤) be a complete lattice and let f : L → L be an order-preserving function (w.r.t. ≤). Then the set of fixed points of f in L also forms a complete lattice under ≤. The theorem has important applications in formal semantics of programming languages and abstract interpretation.