Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

FLT10bench Q10: Frey package construction

Proved
FLT10Bench.q10_of_counterexample

by Jin Gao · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

fltflt10benchnumber-theory

Let a,b,c∈Za,b,c\in\mathbb Za,b,c∈Z be nonzero integers, let p∈Np\in\mathbb Np∈N be prime with p≥5p\ge 5p≥5, and assume

ap+bp=cp.a^p+b^p=c^p.ap+bp=cp.

Then a Frey package exists for this putative counterexample. The package records nonzero integer data, a prime exponent at least 555, the Fermat equation, and the standard normalization data used in the Frey-curve construction: gcd⁡(a,b)=1\gcd(a,b)=1gcd(a,b)=1, a≡3(mod4)a\equiv 3\pmod 4a≡3(mod4), and b≡0(mod2)b\equiv 0\pmod 2b≡0(mod2). It also provides the associated integral and rational Frey curves. This is the first (Q10) checkpoint of FLT10bench and supplies the Frey-package object used by the later irreducibility, modularity, and level-lowering checkpoints.

Formalization Note The conclusion is expressed by the Lean type Nonempty FreyPackage\mathrm{Nonempty}\ \mathrm{FreyPackage}Nonempty FreyPackage, where FreyPackage\mathrm{FreyPackage}FreyPackage is the structure defined by the FLT preliminary development.

Preamble
import Mathlib
import Definitions.Def_FLTPrelim_FreyPackage

set_option autoImplicit false
set_option maxHeartbeats 4000000
set_option synthInstance.maxHeartbeats 400000
set_option backward.isDefEq.respectTransparency.types false
Formal statement
theorem FLT10Bench.q10_of_counterexample (a b c : ℤ) (ha : a ≠ 0) (hb : b ≠ 0) (hc : c ≠ 0) (p : ℕ) (pp : p.Prime) (hp5 : 5 ≤ p) (H : a ^ p + b ^ p = c ^ p) : Nonempty FreyPackage := by sorry
Source
https://github.com/shiyegao/ContextSwarm-ICLR/blob/2450835c06914330ebfd099fd94ddd0924ac5bab/benchmarks/FLT10bench/flt10_q10_of_counterexample/problem.md (FLT10bench Q10; canonical source theorem FreyPackage.of_counterexample: https://github.com/anthropics/fermats-last-theorem/blob/2226972cf818e220d16da6683474496664a6fc67/Theorems/Thm_FreyPackage_of_counterexample.lean)

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me