MedVision ad

HSC 2015 MX2 Integration Marathon (archive) (3 Viewers)

Status
Not open for further replies.

glittergal96

Active Member
Joined
Jul 25, 2014
Messages
418
Gender
Female
HSC
2014
Re: MX2 2015 Integration Marathon

Here is a question that concerns inequalities arising from

integration. (It is harder conceptually than most questions in this thread, but easier than

a lot of them in terms of how technically demanding the required manipulations are.)



First a couple of simplifying observations:

Note: The constant C in the following proof means an arbitrary positive constant. In
particular, C will typically change between lines as we absorb other constants into it. Eg
is true in this sense, because the RHS is just shorthand for .

1. By rotational symmetry we may assume is a non-negative real number.

2. If we can find such pairs of constants for where
is a finite collection of subsets of the non-negative reals, with union the non-negative
reals, then we can find such a pair of constants for x in the full set on non-negative
reals. (We simply take the lowest constant for the lower bound and the largest constant for
the upper bound.)

3. For a similar reason, and symmetry, it suffices to only consider integration in .

4. If we take , then the upper bound is
trivial for the first and third sets. The integrand is bounded by .

5. The integrand is positive and decreasing in theta, whatever x is.

The key to the rest of the work is choosing a nice way cutting up the domain of integration into intervals of varying width and using upper/lower rectangle type approximations. But of course, we first need to understand how varies in theta.



We also have for non-negative a and b, by using the AM-QM for the first and adding in a 2ab under the square root to prove the upper bound.

Cobbling this together with the standard polynomial bounds for cos we get from repeated integration of the trig functions, we get



and



We don't need such delicate analysis to prove the lower bounds, as we have



on and



on



on .

So the only real work to do is on and this is a bit tricky. (It is unsurprising this is the hard bit, as this is where the integrand starts to get big.)

Because x is now a small bounded distance from 1 (indeed this was the purpose of my partitioning choice), our earlier distance estimates simplify to



We want to partition the interval of integration into small sets and use the above estimates. The form of the upper and lower bounds make it convenient to consider scaled intervals of the form .

You can play around with this and try obvious partitionings like , etc, but you will find you have convergence issues generally when you sum up the upper/lower bounds. The problem is that we need to have very sharp control of what happens at the "big" part, where d is kind of small. This motivates the choice of a dyadic style decomposition.

Now, to prove the upper bound on :

Let for

Then



But the geometric series has common ratio < 1 and so converges to something finite, and all partial sums are bounded above by this constant! This (finally) completes the proof.

Jesus christ that was exhausting...

Apologies for my abuse of notation having two d's (to clarify, means the distance from 1 to the unit circle point with argument , and is the distance of x from the unit circle.), there is no way I am going to go back and fix them lol. Feel free to ask me if anything is unclear, it is entirely possible I made little algebra mistakes here or there.
 
Last edited:

glittergal96

Active Member
Joined
Jul 25, 2014
Messages
418
Gender
Female
HSC
2014
Re: MX2 2015 Integration Marathon

In case anyone wants to try to prove the similar question I posted based on the factorial before Sy posts his, it is MUCH MUCH shorter and easier than the above.
 

Sy123

This too shall pass
Joined
Nov 6, 2011
Messages
3,730
Gender
Male
HSC
2013
Re: MX2 2015 Integration Marathon

In case anyone wants to try to prove the similar question I posted based on the factorial before Sy posts his, it is MUCH MUCH shorter and easier than the above.
btw is there a non-strict lower bound for your question? It seems to me (at least on the positive integers) that the expression is monotone decreasing tending towards a limit, but then there is no non-strict lower bound
 

glittergal96

Active Member
Joined
Jul 25, 2014
Messages
418
Gender
Female
HSC
2014
Re: MX2 2015 Integration Marathon

btw is there a non-strict lower bound for your question? It seems to me (at least on the positive integers) that the expression is monotone decreasing tending towards a limit, but then there is no non-strict lower bound
Well if it tends to a limit from above, wouldn't any real number less than that limit be a non-strict lower bound?

There are probably lots of ways of finding one, but I had a particular method in mind.
 

glittergal96

Active Member
Joined
Jul 25, 2014
Messages
418
Gender
Female
HSC
2014
Re: MX2 2015 Integration Marathon

(Ps, if you are actually able to prove that it is monotonically decreasing and bounded below, then you would have filled in the blank in my question which then completes a proof of Stirling's formula. I'm not sure that's true though...will check.)

Update: A quick check with small numbers seems to indicate this is true, can you prove it though?

Update 2: Ahh it's actually not that hard to prove monotonicity at all. That's cool. That means:

(Proof of montonicity)+(Proof of lower bound)+(Evaluation of limit, given that one exists) = (Proof of Stirling's formula.) :)
 
Last edited:

Kaido

be.
Joined
Jul 7, 2014
Messages
798
Gender
Male
HSC
2015
Re: MX2 2015 Integration Marathon

Hmm not sure if I was supposed to use something like F(a-x)

I just multiplied by sec^2x/sec^2x and used u=tanx. Then standard arctan integral
 
Last edited:

porcupinetree

not actually a porcupine
Joined
Dec 12, 2014
Messages
664
Gender
Male
HSC
2015
Re: MX2 2015 Integration Marathon

Hmm not sure if I was supposed to use something like F(a-x)

I just multiplied by sec^2x and used u=tanx. Then standard arctan integral
Yep - that's the way that I first did it to get an answer of

But then I started fiddling around with partial fractions and t method and solved it a different way - but I must have made a mistake somewhere because it yielded the wrong answer.

Can someone have a look at this working and see what's wrong with it? I'm sure it's something very simple https://imgur.com/6mA5WzM
 

Drsoccerball

Well-Known Member
Joined
May 28, 2014
Messages
3,650
Gender
Undisclosed
HSC
2015
Re: MX2 2015 Integration Marathon

Alright lets see if this works:

 

Kaido

be.
Joined
Jul 7, 2014
Messages
798
Gender
Male
HSC
2015
Re: MX2 2015 Integration Marathon

lol, "let's see"

used f(a-x), then let cosa be any constant, used t formula and standard arctan integral
 

Drsoccerball

Well-Known Member
Joined
May 28, 2014
Messages
3,650
Gender
Undisclosed
HSC
2015
Re: MX2 2015 Integration Marathon

lol, "let's see"

used f(a-x), then let cosa be any constant, used t formula and standard arctan integral
using f(a-x) you just change the sin to the cos and thus wasting a step (since youre using t formula)
 

Kaido

be.
Joined
Jul 7, 2014
Messages
798
Gender
Male
HSC
2015
Re: MX2 2015 Integration Marathon

lol, i always try it first whenever i see a definite integral

soz boss
 

Sy123

This too shall pass
Joined
Nov 6, 2011
Messages
3,730
Gender
Male
HSC
2013
Re: MX2 2015 Integration Marathon

Well if it tends to a limit from above, wouldn't any real number less than that limit be a non-strict lower bound?

There are probably lots of ways of finding one, but I had a particular method in mind.
(Ps, if you are actually able to prove that it is monotonically decreasing and bounded below, then you would have filled in the blank in my question which then completes a proof of Stirling's formula. I'm not sure that's true though...will check.)

Update: A quick check with small numbers seems to indicate this is true, can you prove it though?

Update 2: Ahh it's actually not that hard to prove monotonicity at all. That's cool. That means:

(Proof of montonicity)+(Proof of lower bound)+(Evaluation of limit, given that one exists) = (Proof of Stirling's formula.) :)
I wasn't able to think of a way to approximate the lower bound as (though technically if you allow for a strict lower bound like 2pi as an answer to the question, then a strict lower bound of 1 would be sufficient too and easy to prove, though such a bound would not be useful).

How did you get it?
 

Drsoccerball

Well-Known Member
Joined
May 28, 2014
Messages
3,650
Gender
Undisclosed
HSC
2015
Re: MX2 2015 Integration Marathon

I wasn't able to think of a way to approximate the lower bound as (though technically if you allow for a strict lower bound like 2pi as an answer to the question, then a strict lower bound of 1 would be sufficient too and easy to prove, though such a bound would not be useful).

How did you get it?
integrand got the lower bound ages ago if you want to look for it by fowarding to when the question was posted
 
Status
Not open for further replies.

Users Who Are Viewing This Thread (Users: 0, Guests: 3)

Top