Try Magic Notes and save time.Try it free
Try Magic Notes and save timeCrush your year with the magic of personalized studying.Try it free

Related questions with answers

Question

Let X={a, b, c}. Define a function S from P\mathcal{P}(X) to the set of bit strings of length 3 as follows. Let Y\subseteqX. If a\inY, set s1=0s_1=0; If a\notinY, set s1=1s_1=1; If b\inY, set s2=0s_2=0; If b\notinY, set s2=1s_2=1; If c\inY, set s3=0s_3=0; If c\inY, set s3=1s_3=1. Define S(Y)=s1s2s3s_1s_2s_3.

Prove that S is onto.

Solution

Verified
Step 1
1 of 3

DEFINITIONS

A relation ff is a function\textbf{function} when (a,b)f(a,b)\in f and (a,c)f(a,c)\in f implies b=cb=c.

The domain\textbf{domain} is the set of all possible first elements in the ordered pairs.

Notation: dom ff

The image\textbf{image} is the set of all possible second elements in the ordered pairs.

Notation: im ff

The function ff is one-to-one\textbf{one-to-one} whenever (x,b),(y,b)f(x,b),(y,b)\in f implies x=yx=y.

The function f:ABf:A\rightarrow B is onto\textbf{onto} if for element bBb\in B there exist an element aAa\in A such that f(a)=bf(a)=b.

The function ff has an inverse function\textbf{inverse function} if and only if ff is one-to-one and onto.

Create an account to view solutions

Create an account to view solutions

Recommended textbook solutions

Discrete Mathematics and Its Applications 7th Edition by Kenneth Rosen

Discrete Mathematics and Its Applications

7th EditionISBN: 9780073383095Kenneth Rosen
4,283 solutions
Discrete Mathematics 8th Edition by Richard Johnsonbaugh

Discrete Mathematics

8th EditionISBN: 9780321964687 (2 more)Richard Johnsonbaugh
4,246 solutions
Discrete Mathematics and Its Applications 8th Edition by Kenneth Rosen

Discrete Mathematics and Its Applications

8th EditionISBN: 9781259676512Kenneth Rosen
4,397 solutions
Discrete Mathematics with Applications 5th Edition by Susanna S. Epp

Discrete Mathematics with Applications

5th EditionISBN: 9781337694193Susanna S. Epp
2,641 solutions

More related questions

1/4

1/7