Joint distribution of leftmost digits in positional notation and Schanuels's conjecture

This paper establishes that the surjectivity of the joint distribution of leftmost digits across multiple integer bases implies the rational independence of their logarithms, proving the converse for two bases and for three or more bases under the assumption of Schanuel's conjecture.

The Gist

Here is an explanation of Wayne M. Lawton's paper, translated from dense mathematical jargon into a story about digital fingerprints and cosmic clocks.

The Big Idea: The "First Digit" Game

Imagine you have a number, like 42.

• In Base 10 (our normal counting), the first digit is 4.
• In Base 2 (binary), 42 is 101010, so the first digit is 1.
• In Base 8 (octal), 42 is 52, so the first digit is 5.

The paper asks a simple but tricky question: If I pick a number $x$, can I make its first digit be anything I want, simultaneously in several different number systems?

Let's say we have two number systems: Base 4 and Base 8.

• Can we find a number that starts with a 2 in Base 4 AND a 3 in Base 8?
• Can we find a number that starts with a 3 in Base 4 AND a 2 in Base 8?

The paper investigates whether it's possible to hit every single combination of starting digits if we pick the right number $x$.

---

The Analogy: The Cosmic Clocks

To understand the math, imagine every number base (Base 4, Base 8, Base 10) is a giant cosmic clock.

• The Clock Face: The face of the clock isn't numbered 1 to 12. Instead, the "digits" are the hours.
• The Hand: As you increase the number $x$, the hand on the clock spins around.
• The "First Digit": This is simply which hour the hand is currently pointing at.

The paper is asking: If I have two clocks (Base 4 and Base 8), can I find a moment in time where the first clock points to any hour I want, and the second clock points to any hour I want?

The Problem: Linked Clocks

Some clocks are "linked."

• Base 4 and Base 8 are linked because $8 = 4^2$(or$4 = 8^{0.5}$). They are powers of the same base number.
• If you know where the Base 4 hand is, you can predict exactly where the Base 8 hand must be. They are dancing in a synchronized routine.

The Paper's First Discovery:
If your clocks are linked (like Base 4 and Base 8), you cannot hit every combination.

• Example: In the paper's table, it shows that you can never find a number that starts with 2 in Base 4 and 3 in Base 8. It's like trying to make two linked gears turn in a way that breaks their mechanical connection. The "image" of possible outcomes has holes in it.

The Solution: Independent Clocks

Now, imagine two clocks that are completely unrelated.

• Base 3 and Base 5.
• There is no simple power relationship between them. They are "rationally independent."

The Paper's Second Discovery:
If the clocks are unrelated, the hands spin in a chaotic, non-repeating pattern. Over time, they will eventually point to every possible combination of hours.

• If you wait long enough (or pick the right number $x$), you can make Base 3 start with a 2 and Base 5 start with a 4.
• You can make Base 3 start with a 1 and Base 5 start with a 3.
• Every combination is possible.

---

The Deep Mystery: Schanuel's Conjecture

Here is where the paper gets tricky. The authors proved that if the clocks are linked, you miss combinations. They also proved that if the clocks are "obviously" unrelated (like 3 and 5), you hit all combinations.

But what if the clocks are weird?
What if we have three clocks: Base 3, Base 5, and Base 7?

• We know 3 and 5 are unrelated.
• We know 5 and 7 are unrelated.
• But are they all unrelated in a deeper, mathematical sense?

This is where Schanuel's Conjecture comes in.

What is Schanuel's Conjecture?
It is a famous, unproven guess in mathematics about "transcendental numbers" (numbers like $\pi$ or $e$ that aren't roots of simple equations).

• The Conjecture says: If you take a set of numbers that don't have a simple relationship (like $\ln 3$, $\ln 5$, $\ln 7$), then their exponential forms ($3, 5, 7$) are also deeply independent.
• In our analogy: It guarantees that if the clocks don't look linked, they aren't linked in any hidden way.

The Paper's Conclusion:
The author says: "I can prove that if the clocks are linked, you fail. And I can prove that IF Schanuel's Conjecture is true, then for any set of unrelated clocks, you will succeed in hitting every combination."

Since Schanuel's Conjecture is widely believed to be true (even though it's not proven yet), the paper effectively says:

"Unless there is some hidden, magical link between these number systems that we don't know about, you can always find a number that starts with any digit you want in any number of different bases."

Summary in Plain English

1. The Goal: Can we find a number that starts with specific digits in multiple different number systems (like Base 4, Base 7, Base 11) at the same time?
2. The Bad News: If the number systems are "cousins" (powers of the same number, like 4 and 16), the answer is No. Some combinations are impossible.
3. The Good News: If the number systems are "strangers" (no power relationship), the answer is Yes, you can hit every combination.
4. The Catch: To be 100% sure that "strangers" are truly strangers (and not secretly related in a complex way), we have to rely on a famous mathematical guess called Schanuel's Conjecture. If that guess is right, the universe of digits is fully accessible.

The Takeaway: The paper connects the simple act of looking at the first digit of a number to the deepest, most mysterious laws of how numbers relate to one another. It suggests that the "randomness" of digits is actually a sign of the fundamental independence of the number systems we use.

Technical Summary

Here is a detailed technical summary of the paper "Joint distribution of leftmost digits in positional notation and Schanuel's conjecture" by Wayne M. Lawton.

1. Problem Statement

The paper investigates the joint distribution of the leftmost digits of a positive real number $x$ when represented in multiple different integer bases simultaneously.

• Definitions: Let $B = (b_1, \dots, b_n)$ be a tuple of distinct integers where $b_i \geq 3$. For any $x > 0$, let $d_{b_i}(x)$ denote the leftmost digit of $x$ in base $b_i$. The function of interest is the vector-valued map:
  $$d_B(x) := (d_{b_1}(x), \dots, d_{b_n}(x))$$
  where the codomain is the product set $\{1, \dots, b_1-1\} \times \dots \times \{1, \dots, b_n-1\}$.
• Core Question: Under what conditions is the map $d_B$ surjective? That is, can every possible combination of leading digits be realized by some positive real number $x$?
• Hypothesis: The surjectivity of $d_B$ is intimately linked to the rational independence of the natural logarithms of the bases, $\ln b_1, \dots, \ln b_n$.

2. Methodology

The author employs a combination of number theory, topological dynamics, and transcendental number theory.

• Logarithmic Transformation: The problem is transformed from the multiplicative domain ($x \in \mathbb{R}^+$) to the additive domain via the natural logarithm. The condition for the leftmost digit $d_b(x) = j$ is equivalent to:
  $$\log_b(x) \in [\log_b(j), \log_b(j+1)) + \mathbb{Z}$$
  This relates the problem to the fractional parts of logarithms.
• Torus Dynamics: The author defines a homomorphism $\phi_\omega: \mathbb{R} \to \mathbb{T}^n$ (where $\mathbb{T}^n = \mathbb{R}^n/\mathbb{Z}^n$ is the $n$-dimensional torus) given by $\phi_\omega(t) = t\omega + \mathbb{Z}^n$, with $\omega = (1/\ln b_1, \dots, 1/\ln b_n)$.
  • The problem reduces to determining whether the image of the composition $h = \phi_\omega \circ \ln$ is dense in the torus $\mathbb{T}^n$.
  • Kronecker's Theorem (1884): The image of $\phi_\omega$ is dense in $\mathbb{T}^n$ if and only if the components of $\omega$ are rationally independent.
• Algebraic Independence: To extend the result from $n=2$ to $n \geq 3$, the paper relies on Schanuel's Conjecture, a major unsolved problem in transcendental number theory. The author constructs a logical bridge between the rational independence of $\ln b_i$ and the algebraic independence of $\ln p$ (where $p$ are prime factors of the bases).

3. Key Contributions and Results

A. The Case of Two Bases ($n=2$)

The paper provides a complete characterization for $n=2$:

• Theorem 1:
  • If $\ln b_1$ and $\ln b_2$ are rationally dependent (i.e., $b_1 = a^{e_1}$ and $b_2 = a^{e_2}$ for integers $a, e_1, e_2$), then $d_B$ is not surjective. The author derives a specific necessary condition (inequality involving powers of $a$) that restricts the possible pairs of digits $(j_1, j_2)$.
  • If $\ln b_1$ and $\ln b_2$ are rationally independent, then $d_B$ is surjective.
• Example: For bases $B=(4, 8)$, since $4=2^2$and$8=2^3$, the logs are dependent. The paper demonstrates via a table that specific pairs of digits (e.g.,$(2,3)$) are impossible to achieve.

B. The General Case ($n \geq 3$)

For $n \geq 3$, the relationship between rational independence of logs and surjectivity is conditional on deep conjectures in number theory.

• Theorem 2:
  • Necessity: If any pair of $\ln b_i, \ln b_j$ is rationally dependent, $d_B$ is not surjective (generalizing Theorem 1).
  • Sufficiency (Conditional): If no pair of $\ln b_i$ is rationally dependent, then $d_B$ is surjective if Conjecture 2 holds.
• Conjecture 2: If $b_1, \dots, b_n$ are integers such that no pair of $\{\ln b_1, \dots, \ln b_n\}$ is rationally dependent, then the set $\{1/\ln b_1, \dots, 1/\ln b_n\}$ is rationally independent.
• Connection to Schanuel's Conjecture:
  • Conjecture 1: The logarithms of distinct primes $\{\ln p_1, \dots, \ln p_m\}$ are algebraically independent.
  • Lemma 3: Schanuel's Conjecture implies Conjecture 1.
  • Proposition 1: Conjecture 1 implies Conjecture 2.
  • Conclusion: Therefore, Schanuel's Conjecture implies that $d_B$ is surjective whenever the logs of the bases are pairwise rationally independent.

4. Significance

• Bridging Fields: The paper successfully connects the elementary concept of positional notation (digits in different bases) with advanced topics in dynamical systems (density on tori) and transcendental number theory (Schanuel's Conjecture).
• Resolution of a Specific Case: It provides a definitive proof for the $n=2$ case, showing exactly how rational dependence between bases creates "holes" in the joint distribution of leading digits.
• Conditional Completeness: For the general case ($n \geq 3$), the paper reduces the problem of surjectivity to the validity of Schanuel's Conjecture. This is significant because Schanuel's Conjecture is a powerful unifying hypothesis in number theory; if true, it guarantees that "generic" sets of bases will exhibit a uniform joint distribution of leading digits.
• Methodological Insight: The use of the homomorphism $\phi_\omega$ and the reduction to the density of orbits on a torus provides a robust framework for analyzing similar problems involving simultaneous constraints on logarithmic scales.

Summary Conclusion

Wayne M. Lawton proves that the joint distribution of leftmost digits in multiple bases is surjective if and only if the natural logarithms of those bases are rationally independent. While this is proven unconditionally for two bases, the extension to three or more bases relies on Schanuel's Conjecture. The work demonstrates that the "randomness" or uniformity of leading digits across different bases is fundamentally governed by the algebraic independence of the logarithms of the bases.