OAI/NumberTheory/Ostmann/Arithmetic/MovingSampleSizes.lean

GitHub source file

8 declarations, 0 contain sorry, 0 declared as axioms

Concrete degree budgets for the sampled moving-giant paths

  1. def OAI.Ostmann.MovingLeafLengthLE line 9
  2. theorem OAI.Ostmann.moving_flatten_length_le line 13
  3. theorem OAI.Ostmann.moving_append_length_le line 25
  4. theorem OAI.Ostmann.moving_compensation_length line 36
  5. def OAI.Ostmann.MovingSlotData.SizeLE line 43
  6. theorem OAI.Ostmann.MovingSlotData.SizeLE.mono line 48
  7. theorem OAI.Ostmann.buildMovingSlotData_size line 56

    Source documentation

    Compensation adds exactly four labels per bottom leaf per level.

    theorem buildMovingSlotData_size {σ : Type*} (n : ℕ) (t : FrequencyTree ℤ n)
    (small bulk : TreeLeafTuple (List σ) n) (samples : MovingSampleSlots σ n)
    (A B : ℕ) (hsmall : MovingLeafLengthLE n small A) (hbulk : MovingLeafLengthLE n bulk B) :
    (buildMovingSlotData n t small bulk samples).SizeLE (2 ^ n * (A + B + 4 * n + 4)) := by
…

    Mentions: OAI.Ostmann.FrequencyTree, OAI.Ostmann.TreeLeafTuple, OAI.Ostmann.MovingSampleSlots, OAI.Ostmann.MovingLeafLengthLE, OAI.Ostmann.buildMovingSlotData

  8. theorem OAI.Ostmann.MovingSlotData.occurrence_size line 88