Corollary — at most two points (-faithful)
ProvedFTheoryK3Tate.at_most_two_E8Let be a field of characteristic zero and satisfy the K3 degree data. Then the set of points (type fibres, IsE8Point) is finite and has at most two elements. The finiteness is asserted jointly with the cardinality bound, so it cannot be met vacuously via the convention that an infinite set has cardinality . This restates the headline count on the -faithful IsE8Point (encoding as ).
import Definitions.Def_FTheoryK3TateCore open Polynomial
namespace FTheoryK3Tate
variable {k : Type*} [Field k] [CharZero k]
/-- Corollary (`E₈ × E₈` maximal enhancement). On a Calabi–Yau/K3 model there are only finitely
many `E₈` (type II*) points, and at most two of them — since each contributes `10` to the
discriminant budget and `3 × 10 = 30 > 24`. This restates the headline count on the
`f = 0`-faithful `IsE8Point` (via `(X - C t₀)^4 ∣ f`), fixing the earlier
`rootMultiplicity`-only encoding. -/
theorem at_most_two_E8 (f g : k[X]) (h : IsK3Data f g) :
{t₀ : k | IsE8Point f g t₀}.Finite ∧
Nat.card {t₀ : k | IsE8Point f g t₀} ≤ 2 := 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 of characteristic zero and all : assume , , . Let (the unfolding of IsE8Point; note is a lower bound allowing , while forces ). The conclusion is the conjunction: is finite and . Because finiteness is asserted separately, the bound does not rely on the Nat.card-of-infinite-set convention; the empty case (, e.g. ) satisfies it trivially.
Confirmed by the mission captain (proposal self-audit).