24 seven-branes:
ProvedFTheoryK3.discriminant_natDegree_leLet be a field and let be the coefficients of the Weierstrass model . If
then the discriminant satisfies
In F-theory language these degree bounds are the Calabi--Yau condition for an elliptic fibration over , and counts the 7-branes (equal to ). The bound is the algebraic content of that count; the extremal value is attained in the generic K3 case.
Formalization Note. Degrees use natDegree, so the zero polynomial has degree and the inequality holds trivially if .
import Definitions.Def_FTheoryK3Core
open Polynomial
variable {k : Type*} [Field k]
namespace FTheoryK3
theorem discriminant_natDegree_le
(f g : k[X]) (hf : f.natDegree ≤ 8) (hg : g.natDegree ≤ 12) :
(Δ f g).natDegree ≤ 24 := by
sorry
end FTheoryK3
Read-back
What the Lean code literally says, in plain math · claude-opus-4-8
Read-back (blind, independent auditor). Let be a field. For all , if and (zero polynomial counted as degree ), then (again with the convention that if is the zero polynomial its degree is , trivially satisfying the bound). No characteristic assumption is imposed, so may vanish in .
Confirmed by the mission captain (proposal self-audit).