Question

In: Advanced Math

8. Definition: A set A is finite if there exists a non-negative integer c such that...

8. Definition: A set A is finite if there exists a non-negative integer c such that there exists a bijection from A to {n ∈ N : n ≤ c}. (The integer c is called the cardinality of A.)

(a) Let A be a finite set, and let B be a subset of A. Prove that B is finite. (Hint: induction on |A|. Note that our proof can’t use induction on |B|, or indeed refer to “the number of elements in B” at all, because we don’t yet know that B is finite!)

(b) Prove that the union of two disjoint finite sets is finite.

(c) Prove that the union of any two finite sets is finite. (Hint: A ∪ B = A ∪ (B − A))

Solutions

Expert Solution

Denote : [c] = { n in N : n c } = {1,2,3,4,...,c}, then, |[c]| = c, is the cardinality of the finite set [c].

(a) let, A be a finite set and assume that B is a finite subset of A. If B is empty, then, B is finite. So we assume that B is non-empty.
Since A is finite, there exists a bijection f : A ----> [c] for some c in N.

We need to show that B is equivalent to a finite set.

To do this, we define g : B ----> f(B) by g(x) = f(x) for each x in B.

Since A is finite, so, f is an injection, we conclude that g is an injection.

Now let y belongs to f(B).
Then there exists an b in B such that f(b) = y. But by the definition of g, this means that g(b) = y, and hence g is a surjection. This proves that g is a bijection.
Hence, we have proved that B is equivalent to f(B). Since f(B) is a subset of [c], we conclude that f(B) is finite and consequently, B is finite (since, B and f(B) are equivalent)

(b) let, X & Y be two finite sets,

Then, there exists bijection, f : X ----> [c] and g : Y ----> [d] for some positive integers c & d.

Define, h : XY -----> [c+d] by,

h(k) = f(k) if, k belongs to X

&, h(k) = g(k) + c if, k belongs to Y

The inverse h - : [c+d] ----> XY is defined by,

h-1 (k) = f-1(k) if, 1 k c

&, h-1(k) = g-1(k - c) if, c+1 k c+d

So, h and its inverse both exist.

Then, h is a bijection.

So, XY is finite.

(c) let, A & B be 2 finite sets,

Then, AB = A(B-A) is the union of 2 disjoint sets & hence finite, by part (b).

Hence, AB is finite


Related Solutions

ite a C program that prompts for and reads in a non-negative integer from the keyboard....
ite a C program that prompts for and reads in a non-negative integer from the keyboard. Read it into an int variable x. Then display the 32 bits in x from the lsb to the msb (so the display will show the value in x in binary with the bits in reverse order). For example, if you input 6, then your program displays 00000000000000000000000000000110 Use the algorithm given in class (repeatedly divide by 2). Use the / and % operators....
In C++ Let n be a non-negative integer. The factorial of n, written n!, is defined...
In C++ Let n be a non-negative integer. The factorial of n, written n!, is defined by 0 ! 5 1, n! = 1·2·3· · ·n if n $ 1. For example, 4! = 1·2·3·4 = 24. Write a program that prompts the user to enter a nonnegative integer and outputs the factorial of the number. Allow the user to repeat the program. Example: If the user enters a 3 then your program should perform answer = 3 * 2...
Let F be a finite field. Prove that there exists an integer n≥1, such that n.1_F...
Let F be a finite field. Prove that there exists an integer n≥1, such that n.1_F = 0_F . Show further that the smallest positive integer with this property is a prime number.
Use a while(true) loop to ask the user to “Enter a non-negative integer (enter negative integer...
Use a while(true) loop to ask the user to “Enter a non-negative integer (enter negative integer to quit):” and store this into an int named n. If the user enters a negative int for n, the while loop is broken via the brake statement. Otherwise, in the remaining part of the while loop, use a for loop to compute the sum of the inverse factorials from 0 to n, that is sum = 1/0! + 1/1! + 1/2! + ....
Write a program factor that prints the prime factors of a specified non-negative integer. The integer...
Write a program factor that prints the prime factors of a specified non-negative integer. The integer will be provided as a command-line argument. You may assume that the integer will be greater than 1 and less than or equal to the largest signed integer on your platform (that is, you may use an int).
Assignment Instructions: 1) The Factorial The factorial of a non-negative integer ??, denoted by ??!, is...
Assignment Instructions: 1) The Factorial The factorial of a non-negative integer ??, denoted by ??!, is the product of all positive integers less than or equal to ??. The textbook has an example of a recursive MIPS implementation of factorial. Additionally, a simplified version of the MIPS assembly language recursive implementation of the factorial function is attached. Trace the factorial example carefully using QTSPIM 2) Recursive definition of multiplication The function ??????????(??, ??) for two positive integers 1 ? ??,...
Assignment Instructions: 1) The Factorial The factorial of a non-negative integer ??, denoted by ??!, is...
Assignment Instructions: 1) The Factorial The factorial of a non-negative integer ??, denoted by ??!, is the product of all positive integers less than or equal to ??. The textbook has an example of a recursive MIPS implementation of factorial. Additionally, a simplified version of the MIPS assembly language recursive implementation of the factorial function is attached. Trace the factorial example carefully using QTSPIM 2) Recursive definition of multiplication The function ??????????(??, ??) for two positive integers 1 ? ??,...
Create a CubesSum application that prompts the user for a non-negative integer and then displays the...
Create a CubesSum application that prompts the user for a non-negative integer and then displays the sum of the cubes of the digits.   b) Modify the application to determine what integers of two, three, and four digits are equal to the sum of the cubes of their digits.(Java Programming )
The factorial of a non-negative integer is defined as follows: n! = 1 × 2 ×...
The factorial of a non-negative integer is defined as follows: n! = 1 × 2 × ... × (n − 1) × n A. Write a function that takes an input value n and returns its factorial result n!. Ensure that your function returns an error statement if the input n is either a negative or a non-integer value. You cannot use the prod() or factorial() functions. The Euler number e is calculated as the sum of the infinite series...
Let S be a non-empty set (finite or otherwise) and Σ the group of permutations on...
Let S be a non-empty set (finite or otherwise) and Σ the group of permutations on S. Suppose ∼ is an equivalence relation on S. Prove (a) {ρ ∈ Σ : x ∼ ρ(x) (∀x ∈ S)} is a subgroup of Σ. (b) The elements ρ ∈ Σ for which, for every x and y in S, ρ(x) ∼ ρ(y) if and only if x ∼ y is a subgroup of Σ.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT