Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width

preprint2012arXivOpen access

Abstract

A function f: {−1,1}n→Rf:\ \{-1,1\}^n\rightarrow \mathbb{R} is called pseudo-Boolean. It is well-known that each pseudo-Boolean function ff can be written as f(x)=∑I∈Ff^(I)χI(x),f(x)=\sum_{I\in {\cal F}}\hat{f}(I)χ_I(x), where F⊆{I: I⊆[n]}{\cal F}\subseteq \{I:\ I\subseteq [n]\}, [n]={1,2,...,n}[n]=\{1,2,...,n\}, and χI(x)=∏i∈Ixiχ_I(x)=\prod_{i\in I}x_i and f^(I)\hat{f}(I) are non-zero reals. The degree of ff is max⁡{∣I∣: I∈F}\max \{|I|:\ I\in {\cal F}\} and the width of ff is the minimum integer ρρ such that every i∈[n]i\in [n] appears in at most ρρ sets in F\cal F. For i∈[n]i\in [n], let xi\mathbf{x}_i be a random variable taking values 1 or -1 uniformly and independently from all other variables xj\mathbf{x}_j, j≠i.j\neq i. Let x=(x1,...,xn)\mathbf{x}=(\mathbf{x}_1,...,\mathbf{x}_n). The pp-norm of ff is ∣∣f∣∣p=(E[∣f(x)∣p])1/p||f||_p=(\mathbb E[|f(\mathbf{x})|^p])^{1/p} for any p≥1p\ge 1. It is well-known that ∣∣f∣∣q≥∣∣f∣∣p||f||_q\ge ||f||_p whenever q>p≥1q> p\ge 1. However, the higher norm can be bounded by the lower norm times a coefficient not directly depending on ff: if ff is of degree dd and q>p>1q> p>1 then ∣∣f∣∣q≤(q−1p−1)d/2∣∣f∣∣p. ||f||_q\le (\frac{q-1}{p-1})^{d/2}||f||_p. This inequality is called the Hypercontractive Inequality. We show that one can replace dd by ρρ in the Hypercontractive Inequality for each q>p≥2q> p\ge 2 as follows: ∣∣f∣∣q≤((2r)!ρr−1)1/(2r)∣∣f∣∣p, ||f||_q\le ((2r)!ρ^{r-1})^{1/(2r)}||f||_p, where r=⌈q/2⌉r=\lceil q/2\rceil. For the case q=4q=4 and p=2p=2, which is important in many applications, we prove a stronger inequality: ∣∣f∣∣4≤(2ρ+1)1/4∣∣f∣∣2. ||f||_4\le (2ρ+1)^{1/4}||f||_2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.