Hardy's Integral
Вставка
- Опубліковано 9 лют 2025
- 🌟Support the channel🌟
Patreon: / michaelpennmath
Channel Membership: / @michaelpennmath
Merch: teespring.com/...
My amazon shop: www.amazon.com...
🟢 Discord: / discord
🌟my other channels🌟
mathmajor: / @mathmajor
pennpav podcast: / @thepennpavpodcast7878
🌟My Links🌟
Personal Website: www.michael-pen...
Instagram: / melp2718
Twitter: / michaelpennmath
Randolph College Math: www.randolphcol...
Research Gate profile: www.researchga...
Google Scholar profile: scholar.google...
🌟How I make Thumbnails🌟
Canva: partner.canva....
Color Pallet: coolors.co/?re...
🌟Suggest a problem🌟
forms.gle/ea7P...
Thanks!
@@michaeljin101 woah, you *really* wanted this integral done.
What an excellent approach. For anyone wondering, the simplest form using only factorials at the end is:
In=pi/2*sum (2k)!*(2n-2k)!/[k!*(n-k)!]^2*a^(-1/2-k)*b^(-1/2-n+k)
Really respect your continued dedication to the UA-cam game Michael
The final solution as displayed suggests it is negative half the time due to the (-1)^n term. However that cancels against minus signs embedded in the two binomial coefficients, and the value is actually always positive.
Very clever. One of the professors best recently. My preference is analysis over number theory, but others might like all that prime number stuff.😅
Inside Interesting Integrals... One of my favorite books!
Just a stunning solution
Nice integral
Cool! I gotta get that book from the library.
I believe you can factor out a (-1)^n by turning the final combinations to be combinations of positive half-integers, whic would then cancel the same term outside the sum. Also, I would've liked to see what simplifications come about by taking a factorial-onlu representation
Lovely!
13:44 Where’s Laurel?
That's another fine math you got me into Stanley!
Laurel?
This laurel?ua-cam.com/video/Sbltu2_DATQ/v-deo.htmlsi=RzrbJAYiWBReqfHt
@@yoav613 this Laurel ua-cam.com/video/B13QoA59tA4/v-deo.html because Hardy...
@@BarryRowlingsonBaz oh ok,thanks😃
My first Idea was to derive recurrence relation for I(n)
but I tried to derive recurrence without using Leibnitz rule for integration
Nice problem and solution. Maybe I'm being nit-picky, but at 13:40, it seems off the mark to call a summation "a nice closed-form solution". I would want to evaluate the sum in closed form before describing the solution that way.
So, after all, that was not such a good place to stop...
True, it would be nice to have a more closed form, but here's what happens:
Pull out constants- (1/2)!^2, a^(-1/2), and b^(-n-1/2)
Remainder- (pi^2/2)*(-1/b)^n/(ab)^1/2xSum{1/k!*1/(n-k)!*1/(1/2-k)!*1/(1/2-n+k)!*(b/a)^k}
One look at this sum should somewhat breakdown the idea; there is no closed form (no, I won't prove this here). As such, we leave the formula in its "cleanest" form, which is what was provided at the end. While it may seem unsatisfactory, there are many other such series definitions for the likes of the elliptic integrals and even definitions for transcendentals like pi and e.
@@justcuzy3673 Oh, I have no problem with the solution as presented. I just wouldn't call it a "closed-form solution."
I agree with you that the prospects for evaluating that sum in closed form seem rather dim.
Give the prof a break. Hi final answer is simple to program up eliminating any need for numerical integration.
It’s a finite sum, so it counts as a closed form. Typically one only has issues with summations not being closed forms when they include infinitely many terms. (The main reason for not considering these closed forms is because of potential convergence issues.)
pie/2, 0, a/b, b/a, ab
awesome !
Shouldn't be (-1/2)(-3/2)(-5/2)···(-1/2-k+1) for the combinatorial number to be (-1/2)_C_k? And the same goes for the second one.
Do mathematicians lie awake nights composing "impossible" integrals?
Typically at the time of Hardy, physicists or engineers would encounter integrals like this when performing some approximation (suppose cows are not perfect spheres, but oblate spheroids--how does that perturb the results?) or an inverse Fourier transform, and when they had trouble they would ask a mathematician for help.
It's very important and higher technics of solving this type of integral thanks for sharing this
Inside Interesting Integrals by Paul J. Nahin
it’s really good i’ve read through it multiple times lol
The simplest way of stating the result is in terms of the (n-1)th Legendre polynomial.
Can we please all agree to just call it Leibnitz rule and not Feynman's trick?
What's in the name? We call it the "try differentiating under the integral" rule.
Nooooooo
I would agree, but the guy's name is Leibniz, not Leibnitz.
@AnkhArcRod: Leibniz invented the rule, but as far as I know, it was Feynman who first used it extensively for actually calculating integrals. So both names fit.
@@davidruhdorfer3857 That's true starting from 1671; before, there were varying different versions of how his name was written. (And his father's name was actually Leibnütz.)
With the product of the binomials, factor out all the 1/2's, then you are left with two products of odd integers, which you re-write in terms of factorials. {\displaystyle (2k-1)!!={\frac {(2k)!}{2^{k}k!}}={\frac {(2k-1)!}{2^{k-1}(k-1)!}}\,.} I'm not sure this makes things simpler, because I haven't actually done it! 🙂
hardy, cambridge professor
Can someone help me understand the expansion using the binomial formula at 9:00?
Why make it easier if it can be made more complicated.
I wish I understood what this was all about
Does the end result help us in other problems, compared to evaluating the integral atnthe start numerically for given n, a, and b?
I'd tidy it up a little more. Bring b^n and 1/sqrt(ab) common factors out to where they belong, to the left of the summation sign
Waw waw waw !
can you analytically continue the last statement for n to the complex plane?
I was wondering about whether the technique could be modified for real, or at least rational n. But then there is no termination for the iteration of integrals where Michael solves for n = 1.
Any way this extends to Rational numbers for n?
Could have all been a lot simplier bh exploiting symmetry at any step before he binomial expansion. we can see that I is symmetric about the transformation ab and so dI/da = dI/db. You can also prove it rigorously by using the substitution x=π/2-x in either expression for dI/da or dI/db
The substitution doesn't quite work, you'll have an a*sin(x)^2 + b*cos(x)^2 in the denominator, so dI/da ≠ dI/db... maybe you meant that we have dI/da (a,b) = dI/db (b,a) and vice-versa, which I'm pretty sure is definitely the case. This doesn't really simplify stuff tho
If there was that first symmetry then the final result would indeed have a much nicer expression
Penn used the symmetry by writing the forms for b without discussion, because it was the same form as for a.
@@alricboullemant3117 ahh yeah you're right 🤔 I jumped the gun there a bit. My bad
HEY AM HARDYY HE I AM EASLYYYYYYYYYYYYY
Knee jerk reaction at 0:02 Oh no! It has got an I in it. A capital I.
And it is followed by 'n' a lower case 'n'. Two tricky letters added together must make a very tricky integral In 🙂 in 'I' and in 'n'
From 09:04 onwards 🤔😵💫
One short class in multiplicative number theory or enumerative combinatorics will make you sick of discrete convolutions!
first