et A be a non-empty subset of a metric space (X,d) and x an element of X. Define the distance from x to A as d(x, A) = inf{d(x, a) : a ¤ A}. (i) Prove that the function fĄ: X → R, defined as ƒÃ(x) = d(x, A) satisfies |ƒÃ(x) — ƒ^(y)| ≤ d(x, y) Vx, y ≤ X, and that fa is continuous on X. (ii) Prove that A = {x : x € X and f₁(x) = 0}. iii) Suppose A and B are nonempty disjoint closed subsets of X. Use the function g = fA- fB to prove that there exist disjoint open sets U and V with ACU and BCV.
et A be a non-empty subset of a metric space (X,d) and x an element of X. Define the distance from x to A as d(x, A) = inf{d(x, a) : a ¤ A}. (i) Prove that the function fĄ: X → R, defined as ƒÃ(x) = d(x, A) satisfies |ƒÃ(x) — ƒ^(y)| ≤ d(x, y) Vx, y ≤ X, and that fa is continuous on X. (ii) Prove that A = {x : x € X and f₁(x) = 0}. iii) Suppose A and B are nonempty disjoint closed subsets of X. Use the function g = fA- fB to prove that there exist disjoint open sets U and V with ACU and BCV.
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
Could you teach me how to show this in detail?
![Let \( A \) be a non-empty subset of a metric space \((X, d)\) and \( x \) an element of \( X \). Define the distance from \( x \) to \( A \) as
\[
d(x, A) = \inf\{d(x, a) : a \in A\}.
\]
(i) Prove that the function \( f_A : X \to \mathbb{R} \), defined as \( f_A(x) = d(x, A) \), satisfies
\[
|f_A(x) - f_A(y)| \leq d(x, y) \quad \forall x, y \in X,
\]
and that \( f_A \) is continuous on \( X \).
(ii) Prove that \( \overline{A} = \{x : x \in X \text{ and } f_A(x) = 0\} \).
(iii) Suppose \( A \) and \( B \) are nonempty disjoint closed subsets of \( X \). Use the function \( g := f_A - f_B \) to prove that there exist disjoint open sets \( U \) and \( V \) with \( A \subseteq U \) and \( B \subseteq V \).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe15ed467-90ec-4e60-afef-3d3f6119f74d%2Ffe79c758-1032-4c81-91bf-3bfa4da61c35%2F9rsah8zb_processed.png&w=3840&q=75)
Transcribed Image Text:Let \( A \) be a non-empty subset of a metric space \((X, d)\) and \( x \) an element of \( X \). Define the distance from \( x \) to \( A \) as
\[
d(x, A) = \inf\{d(x, a) : a \in A\}.
\]
(i) Prove that the function \( f_A : X \to \mathbb{R} \), defined as \( f_A(x) = d(x, A) \), satisfies
\[
|f_A(x) - f_A(y)| \leq d(x, y) \quad \forall x, y \in X,
\]
and that \( f_A \) is continuous on \( X \).
(ii) Prove that \( \overline{A} = \{x : x \in X \text{ and } f_A(x) = 0\} \).
(iii) Suppose \( A \) and \( B \) are nonempty disjoint closed subsets of \( X \). Use the function \( g := f_A - f_B \) to prove that there exist disjoint open sets \( U \) and \( V \) with \( A \subseteq U \) and \( B \subseteq V \).
Expert Solution
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 3 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
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…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
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…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
