This theorem seems easy enough.
-
This theorem seems easy enough. A great tool to prove associativity of the "add" operation of an elliptic curve.
Then, when I try to understand the proof of this theorem, I get lost immediately.
Anyways, this is the article where the screenshot is from https://en.wikipedia.org/wiki/Cayley%E2%80%93Bacharach_theorem
-
@manlycoffee This is the only argument for associativity that I've ever been able to even _start_ to understand!
-
Sal Rahmanreplied to Mike P last edited by [email protected]
@FenTiger here's an article that apparently has the proof. https://terrytao.wordpress.com/2011/07/15/pappuss-theorem-and-elliptic-curves/
I'm going to have to start drawing things on pen and paper to see if the proof holds, and to get an intuition of why the proof is true.
Would have been nice to have gotten an intuition from it when I presented elliptic curve cryptography to a group of people.
When it came to proving associativity, I just left it at "the Cayley-Bacharach theorem proves it. Now watch this video on your own time to get the intuition. But spoiler: the argument behind Cayley-Bacharach theorem is no different than when you know two points of intersection between a cubic and a line, then you immediately know where the third point lies."
But that is so unsatisfying.
