Hello,
My teacher has given me a problem to try:
Let A={1, 2, 3, 4}. Define a fcn f: Powerset(A) --> N U {0} by f(x) = |x| (cardinality of x) for x element of Powerset(A).
I need to find:
a) f({∅, {1,2}, {2,3}})
b) ƒ−1({3}).
Now, for a, im pretty sure it's simply f({∅, {1,2}, {2,3}}) = 2, since there is nor curly brackets around ∅, so it doesnt count as an element, and other two are elements of powerset (A).
Regarding b, im not too sure what would be the inverse of the cardinality.
For a, is my logic makes sense or i am completely off?
For b, im not sure how to find the inverse.
Thank you for help in advance
I don't know if it's really an "inverse" since the function is not an injection, but you could treat it as a multi-valued inverse of sorts. In that case it would be all the things that give you the result "3" by that function you described.
Plato's right about the cardinality of a. Remember that ∅ is the same as {}. The empty set is included (subset of) in every set, but not contained (member of) in every set. When the empty set is a member of another set, it's just like any other member. (Note you separate it with a comma just like the others.)