Search arXivSearch

arXiv · 2510.13705

VC-Dimension vs Degree: An uncertainty principle for Boolean functions

Abstract

We prove a support--shattering uncertainty principle for functions on the Boolean cube. Let $\mathbb{F}$ be any field and let $f:\{0,1\}^n\to\mathbb{F}$ be nonzero. If $x^S$ is a maximum-degree monomial in the multilinear representation of $f$, then $\mathrm{supp}(f)$ shatters $S^c$. Consequently, \[ \mathrm{VC}(\mathrm{supp}(f))+\mathrm{deg}_{\mathbb{F}}(f)\ge n . \] For Boolean-valued functions this yields both the real-degree and algebraic-degree forms of the inequality. We derive several consequences. The real Fourier support of a nonzero Boolean function satisfies \[ \mathrm{VC}(\mathrm{Spec}(f))\ge \mathrm{deg}_{\mathbb{F}_2}(f), \qquad \mathrm{VC}(\mathrm{supp}(f))+\mathrm{VC}(\mathrm{Spec}(f))\ge n . \] The same principle gives a low-degree-obstruction proof of the Sauer--Shelah lemma and a product-space analogue based on the Efron--Stein decomposition, recovering the Karpovsky--Milman multivalued Sauer lemma. We also obtain polynomial-method applications, including an arbitrary-field Sziklai--Weiner lower bound and a shattering theorem for null designs, and discuss sharpness and equality examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fan Chang, Yijia Fang. 2026-08-11. VC-Dimension vs Degree: An uncertainty principle for Boolean functions. https://arxiv.org/abs/2510.13705

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO