Documentation

MathlibNt.AnalyticNumberTheory.Chen1973.Chen1973Lemma6Equation19SourceParameters

Chen 1973, Lemma 6, equation (19): source parameters #

This module freezes the literal positive-level parameter domain on p. 122. The conductor cell is L*2^(level-1) < d ≤ L*2^level, the pair cell is B*2^k < p₁p₂ ≤ B*2^(k+1). The legacy height helpers in this module use the actual maximum W, not the printed exponential I. The genuine source height ⌈2^level (log x)^200 I_{level,x}⌉₊ is defined in SourceWeightHeight.

No final-payment hypothesis is stored in the source packet. The final logarithmic payments below are proved from explicit large-x inequalities. Any constant coming from a source is therefore quantified once, before all cell parameters.

Lower endpoint of the positive-level conductor cell.

Equations
Instances For

    Upper endpoint of the positive-level conductor cell.

    Equations
    Instances For

      Lower endpoint of the equation-(19) prime-pair shell.

      Equations
      Instances For

        Upper endpoint of the equation-(19) prime-pair shell.

        Equations
        Instances For

          The real legacy W-based cutoff; not the printed exponential-I height.

          Equations
          Instances For

            Literal p. 122 positive-level equation-(19) domain.

            lastD is Chen's final conductor cutoff occurring in the branch split. It is not confused with the lower endpoint chen1973Lemma6Eq19SourceD L level. The real-to-natural identifications L ≈ (log x)^100 and B ≈ x^(13/30) are kept as exact two-sided rounding inequalities.

            Instances For

              The actual conductor carrier lies in the literal positive-level interval.

              Closed-interval form required by the fourth-moment input.

              Every pair in the actual filtered shell has the printed dyadic product bounds.

              theorem AnalyticNumberTheory.LargeSieve.chen1973Lemma6_eq19_first_log_payment {x C : } (_hx : 0 < x) (hlog : 0 < Real.log x) :
              x * Real.log x ^ 2 * (C / Real.log x ^ 22) = C * x / Real.log x ^ 20

              Exact payment of the first log² contour prefactor.

              theorem AnalyticNumberTheory.LargeSieve.chen1973Lemma6_eq19_second_power_payment {x C : } (hx : 0 < x) (_hlog : 0 < Real.log x) :
              x ^ (1 / 2) * (C * x ^ (1 / 2) / Real.log x ^ 20) = C * x / Real.log x ^ 20

              Exact payment of the printed square-root contour prefactor against a square-root-sized second-integral bound.

              theorem AnalyticNumberTheory.LargeSieve.chen1973Lemma6_eq19_absorb_global_constant (Cabs : ) {x : } (_hC : 0 Cabs) (hlog : 1 Real.log x) {a b : } (hab : a b) (hlarge : Cabs Real.log x ^ (b - a)) :
              Cabs * Real.log x ^ a Real.log x ^ b

              Uniform polylogarithmic absorption. The absolute constant is selected before x and before every cell parameter; hlarge is the explicit large-x threshold.

              theorem AnalyticNumberTheory.LargeSieve.chen1973Lemma6_eq19_absorb_global_constant_div (Cabs : ) {x : } (hC : 0 Cabs) (hlog : 1 Real.log x) {a b target : } (hba : a + target b) (hlarge : Cabs Real.log x ^ (b - (a + target))) :
              Cabs * Real.log x ^ a / Real.log x ^ b 1 / Real.log x ^ target

              Division form used when a source contributes one global absolute constant. There is no cell-wise or height-wise existential constant.