Chen 1973, Lemma 2: primitive-character large sieve #
This is a source module for the lemma printed on pp. 113--114 of Chen's 1973
paper. The definitions and theorem statements below retain the paper's exact
objects: the interval M < n ≤ M + N, primitive characters, the weights
q / φ(q) and 1 / φ(q), and the constant X² + π N in equation (2).
The proof on pp. 113--114 has two layers. First, disjoint intervals around the
reduced Farey fractions give equation (4), the sharp additive estimate with
constant X² + π N. Gauss inversion and character orthogonality then give
(2). Finally the source partitions D < q ≤ Q into the cells
2^i D < q ≤ 2^(i+1) D and obtains (3).
The already-proved Gauss/Farey orthogonality layer is reused literally. The
remaining source-calculus sentence (equation (4), whose sharp constant is not
provided by the repository's weaker logarithmic largeSieveBound) is exposed
as Chen1973FareyEquationFour; it is not replaced by the weaker bound.
Chen p. 113: S(α) = ∑_{n=M+1}^{M+N} a_n e(nα).
Equations
- AnalyticNumberTheory.LargeSieve.chen1973ExponentialSum a M N α = ∑ n ∈ Finset.Icc (M + 1) (M + ↑N), ↑(a n) * AnalyticNumberTheory.LargeSieve.charReal (↑n * α)
Instances For
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973ExponentialSum · compiled type and proof/definition references.
Chen p. 113: Z = ∑_{n=M+1}^{M+N} |a_n|².
Equations
- AnalyticNumberTheory.LargeSieve.chen1973CoefficientEnergy a M N = ∑ n ∈ Finset.Icc (M + 1) (M + ↑N), |a n| ^ 2
Instances For
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973CoefficientEnergy · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.charReal_intervalIntegral_int · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973_fourier_parseval · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973_fourier_parseval_shift · compiled type and proof/definition references.
The character amplitude occurring verbatim in equations (2) and (3).
Equations
- AnalyticNumberTheory.LargeSieve.chen1973PrimitiveAmplitude a M N q χ = ∑ n ∈ Finset.Icc (M + 1) (M + ↑N), ↑(a n) * ↑χ ↑n
Instances For
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973PrimitiveAmplitude · compiled type and proof/definition references.
Chen pp. 113--114, equation (4): the sharp reduced-Farey additive estimate. This is exactly the analytic sentence between the disjoint-interval argument and primitive Gauss inversion.
Equations
- AnalyticNumberTheory.LargeSieve.Chen1973FareyEquationFour = ∀ (a : ℤ → ℝ) (M : ℤ) (N X : ℕ), ∑ qa ∈ AnalyticNumberTheory.LargeSieve.reducedFareyIndices X, ‖AnalyticNumberTheory.LargeSieve.chen1973ExponentialSum a M N (AnalyticNumberTheory.LargeSieve.reducedFareyPoint qa)‖ ^ 2 ≤ (↑X ^ 2 + Real.pi * ↑N) * AnalyticNumberTheory.LargeSieve.chen1973CoefficientEnergy a M N
Instances For
Inspect dependencies
AnalyticNumberTheory.LargeSieve.Chen1973FareyEquationFour · compiled type and proof/definition references.
Unconditional closure of Chen's sharp Farey estimate, equation (4).
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973FareyEquationFour · compiled type and proof/definition references.
Chen p. 113, equation (2), as one literal proposition.
Equations
- AnalyticNumberTheory.LargeSieve.Chen1973Lemma2EquationTwo = ∀ (a : ℤ → ℝ) (M : ℤ) (N X : ℕ), ∑ q ∈ Finset.Icc 1 X, ↑q / ↑q.totient * ∑ χ : AnalyticNumberTheory.LargeSieve.PrimitiveCharacter q, ‖AnalyticNumberTheory.LargeSieve.chen1973PrimitiveAmplitude a M N q χ‖ ^ 2 ≤ (↑X ^ 2 + Real.pi * ↑N) * AnalyticNumberTheory.LargeSieve.chen1973CoefficientEnergy a M N
Instances For
Inspect dependencies
AnalyticNumberTheory.LargeSieve.Chen1973Lemma2EquationTwo · compiled type and proof/definition references.
Chen p. 113, equation (3), with the Vinogradov constant made explicit and
its source dependence preserved: one absolute constant works uniformly for
a, M, N, D, Q.
Equations
- AnalyticNumberTheory.LargeSieve.Chen1973Lemma2EquationThree = ∃ (C : ℝ), 0 < C ∧ ∀ (a : ℤ → ℝ) (M : ℤ) (N D Q : ℕ), 0 < D → ∑ q ∈ Finset.Ioc D Q, 1 / ↑q.totient * ∑ χ : AnalyticNumberTheory.LargeSieve.PrimitiveCharacter q, ‖AnalyticNumberTheory.LargeSieve.chen1973PrimitiveAmplitude a M N q χ‖ ^ 2 ≤ C * (↑Q + ↑N / ↑D) * AnalyticNumberTheory.LargeSieve.chen1973CoefficientEnergy a M N
Instances For
Inspect dependencies
AnalyticNumberTheory.LargeSieve.Chen1973Lemma2EquationThree · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973PrimitiveAmplitude_eq_intervalAmplitude · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973CoefficientEnergy_eq_norm_energy · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973ExponentialSum_eq_reducedAdditiveAmplitude · compiled type and proof/definition references.
Source sentence after (4), pp. 113--114: Gauss inversion plus primitive character orthogonality turns the sharp reduced-Farey estimate into (2). The final conclusion is the literal equation-(2) proposition.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973Lemma2_equationTwo_of_fareyEquationFour · compiled type and proof/definition references.
The dyadic modulus decomposition used for equation (3) #
The source cell 2^k D < q ≤ 2^(k+1)D, intersected with (D,Q].
Equations
- AnalyticNumberTheory.LargeSieve.chen1973ModulusCell D Q k = {q ∈ Finset.Ioc D Q | ((q - 1) / D).log2 = k}
Instances For
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973ModulusCell · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.mem_chen1973ModulusCell · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973ModulusCell_bounds · compiled type and proof/definition references.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973ModulusCell_index_lt · compiled type and proof/definition references.
The dyadic cells partition the complete source interval (D,Q].
Inspect dependencies
AnalyticNumberTheory.LargeSieve.sum_chen1973ModulusCell · compiled type and proof/definition references.
One source dyadic cell, obtained from (2) at cutoff 2^(k+1)D and the
pointwise inequality 1/q ≤ 1/(2^k D).
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973EquationThree_cell_le · compiled type and proof/definition references.
Finite geometric identity used in Chen's dyadic summation.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.sum_range_two_pow · compiled type and proof/definition references.
The reciprocal dyadic tail has total mass at most two.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.sum_range_inv_two_pow_le_two · compiled type and proof/definition references.
The exact geometric payment in the proof of (3). The two source sums are
bounded respectively by 8Q and 2πN/D.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973_dyadic_scalar_sum_le · compiled type and proof/definition references.
Chen p. 114: summing the dyadic cells proves equation (3). We exhibit the
absolute constant 8 + 2π; the printed ≪ only records existence of such a
constant and has no dependence on a, M, N, D, or Q.
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973Lemma2_equationThree_of_equationTwo · compiled type and proof/definition references.
Chen's complete Lemma 2 reduction: the sharp Farey equation (4) gives the literal primitive equation (2), and its dyadic summation gives (3).
Inspect dependencies
AnalyticNumberTheory.LargeSieve.chen1973Lemma2_of_fareyEquationFour · compiled type and proof/definition references.