Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

MazurTransfer.original_integral_norms_finite_flat_all_good_primes

Proved

by Vas · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrymazur-theoremnumber-theory

Both same selected integral norm extensions and their fibres over every original test-scheme point are finite, flat, locally finitely presented and surjective at every prime not dividing 104, including nineteen. The original scalar comparison and both original norm composition equalities are retained. Named downstream consumer: integral norm-kernel Hopf models and norm-preimage torsors at nineteen.

Preamble
import Definitions.Def_MazurTransfer_OriginalPicardComparisonGroupProvidersData20261020
import Definitions.Def_MazurTransfer_Order13GoodPrimeIntegralNormCompositionData
import Theorems.Thm_MazurTransfer_Order13GoodPrimeIntegralScalarNineteen_integralNorm_scalar
import Theorems.Thm_MazurTransfer_original_positive_scalar_norm_factors_finite_flat
import Theorems.Thm_MazurTransfer_original_local_picard_group_law_commutative
noncomputable section
open CategoryTheory CategoryTheory.Limits AlgebraicGeometry NeronModelInfra GoodReductionJacobian
open MazurTransfer.Order13GoodPrimeLocalPicardModels MazurTransfer.Order13LocalIntegralCoefficientMaps
open MazurTransfer.Order13GoodPrimeIntegralNormExtensions MazurTransfer.Order13GoodPrimeIntegralNormComposition
open MazurTransfer.Order13GoodPrimeIntegralScalarNineteen MazurTransfer.Order13ActualPicardDiamondSchemeEndomorphism
open scoped CategoryTheory.MonObj
attribute [local instance] MazurTransfer.Order13SameIntegralPicardRationalSchemeComparison.actualGroup
Formal statement
theorem MazurTransfer.original_integral_norms_finite_flat_all_good_primes : (∀ (q : ℕ) [Fact q.Prime] (hq : ¬ (q : ℤ) ∣ 104), (IsFinite (integralPi q hq).val ∧ Flat (integralPi q hq).val ∧
      LocallyOfFinitePresentation (integralPi q hq).val ∧ Surjective (integralPi q hq).val) ∧
    (IsFinite (integralPiConjugate q hq).val ∧ Flat (integralPiConjugate q hq).val ∧
      LocallyOfFinitePresentation (integralPiConjugate q hq).val ∧
        Surjective (integralPiConjugate q hq).val)) ∧ (∀ (q : ℕ) [Fact q.Prime] (hq : ¬ (q : ℤ) ∣ 104), ∀ {T : Scheme}
    (x : T ⟶ (localPicard q hq).P),
(IsFinite (pullback.snd (integralPi q hq).val x) ∧
      Flat (pullback.snd (integralPi q hq).val x) ∧
      LocallyOfFinitePresentation (pullback.snd (integralPi q hq).val x) ∧
      Surjective (pullback.snd (integralPi q hq).val x)) ∧
    (IsFinite (pullback.snd (integralPiConjugate q hq).val x) ∧
      Flat (pullback.snd (integralPiConjugate q hq).val x) ∧
      LocallyOfFinitePresentation (pullback.snd (integralPiConjugate q hq).val x) ∧
      Surjective (pullback.snd (integralPiConjugate q hq).val x))) := by sorry

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