Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unimodularity: det⁡(coeffMat E)≠0\det(\mathrm{coeffMat}\,E) \neq 0det(coeffMatE)=0 and vp=0v_p = 0vp​=0 for the class bases

Proved
Apery.coeffMat_det_unit

by tomasz · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisformalizationirrationalitynumber-theoryzeta5-mo271

Unimodularity of the class bases. Let Ea∈Z[t]E_a \in \mathbb{Z}[t]Ea​∈Z[t] (a∈Fin,ha \in Fin\\,ha∈Fin,h) be congruent modulo ppp to ∏c≠cls a(t−γc)Lc⋅(t−γcls a)idx a\prod_{c \neq \mathrm{cls}\,a} (t - \gamma_c)^{L_c} \cdot (t - \gamma_{\mathrm{cls}\,a})^{\mathrm{idx}\,a}∏c=clsa​(t−γc​)Lc​⋅(t−γclsa​)idxa, where the γc∈Fp\gamma_c \in \mathbb{F}_pγc​∈Fp​ are distinct, idx a<Lcls a\mathrm{idx}\,a < L_{\mathrm{cls}\,a}idxa<Lclsa​ and (cls,idx)(\mathrm{cls},\mathrm{idx})(cls,idx) is injective. Then the rational coefficient matrix of the EaE_aEa​ has determinant nonzero and prime to ppp. This is coeffMat_det_unit of Apery/Arith/Unimodular.lean (with the auxiliary sum_pow_X_sub_C_eq_zero, classBasis_independent); the matrix coeffMat E = Matrix.of fun a k => (E a).coeff k is written out with explicit index types in the statement. It is the unimodularity input of the class-basis framework class_frame toward Apery.inner_bound_cap.

Preamble
import Mathlib

open Finset Polynomial Matrix
Formal statement
namespace Apery

theorem coeffMat_det_unit {h : ℕ} {p : ℕ} [hp : Fact p.Prime] {ι : Type*} [Fintype ι]
    [DecidableEq ι] (Ez : Fin h → ℤ[X]) (hdeg : ∀ a, (Ez a).natDegree < h)
    (γ : ι → ZMod p) (hγ : Function.Injective γ) (L : ι → ℕ) (cls : Fin h → ι) (idx : Fin h → ℕ)
    (hidx : ∀ a, idx a < L (cls a)) (hinj : ∀ a b, cls a = cls b → idx a = idx b → a = b)
    (hred : ∀ a, (Ez a).map (Int.castRingHom (ZMod p)) =
      (∏ c ∈ Finset.univ.erase (cls a), (X - C (γ c)) ^ L c) * (X - C (γ (cls a))) ^ idx a) :
    (Matrix.of (fun a k => ((Ez a).map (Int.castRingHom ℚ)).coeff k : Fin h → Fin h → ℚ)).det ≠ 0 ∧
      padicValRat p (Matrix.of (fun a k => ((Ez a).map (Int.castRingHom ℚ)).coeff k : Fin h → Fin h → ℚ)).det = 0 := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Arith/Unimodular.lean (+ BasisChange.lean coeffMat, DirectBound.lean padicValRat_int_eq_zero)

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