Skip to content

Commit 3400da0

Browse files
mo271Paul-Lez
andauthored
Erdős Problem 67: The Erdős discrepancy problem (google-deepmind#1173)
Co-authored-by: Paul Lezeau <[email protected]>
1 parent fb2990c commit 3400da0

File tree

1 file changed

+55
-0
lines changed
  • FormalConjectures/ErdosProblems

1 file changed

+55
-0
lines changed
Lines changed: 55 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,55 @@
1+
/-
2+
Copyright 2025 The Formal Conjectures Authors.
3+
4+
Licensed under the Apache License, Version 2.0 (the "License");
5+
you may not use this file except in compliance with the License.
6+
You may obtain a copy of the License at
7+
8+
https://www.apache.org/licenses/LICENSE-2.0
9+
10+
Unless required by applicable law or agreed to in writing, software
11+
distributed under the License is distributed on an "AS IS" BASIS,
12+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13+
See the License for the specific language governing permissions and
14+
limitations under the License.
15+
-/
16+
17+
import FormalConjectures.Util.ProblemImports
18+
19+
/-!
20+
# Erdős Problem 67
21+
22+
*References:*
23+
- [erdosproblems.com/67](https://www.erdosproblems.com/66)
24+
- [Ta16] Tao, Terence, The Erdős discrepancy problem. Discrete Anal. (2016), Paper No. 1, 29.
25+
-/
26+
open Filter
27+
28+
namespace Erdos67
29+
30+
/--
31+
**The Erdős discrepancy problem**
32+
33+
If $f\colon \mathbb N \rightarrow \{-1, +1\}$ then is it true that for every $C>0$ there
34+
exist $d, m \ge 1$ such that $$\left\lvert \sum_{1\leq k\leq m}f(kd)\right\rvert > C?$$
35+
This is true, and was proved by Tao [Ta16]
36+
-/
37+
@[category research solved, AMS 11]
38+
theorem erdos_67 (f : ℕ → ({-1, 1} : Finset ℝ)) (C : ℝ) (hC : 0 < C) : ∃ᵉ (d ≥ 1) (m ≥ 1),
39+
C < |∑ k ∈ Finset.Icc 1 m, (f (k * d)).1| := by
40+
sorry
41+
42+
/--
43+
**The Erdős discrepancy problem (complex variant)**
44+
45+
If $f\colon \mathbb N \rightarrow S^1 ⊆ ℂ$ then is it true that for every $C>0$ there
46+
exist $d, m \ge 1$ such that $$\left\lvert \sum_{1\leq k\leq m}f(kd)\right\rvert > C?$$
47+
This is true, and was proved by Tao [Ta16]
48+
-/
49+
@[category research solved, AMS 11]
50+
theorem erdos_67.variants.complex (f : ℕ → Metric.sphere (0 : ℂ) 1) (C : ℝ) (hC : 0 < C) :
51+
∃ᵉ (d ≥ 1) (m ≥ 1), C < ‖∑ k ∈ Finset.Icc 1 m, (f (k * d)).1‖ := by
52+
sorry
53+
54+
55+
end Erdos67

0 commit comments

Comments
 (0)