1. Show that the size of the set of all positive integer multiples of 7 has cardinality No. 2. Show that the size of the set of all positive integer multiples of k has cardinality No for any k € Z+. 3. Show that the size of the even integers is the same as the size of the set of all positive integer multiples of 5. 4. Let A = {1,2}. Show that |A| ‡ |A × A|.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
100%

Background info:

Here, this covers the concept of different sizes of infinity. Afterall, when sets are finite, the answer is easy since the size of a finite set is a number. The order of a set A, |A|, is the number of elements it contains. Let A = {1, 2, 3}, B = {q, f, z} and C = {♠, ◇} Note that |A| = 3 = |B| so A and B have the same size. Since |C| = 2, A and C have different sizes. When sets are infinite, things get trickier since ထ is a concept rather than a number. So, We need a different approach that is still consistent with the concept of size of finite sets. A sturdier definition that works with both finite and infinite sets is to say that two sets have the same size if there exists a one-to-one and onto function between the sets. Note that one-to-one and onto functions are invertible. Hence order is a symmetric relation. As such, A and C have different sizes since we cannot map all three elements of A to C with a one-to-one function. Conversely, if we attempt to map C to A, no onto function exists. This approach works with sets of infinite size. We define the cardinality of the positive integers as countably infinite. Symbolically, |Z+| = ℵ(aleph null)

What I am not understanding is what makes a function one-to-one and/or onto? Also how would we apply the given background information to prove the following problems? (attached as images)

**Question 6**: Provide an example of sets \( A \) and \( B \) such that \( A \) is a proper subset of \( B \) but \(|A| = |B|\).

**Explanation**: 

In set theory, a set \( A \) is said to be a *proper subset* of a set \( B \) if all elements of \( A \) are in \( B \), but \( B \) contains at least one element not in \( A \). The notation for a proper subset is \( A \subset B \).

The condition \(|A| = |B|\) means that the cardinality (number of elements) of both sets \( A \) and \( B \) are the same.

To meet both conditions, one could use sets of infinite size. For instance:

- Let \( A = \{0, 1, 2, 3, \ldots\} \), the set of all non-negative integers.
- Let \( B = \{0, 1, 2, 3, \ldots\} \cup \{\frac{1}{2}\} \).

In this example:
- \( A \) is a proper subset of \( B \) because all elements of \( A \) are in \( B \) and \( B \) has an additional element \(\frac{1}{2}\).
- Despite this, both sets are infinite, so their cardinalities are equal, \(|A| = |B|\).
Transcribed Image Text:**Question 6**: Provide an example of sets \( A \) and \( B \) such that \( A \) is a proper subset of \( B \) but \(|A| = |B|\). **Explanation**: In set theory, a set \( A \) is said to be a *proper subset* of a set \( B \) if all elements of \( A \) are in \( B \), but \( B \) contains at least one element not in \( A \). The notation for a proper subset is \( A \subset B \). The condition \(|A| = |B|\) means that the cardinality (number of elements) of both sets \( A \) and \( B \) are the same. To meet both conditions, one could use sets of infinite size. For instance: - Let \( A = \{0, 1, 2, 3, \ldots\} \), the set of all non-negative integers. - Let \( B = \{0, 1, 2, 3, \ldots\} \cup \{\frac{1}{2}\} \). In this example: - \( A \) is a proper subset of \( B \) because all elements of \( A \) are in \( B \) and \( B \) has an additional element \(\frac{1}{2}\). - Despite this, both sets are infinite, so their cardinalities are equal, \(|A| = |B|\).
1. Show that the size of the set of all positive integer multiples of 7 has cardinality ℵ₀.

2. Show that the size of the set of all positive integer multiples of k has cardinality ℵ₀ for any \( k \in \mathbb{Z}^+ \).

3. Show that the size of the even integers is the same as the size of the set of all positive integer multiples of 5.

4. Let \( A = \{1, 2\} \). Show that \( |A| \neq |A \times A| \).
Transcribed Image Text:1. Show that the size of the set of all positive integer multiples of 7 has cardinality ℵ₀. 2. Show that the size of the set of all positive integer multiples of k has cardinality ℵ₀ for any \( k \in \mathbb{Z}^+ \). 3. Show that the size of the even integers is the same as the size of the set of all positive integer multiples of 5. 4. Let \( A = \{1, 2\} \). Show that \( |A| \neq |A \times A| \).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,