Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finitely many smooth-curve degrees detect numerical triviality

Open
AlgebraicGeometry.RelPicard.exists_finite_curve_degree_tests_of_isProper

by tomasz · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryfinitenessneron-severinumerical-equivalence

Let XXX be a proper scheme over an algebraically closed field KKK. A curve test consists of a smooth proper integral KKK-curve CCC, a KKK-morphism f:C→Xf:C\to Xf:C→X, and two affine open charts covering CCC. For an invertible sheaf LLL on XXX, put

dC,f(L)=χ(C,f∗L)−χ(C,OC).d_{C,f}(L)=\chi(C,f^*L)-\chi(C,\mathcal O_C).dC,f​(L)=χ(C,f∗L)−χ(C,OC​).

There is a finite set SSS of such tests, depending only on XXX, such that every invertible sheaf satisfies

(dC,f(L)=0 for every (C,f)∈S) ⟹ dC,f(L)=0 for every curve test (C,f).\bigl(d_{C,f}(L)=0\text{ for every }(C,f)\in S\bigr) \ \Longrightarrow\ d_{C,f}(L)=0\text{ for every curve test }(C,f).(dC,f​(L)=0 for every (C,f)∈S) ⟹ dC,f​(L)=0 for every curve test (C,f).

The degrees are the actual two-chart Cech Euler characteristics. The finite test set is chosen before the line bundle. It may be empty. No smoothness, reducedness, integrality, projectivity, or connectedness of XXX is assumed.

This is a finite-detection consequence of the numerical-rank argument in the cited source, expressed with normalized smooth curves mapping to XXX. It asserts no finite generation modulo algebraic equivalence.

Preamble
import Definitions.Def_AlgebraicGeometry_CurveDegreeTests

set_option autoImplicit false
open AlgebraicGeometry CategoryTheory
universe u
Formal statement
theorem AlgebraicGeometry.RelPicard.exists_finite_curve_degree_tests_of_isProper    (K : Type u) [Field K] [IsAlgClosed K] {X : Scheme.{u}}
    (π : X ⟶ Spec (.of K)) [IsProper π] :
    ∃ s : Finset (CurveDegreeTests.Probe π),
      ∀ M : X.Modules, Scheme.Modules.IsInvertible M →
        (∀ t ∈ s, t.degree M = 0) → CurveDegreeTests.NumericallyTrivial π M := by
  sorry
Source
Cheng, Ji, Larson and Olander, Theorem of the Base (1 July 2021), Lemma 5.4 and Proposition 5.5, pp. 15-16; Lemma 6.1, p. 16; and the numerical-rank reduction in Theorem 7.4, pp. 18-19. https://mattlarson2399.github.io/Papers/theorem-of-the-base.pdf. Finite-dimensionality of the numerical pairing gives a finite detecting subfamily; normalize integral curves and use degree compatibility under proper pullback. This is a derived finite-detection formulation, not a literal source statement. Compare SGA 6, Expose XIII, Proposition 5.2, pp. 650-651.

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