Conjecture 4.11 — Wirsing and Schmidt
Status Partially solved · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedPartially solvedOpenStatement
Definitions and mathematical statement
For a real algebraic number $\gamma$, let its primitive irreducible polynomial over $\mathbb Z$ have positive leading coefficient. Its naive height $H(\gamma)$ is the largest absolute value of the coefficients of this polynomial, and its degree is the polynomial's degree. This height differs from the absolute logarithmic Weil height.Fix an integer $n\ge1$ and a real number $\theta$ which is either transcendental or algebraic of degree strictly greater than $n$. Does there exist a real constant $c=c(n,\theta)>0$ for which infinitely many distinct real algebraic numbers $\gamma$ of degree at most $n$ satisfy \[ 0<|\theta-\gamma|<c\,H(\gamma)^{-n-1}? \] The constant is chosen once for the given pair $(n,\theta)$ and must work for the entire infinite collection of approximants. No effective procedure for finding it or the approximants is required.
The degree restriction is an upper bound, so rational approximants and algebraic numbers of any smaller degree are permitted. The assumptions on $\theta$ prevent the trivial repeated approximation $\gamma=\theta$; the strict positive lower inequality also records this exclusion explicitly.
Infinitely many distinct approximants necessarily have unbounded heights, because only finitely many primitive integer polynomials have bounded degree and bounded coefficient height. The target exponent is exactly $n+1$, with a fixed multiplicative constant. Bounds with a smaller exponent, or constants allowed to grow from one approximant to the next, do not establish this formulation.
Short English statement
Can every eligible real number be approximated infinitely often by algebraic numbers of degree at most n at the precise height exponent n+1?Sources
- S1 ULAM.AI and the UnsolvedMath Contributors, supplied problems.json, record 8700053 (AMR-086-0053), AMR Open Problem Lists. Catalogue identity and source transcription; CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
- S2 Waldschmidt - Open Diophantine Problems (2004), Conjecture 4.11. Original source indexed by AMR-086-0053. https://arxiv.org/abs/math/0312440.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.