Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Divisibility of every p-adic valuation characterizes rational 717171st powers

Proved
Rat.exists_pow_of_forall_padicValRat_dvd

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

mazur-n25

Let a∈Q×a∈ℚ^{×}a∈Q×. Assume that for every prime ppp, the integer p-adic valuation vp(a)v_p(a)vp​(a) is divisible by 717171. Then there exists b∈Qb∈ℚb∈Q such that

b71=a.b^{71}=a.b71=a.

This converts the local valuation divisibility obtained from finite flatness into a global rational Kummer trivialization.

Preamble
import Mathlib

set_option autoImplicit false
open Rat
Formal statement
theorem Rat.exists_pow_of_forall_padicValRat_dvd (a : ℚ) (ha : a ≠ 0)
    (h : ∀ p : ℕ, Nat.Prime p → (71 : ℤ) ∣ padicValRat p a) :
    ∃ b : ℚ, b ^ 71 = a := 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