973.lean`

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL: Lean4 Domain Explanation Language

Annotation provenance. This overlay contains 10 curated AI-written annotations and 7190 mechanical source-derived annotations. They have not been human-reviewed as explanations; treat them as unverified and not mathematical authority. Retained generation history: The 71 original curated annotations were produced in a Claude Sonnet 5.5 session at medium effort; Claude Opus 5.5 is recorded in that session as the advisor model, not the direct author. The bulk source-derived expansion was generated mechanically from pinned source comments by tooling developed in a GPT-5.6 Sol session at ultra reasoning; GPT-5.6 Sol did not originate the quoted source prose. On 2026-10-17 the mechanically generated source-comment annotations of the Formal Conjectures, Carleson, FLT, PFR, CompFiles, Mathematics in Lean and Theorem Proving in Lean overlays were regenerated by the same generator after three corrections made in a Claude Sonnet 5.5 session: titles no longer cut a sentence inside mathematics or end on a dangling word, workflow markers are removed from the quoted prose, and declaration names follow the scanner's namespace resolution. The boilerplate step line was dropped, and comments that were only a row of dashes no longer yield annotations. No new prose was written and no human review is claimed.

Credit: The upstream authors and contributors retain credit for the project and mathematics. lean4-explainer only renders their pinned source and adds the separately disclosed explanation layer.

Project sources: Pinned project documentation, Formal Conjectures paper, arXiv v1

5 declarations, 5 contain sorry, 0 declared as axioms

Erdős Problem 973

References:

erdosproblems.com/973
[Er92f] Erdős, L., On some problems of {P}. Turán concerning power sums of complex numbers. Acta Math. Hungar. (1992), 11--24.
[Ha74] Hayman, W. K., Research problems in function theory: new problems. (1974), 155--180.
[LYZ26] Luo, Yanping and Yang, Ruiyi and Zhu, Keheng, Exterior power sums. arxiv/2607.22017
[Tu84b] Turán, Paul, On a new method of analysis and its applications. (1984), xvi+584.

Imports (1)

FormalConjecturesUtil

theorem Erdos973.erdos_973 Does there exist a constant sorry line 51 source
Source documentation
Does there exist a constant $C>1$ such that, for every $n\geq 2$, there exists a sequence $z_i\in \mathbb{C}$ with $z_1=1$ and $\lvert z_i\rvert \geq 1$ for all $1\leq i\leq n$ with $\max_{2\leq k\leq n+1}\left\lvert \sum_{1\leq i\leq n}z_i^k\right\rvert < C^{-n}$?
This is Problem 7.3 in [Ha74], where it is attributed to Erdős.
The answer is no, by Luo, Yang and Zhu [LYZ26]: the maximum exceeds $e^{-\lambda n}$ for every fixed $\lambda>0$ once $n$ is large, so it decays subexponentially and no such $C$ exists. See erdos_973.variants.luo_yang_zhu below.

depends on sorry what this means
Statement uses: Iff, False, Exists, Real, And, GT.gt, OfNat.ofNat, Nat, GE.ge, Complex, Eq, Membership.mem, Finset, Finset.Icc, LE.le, Norm.norm, HAdd.hAdd, LT.lt, Finset.sum, HPow.hPow and 1 more
Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous
48 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem erdos_973 :
    answer(False) ↔
      ∃ C : ℝ, C > 1 ∧
        ∀ n : ℕ, n ≥ 2 → ∃ z : ℕ → ℂ,
          z 1 = 1 ∧
          (∀ i ∈ Icc 1 n, 1 ≤ ‖z i‖) ∧
          (∀ k ∈ Icc 2 (n + 1), ‖∑ i ∈ Icc 1 n, z i ^ k‖ < C ^ (-(n : ℝ))) := by
…
```
theorem Erdos973.erdos_973.variants.luo_yang_zhu The result of [LYZ26] that settles the problem: for every fixed sorry line 69 source
Source documentation
The result of [LYZ26] that settles the problem: for every fixed $\lambda>0$ and all large enough $n$, any $z_1,\dots,z_n$ with $\lvert z_j\rvert\geq 1$ satisfy $\max_{2\leq k\leq n+1}\left\lvert\sum_j z_j^k\right\rvert > e^{-\lambda n}$.
This is sharper than erdos_973.variants.tang, whose bound $(2e)^{-(1+o(1))n}$ pins the rate at $\log(2e) = 1 + \log 2$, still exponential decay.

depends on sorry what this means
Statement uses: Real, LT.lt, OfNat.ofNat, Filter.Eventually, Nat, Complex, Membership.mem, Finset, Finset.Icc, LE.le, Norm.norm, Exists, And, HAdd.hAdd, Real.exp, HMul.hMul, Neg.neg, Finset.sum, HPow.hPow, Filter.atTop
Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous
50 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem erdos_973.variants.luo_yang_zhu (lam : ℝ) (hlam : 0 < lam) :
    ∀ᶠ n in atTop, ∀ z : ℕ → ℂ,
      (∀ i ∈ Icc 1 n, 1 ≤ ‖z i‖) →
      ∃ k ∈ Icc 2 (n + 1),
        Real.exp (-lam * n) < ‖∑ i ∈ Icc 1 n, z i ^ k‖ := by
…
```
theorem Erdos973.erdos_973.variants.le_one Erdős proved (as described on p.35 of [Tu84b]) that such a sequence does exist with $\lvert z_i\rvert\leq 1$ sorry line 81 source
Source documentation
Erdős proved (as described on p.35 of [Tu84b]) that such a sequence does exist with $\lvert z_i\rvert\leq 1$. Indeed, Erdős' construction gives a value of $C\approx 1.32$.

depends on sorry what this means
Statement uses: Exists, Real, And, GT.gt, OfNat.ofNat, Nat, GE.ge, Complex, Eq, Membership.mem, Finset, Finset.Icc, LE.le, Norm.norm, HAdd.hAdd, LT.lt, Finset.sum, HPow.hPow, Neg.neg
Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous
48 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem erdos_973.variants.le_one :
    ∃ C : ℝ, C > 1 ∧
      ∀ n : ℕ, n ≥ 2 → ∃ z : ℕ → ℂ,
        z 1 = 1 ∧
        (∀ i ∈ Icc 1 n, ‖z i‖ ≤ 1) ∧
        (∀ k ∈ Icc 2 (n + 1), ‖∑ i ∈ Icc 1 n, z i ^ k‖ < C ^ (-(n : ℝ))) := by
…
```
theorem Erdos973.erdos_973.variants.m2_bounds Documented declaration: m2_bounds sorry line 96 source
Source documentation
In [Er92f] (a different) Erdős refines this analysis, proving that if $M_2=\min_{z_j} \max_{2\leq k\leq n+1} \left\lvert \sum_{1\leq j\leq n}z_j^k\right\rvert$ where the minimum is taken over all $z_j\in \mathbb{C}$ with $\max \lvert z_j\rvert=1$, then $(1.746)^{-n} < M_2 < (1.745)^{-n}$ for all sufficiently large $n$.

depends on sorry what this means
Statement uses: Filter.Eventually, Nat, Real, IsGLB, Set.ofPred, Exists, Complex, And, Membership.mem, Finset, Finset.Icc, OfNat.ofNat, LE.le, Norm.norm, Eq, HAdd.hAdd, Finset.sum, HPow.hPow, LT.lt, OfScientific.ofScientific and 3 more
Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous
48 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem erdos_973.variants.m2_bounds :
    ∀ᶠ n : ℕ in atTop, ∀ M_2 : ℝ,
      IsGLB { M | ∃ z : ℕ → ℂ,
        (∀ j ∈ Icc 1 n, ‖z j‖ ≤ 1) ∧
        (∃ j ∈ Icc 1 n, ‖z j‖ = 1) ∧
        (∃ k ∈ Icc 2 (n + 1), M = ‖∑ j ∈ Icc 1 n, z j ^ k‖ ∧
          ∀ m ∈ Icc 2 (n + 1), ‖∑ j ∈ Icc 1 n, z j ^ m‖ ≤ M) } M_2 →
      (1.746 : ℝ) ^ (-(n : ℝ)) < M_2 ∧ M_2 < (1.745 : ℝ) ^ (-(n : ℝ)) := by
…
```
theorem Erdos973.erdos_973.variants.tang Documented declaration: tang sorry line 112 source
Source documentation
Tang notes in the comments that Theorem 6.1 of [Tu84b] implies that, if $\lvert z_i\rvert \geq 1$ for all $i$, then $\max_{2\leq k\leq n+1}\left\lvert \sum_{1\leq i\leq n}z_i^k\right\rvert \geq (2e)^{-(1+o(1))n}$.

depends on sorry what this means
Statement uses: Exists, Nat, Real, And, Asymptotics.IsLittleO, Filter.atTop, OfNat.ofNat, Filter.Eventually, Complex, Membership.mem, Finset, Finset.Icc, LE.le, Norm.norm, HAdd.hAdd, GE.ge, Finset.sum, HPow.hPow, HMul.hMul, Real.exp and 1 more
Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous
56 instances, coercions and auxiliary constants left out.

Tactic trace: 1 steps
Open to load the checked before-and-after goal states.
```
theorem erdos_973.variants.tang :
    ∃ f : ℕ → ℝ, f =o[atTop] (fun _ ↦ (1 : ℝ)) ∧
    ∀ᶠ n in atTop, ∀ z : ℕ → ℂ,
      (∀ i ∈ Icc 1 n, 1 ≤ ‖z i‖) →
      ∃ k ∈ Icc 2 (n + 1),
        ‖∑ i ∈ Icc 1 n, z i ^ k‖ ≥
        (2 * Real.exp 1) ^ (-(1 + f n) * (n : ℝ)) := by
…
```