PROBLEM 7: Binary Relations, Functions and Orderings (15 pts)1. (2 pts) Prove that ({2, 3, 4, 6, 24, 36, 72}, /) is a poset, create its corresponding Hassediagram and identify maximal and minimal elements.2. (1 pts) Prove that (P{1, 2, 3}, C) is a poset, create its corresponding Hasse diagramand identify maximal and minimal elements3. Assume the following mapping, captured by variable map:map ={72 {1,2,3},36{3},24 {1,2},6- → {3},4 {1,3},2➡ {}}Provide answers to the following in detail (in plain english and formally):(a) (2 pts) Is variable map a function? If so, is it a total or a partial function? Identifydomain and codomain.(b) (10 pts) Discuss all properties (injectivity, surjectivity, bijection, order preserving,order reflecting, order embedding, isomorphism).NOTE: When we reason formally on a property we must state: (1) What Law do we expectto hold or not hold, and (2) Does this Law indeed hold or Is this Law violated?

1. Proof that ({2,3,4,6,24,36,72},/) is a Poset A partially ordered set (poset) is a set with a…

Answered: PROBLEM 7: Binary Relations, Functions…

Linear Algebra: A Modern Introduction

4th Edition

ISBN:9781285463247

Author:David Poole

Publisher:David Poole

Chapter2: Systems Of Linear Equations

Section2.4: Applications

Problem 33EQ

See similar textbooks

Similar questions

31. In Example 2.35, describe all possible configurations of lights that can be obtained if we start with all the lights off.
6. The sets A and B are defined as: A = {2,5, 7} B = {*,+} (a) Express the set A x B in roster notation. (b) Give an example of an element in A × B × B × B. (c) Give an example of an element in B³. (d) What is A × (Ø.
(1.) Let T = {1, 2, 3, 4, 5, 6, 7, 8, 9}. Suppose five integers are chosen from T. Show that it is not true that there must be two integers whose sum is 10 by giving a counterexample. In other words, fill in the blank with five numbers from T, no two of which have a sum of 10. (Enter your answer in set-roster notation.) (2.) Suppose five pairs of similar-looking boots are thrown together in a pile. What is the minimum number of individual boots that you must pick to be sure of getting a matched pair? Why? Since there are 5 pairs of boots in the pile, if at most one boot is chosen from each pair, the maximum number of boots chosen would be............? . It follows that if a minimum of............. boots is chosen, at least two must be from the same pair.
2. a. List all 3-combinations for the set {x1, x2, x3, X4, Xs}. Deduce the value of (,). b. List all unordered selections of two elements from the set {x1, x2, x3, X4, Xs, X6}. Deduce the value of ().
–14 -16] -20, a2 Let ai -16 and az -18 -4 -4 -4 The set {a1, a2, az} will span R' unless h
The difference of two sets, A – B, is defined as the set containing all elements of A except those in B. That is, A - B = AN B'. Find A - B for the pair of sets if U = {1, 2, 3, 4, 5, 6, 7, 8, 9}. (Enter your answer in roster notation. Enter EMPTY or Ø for the empty set.) A = {3, 5, 9} and B = {2, 4, 6, 7, 8, 9} A - B =
3) Let A = {1, 2, 3, 4, 5, 6, 7, 8}. How many possible symmetric relations over A contain the ordered pairs (2,3),(3,2), (4, 7), (5, 5) and (8, 7)?
Consider the set A = {2, 4, 6, 8} with an operation defined by the table. 2 4 6 8 2 8 6 2 4 4 6 8 4 2 6 2 4 6 8 8 4 2 8 6 a b means find the entry in row a and column b; for example, 2 4 = 6 (the entry in row 2 and column 4). Find each of the following. (a) 6 4(b) 8 2(c) 2 6(d) 8 8(e) 4 6(f) 2 8(g) 6 2(h) 6 6
1) Is {(1, 0,3), (1, 4, -2), (-8, 12, -4), (1, 37, 17)} a linearly independent list?
5. Let A, B, and C be subsets of some universal set U. (a) Draw two general Venn diagrams for the sets A, B, and C. On one, shade the region that represents A - (BC), and on the other, shade the region that represents (A - B) U (AC). Based on the Venn diagrams, make a conjecture about the relationship between the sets A-(BC) and (A - B) U (A–C). (b) Use the choose-an-element method to prove the conjecture from Exer- cise (5a). (c) Use the algebra of sets to prove the conjecture from Exercise (5a). 6. Let A, B, and C be subsets of some universal set U. Prove or disprove each of the following: ★ (a) (AB)-C = (A-C) n (B - C) (b) (AUB)(ANB) = (A — B) U (B — A)
Let N= {1, 2, 3, 4, .} be the set of natural numbers and S= (1, 4, 9, 16, ...} be the set of squares of the natural numbers. Then N - S, since we have the one-to-one correspondence 1 + 1, 2 + 4, 3 + 9, 4 + 16, ... n+ n?. (This example is interesting, since it shows that an infinite set can be equivalent to a proper subset of itself.) Show that each of the following pairs of sets are equivalent by carefully describing a one-to-one correspondence between the sets. Complete parts (a) through (c) below. (a) The whole numbers and natural numbers, W = {0, 1, 2, 3, ..} and N= {1, 2, 3, 4, ...} Which of the following describes a one-to-one correspondence between the two sets? O A. For each element in W, there is an element in N that is double that element. O B. For each element in w. there is an element in N that is 1 areater than double that element.
5. Suppose that A = = {0,1} and B = {0}. (a) Write down the elements of AUB. (b) Write down the elements of P(AUB). Write down the elements of A × P(B). (d) Find a set S that is, like the sets in parts (a)- above, built up out of A and B through some combination of taking power sets, unions, intersections, and Cartesian products (but you are not required to use all these operations). Your set S must have the following two features:- S has exactly 10 elements;- (1,0) is an element of S

SEE MORE QUESTIONS

Recommended textbooks for you

Linear Algebra: A Modern Introduction

Algebra

ISBN:

9781285463247

Author:

David Poole

Publisher:

Cengage Learning

Linear Algebra: A Modern Introduction

Algebra

ISBN:

9781285463247

Author:

David Poole

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS