AFTD Auto-Formalizing Theoretical Domains

spectral_norm_c

def

The spectral norm ||f_hat||_1 of a function f : (Fin n -> Bool) -> ℂ is defined as the sum over all subsets S of Fin n of the absolute value of the Fourier coefficient f_hat(S) = 2^(-n) * ∑_x f(x) ∏_{i ∈ S} (if x(i) then -1 else 1).

Statement

noncomputable def spectral_norm_c {n : ℕ} (f : (Fin n → Bool) → ℂ) : ℝ
Defined in
scout/2611-06451-fourier-entropy-bounds-via-approximations.md:502
Verified
05 Nov 2026
Axioms
none listed
Used by 1
  • fourier_entropy_block_boundLet f, P : (Fin n → Bool) → ℂ and let T be a set of frequencies with non-zero Fourier coefficients |f_hat(S)| > 0 such that |f_hat(S)| ≤ 2…

Read back from the Lean

Given a natural number n and a function f : (Fin n → Bool) → ℂ, spectral_norm_c f is defined as the real number obtained by summing over all subsets S : Finset (Fin n) the complex norm (absolute value) of: (1 / 2^n) * ∑ x : Fin n → Bool, f x * ∏ i ∈ S, (if x i then -1 else 1) that is, the sum of the absolute values of the Fourier coefficients of f on the Boolean hypercube.

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

/-- Spectral norm (L1 norm of Fourier coefficients) of a complex function on the Boolean hypercube. -/
noncomputable def spectral_norm_c {n : ℕ} (f : (Fin n → Bool) → ℂ) : ℝ := ∑ S : Finset (Fin n), ‖(1 / (2 : ℂ) ^ n) * ∑ x : Fin n → Bool, f x * (∏ i ∈ S, if x i then (-1 : ℂ) else 1)‖
See it in the graphDiscuss this resultChallenge it