Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coefficient minors are bounded by the exceptional-prime bound

Proved
Wikipedia.SzemeredisTheorem.minor_natAbs_le_exceptionalPrimeBound

by kmehltretter82 · Nov 14, 2026 · Mathlib c5ea003 (Lean v4.30.0)

additive-combinatoricsgreen-tao-port-8822number-theory

Let κ\kappaκ and ι\iotaι be finite index sets, and let (Lq)q∈κ(L_q)_{q\in\kappa}(Lq​)q∈κ​ be integer affine forms in variables indexed by ι\iotaι. For any q,r∈κq,r\in\kappaq,r∈κ and i,j∈ιi,j\in\iotai,j∈ι, their coefficient minor satisfies

∣det⁡(aq,iaq,jar,iar,j)∣≤B(L),\left|\det\begin{pmatrix}a_{q,i}&a_{q,j}\\a_{r,i}&a_{r,j}\end{pmatrix}\right| \le B(L),​det(aq,i​ar,i​​aq,j​ar,j​​)​≤B(L),

where aq,ia_{q,i}aq,i​ is the coefficient of the iiith variable in LqL_qLq​ and B(L)B(L)B(L) is the exceptional-prime bound attached to the family. Repeated row or column indices are allowed.

Preamble
/- Mechanically transplanted from https://github.com/plby/lean-proofs.git at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e. Original scopes and proof bytes are oracle-derived. -/
import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_LinearForms_Geometry
import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_LinearForms_Independence
import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ExceptionalPrimes
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_LinearForms_Basic
import Mathlib.Algebra.BigOperators.Expect
import Mathlib.Data.Fintype.Card
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic

set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Explicit exceptional moduli for integer affine forms

The local-factor argument needs a finite bound after which every selected
nonzero coefficient and every selected nonzero two-by-two minor remains
nonzero modulo `p`.  We use a deliberately coarse sum of absolute values;
its advantage is that it is total, explicit, and requires no choices.
-/
open Wikipedia.SzemeredisTheorem

Formal statement
theorem Wikipedia.SzemeredisTheorem.minor_natAbs_le_exceptionalPrimeBound
    {κ ι : Type*} [Fintype κ] [Fintype ι]
    (forms : κ → AffineForm ι ℤ)
    (q r : κ) (i j : ι) :
    Int.natAbs
        ((forms q).coefficientMinor (forms r) i j) ≤
      exceptionalPrimeBound forms := by sorry
Source
https://github.com/plby/lean-proofs/blob/8822f7ddef30fadbd92e1c6ab4ed897af356af5e/src/latest/Wikipedia/GreenTao/Sieve/ExceptionalPrimes.lean#L72-L130

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