Irrationality exponents of logarithms of positive rational numbers
summary
The gist
We study rational approximation to logarithms of positive rational numbers and give a separated-weight determinant argument for µ(log r) = 2 whenever r ∈ Q>0 ! The main result asserts that this…
In short
The study investigates rational approximation for logarithms of positive rational numbers to determine their irrationality exponents, $\mu(\log r)$. The main result proves that for any positive rational number $r$, $\mu(\log r) = 2$. This is achieved by constructing a nonzero rational determinant and showing its arithmetic lower bounds contradict its analytic upper bounds, thereby attaining the Dirichlet lower bound.
Key concepts
- Irrationality Exponent ($\mu(x)$)
- This measures how well a number $x$ can be approximated by rational numbers. If $\mu(x) = 2$, it means that for any rational approximation $p/q$, the error $|x - p/q|$ is bounded below by $1/q^2$. The paper aims to prove this specific bound for logarithms of positive rationals.
- Separated-Weight Determinant Argument
- This is a technique used to establish irrationality measures. It involves constructing a rational determinant where the arithmetic constraints (lower bounds) derived from its structure are shown to be incompatible with the analytic constraints (upper bounds) derived from an identity involving the logarithm.
- Dirichlet's Theorem Lower Bound
- Dirichlet's theorem provides a general lower bound for irrational numbers, stating that $\mu(x) \ge 2$. The paper proves that this minimum bound is actually achieved for the logarithms of positive rational numbers, meaning they are as well-approximated as possible according to this fundamental theorem.
Terminology used across episodes
This episode discusses
- Irrationality exponents of logarithms of positive rational numbers · Paper Radio
- An essay on irrationality measures of pi and other logarithms
- How many zeroes? Counting the number of solutions of systems of polynomials via geometry at infinity (Draft III)
The paper
Irrationality exponents of logarithms of positive rational numbers · Read on arXiv
School of Mathematics and Statistics, Wuhan University · Wuhan Institute for Math & AI
We study rational approximation to logarithms of positive rational numbers and give a separated-weight determinant argument for μ(r)=2 whenever r in Q>0 1. The geometric input is an interpolation theorem for logarithmic jets at points with distinct multiplicative coordinates. Its successive weight thresholds are independent of the interpolation centres; the eventual degree threshold may depend on them. A local intersection-length bound and a curve inequality lead to surjectivity through a blow-up and Serre vanishing. For a fixed rational argument, this produces a nonzero rational determinant. Clearing denominators gives an arithmetic lower bound, while an exact row translation and repeated Taylor indices yield a contradictory analytic upper bound. The consequences include nonzero rational linear combinations of such logarithms, rational affine changes, and logarithms of positive numbers with a rational positive integer power. We also give a bounded-fibre interpolation extension, an explicit bound for the final analytic degree, and a counterexample to interpolation under the volume condition alone.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Irrationality exponents of logarithms of positive rational numbers".
Emmy: Here's the gist of the paper. We study rational approximation to logarithms of positive rational numbers and give a separated-weight determinant argument for µ(log r) = 2 whenever r ∈ Q>0 !
Ada: The main result asserts that this lower bound is attained throughout the family considered here!
Emmy: The Core Result on Irrationality Exponents Theorem 1 states that for every r ∈ Q>0 !
Ada: and every real ν > 2, there is a positive integer Q(r, ν) such that log r − p/q > q−ν (p ∈ Z, q ∈ Z, q ≥ Q(r, ν)>!
Title and authors: Ada: So we're looking at a paper called "Irrationality exponents of logarithms of positive rational numbers." It’s by Jingwen Liu, Kai Jiang, and Pingwen Zhang. It’s about how well you can approximate the logarithm of a positive fraction with a rational number.
Emmy: Exactly. The authors are combining approximation theory with some geometric ideas to figure out something about these logarithms that we don't always expect. It sounds like they're setting a lower bound on the irrationality exponent for these values, suggesting it’s exactly two for any positive rational number except one.
Kolya: When you say "irrationality exponent," what does that mean in this context? Is it about how irrational the number is, or something else related to how well we can approximate it?
Ada: It’s about the approximation quality. They show that for any positive rational number r not equal to one, if you have a real number nu greater than two, you can always find a denominator q, and an integer p, such that the difference between your approximation of the logarithm of that fraction and the actual logarithm is smaller than something related to that denominator, specifically less than q minus nu.
Emmy: That's a lower bound result. It’s not just saying these logarithms are irrational; it’s giving us a specific rate at which they are approximated. The authors claim this lower bound is attained throughout the whole family of rational numbers they're considering.
Kolya: So, what does this actually change for us? Does it give us a better handle on how hard it is to approximate r ?
Ada: It means that the lower bound suggested by Dirichlet's theorem, which is two, is not just an asymptotic result; they show it’s achieved. They establish that for every positive rational number r, the exponent mu(r) equals two. This confirms a long-standing conjecture for this specific class of numbers >
The paper's summary: Emmy: Now, looking at the details of "Irrationality exponents of logarithms of positive rational numbers," they use a moving-centre polynomial interpolation theorem. This is the geometric input they rely on.
Ada: That geometric part is key because it allows them to set up a structure where they can construct a nonzero rational determinant. This determinant argument is their main tool for proving the result about mu(r) = two <ref:2610.10192#pg1>.
Kolya: So, how does that construction work? Is it some kind of clever way to use the approximation errors to build something non-zero? What kind of mathematical object are they comparing?
Ada: They construct a nonzero rational determinant. They then show that the arithmetic lower bound for this determinant is incompatible with an analytic upper bound they derive from repeated Taylor expansions and row translations. This contradiction forces the result, showing that no excessively good approximations can exist simultaneously.
Emmy: The paper also gives them some improvements to the method itself, specifically a bounded-fibre interpolation extension. This lets them show that even when the interpolation centres aren't all distinct points in space, you can still make the map surjective under certain conditions.
Kolya: That sounds like they’re making the geometric part more robust. If you lose that distinct centre structure, does the whole argument fall apart? What are those specific conditions for it to still work?
Ada: The authors prove that for a fixed rational argument, they can find an explicit degree threshold. This threshold depends on the chosen approximation centers, but once those centers are fixed, the final degree bound is determined by the structure of that configuration. They also show that this result extends to every real nu greater than two.
The paper's improvements: Emmy: Beyond just proving the main theorem, they offer several structural improvements to how you approach these problems. One of the key ones is the idea of successive weight thresholds for the interpolation weights.
Ada: They show that these successive weight thresholds are independent of where you pick your interpolation centers. That independence is a big deal because it means the choice of centers doesn't mess up the fundamental structure they've built up for finding these bounds.
Kolya: That’s good because usually, when you change the setup—like moving those centres around—you have to re-derive everything. Does this independence simplify things for applying these results to different kinds of rational numbers?
Emmy: It simplifies the application significantly. They show that for a fixed rational argument, they can find an explicit bound on the final analytic degree required to get the contradiction. This is a concrete number instead of just saying "it exists."
Ada: And they also have this bounded-fibre interpolation extension. This shows that even if you don't have perfectly distinct centres, as long as you meet a certain condition on the number of points used, the map can still be surjective. It’s a more practical tool for when your setup isn't perfectly ideal.
Kolya: So, to summarize these improvements: they got rid of circular dependence in the weight choices and gave us an explicit degree bound for the analytic part. Does that mean we have a more reliable way to prove irrationality exponents?
Ada: It means yes. They've replaced vague existence claims with concrete bounds derived from geometric constraints, which is exactly what you need when you’re trying to establish sharp results on these approximation problems >
Conclusion: Emmy: So, to wrap up the paper "Irrationality exponents of logarithms of positive rational numbers," they’ve shown that the irrationality exponent for the logarithms of positive rational numbers is exactly two. This result comes from a combination of a moving-centre interpolation theorem and a determinant argument comparing arithmetic and analytic bounds.
Ada: And what this means for us is that we now have a rigorous way to establish this lower bound, showing it's attained everywhere, not just in some limit case. It connects the analytic side—the growth of coefficients—with the arithmetic side—the denominators of approximations >
Kolya: From a probabilistic standpoint, I see this as confirming that the tail behavior governed by these approximation errors is very strong. The constants they derive survive when you apply them to various rational combinations or affine changes >
Emmy: And they go further with consequences. They show that you can form nonzero rational linear combinations of these logarithms, and also logs of positive numbers raised to a positive integer power, and even rational affine changes that still maintain the exponent of two >
Ada: It’s a nice structure. The whole thing hinges on the fact that r is rational. They also provided a counterexample showing that you can't rely only on volume conditions for interpolation; you need the weight separation hypothesis >
Kolya: That's important context because it shows where the methods are actually limited. The geometric proof in Section two requires that weight separation, and without it, even if the volume ratio is small, the map fails to be onto > <ref:2610.10192#pg1>
Emmy: So they’ve given us a complete picture: a sharp result for rational logarithms, structural improvements for their method and how we set up those problems. It’s a solid piece of work >
More episodes
- 2508.18266-On models of affine arithmetic
- 2508.20749-Rates of convergence for extremal spacings in Kakutani's random interval-splitting process
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes