Let C₁ denote the sets defined in exercise 2. Let us also define, for each positive integer n, the closed interval En := [0,2]. (a) Show that for each 7, there exists some real number such that En = {n+y: for some y € Cn}. (b) Is the following statement true? There exists a real number r such that for each n, we have En = {x+y: for some y € Cn}.

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

I've finished number 2, but I cannot figure out what number 3 is asking. Please explain and answer it. Thank you!

2. For each positive integer n, consider the closed interval
C₂ :=
-
Similarly, consider the open intervals
(a) If N is a positive integer, express the set
as an interval.
(b) Let us define
as an interval.
(d) Define the set
TL TL
Dn:=(-n,n).
How many different elements belong to C?
Sidenote: This is how we can define intersection for infinitely many sets.
(c) If N is a positive integer, express the set
D₁ UD₂U... U DN
and
G₂n C₂ C₂n...n CN
C:= {1 € R: for each positive integer n, z
n, I € Cn}.
(b) Is the following statement true?
D:= {1ER:1€ Dn, for some n € N}.
Describe in an alternative way the set R\ D.
Sidenote: This is how we can define the union of infinitely many sets.
3. Let C₁, denote the sets defined in exercise 2. Let us also define, for each positive integer n, the closed
interval En == [0,2].
(a) Show that for each n, there exists some real number, such that
En = {n+y: for some y € Cn}-
There exists a real number such that for each n, we have
En = {1+y: for some y € Cn}-
Definition 1. Given a function f: R→ R, and given a set ACR and a set BCR, we define the image
of A and the pre-image of B as
f(A) := {f(1) = R: for some I € A},
f¹(B) := {1 € R: there exists y B with f(x) = y).
Transcribed Image Text:2. For each positive integer n, consider the closed interval C₂ := - Similarly, consider the open intervals (a) If N is a positive integer, express the set as an interval. (b) Let us define as an interval. (d) Define the set TL TL Dn:=(-n,n). How many different elements belong to C? Sidenote: This is how we can define intersection for infinitely many sets. (c) If N is a positive integer, express the set D₁ UD₂U... U DN and G₂n C₂ C₂n...n CN C:= {1 € R: for each positive integer n, z n, I € Cn}. (b) Is the following statement true? D:= {1ER:1€ Dn, for some n € N}. Describe in an alternative way the set R\ D. Sidenote: This is how we can define the union of infinitely many sets. 3. Let C₁, denote the sets defined in exercise 2. Let us also define, for each positive integer n, the closed interval En == [0,2]. (a) Show that for each n, there exists some real number, such that En = {n+y: for some y € Cn}- There exists a real number such that for each n, we have En = {1+y: for some y € Cn}- Definition 1. Given a function f: R→ R, and given a set ACR and a set BCR, we define the image of A and the pre-image of B as f(A) := {f(1) = R: for some I € A}, f¹(B) := {1 € R: there exists y B with f(x) = y).
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
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,