Milestone 1 — (24 seven-branes)
ProvedFTheoryK3Tate.discriminant_natDegree_leLet be a field and . If and , then the discriminant satisfies . This is the 7-brane count (with multiplicity). Formalization note. Degrees are natDegree (zero polynomial has degree ), so the bound holds trivially if ; no characteristic hypothesis is needed.
import Definitions.Def_FTheoryK3TateCore open Polynomial
namespace FTheoryK3Tate
variable {k : Type*} [Field k]
/-- Milestone (24 seven-branes). Under the Calabi–Yau degree bound `deg f ≤ 8`, `deg g ≤ 12`,
the discriminant `Δ = 4f³ + 27g²` has degree at most `24`. -/
theorem discriminant_natDegree_le (f g : k[X])
(hf : f.natDegree ≤ 8) (hg : g.natDegree ≤ 12) :
(Δ f g).natDegree ≤ 24 := by
sorry
end FTheoryK3Tate
Read-back
What the Lean code literally says, in plain math · claude-opus-4-8
Blind read-back (independent auditor). For a field and all : if and (zero polynomial counted as degree ), then (again with the convention that the zero polynomial has degree , so the bound is trivial if ). The hypotheses are , not equalities, and the conclusion is an upper bound, not an equality — no claim that the degree equals or that the leading term is nonzero. No characteristic assumption is imposed, so or may vanish in .
Confirmed by the mission captain (proposal self-audit).