Corollary. Every infinite set contains a proper subset to which it is similar. Proof. Let A be an infinite set and let S = {a, az, ..} be a count- ably infinite subset of A. The function f: A → A-{a;} defined by (an+1 if x = a, (n = 1, 2, ...), if x € A-S %3D f(x) = (x is a bijection. Thus A ~ A-{a,}. |
Corollary. Every infinite set contains a proper subset to which it is similar. Proof. Let A be an infinite set and let S = {a, az, ..} be a count- ably infinite subset of A. The function f: A → A-{a;} defined by (an+1 if x = a, (n = 1, 2, ...), if x € A-S %3D f(x) = (x is a bijection. Thus 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
Related questions
Question
Show in detail that f is a bijection (Corollary's proof)
![ove that every infinite set S contains a proper subset similar to S
Clear search
Theorem 1.42. Every infinite set contains a countably infinite subset.
Proof. Let A be an infinite set. Take some element of A and call
it az. The set A-{az} is not empty; denote one of its elements by az.
This process may be continued indefinitely: at the nth stage the set
A-{a1, ..., an-1}
cannot be empty since A is infinite. The set {a,, a„ ..} is a countably
infinite subset of A. ||
Corollary. Every infinite set contains a proper subset to which it is
similar.
Proof. Let A be an infinite set and let S = {a, az, ..} be a count-
ably infinite subset of A. The function f: A → A-{az} defined by
%3D
(an+1 if x = a, (n = 1, 2, ..),
f(x)
if x e A-S
is a bijection. Thus A ~ A-{az}. |](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc7317674-d676-41dd-b288-2c960785b5d0%2F25cd46c9-c82c-44e2-938a-56f80e98a878%2F409wcmk_processed.png&w=3840&q=75)
Transcribed Image Text:ove that every infinite set S contains a proper subset similar to S
Clear search
Theorem 1.42. Every infinite set contains a countably infinite subset.
Proof. Let A be an infinite set. Take some element of A and call
it az. The set A-{az} is not empty; denote one of its elements by az.
This process may be continued indefinitely: at the nth stage the set
A-{a1, ..., an-1}
cannot be empty since A is infinite. The set {a,, a„ ..} is a countably
infinite subset of A. ||
Corollary. Every infinite set contains a proper subset to which it is
similar.
Proof. Let A be an infinite set and let S = {a, az, ..} be a count-
ably infinite subset of A. The function f: A → A-{az} defined by
%3D
(an+1 if x = a, (n = 1, 2, ..),
f(x)
if x e A-S
is a bijection. Thus A ~ A-{az}. |
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)