AFTD Auto-Formalizing Theoretical Domains

hash_fully_occupied_seqs

def

The set of sequences A : Fin t → ZMod n such that hash_occupy_count n r S (List.ofFn A) = S.card, filtering Finset.univ.

Statement

def hash_fully_occupied_seqs (n : ℕ) [NeZero n] (r : Fin n → ZMod n) (S : Finset (ZMod n)) (t : ℕ) :
    Finset (Fin t → ZMod n)
Defined in
arXiv:2610.31363 Definition 3.2
Verified
23 Oct 2026
Axioms
none listed
Built on 1
  • hash_occupy_countThe number of slots in S : Finset (ZMod n) that are occupied after inserting the list A : List (ZMod n) into an initially empty table of…
Used by 1
  • hash_count_fully_occupiedThe cardinality of hash_fully_occupied_seqs n r S t, giving the number of length-t sequences in Fin t → ZMod n that fully occupy S.

Read back from the Lean

Given a positive integer $n$ (via [NeZero n]), a probe offset function $r : \text{Fin } n \to \mathbb{Z}/n\mathbb{Z}$, a target subset of slots $S \subseteq \mathbb{Z}/n\mathbb{Z}$, and a sequence length $t : \mathbb{N}$, hash_fully_occupied_seqs n r S t is the finite set of all sequences $A : \text{Fin } t \to \mathbb{Z}/n\mathbb{Z}$ for which the count of occupied slots that fall in $S$ after sequentially inserting the elements of $A$ (as a list) using probe function $r$ is equal to the cardinality of $S$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The set of length-t sequences that fully occupy target slot set S. -/
def hash_fully_occupied_seqs (n : ℕ) [NeZero n] (r : Fin n → ZMod n) (S : Finset (ZMod n)) (t : ℕ) :
    Finset (Fin t → ZMod n) := Finset.univ.filter (fun A => hash_occupy_count n r S (List.ofFn A) = S.card)
See it in the graphDiscuss this resultChallenge it