Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2008-01-20 07:13:44

Registered: 2007-02-23
Posts: 6,868

Knaster–Tarski theorem

Recently I was stuck on how to to prove the following.

It eventually occurred to me that the problem might have something to do with the theory of posets and functions which preserve order in posets. I already knew something about posets (partially ordered sets). So I looked them up on the Internet – and found that the problem actually had something to do with complete lattices. A complete lattice is a poset in which every subset has a supremum and an infimum. The power set

with the subset order is certainly a complete lattice because if
is a collection of subsets of Q, its supremum is
and its infimum is
. (NB: this applies to the empty collection as well. The supremum of the empty collection is Ø and the infimum of the empty collection is Q.)

I presently found out about the Knaster–Tarski theorem: If L is a complete lattice and f:LL is an order-preserving function, then the set of all fixed points of f is also a complete lattice.

This doesn’t solve the original problem directly, but I sensed that I was on the right track. And then I found this: … 1-talk.pdf Clapping.gif

So, in the original problem, taking

will do the trick. jumping-smiley-017.gif … p?t=183245

Last edited by JaneFairfax (2008-01-20 07:39:07)


Board footer

Powered by FluxBB