AFTD Auto-Formalizing Theoretical Domains

is_uniform_fhs

def

A frequency hopping sequence X : Fin (k * s) → Fin s is uniform if each symbol f ∈ Fin s occurs exactly k times in X.

Statement

def is_uniform_fhs (k s : ℕ) (X : Fin (k * s) → Fin s) : Prop
Defined in
arXiv:2611.11747, Section 1
Verified
10 Nov 2026
Axioms
none listed

Read back from the Lean

Given natural numbers k and s, and a function X from Fin (k * s) to Fin s, is_uniform_fhs k s X is the proposition that for every f in Fin s, the number of indices j in Fin (k * s) such that X j = f is equal to k (that is, every element of Fin s has exactly k preimages under X).

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

/-- A frequency hopping sequence of period k * s is uniform if each symbol appears k times -/
def is_uniform_fhs (k s : ℕ) (X : Fin (k * s) → Fin s) : Prop := ∀ f : Fin s, (Finset.univ.filter (fun j => X j = f)).card = k
See it in the graphDiscuss this resultChallenge it