Problem S-1. State and prove a simple correspondence between closure systems and closure operators on the same set.
Problem S-2. Prove this fact due to Tarski:
Theorem. Let
be a complete lattice and let
be
isotone (i.e., order-preserving). Then
has a fixed point.
In other words, there is an element
with
.
(Suggestion: Let
and let
.)
Problem
S-3. The completion by cuts
CC
of a partially
ordered set
is the lattice of closed
subsets of
under the polarity
. It can be
shown that
is isomorphically embedded in
CC
by
, with all
existing meets and joins preserved. Draw diagrams of the
completion by cuts of the two partially ordered sets shown in
Figure
. Notice that the two middle elements in the
second diagram are not comparable. (Suggestion: Start by
identifying the closures of singletons. Their meets become set
intersections. Joins can be found dually.)
Problem S-4. Find a simple description (up to isomorphism) of the completion by cuts of the chain of rational numbers.
Problem
S-5. For these contexts
, describe the closed subsets
in these examples, stating whether your description is both a necessary
and sufficient condition or just necessary, and giving proof where asked:
(a)
R (the reals),
is the set of all continuous
functions
R
R, and
means
.
Prove your description of the
-closed subsets.
(b)
R
and
means
.
Problem
S-6. In the context
, the statement that a
particular subset
of
is closed actually has the force
of an existence statement and so can be highly nontrivial.
Specifically, if
is closed, then for each
there exists
such that
for all
but not
. Write such existence statements in these
more specific contexts from §
, using your knowledge
of what the closed subsets of
are:
(a) Example 2(a).
(b) Example 4(a).
(c) Example 7(a).