This action might not be possible to undo. Are you sure you want to continue?

1. If A ⊆ C and B ⊆ D, then show that A×B ⊆ C×D 2. Determine whether the relation R on the set A is an equivalence relation. A is the set of positive numbers, and a relation R is defined as aRb if a=bk, (a=bk) where k is some positive integer. 3. R be a reflexive relation on a set A. Show that R is an equivalence relation if and only if (a,b) and (a,c) ∈ R implies that (b,c) ∈ R. i.e. (a,b) & (a,c) ∈ R (b,c) ∈ R 4. Let C denote the set of complex numbers and let R denote the set of real numbers. Prove that the mapping f:C ⟶ R given by f(x+iy) = |x+iy|, where x and y are real ,is neither one to one nor onto. 5. For any set A and B, answer the following question: 1. Is the set, A ∅ well defined? 2. If A B = ∅ what can you say about the sets A and B? 3. Is it possible that AA=∅, for some set A? 6. (i) Show that the transitive closure of a symmetric relation is symmetric. (ii) Let R be a transitive and reflexive relation on A. Let T be a relation on A such that (a,b) is in T if and only if both (a,b) and (b,a) are in R. Show that T is an equivalence relation. 7. Let R be a binary relation and S={(a,b)| (a,c) & (c,b) ∈ R. Show that if R is an equivalence relation then S is also an equivalence relation. 8. Prove that if R is reflexive and transitive, then R n = R for all n. 9. A survey was conducted among 1000 people. 595 of them are democrats, 595 wear glasses and 550 like ice/cream. 395 democrats wear giasses. 350 democrats like ice cream. 400 of the people wear glasses and like ice cream. 250 democrats wear glasses and like ice cream. Answer the following questions: i. How many people are not democrats who do not wear glasses and do not like ice-cream, ii. How many people are democrats who do not like ice cream and do not wear glasses, 10. Let R and S be binary relations from A to B. Is it true that (R⋃S)-1 = R-1 ⋃ S-1. Justify your answer. 11. What can you say about the relation R on set A if R is a partial order and an equivalence relation? 12. Compute the transitive closure of R={(1,2),(2,3),(3,4),(4,5)} on {1,2,3,4,5}. 13. Test whether f(x) = x2 + l from the set of positive real number to the set of positive real

4). iii. 6. Compute the i.|].8. prove that f is one one and onto. 5. if A={1.9.4.5. 15.14. draw the Hasse diagram and determine all maximal and minimal elements and greatest and least elements if they exit. (2. and prove that (C×B). 24. (ii) onto. 25. C×B. where A= {2.5} and C{4.(3.1).5} then find A×B. Also find f(f(x)) and f(f(x2)).(2.5}.6. Consider the function f:R→R and g:R→R defined as f(x)=x+1 and g(x)=x 2 for all x in R.(1. B={3.4. (A×B)∩(B×A).6. 21. Let A {1. 8. where A={x | x is a real number and 0 < x≤ 1}. 4. 18.3. a) [D20. 10.(4. B×A. 23. B={4.42) and ≼ is defined as the partial order of divisibility. B×B. 27. Show that R is a Partial order on A and draw a Hasse diagram of R.5.5}. d) [A. Largest relation R1. 17. 32}? 28.(A×B)= B×B.6}.3} . . Consider function f:R →R defined as f(x)=2x+1 for all x in R. ≼). number is (i) one-one.9} verify that A∩ ∪C)= (A∩ ∪ ∩ 20. Find domain and range of the function (i) f(x)=1/√ (ii) f(x)= (x-3) /(x-3) 26.24. 19. minimal elements and greatest and least elements (if exist) of the Poset (A. If A={1. ≤ ].10} and B={4. Suppose A ∆ C = B ∆ C.6} find (A ∩ × (B ∩ (A×B) ∩ (B×C). Let n(E) denotes the cardinality of the set E and A={1.8.3} . Is R a totally order relation? What about if A= {2.5. 3.B={3. 16. If A={4. Transitive closure of R ii.3. Find all the maximal.2. 6. C={1.2.(2. Find A×B. Does it follow that A = B? Justify your answer. Largest relation R1 such that R1 ⊆ R and R1 is antisymmetric.4. A ={2. Let R={(1. |] c) [A.2. 15.2. such that R1 ⊆ R and R1 is irreflexive. If A={1.4.2. Define the cardinality of a set.4).5.9. where Dn is the set of all positive divisors of n and | denotes divides. 8.7. For each of the following posets. 16.3).3) and B={4.11} verify n(A ∪ n(A)+n(B)-n(A ∩ 22. 2.11}.2).5.3)} be a relation on {1. 24. 3. 4. find g∘f(x) and f∘g(x) for all x in R. 30} be a set and R be a relation of divisibility on A.3. b) [D30.2). 48}. | j. find a function g:R →R such that g(f(x))=x for all x in R. Consider function f:R →R defined as f(x)=2x for all x in R.

f. b. 2. 39. 1). then prove that b=c. Prove that every non-empty POSET (S. |).8.5.16. ) has a minimal element. 35.10. Determine whether Dn is a finite Boolean algebra. Find the complement of each element in D42.30} be a set and R be a relation of divisibility on A. 2. where S is a finite set and P(S) is the power set of S. Show that no element of L is its own complement? 38. Is R a linear order relation? What about if A= {2. (3.29.6. 3} 31. . Consider the relation R defined on A as follows. 42. 4). Draw the directed graph and Hasse diagram of R and R -1. 1. ). if it exists. 72}. ∧} be a distributive lattice such that a ∨ b = a ∨ c and a ∧ b= a ∧ c where a. d}. Check whether (P(S). 40.32}? 37.⊆) is a poset. 2).4. Consider the Poset L given below (1) Which elements are atoms? (2) Which elements are join irreducible? (3) Is L complemented? (4) Is L distributive? (5) Find glb and lub of {e. Draw Hasse diagram of the poset ({2. Let S be any non empty set and P(S) be the power set of S.3. c ∈ L then prove the dual of the associative property. symmetric and transitive closure of R using (a) composition of relation (b) matrix of relation (c) graphical method. 24. (2. Let A {1. 4} is defined by R = {(1. (3. If ⊆ (a subset of) is a relation defined on P(S). The relation R on a set A = {1. 4)}. 33. 36. 32. 3. Find the reflexive. 30. 3. 2). (1. 12. 41. State Principle of duality. Prove that if an element of a distributive lattice has a complement then that complement is unique. 3). c ∈ L. Show that R is a Partial order on A and draw a Hasse diagram of R. then show that (P(S). Let L be a lattice and a. b. (3. Let {L.is a lattice.15. where (i) n=12 (ii) n=40 (iii) n=75 (iv) n=21 (v) n=70? 36.2. (1. Let L be a bounded lattice with at least two elements. a (b c) = (a b) c 34. 3). 6. ∨. Where R = {(0. 3)} on A = {0.

6} be ordered as shown here. Draw the Hasse diagram of Y. 4)}. Suppose X = {1. b. (6. Greatest and least element. (c) Is L distributive? a (d) Is L complemented? 47. c). 15}. Show that the lattice L represented by the diagram is Distributive but not complemented. 2. (3. (e. (a) Find all sublattices with five elements. 1 e b c 0 a 5 3 1 d b a e c 2 6 4 1 b 0 c d 48. a)}. 3. Let S be the ordered set. b). c. 2). Consider the lattice as shown in fig. Let A = {1. 5. 4. a c 1 49. Show that R is a partial ordering and draw its Hasse Diagram. All minimal and maximal elements of S. (4. 8. 2. 1). c. All linearly ordered subsets with three or more elements. (12. 1). 45. (3.43. 3. Find a. (c. 2. 5). 4} and consider the relation R = {(1. 2. 44. . 4. 1). d). (8. 3). 4)} is a similarity mapping from S to A. (2. 6. Draw the Hasse diagram of A where Hasse diagram of S is 46. b. 10. 1). (d. (3.5. Suppose A = {1. 3. (2. 2). (2. (b. b 0 50. 11. 3). 4). Let S = {1. d. 5} is isomorphic to S and f = {(a. d (b) Find complements of a and b. 12} is ordered by divisibility and suppose Y = {a. e} is isomorphic to X. Show that the lattice L represented by the diagram is complemented but not distributive. 2. The mapping from X to Y is as follows: f = {(1. Draw the Hasse diagram for the ‘less than or equal to’ relation on the set A = {0. e).

- Giáo Trình Topo
- Ring of sets 1_3
- Ring of sets 1_2
- n
- Ring of sets 1_4
- Antisymmetric VS. Asymmetric Discrete Structures
- Ring of sets 1_6
- Sets
- Grace (Sets)nhjhghg
- Ring of sets 1_9
- 12 4 2004 Undergrad Top Moore Method
- Pi system 1_5
- Set Theory
- H011514550.pdf
- Sigma Algebra
- Set Theory_Handout (1)
- Advanced Calculus I Hw2
- Sets (Mathematics)
- Club set
- Ordinal Numbers
- Chap 2
- Ordinal Numbers
- Complete Lattice
- MeasureTheory UCLA
- Set Theory and Venn Diagrams
- Smarandache Soft-Neutrosophic-Near Ring and Soft- Neutrosophic Bi-Ideal
- Indicator Vector
- Lecture 2
- Sets
- Ex1 - Sets and Algebraic Expressions
- Question Bank BCA 102

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd