Particularize the Collage Theorem in $mathbb{R}$
$begingroup$
Consider the collage theorem stated as below (Interpolation and Approximation with Splines and Fractals by P. Massopust):

I want to get the particular case for $mathbb{R}$ with its usual distance, which is a complete metric space (the idea is to help me to remember the theorem). The only compact sets are intervals of the form $[a,b]$. So fix $A = [a,b]$ and some $epsilon > 0$.
The problem here, is to determine what is $F(A)$, so that we can get a clearer idea of how Hausdorff distance behaves. We have $F(A) = cup_{i = 1}^N overline{f_i}(A)$ where $f_i$ are contractions and $overline{f_i}(A)$ is defined as the image of $A$ under $f_i$.
Since $f_i$ are lipschitz, they are continuous and $overline{f_i}(A)$ will have to be a compact set (we could get no matter what compact set in $mathbb{R}$ right?). So we get a family of $N$ compact sets: $[a_i,b_i]$ for $i = 1, ldots , N$. Since $f_i$ are contractions we further know that these compact sets have less size than $A$.
Can I get any further intuition from here? In other words, what is the collage theorem saying about this finite collection of compact sets?
real-analysis functional-analysis metric-spaces fractals
$endgroup$
add a comment |
$begingroup$
Consider the collage theorem stated as below (Interpolation and Approximation with Splines and Fractals by P. Massopust):

I want to get the particular case for $mathbb{R}$ with its usual distance, which is a complete metric space (the idea is to help me to remember the theorem). The only compact sets are intervals of the form $[a,b]$. So fix $A = [a,b]$ and some $epsilon > 0$.
The problem here, is to determine what is $F(A)$, so that we can get a clearer idea of how Hausdorff distance behaves. We have $F(A) = cup_{i = 1}^N overline{f_i}(A)$ where $f_i$ are contractions and $overline{f_i}(A)$ is defined as the image of $A$ under $f_i$.
Since $f_i$ are lipschitz, they are continuous and $overline{f_i}(A)$ will have to be a compact set (we could get no matter what compact set in $mathbb{R}$ right?). So we get a family of $N$ compact sets: $[a_i,b_i]$ for $i = 1, ldots , N$. Since $f_i$ are contractions we further know that these compact sets have less size than $A$.
Can I get any further intuition from here? In other words, what is the collage theorem saying about this finite collection of compact sets?
real-analysis functional-analysis metric-spaces fractals
$endgroup$
add a comment |
$begingroup$
Consider the collage theorem stated as below (Interpolation and Approximation with Splines and Fractals by P. Massopust):

I want to get the particular case for $mathbb{R}$ with its usual distance, which is a complete metric space (the idea is to help me to remember the theorem). The only compact sets are intervals of the form $[a,b]$. So fix $A = [a,b]$ and some $epsilon > 0$.
The problem here, is to determine what is $F(A)$, so that we can get a clearer idea of how Hausdorff distance behaves. We have $F(A) = cup_{i = 1}^N overline{f_i}(A)$ where $f_i$ are contractions and $overline{f_i}(A)$ is defined as the image of $A$ under $f_i$.
Since $f_i$ are lipschitz, they are continuous and $overline{f_i}(A)$ will have to be a compact set (we could get no matter what compact set in $mathbb{R}$ right?). So we get a family of $N$ compact sets: $[a_i,b_i]$ for $i = 1, ldots , N$. Since $f_i$ are contractions we further know that these compact sets have less size than $A$.
Can I get any further intuition from here? In other words, what is the collage theorem saying about this finite collection of compact sets?
real-analysis functional-analysis metric-spaces fractals
$endgroup$
Consider the collage theorem stated as below (Interpolation and Approximation with Splines and Fractals by P. Massopust):

I want to get the particular case for $mathbb{R}$ with its usual distance, which is a complete metric space (the idea is to help me to remember the theorem). The only compact sets are intervals of the form $[a,b]$. So fix $A = [a,b]$ and some $epsilon > 0$.
The problem here, is to determine what is $F(A)$, so that we can get a clearer idea of how Hausdorff distance behaves. We have $F(A) = cup_{i = 1}^N overline{f_i}(A)$ where $f_i$ are contractions and $overline{f_i}(A)$ is defined as the image of $A$ under $f_i$.
Since $f_i$ are lipschitz, they are continuous and $overline{f_i}(A)$ will have to be a compact set (we could get no matter what compact set in $mathbb{R}$ right?). So we get a family of $N$ compact sets: $[a_i,b_i]$ for $i = 1, ldots , N$. Since $f_i$ are contractions we further know that these compact sets have less size than $A$.
Can I get any further intuition from here? In other words, what is the collage theorem saying about this finite collection of compact sets?
real-analysis functional-analysis metric-spaces fractals
real-analysis functional-analysis metric-spaces fractals
asked Dec 3 '18 at 16:08
JavierJavier
2,01621133
2,01621133
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3024267%2fparticularize-the-collage-theorem-in-mathbbr%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3024267%2fparticularize-the-collage-theorem-in-mathbbr%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown