Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classification of the (−1)(-1)(−1)-classes

Proved
CubicSurface27.classification_of_minus_one_classes

by LG · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrycubic-surfacesinteger-arithmetic

Under the same hypotheses as the Cauchy–Schwarz bound — a>0a>0a>0, bi≥0b_i\ge0bi​≥0 integers, a2−∑ibi2=−1a^2-\sum_i b_i^2=-1a2−∑i​bi2​=−1 and 3a−∑ibi=13a-\sum_i b_i=13a−∑i​bi​=1 — the bound a<3a<3a<3 forces a∈{1,2}a\in\{1,2\}a∈{1,2}, and the only possibilities are the classes already found:

  • a=1a=1a=1 and exactly two of the bib_ibi​ equal 111 (the rest 000): the pair-line L−Ei−EjL-E_i-E_jL−Ei​−Ej​;
  • a=2a=2a=2 and exactly five of the bib_ibi​ equal 111 (the rest 000): the five-point conic 2L−∑k≠iEk2L-\sum_{k\ne i}E_k2L−∑k=i​Ek​.

This is the source's conclusion that "in these cases the only possibilities are the ones we have found", ruling out any further class of irreducible rational curve of self-intersection −1-1−1.

Formalization Note. The conclusion is an explicit disjunction of the two coordinate patterns, matching lineClass and conicClass.

Preamble
import Mathlib
open Finset
Formal statement
namespace CubicSurface27

theorem classification_of_minus_one_classes (a : ℤ) (b : Fin 6 → ℤ)
    (ha : 0 < a) (hb : ∀ i, 0 ≤ b i)
    (hself : a ^ 2 - ∑ i : Fin 6, (b i) ^ 2 = -1)
    (hadj : 3 * a - ∑ i : Fin 6, b i = 1) :
    (a = 1 ∧ ∃ i j : Fin 6, i ≠ j ∧ b = fun k => if k = i ∨ k = j then 1 else 0) ∨
    (a = 2 ∧ ∃ i : Fin 6, b = fun k => if k = i then 0 else 1) := by sorry

end CubicSurface27
Source
Jack Huizenga, answer to "In Algebraic Geometry, why are there exactly 27 straight lines on a smooth cubic surface?", Quora. Archived 2026-11-20 at https://perma.cc/38AQ-6ZCM (snapshot of https://suosuo.de/uu0jlKJ). Part I, 'Counting lines', exhaustiveness: 'It is easy to see that in these cases the only possibilities are the ones we have found' (a = 1 or a = 2).
Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me