Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Branes with multiplicity are bounded by deg⁡Δ\deg\DeltadegΔ

Proved
FTheoryK3.sum_rootMultiplicity_discriminant_le

by andreaskapfer · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryelliptic-curveselliptic-surfacesf-theorymathematical-physics

Let kkk be a field and f,g∈k[X]f, g \in k[X]f,g∈k[X] with Δ=4f3+27g2≠0\Delta = 4f^3 + 27g^2 \ne 0Δ=4f3+27g2=0. For every finite set S⊆kS \subseteq kS⊆k of base points,

∑t0∈Sord⁡t0(Δ)  ≤  deg⁡Δ.\sum_{t_0 \in S} \operatorname{ord}_{t_0}(\Delta) \;\le\; \deg \Delta.t0​∈S∑​ordt0​​(Δ)≤degΔ.

The left-hand side counts, with multiplicity, the degenerate fibres (7-branes) at the points of SSS; the inequality says the total brane charge over any finite collection of points is bounded by the degree of the discriminant. Points of SSS that are not roots of Δ\DeltaΔ contribute 000.

Formalization Note. The hypothesis Δ≠0\Delta \ne 0Δ=0 is needed for deg⁡Δ\deg\DeltadegΔ (natDegree) to be a meaningful bound; the sum ranges over a Finset, whose elements are distinct.

Preamble
import Definitions.Def_FTheoryK3Core
open Polynomial
variable {k : Type*} [Field k]
Formal statement
namespace FTheoryK3
theorem sum_rootMultiplicity_discriminant_le
    (f g : k[X]) (h : Δ f g ≠ 0) (S : Finset k) :
    (∑ t₀ ∈ S, (Δ f g).rootMultiplicity t₀) ≤ (Δ f g).natDegree := by
  sorry
end FTheoryK3
Source
Kodaira classification of singular fibres and Tate's algorithm: M. Schuett and T. Shioda, "Elliptic Surfaces," Adv. Stud. Pure Math. 60 (2010), arXiv:0907.0298 (Euler number of an elliptic surface = degree of the discriminant divisor = 12*deg L; elliptic K3 => 24 singular fibres). F-theory dictionary between Kodaira/Tate fibre types and gauge algebras up to E8, and 7-branes: T. Weigand, "TASI Lectures on F-theory," arXiv:1806.01854.
Read-back

What the Lean code literally says, in plain math · claude-opus-4-8

Read-back (blind, independent auditor). Let kkk be a field. For all f,g∈k[X]f, g \in k[X]f,g∈k[X], assuming 4f3+27g2≠04f^3+27g^2 \ne 04f3+27g2=0, and for every finite set S⊆kS \subseteq kS⊆k (a Finset), ∑t0∈Sord⁡t0(4f3+27g2)≤deg⁡(4f3+27g2)\sum_{t_0 \in S} \operatorname{ord}_{t_0}(4f^3+27g^2) \le \deg(4f^3+27g^2)∑t0​∈S​ordt0​​(4f3+27g2)≤deg(4f3+27g2). Terms where t0t_0t0​ is not a root contribute 000. The nonvanishing hypothesis is what makes deg⁡(4f3+27g2)\deg(4f^3+27g^2)deg(4f3+27g2) meaningful as a bound. No characteristic assumption is imposed.

Human review
  • Endorsed by Shuze Chen · Sep 22, 2026

  • Endorsed by andreaskapfer · Sep 22, 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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me