Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lam–Litt conjecture, integral form: solutions in Z[[z]]\mathbb{Z}[[z]]Z[[z]] are algebraic

Open
LamLitt.integer_coefficients_implies_algebraicity

by emmgaml · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-equationsnumber-theorypower-series

Let n≥0n\ge 0n≥0, let g∈Q(z,y0,…,yn−1)g\in\mathbb{Q}(z,y_0,\dots,y_{n-1})g∈Q(z,y0​,…,yn−1​) be a rational function in n+1n+1n+1 variables, and let f=∑k≥0akzk∈Q[[z]]f=\sum_{k\ge 0}a_kz^k\in\mathbb{Q}[[z]]f=∑k≥0​ak​zk∈Q[[z]] be a formal power series that solves the algebraic differential equation

f(n)(z)=g(z,f(z),f′(z),…,f(n−1)(z))f^{(n)}(z)=g\bigl(z,f(z),f'(z),\dots,f^{(n-1)}(z)\bigr)f(n)(z)=g(z,f(z),f′(z),…,f(n−1)(z))

at a non-singular point, meaning that ggg is defined at (0,f(0),f′(0),…,f(n−1)(0))\bigl(0,f(0),f'(0),\dots,f^{(n-1)}(0)\bigr)(0,f(0),f′(0),…,f(n−1)(0)).

If all coefficients of fff are integers, that is f∈Z[[z]]f\in\mathbb{Z}[[z]]f∈Z[[z]], then fff is algebraic over Q[z]\mathbb{Q}[z]Q[z]:

ak∈Z  for all k≥0⟹f is algebraic over Q[z].a_k\in\mathbb{Z}\ \text{ for all }k\ge 0\quad\Longrightarrow\quad f\text{ is algebraic over }\mathbb{Q}[z].ak​∈Z  for all k≥0⟹f is algebraic over Q[z].

This is an open problem: it is the case N=1N=1N=1 of implication (2)⇒\Rightarrow⇒(1) of the Lam–Litt conjecture, which asks the same conclusion when ak∈Z[1/N]a_k\in\mathbb{Z}[1/N]ak​∈Z[1/N] for some NNN (Problem 1 on Litt's list). The two statements are equivalent. A solution with coefficients in Z[1/N]\mathbb{Z}[1/N]Z[1/N] satisfies Mk+1ak∈ZM^{k+1}a_k\in\mathbb{Z}Mk+1ak​∈Z for a suitable integer M≥1M\ge 1M≥1, the rescaled series Mf(Mz)M f(Mz)Mf(Mz) has integer coefficients and again solves a non-singular algebraic differential equation of order nnn, and fff is algebraic if and only if Mf(Mz)M f(Mz)Mf(Mz) is. The integral form removes the auxiliary integer NNN from the problem.

Formalization Note The hypothesis on fff and ggg is the mission's predicate IsSolutionOfAlgebraicODE: g=p/qg=p/qg=p/q for polynomials p,qp,qp,q with q(0,f(0),…,f(n−1)(0))≠0q\bigl(0,f(0),\dots,f^{(n-1)}(0)\bigr)\neq 0q(0,f(0),…,f(n−1)(0))=0 and f(n)⋅q(z,f,…,f(n−1))=p(z,f,…,f(n−1))f^{(n)}\cdot q(z,f,\dots,f^{(n-1)})=p(z,f,\dots,f^{(n-1)})f(n)⋅q(z,f,…,f(n−1))=p(z,f,…,f(n−1)) in Q[[z]]\mathbb{Q}[[z]]Q[[z]]. The order n=0n=0n=0 is allowed; then fff is a rational function without pole at 000. Integrality is stated as: every coefficient of fff is the image of an integer. Algebraicity is IsAlgebraic (Polynomial ℚ) f, for the action of Q[z]\mathbb{Q}[z]Q[z] on Q[[z]]\mathbb{Q}[[z]]Q[[z]].

Preamble
import Definitions.Def_LamLitt_Defs
import Mathlib

open PowerSeries
Formal statement
namespace LamLitt

theorem integer_coefficients_implies_algebraicity {n : ℕ} (f : PowerSeries ℚ)
    (g : MvRatFunc (Fin (n + 1)) ℚ) (hODE : IsSolutionOfAlgebraicODE n f g)
    (hZ : ∀ k : ℕ, ∃ m : ℤ, PowerSeries.coeff k f = (m : ℚ)) :
    IsAlgebraic (Polynomial ℚ) f := by sorry

end LamLitt
Source
Special case N = 1 of implication (2) => (1) of Conjecture 1.1.1 of Y. H. J. Lam, D. Litt, Algebraicity and integrality of solutions to differential equations, https://arxiv.org/abs/2501.13175 (v1), p. 3; the implication (2) => (1) is Problem 1 of D. Litt, https://www.problemsilike.com/1 , and is formalized in Formal Conjectures, FormalConjectures/LittProblems/1.lean (lam_litt.variants.integrality_implies_algebraicity), https://github.com/google-deepmind/formal-conjectures . The integer-coefficient normalization is not stated in these sources; it is equivalent to the general case by the rescaling z -> Mz.

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