BooleanAnalysis.chiS_empty
theoremverifiedimported Lean
Empty-set Walsh character. The Walsh–Fourier character associated to the empty subset of $[n]$ is the constant function equal to $1$; that is, $\chi_\emptyset(x) = 1$ for every point $x$ of the Boolean hypercube $\{0,1\}^n$.
Statement
set_option maxHeartbeats 400000 in open scoped BigOperators in variable {n : ℕ} in @[simp] lemma BooleanAnalysis.chiS_empty : (BooleanAnalysis.chiS (∅ : Finset (Fin n))) = fun _ ↦ 1
- Source
- TCSlib, `BooleanAnalysis.chiS_empty`
- Lean proof
- By Jingzhen Sha, Allan Li, Hydroxyi, Mina, Owen McGinty (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.BooleanAnalysis.chiS_empty← BooleanAnalysis.chiS_empty (TCSlib/BooleanAnalysis/Basic.lean:171): adapted
What was changed in
BooleanAnalysis.chiS_empty--- TCSlib/BooleanAnalysis/Basic.lean:171 (BooleanAnalysis.chiS_empty) +++ as compiled here @@ -1,4 +1,6 @@ -/-- The character `χ_∅` is the constant function `1`. -/ +set_option maxHeartbeats 400000 in +open scoped BigOperators in +variable {n : ℕ} in @[simp] -lemma chiS_empty : χ_[(∅ : Finset (Fin n))] = fun _ ↦ 1 := by +lemma BooleanAnalysis.chiS_empty : (BooleanAnalysis.chiS (∅ : Finset (Fin n))) = fun _ ↦ 1 := by ext x; simp [chiS] - Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- BooleanAnalysis.chiSThe Walsh--Fourier character associated to $S\subseteq[n]$ is…
- Used by 1
- DecisionTree.signEval_eq_sum_coeffsWalsh expansion of a decision tree's sign function. Let $T$ be a decision tree on $n$ Boolean variables, computing the $\pm 1$-valued…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option maxHeartbeats 400000 inopen scoped BigOperators invariable {n : ℕ} in/-- The character `χ_∅` is the constant function `1`. -/@[simp]lemma BooleanAnalysis.chiS_empty : (BooleanAnalysis.chiS (∅ : Finset (Fin n))) = fun _ ↦ 1 := by ext x; simp [chiS]