Find the volume of $P_n = {x in B_n textrm{ s.t. } |x_1| < frac{1}{1000}}$ and the volume of $B_n-P_n$,...












1















Let $B_n$ be the unit ball in $R^n$. We declare $$P_n = left{ xin B_n textrm{ such that }|x_1| < frac{1}{1000}right} .$$
I want to calculate the volume of $P_n$ and $B_n - P_n$ and determine which is bigger.




I tried to use Fubini's theorem here and found $$P_n = V_{n-1}int_frac{-1}{1000}^frac{1}{1000} left(sqrt{1-x_1^2}right)^{n-1}dx_1 ,$$ where $V_{n-1}$ is the volume of the unit ball in $R^{n-1}$. I got to this answer since the volume of a ball in $R^n$ with a radius $r$ is $V_n r^n$.



However here I get stuck since I don't to solve this integral. I couldn't really solve it even with the help of Wolfram Alpha.



Am I doing something wrong?










share|cite|improve this question




















  • 1




    It is doubtful that this integral has a "nice" closed form in terms of $n$.
    – Frpzzd
    2 days ago










  • Maybe there is an other way to solve it?
    – Gabi G
    2 days ago










  • Then which volume is bigger: $v(P_n)$ or $v(B_n - P_n)$ ?
    – Gabi G
    2 days ago












  • @GabiG for whatever reason I misread your question. My apologies. Let me try again....
    – Mike
    2 days ago












  • So, what I thought about is substituting $x_1 = sin(x_1)$, then it will lead to a reduction formula for the integral I wrote. But I still need some help determining which volume is bgger
    – Gabi G
    2 days ago


















1















Let $B_n$ be the unit ball in $R^n$. We declare $$P_n = left{ xin B_n textrm{ such that }|x_1| < frac{1}{1000}right} .$$
I want to calculate the volume of $P_n$ and $B_n - P_n$ and determine which is bigger.




I tried to use Fubini's theorem here and found $$P_n = V_{n-1}int_frac{-1}{1000}^frac{1}{1000} left(sqrt{1-x_1^2}right)^{n-1}dx_1 ,$$ where $V_{n-1}$ is the volume of the unit ball in $R^{n-1}$. I got to this answer since the volume of a ball in $R^n$ with a radius $r$ is $V_n r^n$.



However here I get stuck since I don't to solve this integral. I couldn't really solve it even with the help of Wolfram Alpha.



Am I doing something wrong?










share|cite|improve this question




















  • 1




    It is doubtful that this integral has a "nice" closed form in terms of $n$.
    – Frpzzd
    2 days ago










  • Maybe there is an other way to solve it?
    – Gabi G
    2 days ago










  • Then which volume is bigger: $v(P_n)$ or $v(B_n - P_n)$ ?
    – Gabi G
    2 days ago












  • @GabiG for whatever reason I misread your question. My apologies. Let me try again....
    – Mike
    2 days ago












  • So, what I thought about is substituting $x_1 = sin(x_1)$, then it will lead to a reduction formula for the integral I wrote. But I still need some help determining which volume is bgger
    – Gabi G
    2 days ago
















1












1








1








Let $B_n$ be the unit ball in $R^n$. We declare $$P_n = left{ xin B_n textrm{ such that }|x_1| < frac{1}{1000}right} .$$
I want to calculate the volume of $P_n$ and $B_n - P_n$ and determine which is bigger.




I tried to use Fubini's theorem here and found $$P_n = V_{n-1}int_frac{-1}{1000}^frac{1}{1000} left(sqrt{1-x_1^2}right)^{n-1}dx_1 ,$$ where $V_{n-1}$ is the volume of the unit ball in $R^{n-1}$. I got to this answer since the volume of a ball in $R^n$ with a radius $r$ is $V_n r^n$.



However here I get stuck since I don't to solve this integral. I couldn't really solve it even with the help of Wolfram Alpha.



Am I doing something wrong?










share|cite|improve this question
















Let $B_n$ be the unit ball in $R^n$. We declare $$P_n = left{ xin B_n textrm{ such that }|x_1| < frac{1}{1000}right} .$$
I want to calculate the volume of $P_n$ and $B_n - P_n$ and determine which is bigger.




I tried to use Fubini's theorem here and found $$P_n = V_{n-1}int_frac{-1}{1000}^frac{1}{1000} left(sqrt{1-x_1^2}right)^{n-1}dx_1 ,$$ where $V_{n-1}$ is the volume of the unit ball in $R^{n-1}$. I got to this answer since the volume of a ball in $R^n$ with a radius $r$ is $V_n r^n$.



However here I get stuck since I don't to solve this integral. I couldn't really solve it even with the help of Wolfram Alpha.



Am I doing something wrong?







real-analysis calculus integration multivariable-calculus






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago









Travis

59.8k767146




59.8k767146










asked 2 days ago









Gabi GGabi G

36719




36719








  • 1




    It is doubtful that this integral has a "nice" closed form in terms of $n$.
    – Frpzzd
    2 days ago










  • Maybe there is an other way to solve it?
    – Gabi G
    2 days ago










  • Then which volume is bigger: $v(P_n)$ or $v(B_n - P_n)$ ?
    – Gabi G
    2 days ago












  • @GabiG for whatever reason I misread your question. My apologies. Let me try again....
    – Mike
    2 days ago












  • So, what I thought about is substituting $x_1 = sin(x_1)$, then it will lead to a reduction formula for the integral I wrote. But I still need some help determining which volume is bgger
    – Gabi G
    2 days ago
















  • 1




    It is doubtful that this integral has a "nice" closed form in terms of $n$.
    – Frpzzd
    2 days ago










  • Maybe there is an other way to solve it?
    – Gabi G
    2 days ago










  • Then which volume is bigger: $v(P_n)$ or $v(B_n - P_n)$ ?
    – Gabi G
    2 days ago












  • @GabiG for whatever reason I misread your question. My apologies. Let me try again....
    – Mike
    2 days ago












  • So, what I thought about is substituting $x_1 = sin(x_1)$, then it will lead to a reduction formula for the integral I wrote. But I still need some help determining which volume is bgger
    – Gabi G
    2 days ago










1




1




It is doubtful that this integral has a "nice" closed form in terms of $n$.
– Frpzzd
2 days ago




It is doubtful that this integral has a "nice" closed form in terms of $n$.
– Frpzzd
2 days ago












Maybe there is an other way to solve it?
– Gabi G
2 days ago




Maybe there is an other way to solve it?
– Gabi G
2 days ago












Then which volume is bigger: $v(P_n)$ or $v(B_n - P_n)$ ?
– Gabi G
2 days ago






Then which volume is bigger: $v(P_n)$ or $v(B_n - P_n)$ ?
– Gabi G
2 days ago














@GabiG for whatever reason I misread your question. My apologies. Let me try again....
– Mike
2 days ago






@GabiG for whatever reason I misread your question. My apologies. Let me try again....
– Mike
2 days ago














So, what I thought about is substituting $x_1 = sin(x_1)$, then it will lead to a reduction formula for the integral I wrote. But I still need some help determining which volume is bgger
– Gabi G
2 days ago






So, what I thought about is substituting $x_1 = sin(x_1)$, then it will lead to a reduction formula for the integral I wrote. But I still need some help determining which volume is bgger
– Gabi G
2 days ago












2 Answers
2






active

oldest

votes


















0














One can write an explicit formula for the integral in terms of $n$ using a hypergeometric function:
$$operatorname{vol}(P_n) = 2 s cdot {}_2F_1left(frac{1}{2}, frac{1}{2}(-n + 1);frac{3}{2}; s^2right) V_{n - 1}, qquad s := frac{1}{1000}.$$
Unless you have a good deal of intuition for hypergeometric functions, though---I don't---this probably doesn't illuminate the point of the problem much, to say nothing of its second part.



On the other hand, applying Fubini's Theorem in the same way you did but this time to an integral for $V_n$ gives
$$V_n = V_{n - 1} int_{-1}^1 (1 - x^2)^{(n - 1) / 2} dx,$$
so (after rewriting the integrals using symmetry) we're comparing $$operatorname{vol}(P_n) = 2 V_{n - 1} int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad operatorname{vol}(B_n - P_n) = 2 V_{n - 1} int_s^1 (1 - x^2)^{(n - 1) / 2} dx ,$$
or just as well, the integrals
$$int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad int_s^1 (1 - x^2)^{(n - 1) / 2} dx .$$



Since $(1 - x^2)^{(n - 1) / 2} leq 1$, the first integral satisfies $$int_0^s (1 - x^2)^{(n - 1) / 2} leq s .$$ On the other hand, we have $$int_0^1 (1 - x^2)^{(n - 1) / 2} dx geq int_0^1 left(1 - (n - 1) x^2right) dx = frac{5 - n}{4},$$ so the second integral is $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx > frac{5 - n}{4} - s,$$
and hence:



$$textbf{For small $n$ we have } operatorname{vol}(B_n - P_n) > operatorname{vol}(P_n) textbf{.}$$



On the other hand, the second integral satisfies
$$int_s^1 (1 - x^2)^{(n - 1) / 2} dx leq (1 - s) (1 - s^2)^{(n - 1) / 2} leq (1 - s^2)^{(n - 1) / 2},$$
whereas for large $n$ (explicitly, $n > -2 log 2 / log(1 - s)$), a naive comparison for the first integral gives
$$int_0^s (1 - x^2)^{(n - 1) / 2} dx geq frac{1}{2} sqrt{1 - 4^{- 1 / n}} .$$
Expanding the r.h.s. in a series at $infty$ gives $frac{1}{2} sqrt{1 - 4^{- 1 / n}} = sqrt{frac{log 2}{2}} n^{-1 / 2} + O(n^{-3 / 2})$. In particular, $int_0^s (1 - x^2)^{(n - 1) / 2} dx$ decays much more slowly in $n$ than $(1 - s^2)^{(n - 1) / 2}$, so:



$$textbf{For large $n$ we have } operatorname{vol}(B_n - P_n) < operatorname{vol}(P_n) textbf{.}$$






share|cite|improve this answer





















  • I don't think this bound on $n$ is right though as $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$, while $B_n = int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$. Even for $n approx 3000$, Vol$(B_{n-1}(1-a^2))$ is close to 1 all the way up to $a approx frac{1}{sqrt{2n}} approx .01 >> .001$ so there is no way $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$ can be at least half of $int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$
    – Mike
    2 days ago












  • Meanwhile there was a solution already given above that answers the question and is much shorter and more elegant than a direct calculation--which still doesn't answer the question of the volume. Why not just go with that solution instead.
    – Mike
    2 days ago












  • In general, for general positive large $K$ letting $P^K_{xi} = {x in B_n; |x_i| le frac{1}{K} }$, this set has half the volume iff $n geq Y$ for some $Y in theta(K^2)$ and not $theta(K)$. Intuitively $B_{n-1}(sqrt{1-a^2})dx =(sqrt{1-a^2})^{n-1}$ has to be about $frac{1}{2}$ by the time $a$ is $frac{1}{K}$, and this will only happen if $n$ is that large.
    – Mike
    2 days ago












  • Typo in my last comment: *Intuitively Vol$(B_{n-1}(sqrt{1-a^2}) )$ has to be half Vol$(B_{n-1})$ by the time $a$ is $frac{1}{K}$; as Vol$(B_{n-1}(sqrt{1-a^2}) )$ $= (sqrt{1-a^2})^{n-1}$ Vol$(B_n)$ this will happen only if $n$ is as large as $theta(K^2)$.
    – Mike
    2 days ago












  • The solution doesn't claim that the bound $n > -2 log 2 / log(1 - s))$ is sufficient to guarantee that $operatorname{vol}(P_n) > operatorname{vol}(P_n)$ (it's not). Rather, it claims that bound is sufficient to guarantee the inequality that comes immediately afterward, and that latter inequality is use to establish the asymptotics of $operatorname{vol}(P_n)$. Consulting a CAS shows that the smallest $n$ where $operatorname{vol}(P_n)$ first exceeds $operatorname{vol}(B_n - P_n)$ is $approx 4.55 cdot 10^5$.
    – Travis
    yesterday





















0














For large enough $n$, the set $P_{ni} = {x in B_n; |x_i| le frac{1}{1000} }$ is bigger.



Indeed, for each $i$, let us write as $Q_{ni} = B_nsetminus P_{ni} = {x in B_n; |x_i| > frac{1}{1000} }$. So it suffices the show the following inequality: Vol$(Q_{n1})$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large. We do this next.



Then by symmetry each $Q_{ni}$ has the same volume, and of course $cup_n Q_i subset B_n$. However, each $x in B_n$ is in at most $1000^2 =1000000$ of the $Q_{ni}$s [make sure you see why] which implies the following inequality: $sum_n$ Vol$(Q_{ni}) le 1000000times$Vol$(B_n)$, which, as all the $Q_{ni}$s have the same volume, in turn implies the following string of inequalities: Vol$(Q_{n1}) le frac{1000000}{n} times $Vol$(B_n)$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large, which yields precisely what you want to show.





ETA on the other hand, for general (large) positive $K$, let $P^K_{ni}$ be the set ${x in B_n; |x_i| le frac{1}{K} }$. Then the inequality Vol$(P^K_{ni}) < frac{1}{2} times$ Vol$(B_n)$ only if $n ge theta(K^2)$. Indeed, let us set $a' = frac{4}{K}$. Then for
all $a < a'$, we note that Vol$(B_{n-1}(sqrt{1-a^2})) geq (sqrt{1-a^2})^{n-1}$Vol$(B_{n-1})$ $geq frac{1}{2}$Vol$(B_{n-1})$ for $n < frac{K^2}{8}$. This implies



$$text{vol}(B_n) ge int^{a'}_{-a'} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx$$



$$ > 2 int^{frac{1}{K}}_{-frac{1}{K}} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx doteq 2 text{Vol}(P^K_{ni}). $$






share|cite|improve this answer























    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
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3063188%2ffind-the-volume-of-p-n-x-in-b-n-textrm-s-t-x-1-frac11000-an%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0














    One can write an explicit formula for the integral in terms of $n$ using a hypergeometric function:
    $$operatorname{vol}(P_n) = 2 s cdot {}_2F_1left(frac{1}{2}, frac{1}{2}(-n + 1);frac{3}{2}; s^2right) V_{n - 1}, qquad s := frac{1}{1000}.$$
    Unless you have a good deal of intuition for hypergeometric functions, though---I don't---this probably doesn't illuminate the point of the problem much, to say nothing of its second part.



    On the other hand, applying Fubini's Theorem in the same way you did but this time to an integral for $V_n$ gives
    $$V_n = V_{n - 1} int_{-1}^1 (1 - x^2)^{(n - 1) / 2} dx,$$
    so (after rewriting the integrals using symmetry) we're comparing $$operatorname{vol}(P_n) = 2 V_{n - 1} int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad operatorname{vol}(B_n - P_n) = 2 V_{n - 1} int_s^1 (1 - x^2)^{(n - 1) / 2} dx ,$$
    or just as well, the integrals
    $$int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad int_s^1 (1 - x^2)^{(n - 1) / 2} dx .$$



    Since $(1 - x^2)^{(n - 1) / 2} leq 1$, the first integral satisfies $$int_0^s (1 - x^2)^{(n - 1) / 2} leq s .$$ On the other hand, we have $$int_0^1 (1 - x^2)^{(n - 1) / 2} dx geq int_0^1 left(1 - (n - 1) x^2right) dx = frac{5 - n}{4},$$ so the second integral is $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx > frac{5 - n}{4} - s,$$
    and hence:



    $$textbf{For small $n$ we have } operatorname{vol}(B_n - P_n) > operatorname{vol}(P_n) textbf{.}$$



    On the other hand, the second integral satisfies
    $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx leq (1 - s) (1 - s^2)^{(n - 1) / 2} leq (1 - s^2)^{(n - 1) / 2},$$
    whereas for large $n$ (explicitly, $n > -2 log 2 / log(1 - s)$), a naive comparison for the first integral gives
    $$int_0^s (1 - x^2)^{(n - 1) / 2} dx geq frac{1}{2} sqrt{1 - 4^{- 1 / n}} .$$
    Expanding the r.h.s. in a series at $infty$ gives $frac{1}{2} sqrt{1 - 4^{- 1 / n}} = sqrt{frac{log 2}{2}} n^{-1 / 2} + O(n^{-3 / 2})$. In particular, $int_0^s (1 - x^2)^{(n - 1) / 2} dx$ decays much more slowly in $n$ than $(1 - s^2)^{(n - 1) / 2}$, so:



    $$textbf{For large $n$ we have } operatorname{vol}(B_n - P_n) < operatorname{vol}(P_n) textbf{.}$$






    share|cite|improve this answer





















    • I don't think this bound on $n$ is right though as $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$, while $B_n = int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$. Even for $n approx 3000$, Vol$(B_{n-1}(1-a^2))$ is close to 1 all the way up to $a approx frac{1}{sqrt{2n}} approx .01 >> .001$ so there is no way $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$ can be at least half of $int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$
      – Mike
      2 days ago












    • Meanwhile there was a solution already given above that answers the question and is much shorter and more elegant than a direct calculation--which still doesn't answer the question of the volume. Why not just go with that solution instead.
      – Mike
      2 days ago












    • In general, for general positive large $K$ letting $P^K_{xi} = {x in B_n; |x_i| le frac{1}{K} }$, this set has half the volume iff $n geq Y$ for some $Y in theta(K^2)$ and not $theta(K)$. Intuitively $B_{n-1}(sqrt{1-a^2})dx =(sqrt{1-a^2})^{n-1}$ has to be about $frac{1}{2}$ by the time $a$ is $frac{1}{K}$, and this will only happen if $n$ is that large.
      – Mike
      2 days ago












    • Typo in my last comment: *Intuitively Vol$(B_{n-1}(sqrt{1-a^2}) )$ has to be half Vol$(B_{n-1})$ by the time $a$ is $frac{1}{K}$; as Vol$(B_{n-1}(sqrt{1-a^2}) )$ $= (sqrt{1-a^2})^{n-1}$ Vol$(B_n)$ this will happen only if $n$ is as large as $theta(K^2)$.
      – Mike
      2 days ago












    • The solution doesn't claim that the bound $n > -2 log 2 / log(1 - s))$ is sufficient to guarantee that $operatorname{vol}(P_n) > operatorname{vol}(P_n)$ (it's not). Rather, it claims that bound is sufficient to guarantee the inequality that comes immediately afterward, and that latter inequality is use to establish the asymptotics of $operatorname{vol}(P_n)$. Consulting a CAS shows that the smallest $n$ where $operatorname{vol}(P_n)$ first exceeds $operatorname{vol}(B_n - P_n)$ is $approx 4.55 cdot 10^5$.
      – Travis
      yesterday


















    0














    One can write an explicit formula for the integral in terms of $n$ using a hypergeometric function:
    $$operatorname{vol}(P_n) = 2 s cdot {}_2F_1left(frac{1}{2}, frac{1}{2}(-n + 1);frac{3}{2}; s^2right) V_{n - 1}, qquad s := frac{1}{1000}.$$
    Unless you have a good deal of intuition for hypergeometric functions, though---I don't---this probably doesn't illuminate the point of the problem much, to say nothing of its second part.



    On the other hand, applying Fubini's Theorem in the same way you did but this time to an integral for $V_n$ gives
    $$V_n = V_{n - 1} int_{-1}^1 (1 - x^2)^{(n - 1) / 2} dx,$$
    so (after rewriting the integrals using symmetry) we're comparing $$operatorname{vol}(P_n) = 2 V_{n - 1} int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad operatorname{vol}(B_n - P_n) = 2 V_{n - 1} int_s^1 (1 - x^2)^{(n - 1) / 2} dx ,$$
    or just as well, the integrals
    $$int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad int_s^1 (1 - x^2)^{(n - 1) / 2} dx .$$



    Since $(1 - x^2)^{(n - 1) / 2} leq 1$, the first integral satisfies $$int_0^s (1 - x^2)^{(n - 1) / 2} leq s .$$ On the other hand, we have $$int_0^1 (1 - x^2)^{(n - 1) / 2} dx geq int_0^1 left(1 - (n - 1) x^2right) dx = frac{5 - n}{4},$$ so the second integral is $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx > frac{5 - n}{4} - s,$$
    and hence:



    $$textbf{For small $n$ we have } operatorname{vol}(B_n - P_n) > operatorname{vol}(P_n) textbf{.}$$



    On the other hand, the second integral satisfies
    $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx leq (1 - s) (1 - s^2)^{(n - 1) / 2} leq (1 - s^2)^{(n - 1) / 2},$$
    whereas for large $n$ (explicitly, $n > -2 log 2 / log(1 - s)$), a naive comparison for the first integral gives
    $$int_0^s (1 - x^2)^{(n - 1) / 2} dx geq frac{1}{2} sqrt{1 - 4^{- 1 / n}} .$$
    Expanding the r.h.s. in a series at $infty$ gives $frac{1}{2} sqrt{1 - 4^{- 1 / n}} = sqrt{frac{log 2}{2}} n^{-1 / 2} + O(n^{-3 / 2})$. In particular, $int_0^s (1 - x^2)^{(n - 1) / 2} dx$ decays much more slowly in $n$ than $(1 - s^2)^{(n - 1) / 2}$, so:



    $$textbf{For large $n$ we have } operatorname{vol}(B_n - P_n) < operatorname{vol}(P_n) textbf{.}$$






    share|cite|improve this answer





















    • I don't think this bound on $n$ is right though as $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$, while $B_n = int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$. Even for $n approx 3000$, Vol$(B_{n-1}(1-a^2))$ is close to 1 all the way up to $a approx frac{1}{sqrt{2n}} approx .01 >> .001$ so there is no way $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$ can be at least half of $int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$
      – Mike
      2 days ago












    • Meanwhile there was a solution already given above that answers the question and is much shorter and more elegant than a direct calculation--which still doesn't answer the question of the volume. Why not just go with that solution instead.
      – Mike
      2 days ago












    • In general, for general positive large $K$ letting $P^K_{xi} = {x in B_n; |x_i| le frac{1}{K} }$, this set has half the volume iff $n geq Y$ for some $Y in theta(K^2)$ and not $theta(K)$. Intuitively $B_{n-1}(sqrt{1-a^2})dx =(sqrt{1-a^2})^{n-1}$ has to be about $frac{1}{2}$ by the time $a$ is $frac{1}{K}$, and this will only happen if $n$ is that large.
      – Mike
      2 days ago












    • Typo in my last comment: *Intuitively Vol$(B_{n-1}(sqrt{1-a^2}) )$ has to be half Vol$(B_{n-1})$ by the time $a$ is $frac{1}{K}$; as Vol$(B_{n-1}(sqrt{1-a^2}) )$ $= (sqrt{1-a^2})^{n-1}$ Vol$(B_n)$ this will happen only if $n$ is as large as $theta(K^2)$.
      – Mike
      2 days ago












    • The solution doesn't claim that the bound $n > -2 log 2 / log(1 - s))$ is sufficient to guarantee that $operatorname{vol}(P_n) > operatorname{vol}(P_n)$ (it's not). Rather, it claims that bound is sufficient to guarantee the inequality that comes immediately afterward, and that latter inequality is use to establish the asymptotics of $operatorname{vol}(P_n)$. Consulting a CAS shows that the smallest $n$ where $operatorname{vol}(P_n)$ first exceeds $operatorname{vol}(B_n - P_n)$ is $approx 4.55 cdot 10^5$.
      – Travis
      yesterday
















    0












    0








    0






    One can write an explicit formula for the integral in terms of $n$ using a hypergeometric function:
    $$operatorname{vol}(P_n) = 2 s cdot {}_2F_1left(frac{1}{2}, frac{1}{2}(-n + 1);frac{3}{2}; s^2right) V_{n - 1}, qquad s := frac{1}{1000}.$$
    Unless you have a good deal of intuition for hypergeometric functions, though---I don't---this probably doesn't illuminate the point of the problem much, to say nothing of its second part.



    On the other hand, applying Fubini's Theorem in the same way you did but this time to an integral for $V_n$ gives
    $$V_n = V_{n - 1} int_{-1}^1 (1 - x^2)^{(n - 1) / 2} dx,$$
    so (after rewriting the integrals using symmetry) we're comparing $$operatorname{vol}(P_n) = 2 V_{n - 1} int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad operatorname{vol}(B_n - P_n) = 2 V_{n - 1} int_s^1 (1 - x^2)^{(n - 1) / 2} dx ,$$
    or just as well, the integrals
    $$int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad int_s^1 (1 - x^2)^{(n - 1) / 2} dx .$$



    Since $(1 - x^2)^{(n - 1) / 2} leq 1$, the first integral satisfies $$int_0^s (1 - x^2)^{(n - 1) / 2} leq s .$$ On the other hand, we have $$int_0^1 (1 - x^2)^{(n - 1) / 2} dx geq int_0^1 left(1 - (n - 1) x^2right) dx = frac{5 - n}{4},$$ so the second integral is $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx > frac{5 - n}{4} - s,$$
    and hence:



    $$textbf{For small $n$ we have } operatorname{vol}(B_n - P_n) > operatorname{vol}(P_n) textbf{.}$$



    On the other hand, the second integral satisfies
    $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx leq (1 - s) (1 - s^2)^{(n - 1) / 2} leq (1 - s^2)^{(n - 1) / 2},$$
    whereas for large $n$ (explicitly, $n > -2 log 2 / log(1 - s)$), a naive comparison for the first integral gives
    $$int_0^s (1 - x^2)^{(n - 1) / 2} dx geq frac{1}{2} sqrt{1 - 4^{- 1 / n}} .$$
    Expanding the r.h.s. in a series at $infty$ gives $frac{1}{2} sqrt{1 - 4^{- 1 / n}} = sqrt{frac{log 2}{2}} n^{-1 / 2} + O(n^{-3 / 2})$. In particular, $int_0^s (1 - x^2)^{(n - 1) / 2} dx$ decays much more slowly in $n$ than $(1 - s^2)^{(n - 1) / 2}$, so:



    $$textbf{For large $n$ we have } operatorname{vol}(B_n - P_n) < operatorname{vol}(P_n) textbf{.}$$






    share|cite|improve this answer












    One can write an explicit formula for the integral in terms of $n$ using a hypergeometric function:
    $$operatorname{vol}(P_n) = 2 s cdot {}_2F_1left(frac{1}{2}, frac{1}{2}(-n + 1);frac{3}{2}; s^2right) V_{n - 1}, qquad s := frac{1}{1000}.$$
    Unless you have a good deal of intuition for hypergeometric functions, though---I don't---this probably doesn't illuminate the point of the problem much, to say nothing of its second part.



    On the other hand, applying Fubini's Theorem in the same way you did but this time to an integral for $V_n$ gives
    $$V_n = V_{n - 1} int_{-1}^1 (1 - x^2)^{(n - 1) / 2} dx,$$
    so (after rewriting the integrals using symmetry) we're comparing $$operatorname{vol}(P_n) = 2 V_{n - 1} int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad operatorname{vol}(B_n - P_n) = 2 V_{n - 1} int_s^1 (1 - x^2)^{(n - 1) / 2} dx ,$$
    or just as well, the integrals
    $$int_0^s (1 - x^2)^{(n - 1) / 2} dx qquad textrm{and} qquad int_s^1 (1 - x^2)^{(n - 1) / 2} dx .$$



    Since $(1 - x^2)^{(n - 1) / 2} leq 1$, the first integral satisfies $$int_0^s (1 - x^2)^{(n - 1) / 2} leq s .$$ On the other hand, we have $$int_0^1 (1 - x^2)^{(n - 1) / 2} dx geq int_0^1 left(1 - (n - 1) x^2right) dx = frac{5 - n}{4},$$ so the second integral is $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx > frac{5 - n}{4} - s,$$
    and hence:



    $$textbf{For small $n$ we have } operatorname{vol}(B_n - P_n) > operatorname{vol}(P_n) textbf{.}$$



    On the other hand, the second integral satisfies
    $$int_s^1 (1 - x^2)^{(n - 1) / 2} dx leq (1 - s) (1 - s^2)^{(n - 1) / 2} leq (1 - s^2)^{(n - 1) / 2},$$
    whereas for large $n$ (explicitly, $n > -2 log 2 / log(1 - s)$), a naive comparison for the first integral gives
    $$int_0^s (1 - x^2)^{(n - 1) / 2} dx geq frac{1}{2} sqrt{1 - 4^{- 1 / n}} .$$
    Expanding the r.h.s. in a series at $infty$ gives $frac{1}{2} sqrt{1 - 4^{- 1 / n}} = sqrt{frac{log 2}{2}} n^{-1 / 2} + O(n^{-3 / 2})$. In particular, $int_0^s (1 - x^2)^{(n - 1) / 2} dx$ decays much more slowly in $n$ than $(1 - s^2)^{(n - 1) / 2}$, so:



    $$textbf{For large $n$ we have } operatorname{vol}(B_n - P_n) < operatorname{vol}(P_n) textbf{.}$$







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered 2 days ago









    TravisTravis

    59.8k767146




    59.8k767146












    • I don't think this bound on $n$ is right though as $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$, while $B_n = int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$. Even for $n approx 3000$, Vol$(B_{n-1}(1-a^2))$ is close to 1 all the way up to $a approx frac{1}{sqrt{2n}} approx .01 >> .001$ so there is no way $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$ can be at least half of $int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$
      – Mike
      2 days ago












    • Meanwhile there was a solution already given above that answers the question and is much shorter and more elegant than a direct calculation--which still doesn't answer the question of the volume. Why not just go with that solution instead.
      – Mike
      2 days ago












    • In general, for general positive large $K$ letting $P^K_{xi} = {x in B_n; |x_i| le frac{1}{K} }$, this set has half the volume iff $n geq Y$ for some $Y in theta(K^2)$ and not $theta(K)$. Intuitively $B_{n-1}(sqrt{1-a^2})dx =(sqrt{1-a^2})^{n-1}$ has to be about $frac{1}{2}$ by the time $a$ is $frac{1}{K}$, and this will only happen if $n$ is that large.
      – Mike
      2 days ago












    • Typo in my last comment: *Intuitively Vol$(B_{n-1}(sqrt{1-a^2}) )$ has to be half Vol$(B_{n-1})$ by the time $a$ is $frac{1}{K}$; as Vol$(B_{n-1}(sqrt{1-a^2}) )$ $= (sqrt{1-a^2})^{n-1}$ Vol$(B_n)$ this will happen only if $n$ is as large as $theta(K^2)$.
      – Mike
      2 days ago












    • The solution doesn't claim that the bound $n > -2 log 2 / log(1 - s))$ is sufficient to guarantee that $operatorname{vol}(P_n) > operatorname{vol}(P_n)$ (it's not). Rather, it claims that bound is sufficient to guarantee the inequality that comes immediately afterward, and that latter inequality is use to establish the asymptotics of $operatorname{vol}(P_n)$. Consulting a CAS shows that the smallest $n$ where $operatorname{vol}(P_n)$ first exceeds $operatorname{vol}(B_n - P_n)$ is $approx 4.55 cdot 10^5$.
      – Travis
      yesterday




















    • I don't think this bound on $n$ is right though as $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$, while $B_n = int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$. Even for $n approx 3000$, Vol$(B_{n-1}(1-a^2))$ is close to 1 all the way up to $a approx frac{1}{sqrt{2n}} approx .01 >> .001$ so there is no way $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$ can be at least half of $int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$
      – Mike
      2 days ago












    • Meanwhile there was a solution already given above that answers the question and is much shorter and more elegant than a direct calculation--which still doesn't answer the question of the volume. Why not just go with that solution instead.
      – Mike
      2 days ago












    • In general, for general positive large $K$ letting $P^K_{xi} = {x in B_n; |x_i| le frac{1}{K} }$, this set has half the volume iff $n geq Y$ for some $Y in theta(K^2)$ and not $theta(K)$. Intuitively $B_{n-1}(sqrt{1-a^2})dx =(sqrt{1-a^2})^{n-1}$ has to be about $frac{1}{2}$ by the time $a$ is $frac{1}{K}$, and this will only happen if $n$ is that large.
      – Mike
      2 days ago












    • Typo in my last comment: *Intuitively Vol$(B_{n-1}(sqrt{1-a^2}) )$ has to be half Vol$(B_{n-1})$ by the time $a$ is $frac{1}{K}$; as Vol$(B_{n-1}(sqrt{1-a^2}) )$ $= (sqrt{1-a^2})^{n-1}$ Vol$(B_n)$ this will happen only if $n$ is as large as $theta(K^2)$.
      – Mike
      2 days ago












    • The solution doesn't claim that the bound $n > -2 log 2 / log(1 - s))$ is sufficient to guarantee that $operatorname{vol}(P_n) > operatorname{vol}(P_n)$ (it's not). Rather, it claims that bound is sufficient to guarantee the inequality that comes immediately afterward, and that latter inequality is use to establish the asymptotics of $operatorname{vol}(P_n)$. Consulting a CAS shows that the smallest $n$ where $operatorname{vol}(P_n)$ first exceeds $operatorname{vol}(B_n - P_n)$ is $approx 4.55 cdot 10^5$.
      – Travis
      yesterday


















    I don't think this bound on $n$ is right though as $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$, while $B_n = int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$. Even for $n approx 3000$, Vol$(B_{n-1}(1-a^2))$ is close to 1 all the way up to $a approx frac{1}{sqrt{2n}} approx .01 >> .001$ so there is no way $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$ can be at least half of $int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$
    – Mike
    2 days ago






    I don't think this bound on $n$ is right though as $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$, while $B_n = int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$. Even for $n approx 3000$, Vol$(B_{n-1}(1-a^2))$ is close to 1 all the way up to $a approx frac{1}{sqrt{2n}} approx .01 >> .001$ so there is no way $P_n = int_{-.001}^{.001}$Vol$B_{n-1}(sqrt{1-x^2})dx$ can be at least half of $int_{-1}^{1}$Vol$B_{n-1}(sqrt{1-x^2})dx$
    – Mike
    2 days ago














    Meanwhile there was a solution already given above that answers the question and is much shorter and more elegant than a direct calculation--which still doesn't answer the question of the volume. Why not just go with that solution instead.
    – Mike
    2 days ago






    Meanwhile there was a solution already given above that answers the question and is much shorter and more elegant than a direct calculation--which still doesn't answer the question of the volume. Why not just go with that solution instead.
    – Mike
    2 days ago














    In general, for general positive large $K$ letting $P^K_{xi} = {x in B_n; |x_i| le frac{1}{K} }$, this set has half the volume iff $n geq Y$ for some $Y in theta(K^2)$ and not $theta(K)$. Intuitively $B_{n-1}(sqrt{1-a^2})dx =(sqrt{1-a^2})^{n-1}$ has to be about $frac{1}{2}$ by the time $a$ is $frac{1}{K}$, and this will only happen if $n$ is that large.
    – Mike
    2 days ago






    In general, for general positive large $K$ letting $P^K_{xi} = {x in B_n; |x_i| le frac{1}{K} }$, this set has half the volume iff $n geq Y$ for some $Y in theta(K^2)$ and not $theta(K)$. Intuitively $B_{n-1}(sqrt{1-a^2})dx =(sqrt{1-a^2})^{n-1}$ has to be about $frac{1}{2}$ by the time $a$ is $frac{1}{K}$, and this will only happen if $n$ is that large.
    – Mike
    2 days ago














    Typo in my last comment: *Intuitively Vol$(B_{n-1}(sqrt{1-a^2}) )$ has to be half Vol$(B_{n-1})$ by the time $a$ is $frac{1}{K}$; as Vol$(B_{n-1}(sqrt{1-a^2}) )$ $= (sqrt{1-a^2})^{n-1}$ Vol$(B_n)$ this will happen only if $n$ is as large as $theta(K^2)$.
    – Mike
    2 days ago






    Typo in my last comment: *Intuitively Vol$(B_{n-1}(sqrt{1-a^2}) )$ has to be half Vol$(B_{n-1})$ by the time $a$ is $frac{1}{K}$; as Vol$(B_{n-1}(sqrt{1-a^2}) )$ $= (sqrt{1-a^2})^{n-1}$ Vol$(B_n)$ this will happen only if $n$ is as large as $theta(K^2)$.
    – Mike
    2 days ago














    The solution doesn't claim that the bound $n > -2 log 2 / log(1 - s))$ is sufficient to guarantee that $operatorname{vol}(P_n) > operatorname{vol}(P_n)$ (it's not). Rather, it claims that bound is sufficient to guarantee the inequality that comes immediately afterward, and that latter inequality is use to establish the asymptotics of $operatorname{vol}(P_n)$. Consulting a CAS shows that the smallest $n$ where $operatorname{vol}(P_n)$ first exceeds $operatorname{vol}(B_n - P_n)$ is $approx 4.55 cdot 10^5$.
    – Travis
    yesterday






    The solution doesn't claim that the bound $n > -2 log 2 / log(1 - s))$ is sufficient to guarantee that $operatorname{vol}(P_n) > operatorname{vol}(P_n)$ (it's not). Rather, it claims that bound is sufficient to guarantee the inequality that comes immediately afterward, and that latter inequality is use to establish the asymptotics of $operatorname{vol}(P_n)$. Consulting a CAS shows that the smallest $n$ where $operatorname{vol}(P_n)$ first exceeds $operatorname{vol}(B_n - P_n)$ is $approx 4.55 cdot 10^5$.
    – Travis
    yesterday













    0














    For large enough $n$, the set $P_{ni} = {x in B_n; |x_i| le frac{1}{1000} }$ is bigger.



    Indeed, for each $i$, let us write as $Q_{ni} = B_nsetminus P_{ni} = {x in B_n; |x_i| > frac{1}{1000} }$. So it suffices the show the following inequality: Vol$(Q_{n1})$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large. We do this next.



    Then by symmetry each $Q_{ni}$ has the same volume, and of course $cup_n Q_i subset B_n$. However, each $x in B_n$ is in at most $1000^2 =1000000$ of the $Q_{ni}$s [make sure you see why] which implies the following inequality: $sum_n$ Vol$(Q_{ni}) le 1000000times$Vol$(B_n)$, which, as all the $Q_{ni}$s have the same volume, in turn implies the following string of inequalities: Vol$(Q_{n1}) le frac{1000000}{n} times $Vol$(B_n)$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large, which yields precisely what you want to show.





    ETA on the other hand, for general (large) positive $K$, let $P^K_{ni}$ be the set ${x in B_n; |x_i| le frac{1}{K} }$. Then the inequality Vol$(P^K_{ni}) < frac{1}{2} times$ Vol$(B_n)$ only if $n ge theta(K^2)$. Indeed, let us set $a' = frac{4}{K}$. Then for
    all $a < a'$, we note that Vol$(B_{n-1}(sqrt{1-a^2})) geq (sqrt{1-a^2})^{n-1}$Vol$(B_{n-1})$ $geq frac{1}{2}$Vol$(B_{n-1})$ for $n < frac{K^2}{8}$. This implies



    $$text{vol}(B_n) ge int^{a'}_{-a'} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx$$



    $$ > 2 int^{frac{1}{K}}_{-frac{1}{K}} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx doteq 2 text{Vol}(P^K_{ni}). $$






    share|cite|improve this answer




























      0














      For large enough $n$, the set $P_{ni} = {x in B_n; |x_i| le frac{1}{1000} }$ is bigger.



      Indeed, for each $i$, let us write as $Q_{ni} = B_nsetminus P_{ni} = {x in B_n; |x_i| > frac{1}{1000} }$. So it suffices the show the following inequality: Vol$(Q_{n1})$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large. We do this next.



      Then by symmetry each $Q_{ni}$ has the same volume, and of course $cup_n Q_i subset B_n$. However, each $x in B_n$ is in at most $1000^2 =1000000$ of the $Q_{ni}$s [make sure you see why] which implies the following inequality: $sum_n$ Vol$(Q_{ni}) le 1000000times$Vol$(B_n)$, which, as all the $Q_{ni}$s have the same volume, in turn implies the following string of inequalities: Vol$(Q_{n1}) le frac{1000000}{n} times $Vol$(B_n)$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large, which yields precisely what you want to show.





      ETA on the other hand, for general (large) positive $K$, let $P^K_{ni}$ be the set ${x in B_n; |x_i| le frac{1}{K} }$. Then the inequality Vol$(P^K_{ni}) < frac{1}{2} times$ Vol$(B_n)$ only if $n ge theta(K^2)$. Indeed, let us set $a' = frac{4}{K}$. Then for
      all $a < a'$, we note that Vol$(B_{n-1}(sqrt{1-a^2})) geq (sqrt{1-a^2})^{n-1}$Vol$(B_{n-1})$ $geq frac{1}{2}$Vol$(B_{n-1})$ for $n < frac{K^2}{8}$. This implies



      $$text{vol}(B_n) ge int^{a'}_{-a'} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx$$



      $$ > 2 int^{frac{1}{K}}_{-frac{1}{K}} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx doteq 2 text{Vol}(P^K_{ni}). $$






      share|cite|improve this answer


























        0












        0








        0






        For large enough $n$, the set $P_{ni} = {x in B_n; |x_i| le frac{1}{1000} }$ is bigger.



        Indeed, for each $i$, let us write as $Q_{ni} = B_nsetminus P_{ni} = {x in B_n; |x_i| > frac{1}{1000} }$. So it suffices the show the following inequality: Vol$(Q_{n1})$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large. We do this next.



        Then by symmetry each $Q_{ni}$ has the same volume, and of course $cup_n Q_i subset B_n$. However, each $x in B_n$ is in at most $1000^2 =1000000$ of the $Q_{ni}$s [make sure you see why] which implies the following inequality: $sum_n$ Vol$(Q_{ni}) le 1000000times$Vol$(B_n)$, which, as all the $Q_{ni}$s have the same volume, in turn implies the following string of inequalities: Vol$(Q_{n1}) le frac{1000000}{n} times $Vol$(B_n)$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large, which yields precisely what you want to show.





        ETA on the other hand, for general (large) positive $K$, let $P^K_{ni}$ be the set ${x in B_n; |x_i| le frac{1}{K} }$. Then the inequality Vol$(P^K_{ni}) < frac{1}{2} times$ Vol$(B_n)$ only if $n ge theta(K^2)$. Indeed, let us set $a' = frac{4}{K}$. Then for
        all $a < a'$, we note that Vol$(B_{n-1}(sqrt{1-a^2})) geq (sqrt{1-a^2})^{n-1}$Vol$(B_{n-1})$ $geq frac{1}{2}$Vol$(B_{n-1})$ for $n < frac{K^2}{8}$. This implies



        $$text{vol}(B_n) ge int^{a'}_{-a'} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx$$



        $$ > 2 int^{frac{1}{K}}_{-frac{1}{K}} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx doteq 2 text{Vol}(P^K_{ni}). $$






        share|cite|improve this answer














        For large enough $n$, the set $P_{ni} = {x in B_n; |x_i| le frac{1}{1000} }$ is bigger.



        Indeed, for each $i$, let us write as $Q_{ni} = B_nsetminus P_{ni} = {x in B_n; |x_i| > frac{1}{1000} }$. So it suffices the show the following inequality: Vol$(Q_{n1})$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large. We do this next.



        Then by symmetry each $Q_{ni}$ has the same volume, and of course $cup_n Q_i subset B_n$. However, each $x in B_n$ is in at most $1000^2 =1000000$ of the $Q_{ni}$s [make sure you see why] which implies the following inequality: $sum_n$ Vol$(Q_{ni}) le 1000000times$Vol$(B_n)$, which, as all the $Q_{ni}$s have the same volume, in turn implies the following string of inequalities: Vol$(Q_{n1}) le frac{1000000}{n} times $Vol$(B_n)$ $<frac{1}{2} times$Vol$(B_n)$ for $n$ sufficiently large, which yields precisely what you want to show.





        ETA on the other hand, for general (large) positive $K$, let $P^K_{ni}$ be the set ${x in B_n; |x_i| le frac{1}{K} }$. Then the inequality Vol$(P^K_{ni}) < frac{1}{2} times$ Vol$(B_n)$ only if $n ge theta(K^2)$. Indeed, let us set $a' = frac{4}{K}$. Then for
        all $a < a'$, we note that Vol$(B_{n-1}(sqrt{1-a^2})) geq (sqrt{1-a^2})^{n-1}$Vol$(B_{n-1})$ $geq frac{1}{2}$Vol$(B_{n-1})$ for $n < frac{K^2}{8}$. This implies



        $$text{vol}(B_n) ge int^{a'}_{-a'} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx$$



        $$ > 2 int^{frac{1}{K}}_{-frac{1}{K}} text{Vol}left(B_{n-1}left(sqrt{1-x^2}right)right) dx doteq 2 text{Vol}(P^K_{ni}). $$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 2 days ago

























        answered 2 days ago









        MikeMike

        3,148311




        3,148311






























            draft saved

            draft discarded




















































            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3063188%2ffind-the-volume-of-p-n-x-in-b-n-textrm-s-t-x-1-frac11000-an%23new-answer', 'question_page');
            }
            );

            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







            Popular posts from this blog

            Mario Kart Wii

            The Binding of Isaac: Rebirth/Afterbirth

            What does “Dominus providebit” mean?