Scribd
Upload
31 views6 pages

Proof Portfolio

The document contains proofs of several mathematical statements: 1) A linear order is well-ordered if and only if it does not contain an infinite descending sequence. 2) The supremum norm defines a norm on the space of bounded functions from the real numbers to itself. 3) A function from the power set of a set to itself is a Kuratowski closure operator if it satisfies four properties.

Uploaded by

Tanya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views6 pages

Proof Portfolio

The document contains proofs of several mathematical statements: 1) A linear order is well-ordered if and only if it does not contain an infinite descending sequence. 2) The supremum norm defines a norm on the space of bounded functions from the real numbers to itself. 3) A function from the power set of a set to itself is a Kuratowski closure operator if it satisfies four properties.

Uploaded by

Tanya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Proof Portfolio

Jeffrey Strachan
November 16, 2015

An infinite descending sequence in a linear order (X, ) is a sequence


x1 , x2 .... of elements of X such that xi+1  xi for all i N. Prove that a
linear order (X, ) is well ordered if and only if it has no infinite descending
sequence.
Proof. A set is well ordered if it has a linear order  and every nonempty
subset of X has a minimal element. Suppose X has an infinite descending
sequence xn . Then xn is unbounded below, so X is not well ordered. Conversely suppose X is not well ordered. Let S X such that S does not
have a minimal element. Pick x1 S. x1 is not minimal, so there is an
x2 S such that x2 < x1 Continuing in this way, we construct a sequence of
elements x1 > x2 > x3 > . Since for i N, xi S. We have an infinite
descending sequence in X.

Let B(R) be the set of all bounded functions from R to R. For f B(R),
let ||f || = sup{|f (x)| : x R}. This norm is called the sup norm on B(R).
Prove that || || defines a norm on B(R). This means that:
(a) ||f || 0 for all f B(R).
(b) ||f || = 0 if and only if f = 0, for all f B(R).
(c) ||f || = || ||f || for all f B(R) and R.
(d) ||f + g|| ||f || + ||g|| for all f, g B(R)
Proof. Since |f | 0 for all f , any upper bound u 0, so ||f || 0. Now
since B(R) is a vector space the function f = 0 B(R) and since |f | = 0 if
and only if f = 0, we get ||f || = 0. Also if ||f || = 0 then |f | = 0, so f = 0
for all x R. Now to verify property (c) let R. Then
||f || = sup{|f (x)| : x R} = sup{|||f (x)| : x R} = ||sup{|f (x)| :
x R} = || ||f || for all f B(R)
Finally to verify property (c) we apply the triangle inequality and property of sups to get
||f + g|| = sup{|f (x) + g(x)| : x R} sup{|f (x)| + |g(x)| : x R} =
sup{|f (x)| : x R} + sup{|g(x)| : x R} = ||f || + ||g||

Given a set X, we can look at functions that map each subset of X to


another subset of X; these functions maps the powerset P (X) to itself. Given
C : P (X) P (X), we call C a Kuratowski closure operator if C has the
following properties:
(a) C() =
(b) A C(A) for all A X.
(c) C(A B) = C(A) C(B) for all A, B X
(d) C(C(A)) = C(A) for all A X
Proof.

a) C() = =

b) Let A X, C(A) = A (A) A


We
c) Let A, B X, then C(A B) = A B and C(A) C(B) = A B.

want to show A B = A B. First we show (A B) (A) (B).


c
B)A

B
then
Suppose x
/ (A)(B) then x (A
B . If x A
c
x A\(A)B \(B) implies x AB \(AB). If x A B then
x
/ A B = A B (A B). Thus (A B) (A) (B). Now let
x A B then x A B (A B) implies x A B (A) (B)

implies x A B.
then x A or x B
implies x A (A)
Now suppose x A B
or B (B) implies x A B (A) (B) implies x A B since
(A B) (A) (b). So we conclude C(A B) = C(A) C(B).
= A = A = C(A).
d) C(A) = A We have C(C(A)) = C(A)
Thus A A is a Kuratowski closure operator.

a T is continuous at every point of E


b T is continuous at 0
Proof. (a) = (b)
Suppose T is continuous at every point of E. Let  be given. Choose
= . then when ||u 0|| = ||u|| < , ||T (u) T (0)|| = ||T (u 0)|| =
||T (u)|| < 
(b) = (a) Suppose T continuous at 0. Let  be given. Choose > 0
so that when ||uv|| < then ||T (u)T (0)| = ||T (u+v)T (vv)|| < 
since v is arbitrary this implies (a).

Let (X, d) be a metric space and let S be a nonempty subset of X. Show


that {z X : dist(z, S) < r} is an open set, for eachr > 0.
Proof. We define a function f (z) = dist(z, S). Let z, w X, then by triangle
inequality d(z, s) d(z, w) + d(w, s) for all s S. This implies inf d(z, s)
d(z, w). This implies inf {d(z, s)} d(z, w) + d(w, s), implies d(z, S)
d(z, w) + d(w, S). From this we get d(z, S) d(w, S) d(z, w). By reverse
triangle inequality |d(z, S) d(w, S)| d(z, w). Let  > 0 choose = 
then for d(z, w) |d(z, S) d(w, S)| = |f (z) f (w)| . Thus f is a
continuous function on x. Since f (z) = dist(z, S) < r, f (z), (0, r). Since f
is continuous f 1 (0, r) = {z X : dist(z, X) < r} is an open set in X.

You might also like