Source labels openChecked July 26, 2026

Erdős Problem 1085: Upper D3

Is the $n^{4/3}\log\log n$ lower bound in 3D also an upper bound?.

Convex geometry AMS 52

Mathematical statement

Is the $n^{4/3}\log\log n$ lower bound in 3D also an upper bound?.

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_1085.variants.upper_d3

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_1085.variants.upper_d3 : answer(sorry) ↔    (fun n ↦ (f 3 n : ℝ)) =O[atTop] (fun n : ℕ ↦ (n : ℝ) ^ (4/3 : ℝ) * log (log n)) := by  sorry

Statement source: Formal Conjectures
Lean version: v4.27.0
Placeholder: Present; no proof artifact
Source evidence: Pinned source index
Fidelity review: Community formulation

References

Pinned Formal Conjectures sourceformalization erdosproblems.com/1085background