(5 pts) Give an example of a relation on a set that is a) both symmetric...
(3 pts each) For each of the following find an indexed collection {An}nen of distinct sets (no two sets are equal) such that (a) n=1 An = {0} (b) Un=1 An = [0, 1] (c) n=1 An = {-1,0,1} (5 pts each) Give example of an explicit function f in each of the following category with properly written domain D and range R such that (a) There exists a subset S of D with f-'[F(S)] + S (b) There exists...
(5 pts each) Give example of an explicit function f in each of the following category with properly written domain D and range R such that (a) There exists a subset S of D with f-'[F(S)] + S (b) There exists a subset T of R with f[f-(T)] #T (11) (3+3+ 5 + 5 + 2) Define functional completeness. Show that x + y = (x + y) + (x + y), x · y = (x + x) +...
Determine whether the relation R on the set of all real numbers is reflexive, symmetric, antisymmetric, and/or transitive, where (x, y) ∈ R if and only if a) x + y = 0 b) x= ±y. c) x-y is a rational number. d) = 2y. e) xy ≥ 0. f) xy = 0. g) x=l. h) r=1 or y = 1
Question 1 1. [5 pts] Give a complete definition of lim f(x) = -oo if... 2. [25 pts] Give an example of each of the following, or state one or more theorems which show that such an example is impossible: a. A countable collection of nonempty closed proper subsets of R whose union is open. b. A nonempty bounded subset of R with no cluster points. c. A convergent sequence with two convergent subsequences with distinct limits. d. A function...
Define the set F- (XI X is a finite set of counting numbers) and the relation is a finiice sei of counting nuobors and the relation {(X Z〉 | Ye F and Z € Fand y-2). This relation is just a version of the usual subset relation, but restricted to only apply to the sets in F Prove: CFis a partial order. Prove: Cis not symmetric and connected. Prove: If R is an equivalence relation, it is also a euclidean...
4.(5 pts)Give an example of a 3 x 3 matrix with eigenvalues of 2, 2, and -3 that is diagonalizable. Show that it is, in fact, diagonalizable, and find C and D such that C (you may make this as trivial as you wish!) AC = D 5.(5 pts) Give an example of a 3 x 3 matrix with eigenvalues of 2, 2, and -3 that is NOT diagonalizable. Show WHY it is not diagonalizable. 6. (5 pts) Let T:...
Let A = { 1, 2, 3, 4, 5 }. Give examples of a relation over AxA that has exactly 5 elements that satisfy each of the following properties: Reflexive: Irreflexive: Symmetric: Antisymmetric: Transitive:
Question 2 For each of the following relations R, determine (and explain) whether R is: (1) reflexive (2) symmetric (3) antisymmetric (4) transitive (a) R-(x, y):x +2y 3), defined on the set A 10, 1,2,3) (b) R-I(x, y): xy 4), defined on the set A (0,1,2,3,4 (c) R-(x, y): xy 4), defined on the set A-0,,2,3) Question 2 For each of the following relations R, determine (and explain) whether R is: (1) reflexive (2) symmetric (3) antisymmetric (4) transitive (a)...
4. Let S be the set of continuous function f: [0;1) ! R. Let R be the relation defined on S by (f; g) 2 Rif(x) is O(g(x)). (a) Is R reflexive? (b) Is R antisymmetric? (c) is R symmetric? (d) is R transitive? Explain your answer in details. Use the definition of big-O to justify your answer if you think R has a certain property or give a counter example if you think R does not have a certain...
(4) (a) Give an example of a relation (different to those in question 1) which is symmetric and transitive but not reflexive. (b) Identify the problem with the following proof: Let R be a relation on a set S, and suppose that R is symmetric and transitive. Since the relation is symmetric, we know that a bb~a, and then it follows from transitivity that a ~b and b ~ a → a ~ a. Therefore any symmetric and transitive relation...