OAI/Combinatorics/LowSpaceSubsetSum/Storage/PermutationSamplerCells.lean

GitHub source file

7 declarations, 0 contain sorry, 0 declared as axioms

Stored bounded draws and permutation digits

Each finite-range call uses an explicit candidate array and releases it before the recursive tail. The conservative sum below also covers every retained digit, scalar counter, and recursive return frame. A failed head also counts the supplied but unread tail of the finite random-word tuple.

  1. def OAI.LowSpaceSubsetSum.PermutationSamplerCells.run line 18
  2. theorem OAI.LowSpaceSubsetSum.PermutationSamplerCells.run_value line 30
  3. theorem OAI.LowSpaceSubsetSum.PermutationSamplerCells.run_cells line 38
  4. def OAI.LowSpaceSubsetSum.PermutationSamplerCells.materialize line 52
  5. theorem OAI.LowSpaceSubsetSum.PermutationSamplerCells.materialize_value line 61
  6. theorem OAI.LowSpaceSubsetSum.PermutationSamplerCells.materialize_cells line 66
  7. theorem OAI.LowSpaceSubsetSum.PermutationSamplerCells.materialize_cells_scale line 73