-
Notifications
You must be signed in to change notification settings - Fork 219
feat: add Green's Open Problem 82 #1897
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Changes from 1 commit
956e0b3
c753597
a03c2e9
b53dceb
9efb382
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,52 @@ | ||
| /- | ||
| Copyright 2026 The Formal Conjectures Authors. | ||
|
|
||
| Licensed under the Apache License, Version 2.0 (the "License"); | ||
| you may not use this file except in compliance with the License. | ||
| You may obtain a copy of the License at | ||
|
|
||
| https://www.apache.org/licenses/LICENSE-2.0 | ||
|
|
||
| Unless required by applicable law or agreed to in writing, software | ||
| distributed under the License is distributed on an "AS IS" BASIS, | ||
| WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| See the License for the specific language governing permissions and | ||
| limitations under the License. | ||
| -/ | ||
|
|
||
| import FormalConjectures.Util.ProblemImports | ||
|
|
||
| /-! | ||
| # Ben Green's Open Problem 82 | ||
|
|
||
| Let $A \subset \mathbb{Z}$ be a set of size $n$. For how many $\theta \in \mathbb{R}/\mathbb{Z}$ | ||
| must we have $\sum_{a \in A} \cos(2\pi a\theta) = 0$? | ||
|
|
||
| This problem asks for the minimum number of zeros of the trigonometric sum | ||
| $\sum_{a \in A} \cos(2\pi a \theta)$ on the circle, over all sets $A$ of a given size. | ||
|
|
||
| *Reference:* | ||
| - [Gr24] [Ben Green's Open Problem 82](https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf#problem.82) | ||
| -/ | ||
|
|
||
| open Real Set | ||
| open scoped Finset | ||
|
|
||
| namespace Green82 | ||
|
|
||
| /-- | ||
| Let $A \subset \mathbb{Z}$ be a set of size $n$. For how many $\theta \in \mathbb{R}/\mathbb{Z}$ | ||
| must we have $\sum_{a \in A} \cos(2\pi a\theta) = 0$? | ||
|
|
||
| We formalize this as asking for the infimum of the number of zeros of | ||
| $\theta \mapsto \sum_{a \in A} \cos(2\pi a \theta)$ in $[0, 1)$, over all finite sets | ||
| $A \subset \mathbb{Z}$ with $|A| = n$. | ||
| -/ | ||
| @[category research open, AMS 11 42] | ||
| theorem green_82 (n : ℕ) (hn : 1 ≤ n) : | ||
|
||
| ⨅ (A : Finset ℤ) (_ : A.card = n), | ||
| ({θ : ℝ | θ ∈ Ico 0 1 ∧ ∑ a ∈ A, cos (2 * π * a * θ) = 0} : Set ℝ).ncard = | ||
|
||
| answer(sorry) := by | ||
| sorry | ||
|
|
||
| end Green82 | ||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I don't quite see how "For how many" is formalised here. Is this meant asymptocially or should we use the
answer(sorry)mechanism?can we just take
f := fun n => 0here and it will be trivially true?