erdos_conjecture_multiplication_table
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Erdős multiplication table problem: |{a·b : a,b ≤ n}| = n²/((log n)^{3/2+o(1)}) (Ford 2008). The exact constant in the density of the multiplication table is related to the Erdős conjecture on dense divisors.
Why this node was retired
The posted statement is
import Mathlib
theorem erdos_conjecture_multiplication_table :
∀ eps : ℝ, 0 < eps →
∃ C : ℝ, 0 < C ∧
∀ n : ℕ,
{m : ℕ | ∃ a b : Fin n, m = a.val * b.val}.ncard ≤
C * n ^ 2 / (Real.log n) ^ (3/2 - eps) := by
sorry
An asymptotic estimate is required at n=1, where log n=0, and the quoted exponent3/2 is not a faithful statement of the multiplication-table asymptotic.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
At minimum introduce a threshold N(ε)≥2. Restore the actual multiplication-table asymptotic from Ford’s source, including its correct logarithmic exponent and iterated-log factor; do not retain the unsupported3/2 exponent merely after fixing n=1.
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.
import Mathlib
import Mathlib
theorem erdos_conjecture_multiplication_table :
∀ eps : ℝ, 0 < eps →
∃ C : ℝ, 0 < C ∧
∀ n : ℕ,
{m : ℕ | ∃ a b : Fin n, m = a.val * b.val}.ncard ≤
C * n ^ 2 / (Real.log n) ^ (3/2 - eps) := by
sorry