Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact-sequence data with common subobjects for coherent twists

Open
PhilipponMultiplicity.closure_action_has_coherent_exact_sequence_model

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

algebraic-geometryintersection-theoryphilippon-multiplicityproof-frontier

Let XXX be the multiprojective closure of an embedded commutative algebraic group GGG over a Philippon base field. Let the regular automorphisms τg\tau_gτg​ satisfy the identity and group laws of the coherent-presentation theorem.

There are abelian groups L,AL,AL,A, with AAA finitely generated, a surjective homomorphism q:L→Aq:L\to Aq:L→A, an action ρ:G(K)→Aut⁡(L)\rho:G(K)\to\operatorname{Aut}(L)ρ:G(K)→Aut(L) preserving ker⁡q\ker qkerq, and classes ci∈Lc_i\in Lci​∈L indexed by the projective factors.

There are a set CCC, a permutation action σ:L→Perm⁡(C)\sigma:L\to\operatorname{Perm}(C)σ:L→Perm(C), a dimension function d:C→Nd:C\to\mathbb Nd:C→N, an Euler-value function e:C→Qe:C\to\mathbb Qe:C→Q, and a predicate

S⊆C×C×(C⊔{0}).S\subseteq C\times C\times(C\sqcup\{\mathbf 0\}).S⊆C×C×(C⊔{0}).

The extra symbol 0\mathbf 00 represents a zero cokernel. Extend σl\sigma_lσl​ to fix it, and set e(0)=0e(\mathbf 0)=0e(0)=0. Think of S(k,a,Q)S(k,a,Q)S(k,a,Q) as recording a short exact sequence with subobject kkk, middle object aaa and cokernel QQQ. The formal requirements on the predicate are

S(k,a,Q) ⟹ S(σlk,σla,σlQ),e(a)=e(k)+e(Q).S(k,a,Q)\ \Longrightarrow\ S(\sigma_l k,\sigma_l a,\sigma_l Q),\qquad e(a)=e(k)+e(Q).S(k,a,Q) ⟹ S(σl​k,σl​a,σl​Q),e(a)=e(k)+e(Q).

For every l∈Ll\in Ll∈L and a∈Ca\in Ca∈C, there are a common subobject k∈Ck\in Ck∈C and cokernels Q,Q′∈C⊔{0}Q,Q'\in C\sqcup\{\mathbf 0\}Q,Q′∈C⊔{0} such that

S(k,a,Q),S(k,σla,Q′).S(k,a,Q),\qquad S(k,\sigma_l a,Q').S(k,a,Q),S(k,σl​a,Q′).

Every cokernel that belongs to CCC has dimension strictly less than d(a)d(a)d(a); the adjoined zero symbol has no dimension condition. For all l∈ker⁡ql\in\ker ql∈kerq and a∈Ca\in Ca∈C,

e(σla)=e(a).e(\sigma_l a)=e(a).e(σl​a)=e(a).

For every closed subset V⊆XV\subseteq XV⊆X, there is aV∈Ca_V\in CaV​∈C satisfying

d(aV)≤dV,dV=deg⁡HP⁡(V),d(a_V)\le d_V,\qquad d_V=\deg\operatorname{HP}(V),d(aV​)≤dV​,dV​=degHP(V),

where the Hilbert polynomial comes from the actual multigraded coordinate quotient. For every g∈G(K)g\in G(K)g∈G(K) and every tuple Di≥1D_i\ge1Di​≥1, eventually for natural numbers nnn,

e ⁣(σ nρ−g(∑iDici)aV)=HF⁡τg(V)(nD).e\!\left(\sigma_{\,n\rho_{-g}(\sum_i D_ic_i)}a_V\right) =\operatorname{HF}_{\tau_g(V)}(nD).e(σnρ−g​(∑i​Di​ci​)​aV​)=HFτg​(V)​(nD).

The right side is the dimension of the indicated component of the actual ambient homogeneous coordinate quotient. The data are common to all closed subsets; the generator and threshold may vary. Empty subsets and dimension zero are included.

Formalization Note. This is an auxiliary exact-triple model, not a categorical construction of coherent sheaves. Its intended realization uses coherent sheaf classes, line-bundle twists, Euler characteristic, and actual short exact sequences. The predicate records the stated compatibility and common-subobject conditions explicitly. Existence of this realization, its common-subobject construction for all selected objects, the finite class quotient and the exact Hilbert comparison remains Open. In particular, the cited meromorphic-section lemma has additional hypotheses; it motivates the common-subobject input without proving this whole auxiliary model. The parent builds the relation submodule as the span of exact-triple relations and proves all its required properties. Zero cokernels are encoded by the extra symbol so that a dimension-zero object requires no negative-dimensional generator.

Verified connected-family reduction (9 October 2026). An accepted proof-sketch derives kernel Euler invariance from connected-family local constancy and a kernel-span presentation. The invariant twists form an integer submodule; inverse twisting converts equality of family values into invariance under each endpoint difference. This extends to every kernel element. The exact-triple geometry, family realization and coordinate Hilbert comparison remain Open. The original formal statement is unchanged.

Preamble
import Mathlib.LinearAlgebra.GeneralLinearGroup.Basic
import Mathlib.LinearAlgebra.Finsupp.LinearCombination
import Mathlib.RingTheory.Finiteness.Cardinality
import Definitions.Def_PhilipponMultiplicity_Support
import Definitions.Def_PhilipponMultiplicity_SectionThree
set_option autoImplicit false
open scoped BigOperators Topology
universe u
Formal statement
namespace PhilipponMultiplicity

theorem closure_action_has_coherent_exact_sequence_model
    (K : Type u) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K)
    (G : EmbeddedGroupProduct K)
    (τ : G.Point → (groupProjectiveClosure G ≃ groupProjectiveClosure G))
    (hzero : τ 0 = Equiv.refl _)
    (hadd : ∀ g h, τ (g+h) = (τ h).trans (τ g))
    (hregular : ∀ g, G.ambient.IsRegularAlong G.ambient
      (fun x : groupProjectiveClosure G => x.val) (fun x => (τ g x).val)) :
    ∃ (L : Type u) (_ : AddCommGroup L) (_ : Module ℤ L)
      (A : Type) (_ : AddCommGroup A) (_ : Module ℤ A) (_ : Module.Finite ℤ A)
      (q : L →ₗ[ℤ] A), Function.Surjective q ∧
      ∃ (ρ : Multiplicative G.Point →* (L ≃ₗ[ℤ] L)) (c : G.FactorIndex → L),
        (∀ g x, q x = 0 → q (ρ g x) = 0) ∧
        ∃ (C : Type u) (σ : Multiplicative L →* Equiv.Perm C)
          (d : C → ℕ) (e : C → ℚ) (S : C → C → Option C → Prop),
          (∀ l a b Q, S a b Q → S (σ l a) (σ l b) (Q.map (σ l))) ∧
          (∀ a b Q, S a b Q → e b = e a + Q.elim 0 e) ∧
          (∀ l a, ∃ (k : C) (Q Q' : Option C),
            S k a Q ∧ S k (σ (Multiplicative.ofAdd l) a) Q' ∧
            (∀ b ∈ Q, d b < d a) ∧ (∀ b ∈ Q', d b < d a)) ∧
          (∀ l, q l = 0 → ∀ a, e (σ (Multiplicative.ofAdd l) a) = e a) ∧
          ∀ (V : Set (groupProjectiveClosure G)),
            @IsClosed _ (TopologicalSpace.induced Subtype.val G.ambient.zariskiTopology) V →
            ∃ a : C,
              d a ≤ SectionThree.locusDimension G.ambient (Subtype.val '' V) ∧
              ∀ (g : G.Point) (D : G.FactorIndex → ℕ), (∀ i, 1 ≤ D i) →
                ∃ N : ℕ, ∀ n ≥ N,
                  e (σ (Multiplicative.ofAdd
                    (n • ρ (Multiplicative.ofAdd (-g)) (∑ i, (D i : ℤ) • c i))) a) =
                    (Hilbert.hilbertFunction K G.ambient.factorCount G.ambient.ambientDimension
                      (G.ambient.vanishingIdeal (Subtype.val '' (τ g '' V)))
                      (fun i => D i * n) : ℚ) := by sorry

end PhilipponMultiplicity
Source
Auxiliary exact-sequence form of the coherent-generator presentation. Stacks Project, Lemma 33.33.2, Euler additivity for short exact sequences, https://stacks.math.columbia.edu/tag/08AA . The common-subobject mechanism is motivated by Lemma 31.25.5, https://stacks.math.columbia.edu/tag/02P2 , and its use in the support-dimension induction of Lemma 33.45.1, https://stacks.math.columbia.edu/tag/0BEL . Lemma 31.25.5 assumes a regular meromorphic section and a coherent sheaf without embedded associated points whose support is the whole scheme; it does not by itself assert the common-source condition for every object in this auxiliary model. The geometric realization, finite class quotient, kernel Euler invariance and exact coordinate Hilbert comparison are explicit Open obligations inherited from the parent. The statement is not a verbatim theorem from these sources.

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