×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide

Suppose that is a function from A to B where A and If are

Discrete Mathematics and Its Applications | 7th Edition | ISBN: 9780073383095 | Authors: Kenneth Rosen ISBN: 9780073383095 37

Solution for problem 15E Chapter 2.SE

Discrete Mathematics and Its Applications | 7th Edition

  • Textbook Solutions
  • 2901 Step-by-step solutions solved by professors and subject experts
  • Get 24/7 help from StudySoup virtual teaching assistants
Discrete Mathematics and Its Applications | 7th Edition | ISBN: 9780073383095 | Authors: Kenneth Rosen

Discrete Mathematics and Its Applications | 7th Edition

4 5 0 257 Reviews
20
3
Problem 15E

Suppose that is a function from A to B where A and If are finite sets. Explain why | f(S) | = | S | for all subsets S of A if and only if f is one-to-one.Suppose that f is a function from A to B. We define the function Sf from p(A) to p(B) by the rule Sf(X) = f(X) for each subset X of A. Similarly, we define the function Sf?1 from p(B) to p(A) by the rule Sf?1(Y) = f?1(Y) for each subset Y of B. Here, we are using Definition 4, and the definition of the inverse image of a set found in the preamble to Exercise 42, both in Section 2.3.

Step-by-Step Solution:

SolutionStep 1In this problem, we have to show that function A to B where A and B finite sets.and we have to explain that why f(S) = |S| for all subsets S to A if and only if f is one to one function.Step 2One to one functionA function is said to be one to one if and if one object of the domain have exactly one range of that object.Bijective functionThe function is said to be bijective if and only if each object of one set is joined with exactly one object of the other set and vice versa.CardinalityIt is the number of element in a set.Step 3Proof by contradictionLet us assume that f is onto function then by the pigeonhole...

Step 2 of 3

Chapter 2.SE, Problem 15E is Solved
Step 3 of 3

Textbook: Discrete Mathematics and Its Applications
Edition: 7
Author: Kenneth Rosen
ISBN: 9780073383095

This full solution covers the following key subjects: function, subset, definition, suppose, rule. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The full step-by-step solution to problem: 15E from chapter: 2.SE was answered by , our top Math solution expert on 06/21/17, 07:45AM. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. The answer to “Suppose that is a function from A to B where A and If are finite sets. Explain why | f(S) | = | S | for all subsets S of A if and only if f is one-to-one.Suppose that f is a function from A to B. We define the function Sf from p(A) to p(B) by the rule Sf(X) = f(X) for each subset X of A. Similarly, we define the function Sf?1 from p(B) to p(A) by the rule Sf?1(Y) = f?1(Y) for each subset Y of B. Here, we are using Definition 4, and the definition of the inverse image of a set found in the preamble to Exercise 42, both in Section 2.3.” is broken down into a number of easy to follow steps, and 117 words. Since the solution to 15E from 2.SE chapter was answered, more than 246 students have viewed the full step-by-step answer.

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

Suppose that is a function from A to B where A and If are

×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide
×
Reset your password