AFTD Auto-Formalizing Theoretical Domains

KKL.IsJunta

defimported Lean

A function $g$ is a $J$-junta if it depends only on the coordinates in $J$: whenever $x$ and $y$ agree on every $i \in J$, we have $g(x) = g(y)$.

Statement

set_option maxHeartbeats 800000 in
open scoped BigOperators in
open BooleanAnalysis in
variable {n : ℕ} in
open Classical in
def KKL.IsJunta (g : BooleanFunc n) (J : Finset (Fin n)) : Prop
Defined in
TCSlib, `KKL.IsJunta`
Lean proof
By Mina, Owen McGinty, Hydroxyi (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.
Verified
07 Oct 2026
Axioms
none listed
Built on 2
Used by 2
  • KKL.friedgut_juntaFriedgut's junta theorem. Let $f : \{0,1\}^n \to \{-1,1\}$ be a $\pm 1$-valued Boolean function with total influence $I[f]$, and let…
  • KKL.lowDegreePart_depends_on_influentialLow-degree part is close to a junta on the influential coordinates. Let $f:\{0,1\}^n\to\bbr$ be a Boolean function, let $k$ be a natural…

Lean source view module on GitHub

set_option maxHeartbeats 800000 in
open scoped BigOperators in
open BooleanAnalysis in
variable {n : ℕ} in
open Classical in
/-- Defines a `J`-junta as a function depending only on coordinates in `J`. **Source:** [OD14, Ch. 10]. -/
def KKL.IsJunta (g : BooleanFunc n) (J : Finset (Fin n)) : Prop :=
  ∀ x y : BoolCube n, (∀ i ∈ J, x i = y i) → g x = g y
See it in the graphDiscuss this resultChallenge it