Skip to content

Commit a9392c8

Browse files
alreadydonekim-em
andauthored
feat(NumberTheory): Vinogradov mean value theorem (#504)
* feat(NumberTheory): Vinogradov mean value theorem * toml * style: clarify Vinogradov exponent --------- Co-authored-by: Kim Morrison <kim@tqft.net>
1 parent 6af65bb commit a9392c8

2 files changed

Lines changed: 50 additions & 0 deletions

File tree

Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
import Mathlib
2+
import EvalTools.Markers
3+
4+
/-!
5+
# Vinogradov mean value theorem
6+
7+
https://en.wikipedia.org/wiki/Vinogradov%27s_mean-value_theorem
8+
9+
Given integers `s, k ≥ 1`, let J_{s,k}(X) denote the number of integral solutions to the system of
10+
`k` equations `x₁ʲ + … + xₛʲ = y₁ʲ + … + yₛʲ` with `1 ≤ xᵢ, yᵢ ≤ X` for `i = 1, …, s`.
11+
Then J_{s,k}(X) ≪ X^ε(X^s + X^{2s-k(k+1)/2}) for every ε > 0.
12+
13+
This was proved by Jean Bourgain, Ciprian Demeter, and Larry Guth and by a different method
14+
by Trevor Wooley.
15+
16+
## References
17+
18+
Lillian B. Pierce. The Vinogradov Mean Value Theorem [after Wooley, and Bourgain, Demeter and Guth].
19+
https://arxiv.org/abs/1707.00119
20+
21+
Bourgain, Jean; Demeter, Ciprian; Guth, Larry (2016).
22+
"Proof of the main conjecture in Vinogradov's Mean Value Theorem for degrees higher than three".
23+
Ann. of Math. 184 (2): 633–682. arXiv:1512.01565. doi:10.4007/annals.2016.184.2.7.
24+
25+
Wooley, Trevor D. (2019). "Nested efficient congruencing and relatives of Vinogradov's mean value theorem".
26+
Proceedings of the London Mathematical Society. 118 (4): 942–1016. arXiv:1708.01220. doi:10.1112/plms.12204.
27+
-/
28+
29+
namespace LeanEval.NumberTheory.VinogradovMeanValue
30+
31+
/-- The quantity J_{s,k}(X) that counts solutions of a certain system of
32+
Diophantine equations in a cube. -/
33+
def J (s k X : ℕ) : ℝ :=
34+
Finset.card {(x, y) : (Fin s → Finset.Icc 1 X) × (Fin s → Finset.Icc 1 X) |
35+
∀ j ≤ k, ∑ i, (x i).1 ^ j = ∑ i, (y i).1 ^ j}
36+
37+
@[eval_problem]
38+
theorem vinogradov_mean_value (s k : ℕ) (ε : ℝ) (hε : 0 < ε) :
39+
J s k =O[Filter.atTop]
40+
fun X ↦ (X ^ (s + ε) + X ^ ((2 * s : ℝ) - k * (k + 1) / 2 + ε) : ℝ) := by
41+
sorry
42+
43+
end LeanEval.NumberTheory.VinogradovMeanValue
Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
id = "vinogradov_mean_value"
2+
title = "Vinogradov mean value theorem"
3+
test = false
4+
module = "LeanEval.NumberTheory.VinogradovMeanValue"
5+
holes = ["vinogradov_mean_value"]
6+
submitter = "Junyan Xu"
7+
notes = "The Bourgain–Demeter–Guth proof relies solely on harmonic analysis techniques rather than number theoretic methods all previous progress relied on, and allows integers to be replaced with arbitrary well separated real numbers. The theorem is derived as a consequence of a sharp decoupling inequality for curves. Wooley's proof uses his nested efficient congruencing method, which in contrast with the l2-decoupling method makes no use of multilinear Kakeya estimates, so is of sufficient flexibility to be applicable in algebraic number fields, and in function fields."

0 commit comments

Comments
 (0)