Step 30 / 64

University

The curve’s own addition

The curve’s points add: the straight line through two chooses their sum.

Start with a concrete example

On y²=x³−x+1, (0,1) and (1,1) lie on the curve. Their connecting line meets it again at (−1,1); reflecting that last point gives the sum (−1,−1). This is a special point-addition rule.

A small check: try the idea

Think with the concrete example above. You can try again.

In the given example, the third intersection is (−1,1). What is the point sum?

Read the answer and reasoning

(−1,−1). The special rule reflects the third intersection across the horizontal axis. Skipping the reflection gives the wrong answer.

Build the idea in three steps

  1. On a nonsingular Weierstrass curve, the third intersection R of the line through P and Q is not yet P + Q: the sum is −R. For a short equation y² = x³ + Ax + B, negate by reflecting across the x-axis. In the general equation, −(x,y) = (x, −y − a₁x − a₃). Coincident points use a tangent; inverse points sum to the identity at infinity.
  2. The displayed instance lets the symmetry actors of the number world touch the curve: σ • P applies σ to the coordinates of P, producing another point. It is a DistribMulAction — the identity leaves points alone, and doing σ then τ is one combined shuffle.
  3. The last line is the hinge for everything later: smul_add certifies σ • (P + Q) = σ • P + σ • Q, proved by map_add on the underlying map. Symmetries of the number world respect the curve’s own addition — precisely the agreement that will let a representation record the curve.

A small example

On y² = x³ − x + 1, P = (0,1) and Q = (1,1) lie on y = 1. Its third intersection is R = (−1,1), so P + Q = −R = (−1,−1). Taking the third intersection without negating it would give the wrong sum.

Lean definition · original excerpt

FLT · aa2d8b3 · Def_FLTPrelim_GaloisRep.lean

noncomputable instance instDistribMulActionAlgEquiv :    DistribMulAction (K ≃ₐ[S] K) (W'⁄K).Point where  one_smul P := by cases P <;> rfl  mul_smul σ τ P := by cases P <;> rfl  smul_zero _ := rfl  smul_add σ P Q := (Point.map σ.toAlgHom).map_add P Q

How to read this Lean

The file imports Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point — the group law itself lives in Mathlib, with its abstract nonsense already in place. What this repository adds is the interface for symmetries: an SMul of algebra equivariant maps K ≃ₐ[S] K on the point set, and the DistribMulAction laws one, mul and zero. Read smul_add once more slowly: it is the compatibility certificate.

Where this idea is used

6. The scissors incident8. The secret duet9. Two doors to the concert10. A three-note audition11. Borrow a better passport12. The workshops agree13. Pip’s impossible quilt14. The shrinking reservation
I’m lost · Help

Mika’s help desk

The curve’s own addition

One thing at a time

Read the three explanation steps first. The Lean source is there for a closer look afterwards; you do not have to read it first.

In simpler words

The curve’s points add: the straight line through two chooses their sum.

Earlier ideas are listed under “Start with these ideas” on this page.

A small clue

On y² = x³ − x + 1, P = (0,1) and Q = (1,1) lie on y = 1. Its third intersection is R = (−1,1), so P + Q = −R = (−1,−1). Taking the third intersection without negating it would give the wrong sum.

Close this panel to return to the exact place you were reading. These are prepared hints for this page.

Start with the first small story →