Geometry
Algebraic Curves: Bezout's Theorem and Genus
Цели урока
- Understand algebraic curves as zero sets of polynomials in P^2
- Master Bezout's theorem and the group law on elliptic curves
- Know the genus formula g=(d-1)(d-2)/2 and Riemann-Hurwitz
- See the connection between algebraic geometry and cryptography
Предварительные знания
- Symplectic Geometry
- Classification of surfaces
- Projective Geometry
Why is the discrete logarithm problem on an elliptic curve hard when point addition is easy?
- Bitcoin/Ethereum: ECDSA signatures on secp256k1 (y^2=x^3+7) secure every transaction - billions of dollars per second
- TLS 1.3: ECDH on Curve25519 - the HTTPS standard protecting all internet traffic
- Goppa codes: AG codes on algebraic curves achieve the Singleton bound - used in post-quantum cryptography (McEliece)
- Fermat's last theorem: Wiles (1995) proved modularity of elliptic curves over Q - a direct application of algebraic geometry
From Bezout to Deligne
Etienne Bezout proved his intersection theorem in 1779. Bernhard Riemann in 1857 created the theory of algebraic functions connecting genus to topology. Adolf Hurwitz in 1893 proved the formula for morphisms. Hasse in 1936 bounded points on elliptic curves over finite fields. Weil in 1948 formulated conjectures unifying geometry and number theory. Grothendieck in the 1960-70s built l-adic cohomology. Deligne in 1974 proved the main Weil conjecture - a peak of modern mathematics.
Bezout's Theorem and the Genus Formula
Every Bitcoin transaction is secured by elliptic curves. The curve y^2 = x^3 + 7 over the field F_p, where p is a 256-bit prime, is an algebraic curve of genus 1. Bezout's theorem says: two curves of degrees d1 and d2 meet in exactly d1*d2 points. This is what makes the group law on an elliptic curve geometrically natural.
Bezout's theorem requires P^2, an algebraically closed field, and counting with multiplicities. In affine space or over R, the number of intersections can be smaller.
What is the genus of a smooth plane curve of degree 4?
Genus formula: g=(d-1)(d-2)/2. For d=4: g=3. Rundown: d=1->g=0, d=2->g=0, d=3->g=1, d=4->g=3, d=5->g=6.
Elliptic Curves: Group Law and Cryptography
TLS 1.3, SSH, Bitcoin, Ethereum - all rely on ECDSA or ECDH. The reason: the discrete logarithm problem on an elliptic curve is computationally hard. The best known algorithm requires sqrt(p) operations - for 256-bit p that is 2^128 operations.
secp256k1: Bitcoin's curve
Parameters of a real cryptographic curve
secp256k1: y^2 = x^3 + 7 over F_p, where p = 2^256 - 2^32 - 977. Group order n is a 256-bit prime. Private key: a random k < n. Public key: point K = k*G. Signing a transaction solves a system in E(F_p). Breaking ECDSA requires solving the discrete logarithm: find k from K = k*G.
Why does the group law on an elliptic curve use Bezout's theorem?
Line (degree 1) and cubic (degree 3): 1*3=3 intersections by Bezout. Two are P and Q; the third is -R. Reflecting R gives P+Q. Elegant consequence of projective geometry.
Riemann-Hurwitz Formula and Morphisms
What happens to the genus when one curve maps to another? If a morphism f: C -> D has degree n, the genera are related by an exact formula - Riemann-Hurwitz. The difference is determined by the ramification.
The Riemann-Hurwitz formula is topological: it holds over any algebraically closed field of characteristic 0. In positive characteristic, wild ramification requires additional care.
A morphism f: C -> P^1 of degree 4 has 10 ramification points (each of index 1). What is the genus of C?
Riemann-Hurwitz: 2g(C)-2 = 4*(2*0-2)+10 = -8+10 = 2, so g(C) = 2.
Connections to Other Topics
Algebraic curves connect topology, number theory, and cryptography.
- Projective Geometry — Projective plane is the right stage where Bezout's theorem actually holds
- Enumerative Geometry: Kontsevich's Recursion and Gromov-Witten Invariants — Curve counting on surfaces uses intersection theory of algebraic curves
- Arithmetic Geometry — Elliptic curves are arithmetic objects studied as algebraic curves of genus 1
Итоги
- Degree-d curve in P^2: smooth has genus g=(d-1)(d-2)/2
- Bezout: |C1 cap C2| = d1*d2 with multiplicities over algebraically closed field
- Elliptic curve (d=3, g=1): group law via third intersection point
- Hasse bound: ||E(F_p)| - (p+1)| <= 2*sqrt(p)
- Riemann-Hurwitz: 2g(C)-2 = n*(2g(D)-2) + deg R for degree-n morphisms
Вопросы для размышления
- Why does Bezout's theorem require the projective plane P^2 rather than the affine plane - what is lost in the affine case?
- How does Bezout's theorem explain the group law on an elliptic curve through lines and intersection points?
- What do the zeta function of an algebraic curve over F_q and the Riemann zeta function have in common, and where do they differ fundamentally?