OAI/NumberTheory/TwoPointCorrelations/HalaszDoubleConvolution.lean
3 declarations, 0 contain sorry, 0 declared as axioms
Apply the prime convolution a second time, retaining the varying denominator log(N/p). This is the adaptive triple sum in the short proof of Halasz's theorem.
- def
OAI.TwoPointCorrelations.halaszDoubleConvolutionline 15Also declared: OAI/NumberTheory/TwoPoint/Halasz/HalaszDoubleConvolution.lean:15 (same declaration text).
- lemma
OAI.TwoPointCorrelations.halasz_divisor_cutoffline 20Also declared: OAI/NumberTheory/TwoPoint/Halasz/HalaszDoubleConvolution.lean:20 (same declaration text).
- theorem
OAI.TwoPointCorrelations.halasz_double_convolution_errorline 35Also declared: OAI/NumberTheory/TwoPoint/Halasz/HalaszDoubleConvolution.lean:35 (same declaration text).