2. Let X be the set {a, b, c,..., z). Give answers to each of the...

 

Transcribed Image Text:

2. Let X be the set {a, b, c,..., z). Give answers to each of the following questions, justifying your answer in each case. (You don't need to simplify arithmetic expressions.) (a) How many functions are there which map from X to X? (b) How many distinct total orders can be defined on X? (c) For each function f in the set of functions from X to X, consider the relation that is the symmetric closure of the function f. Let us call the set of these symmetric closures Y. List at least two elements of Y. (d) Suppose R is some partial order on X. What is the smallest possible cardinality R could have? What is the largest? 2. Let X be the set {a, b, c,..., z). Give answers to each of the following questions, justifying your answer in each case. (You don't need to simplify arithmetic expressions.) (a) How many functions are there which map from X to X? (b) How many distinct total orders can be defined on X? (c) For each function f in the set of functions from X to X, consider the relation that is the symmetric closure of the function f. Let us call the set of these symmetric closures Y. List at least two elements of Y. (d) Suppose R is some partial order on X. What is the smallest possible cardinality R could have? What is the largest?

Answer rating: 100% (QA)

a How many functions are there which map from X to X For each element x in X there are 26 choices of ... View the full answer