The Birch and Swinnerton-Dyer Conjecture is a millennium prize problem, one of the famed seven placed by the Clay Mathematical Institute in the year 2000. As the only number-theoretic problem in the list apart from the Riemann Hypothesis, the BSD Conjecture has been haunting mathematicians ever since its conception in the mid-20th century, and relates to several different concepts and applications, including Elliptic Curve Cryptography.
The BSD Conjecture is essentially an attempt to determine rational solutions of elliptic curves through a variety of different approaches, including but not limited to L-functions, statistics, complex analysis and rank determination. In this video I attempt to explain the BSD Conjecture in layman terms without shying away from the inner beauty of the equations.
Slight error at 14:14, the equation should be y^3, not y^2.
-------------------------------------------------------------------------
Music Credits:
Special thanks to E7VN (https://open.spotify.com/artist/6erp85MigVPLLohx5xPxwT) for creating some great original soundtracks.
Inspired by Kevin MacLeod
Link: https://incompetech.filmmusic.io/song/3918-inspired/
License: http://creativecommons.org/licenses/by/4.0/
Wind Of The Rainforest Preview by Kevin MacLeod
Link: https://incompetech.filmmusic.io/song/5729-wind-of-the-rainforest-preview
License: http://creativecommons.org/licenses/by/4.0/
Music: https://www.purple-planet.comhttp://www.bensound.com/royalty-free-music
--------------------------------------------------------------------------
Sources and Citations:
1) Gunter Harder and Don Zagier, 'The Conjecture of Birch and Swinnerton-Dyer' (https://people.mpim-bonn.mpg.de/zagier/files/tex/BSDwHarder/fulltext.pdf)
2) Popular Talk by Manjul Bhargava in the Clay Mathematics Institute, 2016 (/watch/)gD6bzIWQbg2Q6
3) Notes on Bhargava's talk (https://www.claymath.org/sites/default/files/bhargava.pdf)
4) Wikipedia contributors, "Birch and Swinnerton-Dyer conjecture," Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/w/index.php?title=Birch_and_Swinnerton-Dyer_conjecture&oldid=948783592
5) Stewart, Ian, 'Visions of Infinity: The Great Mathematical Problems' (Basic Books, 05-Mar-2013)
--------------------------------------------------------------------------
Chapters
0:00 Introduction to Elliptic Curves
1:40 Intro
1:50 What is Number Theory?
3:27 Types of Diophantine Equations
6:22 Solutions to Elliptic Curves
11:50 Clock Arithmetic
13:13 Analyzing Solutions using Modular Arithmetic
15:45 The Conjecture
17:45 What's been done?
19:03 Conclusion
@beplus22منذ 3 سنواتAs a professional mathematician, I should say that this video is very visually interesting, but contains many mistakes: 1) Elliptic Curve Cryptography (ECC) is actually WORSE than RSA when it comes to being broken by quantum computers. One of the proposed crypto-schemes that is believed to be resistant to quantum attacks is SIDH, which is also based on elliptic curves, but it is not widely implemented. 2) There is some confusion here. What we learn at school is that there is no formula giving all of the solutions of general polynomial equations in terms of radicals, when the degree of these polynomials is greater or equal to 5. For polynomials of degree less than 5 there is a formula just like the quadratic one we learned at school, that gives us all of the solutions, but if you are only interested in rational solutions, then you have to actually check which solutions are rational. The Rational Root Theorem provides us with an algorithm for finding RATIONAL (and only rational) solutions of polynomial equations in any degree, though one should note that this algorithm requires factoring integers. 3) What is written in the screen is NOT an elliptic curve, it is a CUBIC CURVE. Elliptic curves are special cases of cubic curves, of the form " y^2 = x^3 +ax +b " over the complex numbers (they have more general forms over different fields). 4) There are NO elliptic curves with genus greater than 2. In fact, in algebraic-geometry, elliptic curves are DEFINED as algebraic curves of genus equal to 1 (+ some other conditions). This is because over the complex numbers an elliptic curve is EQUIVALENT to a torus (a doughnut, which has 1 hole and therefore genus equal to 1). 5) There is also confusion regarding Mordell's conjecture. Mordell had already proved that the rational points of an elliptic curve form a "finitely generated abelian group", which is what you explain at in simpler terms. This is called Mordell's Theorem, or more generally Mordell-Weil Theorem. Since elliptic curves cover the "genus = 1 case", Mordell thought about algebraic curves of genus greater than one, and conjectured that they all have only finitely many rational solutions. This was known as the Mordell Conjecture and is now Faltings Theorem, after Faltings proved it. General comments: at it should be noted that this is a "weak" form of what is now known as the Birch Swinnerton-Dyer Conjecture, but it is correctly stated. Another comment that I would like to make is that elliptic curves are interesting and well-known precisely because their rational solutions (or points) form a group: that means you can "add" points, in a rather interesting geometrical way, and also reverse this process back, only going from rational point to rational point. I thought this would be explained at , but unfortunately it was not. Some of the pronunciations of the names and historical remarks were also off, but that would be nitpicking :) ....وسعت415
@
@Aleph0منذ 4 سنواتThis is so beautiful! I love how you don't shy away from showing us the real math. It's a really great service, as most sources found online are id="hidden3" class="buttons"> either aimed at seasoned elliptic curve veterans, or watered-down popular culture renditions of these topics. Your channel hits the middle ground perfectly: it's both rigorous and accessible. Keep doing what you're doing; your videos are phenomenal. ....وسعت358
@
@qqwee9014منذ 4 سنواتThis dude, deserve more subscriber! Keep up the good work, we all learning from you! Love you☺️ 39
@
@samuelbevins247منذ 4 سنواتI have a strong feeling this channel is about to explode 174
@
@mikeschmit7125منذ 4 سنواتOne of the most underappreciated channels ever. 7
@
@bhavya5413منذ 4 سنواتHi bro I'm your 67th subscriber and checks for your channel everyday for a new video. I love your channel , I appreciate 5
@
@rishitiwari8644منذ 3 سنواتThe clarity of your content delivery is remarkable! Keep up the good work! 2
@
@mariahamilton5305العام الماضيBryan Birch briefly taught me when I was a first year student - as I write this, he's still alive and well and helping to price up 2nd hand maths and computing books, in his early 90s! 8
@
@kalebmark2908منذ 4 سنواتI. LOVE this video. How do you not have more subscribers?? 7
@
@anamarijavego6688منذ 4 سنواتthe quality of your videos is outstandingly good 4
@
@henriklovoldقبل 9 أشهرAssistant professor of compsci here - I approve of your video. Great job, and keep more coming, I'm looking forward to it :) 2
@
@PartyFunCrazyمنذ 4 سنواتJust found your channel, loved the video! I'm so excited to see where this goes for you! I wish you well, keep going! 3
@
@zomgthisisawesomelolمنذ 4 سنواتHigh quality video! We need more advanced topics on Youtube. Thank you! 4
@
@keving958منذ 4 سنواتWhat a great video! I wish I had seen this 15 years ago when I was learning this stuff in college. But, I can't be the only one who chuckled at the id="hidden5" class="buttons"> end when he referred to BSD as the "cherry on top" while flashing a picture of pastries with strawberries on top. ....وسعت2
@
@therealAQمنذ 4 سنواتI will always appreciate a good trip on BSD 3
@
@AnitaSVقبل 9 أشهر ECC is equally susceptible to quantum shor’s algorithm. Any hidden sub group can be solved by quantum computers. You need something like lattice based techniques to be resistant to quantum computers. ....وسعت4
@
@OwenMcKinleyمنذ 4 سنواتYour explanations and content are incredible! Supremely well done. Hope to continue to see more neat math videos from you in the future. 14
@
@helojoeywala6622منذ 4 سنواتSuper good video! I didn't think it would be this well made and edited but it blew my mind! Good job and good luck to you in the future. 5
@
@dylanparker130منذ 4 سنواتreally enjoy your videos - even though I'm sure a great deal of planning goes into them, I like the way it sounds as though you're just thinking out loud at times 31
@
@PiAndAHalfمنذ 4 سنواتhere before this channel blows up, keep it up! 4
@
@andreasburger4038منذ 3 سنواتAmazing stuff! Awesome work with the animations and the explanation. If I could improve would think, it would be the audio quality. Keep it up! 3
@
@sairithvickg6663منذ 3 سنواتGreat Work Bro !! I hope your channel gets 1 million + subscribers
@
@AllanKobelanskyمنذ 4 سنواتI Liked and Subscribed. Looking forward to more, compelling content. Very well done. 1
@
@Mrpallekulingقبل 10 أشهرVery interesting video with an introduction to many complex math areas. Well done!
@TheBurningsmokeمنذ 4 سنواتFriend did his undergrad thesis on cryptographic applications of graphs, so this was really cool to see! 6
@
@King_Imaniمنذ 3 سنوات1 of the best Youtube Maths videos I have watched. This is truly a great video on maths and the title is click bait with 5000IQ
@
@harriehausenman8623قبل 9 أشهرGreat content, really fine production. Thanks!
@
@rishiraj8738منذ 4 سنواتGreat work bhai. I really appreciate it. 4
@
@RSLTقبل 9 أشهر Just watched the video and I loved it! Hit that like button and subscribed to your channel. Can't wait for more amazing content like this! Keep up the great work! 1
@
@r1a933قبل 9 أشهرBro took the whole explanation to another level
@
@TheHzh82منذ 4 سنواتECC is just as vulnerable as RSA with a quantum computer. 21
@
@dcterr1قبل 10 أشهرVery good explanation of the BSD conjecture as well as elliptic curves in geheral!
@
@dogbiscuitukمنذ 4 سنواتThere is a formula for the roots of a quartic. 40
@
@jnoelcookمنذ 4 سنواتJust came across your channel yesterday and love it. I hope you will keep it up! These are some of the best math videos I have seen! One thing I do need id="hidden10" class="buttons"> to ask though, as I had to replay it 3 times when I heard it. Can't remember at which minute in the video it was, but you said that Mordell proved that for any elliptic curve there are only an infinite number of rational points when s = 0. You might want to look into this. Don't you mean that there are only an infinite number of rational points when L(C,1)=0? ....وسعت
@
@SmiteYaBgsمنذ 4 سنواتHow do you edit these videos? What software etcc and do you draw those graphs and write the text yourself?
@
@SatyarthShankarمنذ 3 سنواتYour content quality has been a constant (at excellent). Your accent on the other hand has been a variable.
@
@5wplush243منذ 4 سنواتI have a few doubts that aren’t clear to understand in the vid:- 1. How do elliptical curves have genus’? You explained Mordell’s conjecture but this wasn’t clear. I thought only 3d figures (‘holes’) could have a genus… 2. Why are only primes studied in on the table? ....وسعت21
@
@barisbasar3909العام الماضيMy deepest admiration. You really did a great job with this video. Didmt expect that
@
@marchevka22xقبل 10 أشهرGreat intro to an interesting subject.
@
@dcterr1منذ 4 سنواتVery good, enlightening video! I noticed you made a mistake though. You presented the equation y^2 = x^2 + 5 as an elliptic curve. I think the exponent of x should be 3, not 2. 12
@
@TheChicken313منذ 2 سنواتHey, just wanted to start by saying that this was an amazing video! My primary academic focus is not math but I have a novice level foundation in university id="hidden13" class="buttons"> physics and calculus till the multivariate level, so I love more qualitative style videos like these that can help me appreciate issues in the field! I just had a few questions regarding the video that may allow me to appreciate the BSD conjecture even more. My primary confusion with regards to this video is the concept of "solutions". What first comes to my mind with regard to solutions in the context of polynomial functions is the first instance of this concept when you learn about exponential functions in the beginning of calculus. A "solution" with regard to an exponential function is of course a point or points where the function intercepts the x axis. Of course in these situations there are only finite or no "solutions". At there is an image of genus = 0 resembling an exponential function which apparently has "infinite solutions"?? This suggests to me that I am misunderstanding what is meant here by a "solution". I have solved problems before involving solving for individual points on a elliptic curve, but again I am unaware what the idea of having infinite or finite "solutions" in this context. An explanation or example to help me better understand this idea from anyone would help me appreciate this problem infinitely more, and would be greatly appreciated!! ....وسعت
@
@attilaoقبل 9 أشهرThe peafowl in the background is a nice touch.
@
@Chris-lv1nzالعام الماضيExcellent thank you ! I like the background music also :)
@
@ND62511قبل 9 أشهرA bit of a correction on your explanation of Fermat’s Last Theorem; the theorem states that there are no NON-TRIVIAL INTEGER solutions to the equation a^n + b^n = c^n where n > 2. It’s really easy to get solutions to the equation if a, b & c are allowed to be real numbers. Infinitely many, actually. ....وسعت
@
@paulisaac3489منذ 4 سنواتmaybe I'm weird, but I like your math videos, not sure why they have so few views. 4
@
@lazgheenمنذ 4 سنواتNice animations. Which programs are you using?
@
@LeonardoGPNمنذ 4 سنواتKeep making videos, your channel will really grow.
@
@based_kingمنذ 4 سنواتGood on you man :). Wishing you the best ! 1
@
@zer-melaمنذ 3 سنواتI like ur presentation style it's fun and engaging
@
@StephenBlackstoneمنذ 2 سنواتECC and RSA are both examples of the same thing "the hidden subgroup problem" - both are breakable by versions of Shor's algortihm.. 1
@
@dr.rahulgupta7573منذ 3 سنواتNice presentation of the topics in a beautiful manner. Thanks.DrRahul Rohtak Haryana India
@
@johnchessant3012قبل 10 أشهر I've heard it joked that Bhargava should receive $625,000 for that paper (62.5% of the $1 million prize) 2
@
@MrController12345منذ 4 سنواتThanks for such video. Really appreciated 1
@
@dcterr1قبل 10 أشهرIf elliptic curves of rank greater than 1 are so rare, why do we care about them? In particular, do we need to use them to make a secure cryptosystem? And is BSD important in designing such cryptosystems?
@
@roman111117منذ 3 سنواتCrazy how I had never heard of elliptic curves outside of orbits in our solar system until yesterday. I argued it was pronounced elliptical curves and id="hidden17" class="buttons"> was proven wrong lol. And today you link it to computer science and cryptography. Love this. ....وسعت
@
@redfullpackمنذ 2 سنواتunlike paranormal mysteries which are largely Humbug Drivel, mysteries and enigmas from Mathematics do educate the mind by the way I Fail id="hidden18" class="buttons"> miserably in mathematics subjects throughout school from kindergarten to college ....وسعت2
@sergiogarofoli573منذ 2 سنواتwhy quantum compute to factorize a number that is a miserable difference of squares? because a number n=pq (in RSA original notation) is just the id="hidden19" class="buttons"> reduced form of the n=[(p+q)/2]^2 - [(p-q)/2]^2 expanded expresion, and is a difference of squares. Just because the squares are hidden beyond invisible differences, doesn't mean they are not existing, you just cannot see them. That's how Sophie Germain made her identity. more than a sentury and half ago ....وسعت
@
@Zibeline759منذ 4 سنواتThe same quantum algorithm to break RSA can be used to break ECC. So ECC is not the cryptography of the future. It's the cryptography of the present, soon to be replaced. 1
@
@amandeep9930منذ 4 سنواتPlease tell me which software do you use to make those animations
@
@PrintEngineeringقبل 11 أشهرMake another one that goes into depth for the secp256k1 curve! y^2 = x^3 + 7 mod (2^256-2^32-977)
@
@fizqialfairuz5744منذ 3 سنواتI was here before this channel become famous. 1
@
@FF-mr9wvمنذ 3 سنواتIs more simple to say: f(x,y) x,y belonging to Q(rationals) such f(x)=0, where fx is an L-function (as well the Riemann zeta function). Source: wikipedia.
@
@metalimقبل 10 أشهرwhy the heck is there drill sound in background?
@
@JoeJoeTaterمنذ 4 سنواتYeah, it doesn't seem like a great idea to found post-quantum cryptography on math with big open questions. That just provides a big opportunity for id="hidden22" class="buttons"> people to break it. It's especially concerning since NIST and the NSA succeeded in sneaking vulnerabilities into older methods that used elliptic curves. ....وسعت1
@
@ophelloمنذ 4 سنواتI thought Fermat was the one who drew the note in the margins. 1
@
@hikingpeteمنذ 3 سنواتI'm sorry to say, the video introduction is very problematic. While Elliptic Curve Cryptography has its strengths, it's just as vulnerable to quantum id="hidden23" class="buttons"> computing as RSA, and in fact may end up falling sooner. If you're interested in post-quantum cryptography, there's a lot of options under development. The most widely deployed option I'm aware of is NTRUPrime. ....وسعت3
@
@carterthaxtonمنذ 3 سنوات64 GB = 512 billion bits. Dividing that by 576 bits gives about 1 billion times, not half a trillion (which would be 500 billion). Still very remarkable, id="hidden24" class="buttons"> but just keeping you honest. ;) Great video, btw! Thank you for making this. ....وسعت2
@
@wilderuhl3450قبل 9 أشهرLet’s take a moment to appreciate Number theory. Way ahead of you buddy.
@
@josephmarshall2030منذ 2 سنواتThank you scholar from the indian sub-continent, you make henry jacobotitz & Brieske proud.I meant jacobowitz
@
@lydeostv1639منذ 4 سنواتNo entendì casi nada pero aùn asì es hermoso xD, me transmites pasiòn, ni siquiera hablo inglès por lo que activè los subtìtulos, espero en algùn momento entender todos estos temas y aventurarme a intentar resolver algo, sè que es poco probable y quizà imposible para mì resolver un problema del milenio pero el solo intento puede ser una aventura emocionante. ....وسعت
@
@_yt_4081منذ 4 سنواتtbh, equations are like sentences in mathematics, so there should be no surprise that they play an important role in mathematics.
@
@pmcgee003منذ 4 سنواتRational root theorem doesn't require a(i) > 0. But nice video
@
@hrvojeabraham5080منذ 4 سنواتContrary to the statement in the video, all order 4 poly. eqs. have algebraic solutions in C. Order >= 5 don't. This is called Abel-Ruffini theorem.
@
@IsraelJacobovichالعام الماضيRSA has only been hacked when cybercriminals managed to steal confidential preliminary data. RSA is provably secure ( assuming factoring is as hard as id="hidden27" class="buttons"> we think ). moreover: while shore's algorithm does indeed solves factoring in poly-time on a quntum computer. the hardware required is still many years away. ( just a side note ) ....وسعت
مقاطع الفيديو ذات الصلة على The Most Difficult Math Problem You've Never Heard Of - Birch and Swinnerton-Dyer Conjecture:
1) Elliptic Curve Cryptography (ECC) is actually WORSE than RSA when it comes to being broken by quantum computers. One of the proposed crypto-schemes that is believed to be resistant to quantum attacks is SIDH, which is also based on elliptic curves, but it is not widely implemented.
2) There is some confusion here. What we learn at school is that there is no formula giving all of the solutions of general polynomial equations in terms of radicals, when the degree of these polynomials is greater or equal to 5. For polynomials of degree less than 5 there is a formula just like the quadratic one we learned at school, that gives us all of the solutions, but if you are only interested in rational solutions, then you have to actually check which solutions are rational. The Rational Root Theorem provides us with an algorithm for finding RATIONAL (and only rational) solutions of polynomial equations in any degree, though one should note that this algorithm requires factoring integers.
3) What is written in the screen is NOT an elliptic curve, it is a CUBIC CURVE. Elliptic curves are special cases of cubic curves, of the form " y^2 = x^3 +ax +b " over the complex numbers (they have more general forms over different fields).
4) There are NO elliptic curves with genus greater than 2. In fact, in algebraic-geometry, elliptic curves are DEFINED as algebraic curves of genus equal to 1 (+ some other conditions). This is because over the complex numbers an elliptic curve is EQUIVALENT to a torus (a doughnut, which has 1 hole and therefore genus equal to 1).
5) There is also confusion regarding Mordell's conjecture. Mordell had already proved that the rational points of an elliptic curve form a "finitely generated abelian group", which is what you explain at in simpler terms. This is called Mordell's Theorem, or more generally Mordell-Weil Theorem. Since elliptic curves cover the "genus = 1 case", Mordell thought about algebraic curves of genus greater than one, and conjectured that they all have only finitely many rational solutions. This was known as the Mordell Conjecture and is now Faltings Theorem, after Faltings proved it.
General comments: at it should be noted that this is a "weak" form of what is now known as the Birch Swinnerton-Dyer Conjecture, but it is correctly stated. Another comment that I would like to make is that elliptic curves are interesting and well-known precisely because their rational solutions (or points) form a group: that means you can "add" points, in a rather interesting geometrical way, and also reverse this process back, only going from rational point to rational point. I thought this would be explained at , but unfortunately it was not.
Some of the pronunciations of the names and historical remarks were also off, but that would be nitpicking :) ....وسعت 415
Good job and good luck to you in the future. 5
If I could improve would think, it would be the audio quality.
Keep it up! 3
1. How do elliptical curves have genus’? You explained Mordell’s conjecture but this wasn’t clear. I thought only 3d figures (‘holes’) could have a genus…
2. Why are only primes studied in on the table? ....وسعت 21
My primary confusion with regards to this video is the concept of "solutions". What first comes to my mind with regard to solutions in the context of polynomial functions is the first instance of this concept when you learn about exponential functions in the beginning of calculus. A "solution" with regard to an exponential function is of course a point or points where the function intercepts the x axis. Of course in these situations there are only finite or no "solutions". At there is an image of genus = 0 resembling an exponential function which apparently has "infinite solutions"?? This suggests to me that I am misunderstanding what is meant here by a "solution". I have solved problems before involving solving for individual points on a elliptic curve, but again I am unaware what the idea of having infinite or finite "solutions" in this context.
An explanation or example to help me better understand this idea from anyone would help me appreciate this problem infinitely more, and would be greatly appreciated!! ....وسعت
by the way I Fail id="hidden18" class="buttons"> miserably in mathematics subjects throughout school from kindergarten to college ....وسعت 2
because a number n=pq (in RSA original notation) is just the id="hidden19" class="buttons"> reduced form of the n=[(p+q)/2]^2 - [(p-q)/2]^2 expanded expresion, and is a difference of squares.
Just because the squares are hidden beyond invisible differences, doesn't mean they are not existing, you just cannot see them. That's how Sophie Germain made her identity. more than a sentury and half ago ....وسعت
Great video, btw! Thank you for making this. ....وسعت 2
Way ahead of you buddy.
But nice video