Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A ψψψ-cocycle restricts to a finite character over the quintic field

Proved
N25.GlobalKummer.psi_cocycle_restricted_character

by FormallyCorrect · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

mazur-n25

Let F=Q(ζ25)H25F=ℚ(ζ_{25})^{H_{25}}F=Q(ζ25​)H25​ be the quintic character field, let c∈Z1(GQ,𝔽71(ψ))c\in Z^1(G_{ℚ},𝔽_{71}(ψ))c∈Z1(GQ​,F71​(ψ)), and assume that ccc factors through a finite quotient. Then there is an embedding j:F↪Qˉj:F\hookrightarrow ℚ̄j:F↪Qˉ​ for which Qˉ/j(F)ℚ̄/j(F)Qˉ​/j(F) is Galois, every j(F)j(F)j(F)-automorphism has ψ=1ψ=1ψ=1, and every σ∈GQσ\in G_{ℚ}σ∈GQ​ with ψ(σ)=1ψ(σ)=1ψ(σ)=1 fixes j(F)j(F)j(F). Moreover the restriction of ccc is a multiplicative character fff on GFG_FGF​, it factors through a finite extension E/FE/FE/F, and the class number of FFF is at most 777:

f(τ)=c(τ∣GQ),[E:F]<∞,GE⊆ker⁡f,hF≤7.f(τ)=c(τ|_{G_{ℚ}}),\qquad [E:F]<\infty,\qquad G_E\subseteq\ker f,\qquad h_F\le7.f(τ)=c(τ∣GQ​​),[E:F]<∞,GE​⊆kerf,hF​≤7.

This packages the restricted character and the arithmetic bound that force its vanishing. Formalization note: the algebra and scalar-tower instances are the canonical structures induced by the chosen embedding jjj.

Preamble
import Mathlib
import Definitions.Def_N25_GlobalKummerSequence
import Definitions.Def_N25_CharacterField
import Definitions.Def_N25_LocalKummerCharacter
import Definitions.Def_N25
import Mathlib.NumberTheory.NumberField.Norm
import Mathlib.NumberTheory.RamificationInertia.Galois
import Mathlib.RingTheory.Frobenius
import Mathlib.RingTheory.Invariant.Basic

set_option autoImplicit false
noncomputable section
open N25
open N25.GlobalKummer
local instance psiRestrictedPrimeSeventyOne_i9cc59a : Fact (Nat.Prime 71) := ⟨by decide⟩
Formal statement
theorem N25.GlobalKummer.psi_cocycle_restricted_character
    (c : groupCohomology.cocycles₁ psiRep)
    (hc : groupCohomology.IsLevelConstant₁ (MonoidHom.id Gal) c) :
    ∃ j : characterField →ₐ[ℚ] AlgebraicClosure ℚ,
      letI : Algebra characterField (AlgebraicClosure ℚ) := j.toRingHom.toAlgebra
      letI : IsScalarTower ℚ characterField (AlgebraicClosure ℚ) := IsScalarTower.of_algHom j
      IsGalois characterField (AlgebraicClosure ℚ) ∧
      (∀ τ : AlgebraicClosure ℚ ≃ₐ[characterField] AlgebraicClosure ℚ,
        psi (τ.restrictScalars ℚ) = 1) ∧
      (∀ σ : Gal, psi σ = 1 → ∀ x : characterField, σ (j x) = j x) ∧
      ∃ f : (AlgebraicClosure ℚ ≃ₐ[characterField] AlgebraicClosure ℚ) →*
          Multiplicative (ZMod 71),
        (∀ σ, f σ = Multiplicative.ofAdd (c (σ.restrictScalars ℚ))) ∧
        (∃ E : IntermediateField characterField (AlgebraicClosure ℚ),
          FiniteDimensional characterField E ∧ E.fixingSubgroup ≤ f.ker) ∧
        NumberField.classNumber characterField ≤ 7 := by sorry
Source
B. Mazur, Modular curves and the Eisenstein ideal, Publ. IHES 47 (1977); Lean formalization of the order-25 case for this mission. Modules in the MazurProof/Keystone/Tate families are adapted from anthropics/fermats-last-theorem (Apache-2.0) via the xiangyazi24/FLT fork.

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