Exact value of Hausdorff measure of two dimensional Cantor set
$begingroup$
Let $mathcal{C}$ denote the classical Cantor set, then it is well-known that $mathcal{C}$ has Hausdorff dimension $alpha = ln 2 /ln 3$, and its $alpha$-dimensional Hausdorff measure is $mathcal{H}_alpha(mathcal{C}) = 1$.
For $mathcal{C}times mathcal{C}subset mathbb{R}^2$, it is fairly easy to show its Hausdorff dimension is $2alpha$, and $0< mathcal{H}_{2alpha}(mathcal{C}times mathcal{C}) <infty$. I am interested in knowing the exact value of $mathcal{H}_{2alpha}(mathcal{C}times mathcal{C})$.
The proof for 1D case $mathcal{H}_alpha(mathcal{C}) = 1$ cannot carry directly into higher dimension.
This answer claims the measure is $1$ and refers to Falcon's book The Geometry of Fractal Sets. However, after really looking into the book, it does not say anything about Hausdorff measure (only Hausdorff dimension) for any non-1D set (at least at the position quoted).
Nonetheless, it might be possible that the Hausdorff measure does not admit a simple closed-form, as expected for many fractals in $mathbb{R}^n$ with $n>1$. Any idea/reference is much appreciated.
real-analysis measure-theory fractals geometric-measure-theory hausdorff-measure
$endgroup$
add a comment |
$begingroup$
Let $mathcal{C}$ denote the classical Cantor set, then it is well-known that $mathcal{C}$ has Hausdorff dimension $alpha = ln 2 /ln 3$, and its $alpha$-dimensional Hausdorff measure is $mathcal{H}_alpha(mathcal{C}) = 1$.
For $mathcal{C}times mathcal{C}subset mathbb{R}^2$, it is fairly easy to show its Hausdorff dimension is $2alpha$, and $0< mathcal{H}_{2alpha}(mathcal{C}times mathcal{C}) <infty$. I am interested in knowing the exact value of $mathcal{H}_{2alpha}(mathcal{C}times mathcal{C})$.
The proof for 1D case $mathcal{H}_alpha(mathcal{C}) = 1$ cannot carry directly into higher dimension.
This answer claims the measure is $1$ and refers to Falcon's book The Geometry of Fractal Sets. However, after really looking into the book, it does not say anything about Hausdorff measure (only Hausdorff dimension) for any non-1D set (at least at the position quoted).
Nonetheless, it might be possible that the Hausdorff measure does not admit a simple closed-form, as expected for many fractals in $mathbb{R}^n$ with $n>1$. Any idea/reference is much appreciated.
real-analysis measure-theory fractals geometric-measure-theory hausdorff-measure
$endgroup$
add a comment |
$begingroup$
Let $mathcal{C}$ denote the classical Cantor set, then it is well-known that $mathcal{C}$ has Hausdorff dimension $alpha = ln 2 /ln 3$, and its $alpha$-dimensional Hausdorff measure is $mathcal{H}_alpha(mathcal{C}) = 1$.
For $mathcal{C}times mathcal{C}subset mathbb{R}^2$, it is fairly easy to show its Hausdorff dimension is $2alpha$, and $0< mathcal{H}_{2alpha}(mathcal{C}times mathcal{C}) <infty$. I am interested in knowing the exact value of $mathcal{H}_{2alpha}(mathcal{C}times mathcal{C})$.
The proof for 1D case $mathcal{H}_alpha(mathcal{C}) = 1$ cannot carry directly into higher dimension.
This answer claims the measure is $1$ and refers to Falcon's book The Geometry of Fractal Sets. However, after really looking into the book, it does not say anything about Hausdorff measure (only Hausdorff dimension) for any non-1D set (at least at the position quoted).
Nonetheless, it might be possible that the Hausdorff measure does not admit a simple closed-form, as expected for many fractals in $mathbb{R}^n$ with $n>1$. Any idea/reference is much appreciated.
real-analysis measure-theory fractals geometric-measure-theory hausdorff-measure
$endgroup$
Let $mathcal{C}$ denote the classical Cantor set, then it is well-known that $mathcal{C}$ has Hausdorff dimension $alpha = ln 2 /ln 3$, and its $alpha$-dimensional Hausdorff measure is $mathcal{H}_alpha(mathcal{C}) = 1$.
For $mathcal{C}times mathcal{C}subset mathbb{R}^2$, it is fairly easy to show its Hausdorff dimension is $2alpha$, and $0< mathcal{H}_{2alpha}(mathcal{C}times mathcal{C}) <infty$. I am interested in knowing the exact value of $mathcal{H}_{2alpha}(mathcal{C}times mathcal{C})$.
The proof for 1D case $mathcal{H}_alpha(mathcal{C}) = 1$ cannot carry directly into higher dimension.
This answer claims the measure is $1$ and refers to Falcon's book The Geometry of Fractal Sets. However, after really looking into the book, it does not say anything about Hausdorff measure (only Hausdorff dimension) for any non-1D set (at least at the position quoted).
Nonetheless, it might be possible that the Hausdorff measure does not admit a simple closed-form, as expected for many fractals in $mathbb{R}^n$ with $n>1$. Any idea/reference is much appreciated.
real-analysis measure-theory fractals geometric-measure-theory hausdorff-measure
real-analysis measure-theory fractals geometric-measure-theory hausdorff-measure
edited Dec 12 '18 at 12:29
pisco
asked Dec 12 '18 at 7:27
piscopisco
11.6k21742
11.6k21742
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Sketch for a possible solution: we can build $Ctimes C$ in the same way that we build $C$, that is, starting from $C_0:=[0,1]$, $C_1:=[0,1/3]cup[2/3,1]$ and so on then $$Ctimes C=bigcap_{k=0}^infty C_ktimes C_ktag1$$
Set $A_k:=C_ktimes C_k$, then $A_k$ is composed by $4^k$ squares of side length $3^{-k}$, this means that each square have diameter $sqrt 2/3^k$.
For measurable sets the Hausdorff measure is defined by the limit $mathcal H^s(A)=lim_{epsilonto 0^+}mathcal H^s_epsilon(A)$, where
$$mathcal H_epsilon^s(A):=infleft{sum_{k=0}^inftyoperatorname{diam}(O_k)^s,, operatorname{diam}(O_k)le epsilon,, Asubsetbigcup_{k=0}^infty O_k,, O_ktext{ is open}right}tag2$$
Now we can try to approximate the value of $mathcal H^s(A)$ from above. Suppose we are trying to cover $A$ with open squares of diameter $gammasqrt 2/ 3^k$, then for enough small $gamma>1$ it seems easy to prove (by the inner structure of $Ctimes C$ that can be seen in it construction) that the most efficient way to do it is covering $A$ as if we were covering $A_k$, so we will need $4^k$ of this squares. The same happen for all $kinBbb N$, hence we will find that
$$mathcal H^s(A)lelim_{ktoinfty} 4^kleft(gammafrac{sqrt 2}{3^k}right)^s,quadforall gamma>1tag3$$
where the inequality comes from the fact that a box-covering is less efficient than a circle-covering using the same diameter for squares and circles (because a square cover less area than a circle with the same diameter). Hence we find that $mathcal H^s(A)le(sqrt 2)^s$ when we choose $s:=ln 4/ln 3$.
From all of this I see that if we shows that, for each $gamma_ksqrt 2/3^k$ (for enough small $gamma_k>1$), the covering of circles cannot be better than the covering of boxes, that is that $mathcal H^s_{gamma_ksqrt 2/3^k}(A)=4^k(gamma_ksqrt 2/3^k)^s$ then we will had that $$mathcal H^s(A)=lim_{ktoinfty}mathcal H^s_{gamma_ksqrt 2/3^k}(A)=(sqrt 2)^s$$ for $s:=ln 4/ln 3$.
About possible references: I didn't read it but, the most complete textbook that cover this questions, seems to by Fractal geometry of Falconer.
$endgroup$
$begingroup$
Thank you for your effort. But if you look closely, the set you constructed is not $mathcal{C}times mathcal{C}$ at all. Each steps of the construction of $mathcal{C}times mathcal{C}$ involves $4^k$ squares with diameter $sqrt{2}/3^k$.
$endgroup$
– pisco
Dec 12 '18 at 9:46
add a comment |
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%2f3036362%2fexact-value-of-hausdorff-measure-of-two-dimensional-cantor-set%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Sketch for a possible solution: we can build $Ctimes C$ in the same way that we build $C$, that is, starting from $C_0:=[0,1]$, $C_1:=[0,1/3]cup[2/3,1]$ and so on then $$Ctimes C=bigcap_{k=0}^infty C_ktimes C_ktag1$$
Set $A_k:=C_ktimes C_k$, then $A_k$ is composed by $4^k$ squares of side length $3^{-k}$, this means that each square have diameter $sqrt 2/3^k$.
For measurable sets the Hausdorff measure is defined by the limit $mathcal H^s(A)=lim_{epsilonto 0^+}mathcal H^s_epsilon(A)$, where
$$mathcal H_epsilon^s(A):=infleft{sum_{k=0}^inftyoperatorname{diam}(O_k)^s,, operatorname{diam}(O_k)le epsilon,, Asubsetbigcup_{k=0}^infty O_k,, O_ktext{ is open}right}tag2$$
Now we can try to approximate the value of $mathcal H^s(A)$ from above. Suppose we are trying to cover $A$ with open squares of diameter $gammasqrt 2/ 3^k$, then for enough small $gamma>1$ it seems easy to prove (by the inner structure of $Ctimes C$ that can be seen in it construction) that the most efficient way to do it is covering $A$ as if we were covering $A_k$, so we will need $4^k$ of this squares. The same happen for all $kinBbb N$, hence we will find that
$$mathcal H^s(A)lelim_{ktoinfty} 4^kleft(gammafrac{sqrt 2}{3^k}right)^s,quadforall gamma>1tag3$$
where the inequality comes from the fact that a box-covering is less efficient than a circle-covering using the same diameter for squares and circles (because a square cover less area than a circle with the same diameter). Hence we find that $mathcal H^s(A)le(sqrt 2)^s$ when we choose $s:=ln 4/ln 3$.
From all of this I see that if we shows that, for each $gamma_ksqrt 2/3^k$ (for enough small $gamma_k>1$), the covering of circles cannot be better than the covering of boxes, that is that $mathcal H^s_{gamma_ksqrt 2/3^k}(A)=4^k(gamma_ksqrt 2/3^k)^s$ then we will had that $$mathcal H^s(A)=lim_{ktoinfty}mathcal H^s_{gamma_ksqrt 2/3^k}(A)=(sqrt 2)^s$$ for $s:=ln 4/ln 3$.
About possible references: I didn't read it but, the most complete textbook that cover this questions, seems to by Fractal geometry of Falconer.
$endgroup$
$begingroup$
Thank you for your effort. But if you look closely, the set you constructed is not $mathcal{C}times mathcal{C}$ at all. Each steps of the construction of $mathcal{C}times mathcal{C}$ involves $4^k$ squares with diameter $sqrt{2}/3^k$.
$endgroup$
– pisco
Dec 12 '18 at 9:46
add a comment |
$begingroup$
Sketch for a possible solution: we can build $Ctimes C$ in the same way that we build $C$, that is, starting from $C_0:=[0,1]$, $C_1:=[0,1/3]cup[2/3,1]$ and so on then $$Ctimes C=bigcap_{k=0}^infty C_ktimes C_ktag1$$
Set $A_k:=C_ktimes C_k$, then $A_k$ is composed by $4^k$ squares of side length $3^{-k}$, this means that each square have diameter $sqrt 2/3^k$.
For measurable sets the Hausdorff measure is defined by the limit $mathcal H^s(A)=lim_{epsilonto 0^+}mathcal H^s_epsilon(A)$, where
$$mathcal H_epsilon^s(A):=infleft{sum_{k=0}^inftyoperatorname{diam}(O_k)^s,, operatorname{diam}(O_k)le epsilon,, Asubsetbigcup_{k=0}^infty O_k,, O_ktext{ is open}right}tag2$$
Now we can try to approximate the value of $mathcal H^s(A)$ from above. Suppose we are trying to cover $A$ with open squares of diameter $gammasqrt 2/ 3^k$, then for enough small $gamma>1$ it seems easy to prove (by the inner structure of $Ctimes C$ that can be seen in it construction) that the most efficient way to do it is covering $A$ as if we were covering $A_k$, so we will need $4^k$ of this squares. The same happen for all $kinBbb N$, hence we will find that
$$mathcal H^s(A)lelim_{ktoinfty} 4^kleft(gammafrac{sqrt 2}{3^k}right)^s,quadforall gamma>1tag3$$
where the inequality comes from the fact that a box-covering is less efficient than a circle-covering using the same diameter for squares and circles (because a square cover less area than a circle with the same diameter). Hence we find that $mathcal H^s(A)le(sqrt 2)^s$ when we choose $s:=ln 4/ln 3$.
From all of this I see that if we shows that, for each $gamma_ksqrt 2/3^k$ (for enough small $gamma_k>1$), the covering of circles cannot be better than the covering of boxes, that is that $mathcal H^s_{gamma_ksqrt 2/3^k}(A)=4^k(gamma_ksqrt 2/3^k)^s$ then we will had that $$mathcal H^s(A)=lim_{ktoinfty}mathcal H^s_{gamma_ksqrt 2/3^k}(A)=(sqrt 2)^s$$ for $s:=ln 4/ln 3$.
About possible references: I didn't read it but, the most complete textbook that cover this questions, seems to by Fractal geometry of Falconer.
$endgroup$
$begingroup$
Thank you for your effort. But if you look closely, the set you constructed is not $mathcal{C}times mathcal{C}$ at all. Each steps of the construction of $mathcal{C}times mathcal{C}$ involves $4^k$ squares with diameter $sqrt{2}/3^k$.
$endgroup$
– pisco
Dec 12 '18 at 9:46
add a comment |
$begingroup$
Sketch for a possible solution: we can build $Ctimes C$ in the same way that we build $C$, that is, starting from $C_0:=[0,1]$, $C_1:=[0,1/3]cup[2/3,1]$ and so on then $$Ctimes C=bigcap_{k=0}^infty C_ktimes C_ktag1$$
Set $A_k:=C_ktimes C_k$, then $A_k$ is composed by $4^k$ squares of side length $3^{-k}$, this means that each square have diameter $sqrt 2/3^k$.
For measurable sets the Hausdorff measure is defined by the limit $mathcal H^s(A)=lim_{epsilonto 0^+}mathcal H^s_epsilon(A)$, where
$$mathcal H_epsilon^s(A):=infleft{sum_{k=0}^inftyoperatorname{diam}(O_k)^s,, operatorname{diam}(O_k)le epsilon,, Asubsetbigcup_{k=0}^infty O_k,, O_ktext{ is open}right}tag2$$
Now we can try to approximate the value of $mathcal H^s(A)$ from above. Suppose we are trying to cover $A$ with open squares of diameter $gammasqrt 2/ 3^k$, then for enough small $gamma>1$ it seems easy to prove (by the inner structure of $Ctimes C$ that can be seen in it construction) that the most efficient way to do it is covering $A$ as if we were covering $A_k$, so we will need $4^k$ of this squares. The same happen for all $kinBbb N$, hence we will find that
$$mathcal H^s(A)lelim_{ktoinfty} 4^kleft(gammafrac{sqrt 2}{3^k}right)^s,quadforall gamma>1tag3$$
where the inequality comes from the fact that a box-covering is less efficient than a circle-covering using the same diameter for squares and circles (because a square cover less area than a circle with the same diameter). Hence we find that $mathcal H^s(A)le(sqrt 2)^s$ when we choose $s:=ln 4/ln 3$.
From all of this I see that if we shows that, for each $gamma_ksqrt 2/3^k$ (for enough small $gamma_k>1$), the covering of circles cannot be better than the covering of boxes, that is that $mathcal H^s_{gamma_ksqrt 2/3^k}(A)=4^k(gamma_ksqrt 2/3^k)^s$ then we will had that $$mathcal H^s(A)=lim_{ktoinfty}mathcal H^s_{gamma_ksqrt 2/3^k}(A)=(sqrt 2)^s$$ for $s:=ln 4/ln 3$.
About possible references: I didn't read it but, the most complete textbook that cover this questions, seems to by Fractal geometry of Falconer.
$endgroup$
Sketch for a possible solution: we can build $Ctimes C$ in the same way that we build $C$, that is, starting from $C_0:=[0,1]$, $C_1:=[0,1/3]cup[2/3,1]$ and so on then $$Ctimes C=bigcap_{k=0}^infty C_ktimes C_ktag1$$
Set $A_k:=C_ktimes C_k$, then $A_k$ is composed by $4^k$ squares of side length $3^{-k}$, this means that each square have diameter $sqrt 2/3^k$.
For measurable sets the Hausdorff measure is defined by the limit $mathcal H^s(A)=lim_{epsilonto 0^+}mathcal H^s_epsilon(A)$, where
$$mathcal H_epsilon^s(A):=infleft{sum_{k=0}^inftyoperatorname{diam}(O_k)^s,, operatorname{diam}(O_k)le epsilon,, Asubsetbigcup_{k=0}^infty O_k,, O_ktext{ is open}right}tag2$$
Now we can try to approximate the value of $mathcal H^s(A)$ from above. Suppose we are trying to cover $A$ with open squares of diameter $gammasqrt 2/ 3^k$, then for enough small $gamma>1$ it seems easy to prove (by the inner structure of $Ctimes C$ that can be seen in it construction) that the most efficient way to do it is covering $A$ as if we were covering $A_k$, so we will need $4^k$ of this squares. The same happen for all $kinBbb N$, hence we will find that
$$mathcal H^s(A)lelim_{ktoinfty} 4^kleft(gammafrac{sqrt 2}{3^k}right)^s,quadforall gamma>1tag3$$
where the inequality comes from the fact that a box-covering is less efficient than a circle-covering using the same diameter for squares and circles (because a square cover less area than a circle with the same diameter). Hence we find that $mathcal H^s(A)le(sqrt 2)^s$ when we choose $s:=ln 4/ln 3$.
From all of this I see that if we shows that, for each $gamma_ksqrt 2/3^k$ (for enough small $gamma_k>1$), the covering of circles cannot be better than the covering of boxes, that is that $mathcal H^s_{gamma_ksqrt 2/3^k}(A)=4^k(gamma_ksqrt 2/3^k)^s$ then we will had that $$mathcal H^s(A)=lim_{ktoinfty}mathcal H^s_{gamma_ksqrt 2/3^k}(A)=(sqrt 2)^s$$ for $s:=ln 4/ln 3$.
About possible references: I didn't read it but, the most complete textbook that cover this questions, seems to by Fractal geometry of Falconer.
edited Dec 13 '18 at 8:07
answered Dec 12 '18 at 9:32
MasacrosoMasacroso
13.1k41746
13.1k41746
$begingroup$
Thank you for your effort. But if you look closely, the set you constructed is not $mathcal{C}times mathcal{C}$ at all. Each steps of the construction of $mathcal{C}times mathcal{C}$ involves $4^k$ squares with diameter $sqrt{2}/3^k$.
$endgroup$
– pisco
Dec 12 '18 at 9:46
add a comment |
$begingroup$
Thank you for your effort. But if you look closely, the set you constructed is not $mathcal{C}times mathcal{C}$ at all. Each steps of the construction of $mathcal{C}times mathcal{C}$ involves $4^k$ squares with diameter $sqrt{2}/3^k$.
$endgroup$
– pisco
Dec 12 '18 at 9:46
$begingroup$
Thank you for your effort. But if you look closely, the set you constructed is not $mathcal{C}times mathcal{C}$ at all. Each steps of the construction of $mathcal{C}times mathcal{C}$ involves $4^k$ squares with diameter $sqrt{2}/3^k$.
$endgroup$
– pisco
Dec 12 '18 at 9:46
$begingroup$
Thank you for your effort. But if you look closely, the set you constructed is not $mathcal{C}times mathcal{C}$ at all. Each steps of the construction of $mathcal{C}times mathcal{C}$ involves $4^k$ squares with diameter $sqrt{2}/3^k$.
$endgroup$
– pisco
Dec 12 '18 at 9:46
add a comment |
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%2f3036362%2fexact-value-of-hausdorff-measure-of-two-dimensional-cantor-set%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