Question

In: Advanced Math

Exercise 31: (General definition of a topology) Let X be a set and O ⊂ P(X),...

Exercise 31: (General definition of a topology) Let X be a set and O ⊂ P(X), where P(X) := {U ⊂ X}. O is a topology on X iff O satisfies

(i) X∈O and ∅∈O;
(ii) ?i∈I Ui ∈ O where Ui ∈ O for all i ∈ I and I is an arbitrary index set;

(iii) ?i∈J Ui ∈ O where Ui ∈ O for all i ∈ J and J is a finite index set.
In a general topological space O on some X a sequence (xn) ⊂ X converges to x ∈ X iff

for all neighborhoods x ∈ U ∈ O there exists N such that xn ∈ U for all n ≥ N. Show

a) O = ?{a},{b,c},{a,b,c},{∅}? defines a topology on X = {a,b,c}.

b) Write down all possible topologies on X = {a, b, c}.

c) Oc = ?U ⊂ R : R\U isatmostcountableorallofX? defines a topology onX = R. Moreover, show that a sequence (xn) ⊂ R equipped with the topology Occonverges if and only if (xn) is eventually constant, i.e. xn = x for all n ≥ N for some N.

Solutions

Expert Solution


Related Solutions

Definition 1 (Topological space). Let X be a set. A collection O of subsets of X...
Definition 1 (Topological space). Let X be a set. A collection O of subsets of X is called a topology on the set X if the following properties are satisfied: (1) emptyset ∈ O and X ∈ O. (2) For all A,B ∈ O, we have A∩B ∈ O (stability under intersection). (3) For all index sets I, and for all collections {Ui}i∈I of elements of O (i.e., Ui ∈ O for all i ∈ I), we have U i∈I...
Let X be a non-empty set and P(X) its power set. Then (P(x), symetric difference, intersection)...
Let X be a non-empty set and P(X) its power set. Then (P(x), symetric difference, intersection) is a ring. Find a non-trivial ideal of P(X).
Let X = NN endowed with the product topology. For x ∈ X denote x by...
Let X = NN endowed with the product topology. For x ∈ X denote x by (x1, x2, x3, . . .). (a) Decide if the function given by d : X × X → R is a metric on X where, d(x, x) = 0 and if x is not equal to y then d(x, y) = 1/n where n is the least value for which xn is not equal to yn. Prove your answer. (b) Show that no...
Considering the set X = {1,2,3,4,5,6,7,8}, calculate a Tx topology on X such that the following...
Considering the set X = {1,2,3,4,5,6,7,8}, calculate a Tx topology on X such that the following two conditions are met: Tx has exactly 8 different elements, that is, | Tx | = | X | = 8 It is possible to find a subspace S of X with three elements, such that the relative topology Ts in S (with respect to Tx) has exactly 8 different elements, that is, | Ts | = | Tx | = | X |...
Let x be a set and let R be a relation on x such x is...
Let x be a set and let R be a relation on x such x is simultaneously reflexive, symmetric, and antisymmetric. Prove equivalence relation.
X is infinite set with the finite complement topology. X is Hausdorff ??? why??? please thank...
X is infinite set with the finite complement topology. X is Hausdorff ??? why??? please thank U
TOPOLOGY Let f : X → Y be a function. Prove that f is one-to-one and...
TOPOLOGY Let f : X → Y be a function. Prove that f is one-to-one and onto if and only if f[A^c] = (f[A])^c for every subset A of X. (prove both directions)
Let S be a set and P be a property of the elements of the set,...
Let S be a set and P be a property of the elements of the set, such that each element either has property P or not. For example, maybe S is the set of your classmates, and P is "likes Japanese food." Then if s ∈ S is a classmate, he/she either likes Japanese food (so s has property P) or does not (so s does not have property P). Suppose Pr(s has property P) = p for a uniformly...
Consider a finite set A = {a1,...,an}, and let P(x) be some statement. – Explain why...
Consider a finite set A = {a1,...,an}, and let P(x) be some statement. – Explain why ∀x(x∈A → P(x)) is equivalent to P(a1)∧P(a2)∧...∧P(an). – Explain why ∃x(x∈A∧P(x)) is equivalent to P(a1)∨P(a2)∨...∨P(an). (It may help to think about some special cases like n = 2, n = 3. A formal proof is not required here.)
Let S be a set of n numbers. Let X be the set of all subsets...
Let S be a set of n numbers. Let X be the set of all subsets of S of size k, and let Y be the set of all ordered k-tuples (s1, s2,   , sk) such that s1 < s2 <    < sk. That is, X = {{s1, s2,   , sk} | si  S and all si's are distinct}, and Y = {(s1, s2,   , sk) | si  S and s1 < s2 <    < sk}. (a) Define a one-to-one correspondence f : X → Y. Explain...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT