OAI/Combinatorics/ContingencyTables/Dense/DenseTabulationScalarBounds.lean

GitHub source file

9 declarations, 0 contain sorry, 0 declared as axioms

Numeric dense-tabulation schedules versus binary margin size

  1. lemma OAI.ContingencyTables.DensePrograms.clog_succ_le_weight line 12
  2. def OAI.ContingencyTables.DensePrograms.offsetNumericMeasure line 16
  3. theorem OAI.ContingencyTables.DensePrograms.offsetLengths_sum_polynomial line 18
  4. def OAI.ContingencyTables.DensePrograms.trialNumericMeasure line 52
  5. theorem OAI.ContingencyTables.DensePrograms.trialWidth_polynomial line 54
  6. def OAI.ContingencyTables.DensePrograms.canonicalNumericMeasure line 84
  7. theorem OAI.ContingencyTables.DensePrograms.rawTrialBits_polynomial line 86
  8. def OAI.ContingencyTables.DensePrograms.rawBoxMeasure line 105

    Source documentation

    Only the two finite boxes contribute an exponential factor; the numeric walk, rejection and reserved-word schedules are polynomial.

    def rawBoxMeasure (z : CanonicalParameters) : ℕ :=
…

    Mentions: OAI.ContingencyTables.DensePrograms.CanonicalParameters

  9. theorem OAI.ContingencyTables.DensePrograms.rawTabulationMeasure_polynomial line 109