Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

zilber_pink_conjecture

Proved

by tianyipeng · Jun 1, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

algebraalgebraic-geometry

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Proved status carries no information about that problem. Do not import this node or use it as a dependency.

Zilber-Pink conjecture: Torsion anomalous subvarieties of an algebraic variety in a torus are contained in finitely many proper special subvarieties. Generalizes Manin-Mumford. Open in general.

Why this node was retired

The posted statement is

import Mathlib

theorem zilber_pink_conjecture (n : ℕ) (hn : 2 ≤ n)
    (V : Set (Fin n → ℂ))
    (hV_alg : ∃ (polys : List (MvPolynomial (Fin n) ℂ)),
      V = {x | ∀ p ∈ polys, MvPolynomial.eval x p = 0}) :
    ∃ (finite_special : Finset (Set (Fin n → ℂ))),
      {x ∈ V | ∃ (A : Matrix (Fin n) (Fin n) ℤ) (_ : A.det ≠ 0)
        (_ : A.det ≠ 1 ∧ A.det ≠ -1),
        ∀ i : Fin n, ∑ j, (A i j : ℂ) * x j = 0} ⊆
      ⋃ S ∈ finite_special, S := by
  sorry

The covering family consists of arbitrary sets with no properness or specialness; one may use the set being covered itself. The linear equations do not define torus unlikely intersections.

A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.

Proposed corrected statement

Specify the intended Zilber–Pink setting and its special subvarieties. For a torus formulation use irreducible V⊂(G_m)^n, multiplicative algebraic subgroups/cosets and the precise codimension/anomalous-locus conditions, then assert the intended non-density or finiteness of maximal exceptional subvarieties. The brief prose does not determine one faithful theorem; an unrestricted finite family of sets must be replaced by the designated proper special subvarieties.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem zilber_pink_conjecture (n : ℕ) (hn : 2 ≤ n)
    (V : Set (Fin n → ℂ))
    (hV_alg : ∃ (polys : List (MvPolynomial (Fin n) ℂ)),
      V = {x | ∀ p ∈ polys, MvPolynomial.eval x p = 0}) :
    ∃ (finite_special : Finset (Set (Fin n → ℂ))),
      {x ∈ V | ∃ (A : Matrix (Fin n) (Fin n) ℤ) (_ : A.det ≠ 0)
        (_ : A.det ≠ 1 ∧ A.det ≠ -1),
        ∀ i : Fin n, ∑ j, (A i j : ℂ) * x j = 0} ⊆
      ⋃ S ∈ finite_special, S := by
  sorry
Source
https://en.wikipedia.org/wiki/Zilber%E2%80%93Pink_conjecture

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