Source labels openChecked July 26, 2026

Erdős Problem 1192

Does there exist, for all $r\geq 2$ , a basis $A$ of order $r$ (so that $f_r(n)>0$ for all large $n$ ) such that $\sum_{n\leq x}f_r(n)^2 \ll x$ for all $x$ ?

Combinatorics AMS 5

Mathematical statement

Does there exist, for all $r\geq 2$ , a basis $A$ of order $r$ (so that $f_r(n)>0$ for all large $n$ ) such that $\sum_{n\leq x}f_r(n)^2 \ll x$ for all $x$ ?

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_1192

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_1192 :    answer(sorry) ↔      ∀ r ≥ 2, ∃ A : Set ℕ,        (∀ᶠ n in atTop, f_r A r n > 0) ∧        (fun (x : ℕ) ↦ ∑ n ∈ range (x + 1), (f_r A r n : ℝ) ^ 2) =O[atTop]          (fun (x : ℕ) ↦ (x : ℝ)) := 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/1192background