AFTD Auto-Formalizing Theoretical Domains

uniform_hash_measure

def

The uniform probability measure on sequences of n independent uniform home slots in ZMod n.

Statement

noncomputable def uniform_hash_measure (n : ℕ) [NeZero n] : MeasureTheory.Measure (Fin n → ZMod n)
Defined in
arXiv:2610.15776
Verified
03 Nov 2026
Axioms
none listed

Read back from the Lean

Given a natural number $n$ with hypothesis $n \neq 0$ (NeZero n), uniform_hash_measure n is defined as the measure on the function type Fin n → ZMod n obtained by scaling the counting measure (MeasureTheory.Measure.count) by the factor $((n : \text{ENNReal})^n)^{-1}$.

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

/-- Uniform probability measure on hash table home slot sequences of length n. -/
noncomputable def uniform_hash_measure (n : ℕ) [NeZero n] : MeasureTheory.Measure (Fin n → ZMod n) :=
  ((n : ENNReal) ^ n)⁻¹ • (MeasureTheory.Measure.count : MeasureTheory.Measure (Fin n → ZMod n))
See it in the graphDiscuss this resultChallenge it