symmetric_counterexample_func_eight
The eight-variable symmetric Boolean function F_8 = 1 + σ_2 + σ_4 on (Fin 8 → ZMod 2), defined as the sum modulo two of 1 and the elementary symmetric Boolean polynomials of degrees 2 and 4.
Statement
def symmetric_counterexample_func_eight (x : Fin 8 → ZMod 2) : ZMod 2- Defined in
- arXiv:2611.06744 Theorem 1 and Section 4
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Used by 3
- symmetric_counterexample_func_eight_eqThe symmetric Boolean function symmetric_counterexample_func 8 on (Fin 8 → ZMod 2) equals symmetric_counterexample_func_eight.
- symmetric_counterexample_eight_not_bentThe eight-variable symmetric Boolean function F_8 is not bent.
- symmetric_counterexample_eight_ne_zeroThe eight-variable symmetric Boolean function F_8 is not identically zero.
Read back from the Lean
The definition of a function symmetric_counterexample_func_eight that maps an input vector $x : \text{Fin } 8 \to \mathbb{Z}/2\mathbb{Z}$ to $\mathbb{Z}/2\mathbb{Z}$, given by $1 + \sum_{s} \prod_{i \in s} x(i) + \sum_{t} \prod_{j \in t} x(j)$, where the first sum runs over all subsets $s \subseteq \text{Fin } 8$ of size 2, and the second sum runs over all subsets $t \subseteq \text{Fin } 8$ of size 4 (i.e., $1 + e_2(x) + e_4(x)$ evaluated in $\mathbb{Z}/2\mathbb{Z}$).
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 eight-variable symmetric Boolean function F_8 = 1 + σ_2 + σ_4. -/ def symmetric_counterexample_func_eight (x : Fin 8 → ZMod 2) : ZMod 2 := 1 + (∑ s ∈ Finset.powersetCard 2 Finset.univ, ∏ i ∈ s, x i) + (∑ s ∈ Finset.powersetCard 4 Finset.univ, ∏ i ∈ s, x i)