OAI/NumberTheory/JointDickman/Amplification/BinMarginalInput.lean

GitHub source file

7 declarations, 0 contain sorry, 0 declared as axioms

The published one-variable distribution input

G. Tenenbaum, A rate estimate in Billingsley's theorem for the size distribution of large prime factors, Quart. J. Math. 51 (2000), 385–403: the unnumbered main Theorem, parts (i), (iii) at H = 0, equations (1.1), (1.3), and the multiplicity remark following (1.7), printed pp. 386–388. Author's corrected version: https://tenenb.perso.math.cnrs.fr/PPP/Billingsley.pdf

The input below is only its finite-bin consequence. Thresholds are the fixed positive numbers k/J; hence finitely many ranks suffice. Continuity of the limiting distribution permits replacing the counting endpoint by A*x and the rank thresholds by powers of x. Its first-rank marginal is the classical Dickman law. No statement about two different integers, residue restrictions, weights, or short intervals is included.

  1. abbrev OAI.JointDickman.BinCountState line 26
  2. def OAI.JointDickman.canonicalBinVector line 28
  3. def OAI.JointDickman.binStateDensity line 32
  4. def OAI.JointDickman.PublishedInputs.FiniteBinDistributionInput line 39

    Source documentation

    Finite-bin specialization of Tenenbaum (2000), main Theorem (i),(iii), including the stated multiplicity version.

    def FiniteBinDistributionInput : Prop :=
    …
  5. theorem OAI.JointDickman.canonicalBinVector_val line 50
  6. theorem OAI.JointDickman.finite_state_sum line 57
  7. theorem OAI.JointDickman.canonical_binLabel_mean line 66