Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The divisor dictionary between the Riemann–Roch library and FLT preserves ℓ(D)\ell(D)ℓ(D)

Proved
WeilConjectures.Bridge.ell_divEquiv

by Idealson · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-curvesdivisorsfunction-fieldsriemann-roch

Let k⊆Kk\subseteq Kk⊆K be an arbitrary field extension. Two formalizations of the places of K/kK/kK/k are compared:

  1. the places PPP of the Riemann–Roch library: valuation rings OP\mathcal O_POP​ with k⊆OP⊊Kk\subseteq\mathcal O_P\subsetneq Kk⊆OP​⊊K whose value group is (order-)isomorphic to Z\mathbb ZZ;
  2. the places vvv of the FLT project: valuation rings Ov\mathcal O_vOv​ with k⊆Ov⊊Kk\subseteq\mathcal O_v\subsetneq Kk⊆Ov​⊊K that are principal ideal rings, i.e. discrete valuation rings.

The map P↦π(P)P\mapsto\pi(P)P↦π(P) keeping the same valuation ring is a bijection between them. A divisor is, on either side, a finitely supported function from places to Z\mathbb ZZ, and Φ\PhiΦ denotes the reindexing of divisors along π\piπ: Φ(D)(π(P))=D(P)\Phi(D)(\pi(P))=D(P)Φ(D)(π(P))=D(P). On both sides the degree of a place is the dimension over kkk of the residue field κ(P)=OP/mP\kappa(P)=\mathcal O_P/\mathfrak m_Pκ(P)=OP​/mP​, and the degree of a divisor is deg⁡D=∑PD(P) [κ(P):k]\deg D=\sum_P D(P)\,[\kappa(P):k]degD=∑P​D(P)[κ(P):k].

For a divisor DDD of the Riemann–Roch library, L(D)={f∈K: f=0 or vP(f)≥−D(P) for every place P}\mathcal L(D)=\{f\in K:\ f=0\ \text{or}\ v_P(f)\ge -D(P)\ \text{for every place } P\}L(D)={f∈K: f=0 or vP​(f)≥−D(P) for every place P} with vPv_PvP​ the normalized valuation of PPP, and for an FLT divisor EEE, LFLT(E)={f∈K: f=0 or v(f)≥−E(v) for every FLT place v}\mathcal L^{\mathrm{FLT}}(E)=\{f\in K:\ f=0\ \text{or}\ v(f)\ge -E(v)\ \text{for every FLT place } v\}LFLT(E)={f∈K: f=0 or v(f)≥−E(v) for every FLT place v} with vvv the normalized valuation of the discrete valuation ring Ov\mathcal O_vOv​; put ℓ=dim⁡kL\ell=\dim_k\mathcal Lℓ=dimk​L on each side. Then for every divisor DDD of the Riemann–Roch library,

ℓFLT(Φ(D))=ℓ(D).\ell^{\mathrm{FLT}}\big(\Phi(D)\big)=\ell(D).ℓFLT(Φ(D))=ℓ(D).

Together with the preservation of degrees, this transports the Riemann–Roch theorem of the library to the FLT framework.

Formalization Note The places are FunctionField.Place k K and AlgebraicCurve.Place k K, the divisor equivalence is WeilConjectures.Bridge.divEquiv k K = Finsupp.domCongr (placeEquiv k K). Dimensions (degrees of places, ℓ\ellℓ) are Module.finrank over kkk, which is 000 for an infinite-dimensional space; with this convention no hypothesis beyond Algebra k K is needed. Valuations are multiplicative with values in Zm0\mathbb Z^{m0}Zm0: the conditions read w.valuation f ≤ exp (D w) (library) and v.adicValuation f ≤ exp (E v) (FLT, adicValuation being the adic valuation of the maximal ideal of Ov\mathcal O_vOv​). The spaces are FunctionField.RRspace k K D and AlgebraicCurve.LSpace, and the dimensions FunctionField.ell k K D and AlgebraicCurve.ell.

Preamble
import Mathlib
import Definitions.Def_WeilConjectures_RiemannRochFLT

set_option maxHeartbeats 4000000
set_option synthInstance.maxHeartbeats 400000
open scoped WithZero
open MonoidWithZeroHom
open WeilConjectures.Bridge
variable (k K : Type*) [Field k] [Field K] [Algebra k K]
variable {k K}
Formal statement
theorem WeilConjectures.Bridge.ell_divEquiv (D : FunctionField.Divisor k K) :
    AlgebraicCurve.ell (divEquiv k K D) = FunctionField.ell k K D := by sorry
Source
Comparison lemma between two formalizations of Riemann–Roch spaces; no counterpart in the literature (the notion is L(A)\mathcal L(A)L(A) and ℓ(A)\ell(A)ℓ(A), H. Stichtenoth, *Algebraic Function Fields and Codes*, 2nd ed., GTM 254, Springer 2009, Section 1.4). Lean: bridge written for this port, file `Bridge/RiemannRochFLT.lean`

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