Question

Define p to be the set of all pairs (l,m) in N×N such that l≤m. Which...

Define p to be the set of all pairs (l,m) in N×N such that l≤m. Which of the conditions (a), (c), (r), (s), (t) does p satisfy?

(a) For any two elements y and z in X with (y,z)∈r and (z,y)∈r, we have y=z

.(c) For any two elements y and z in X, we have (y,z)∈r or (z,y)∈r.

(r) For each element x in X, we have (x,x)∈r.

(s) For any two elements y and z in X with (y,z)∈r, we have (z,y)∈r.

(t) For any three elements x,y, and z in X with (x,y)∈rand (y,z)∈r, we have(x,z)∈r

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider an axiomatic system that consists of elements in a set S and a set P...
Consider an axiomatic system that consists of elements in a set S and a set P of pairings of elements (a, b) that satisfy the following axioms: A1 If (a, b) is in P, then (b, a) is not in P. A2 If (a, b) is in P and (b, c) is in P, then (a, c) is in P. Given two models of the system, answer the questions below. M1: S= {1, 2, 3, 4}, P= {(1, 2), (2,...
Define a set M recursively as follows. B. 3 and 7 are in M R. If...
Define a set M recursively as follows. B. 3 and 7 are in M R. If x and y are in M, so is x+y. (it is possible that x = y) Prove for every natural number n greater than or equal to 12, n is an element of M
1. We define a relation C on the set of humans as xRy ⇐⇒ x and...
1. We define a relation C on the set of humans as xRy ⇐⇒ x and y were born in the same country Describe the equivalence class containing yourself as an element. 2. Let R be an equivalence relation with (x, y) ∈ R and (y, z) is not ∈ R (that is, y does not relate to z). Can you determine whether or not xRz? Why or why not?
2. Let A = {p, q, r, s}, B = {k, l, m, n}, and C...
2. Let A = {p, q, r, s}, B = {k, l, m, n}, and C = {u, v, w}, Define f : A→B by f(p) = m, f(q) = k, f(r) = l, and f(s) = n, and define g : B→C by g(k) = v, g(l) = w, g(m) = u, and g(n) = w. Also define h : A→C by h = g ◦ f. (a) Write out the values of h. (b) Why is it that...
1. A function + : S × S → S for a set S is said...
1. A function + : S × S → S for a set S is said to provide an associative binary operation on S if r + (s + t) = (r + s) +t for all r, s, t ∈ S. Show that any associative binary operation + on a set S can have at most one “unit” element, i.e. an element u ∈ S such that (*) s + u = s = u + s for all...
I had a discussion question that follows: What is wrong with the following argument? Note the...
I had a discussion question that follows: What is wrong with the following argument? Note the argument supposedly shows that any symmetric and transitive relation R on A must also be reflexive. Let R be a relation in A × A that is symmetric and transitive. Using symmetry, if (x,y) ∈ R then (y,x) ∈ R. Hence, both (x,y) and (y,x) are in R. Since (x,y) and (y,x) ∈ R, by transitivity, we have (x,x) ∈ R. Therefore, R is...
Let n=60, not a product of distinct prime numbers. Let B_n= the set of all positive...
Let n=60, not a product of distinct prime numbers. Let B_n= the set of all positive divisors of n. Define addition and multiplication to be lcm and gcd as well. Now show that B_n cannot consist of a Boolean algebra under those two operators. Hint: Find the 0 and 1 elements first. Now find an element of B_n whose complement cannot be found to satisfy both equalities, no matter how we define the complement operator.
Let S be a finite set and let P(S) denote the set of all subsets of...
Let S be a finite set and let P(S) denote the set of all subsets of S. Define a relation on P(S) by declaring that two subsets A and B are related if A and B have the same number of elements. (a) Prove that this is an equivalence relation. b) Determine the equivalence classes. c) Determine the number of elements in each equivalence class.
we have sample space (S,P) where S is the power set of {1,2} and P(a) =...
we have sample space (S,P) where S is the power set of {1,2} and P(a) = |a| / |S| for all a in S (thus |S|=4). We define two random variables such that for all a in S we have X(a) = |a| and Y(a) = 1 if b is in a and 0 otherwise. What is the probability that Y(a)=1? what is the expected value of Y? What is the variance of Y? what is the value of P(X=1...
Consider permutations of the 26-character lowercase alphabet Σ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}. In how many of these permutations do a,b,c...
Consider permutations of the 26-character lowercase alphabet Σ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}. In how many of these permutations do a,b,c occur consecutively and in that order? In how many of these permutations does a appear before b and b appear before c?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT