Sum of Square Proof for Brascamp-Lieb Type Inequality

10/04/2017
by   Zhixian Lei, et al.
0

Brascamp-Lieb inequality is an important mathematical tool in analysis, geometry and information theory. There are various ways to prove Brascamp-Lieb inequality such as heat flow method, Brownian motion and subadditivity of the entropy. While Brascamp-Lieb inequality is originally stated in Euclidean Space, discussed Brascamp-Lieb inequality for discrete Abelian group and discussed Brascamp-Lieb inequality for Markov semigroups. Many mathematical inequalities can be formulated as algebraic inequalities which asserts some given polynomial is nonnegative. In 1927, Artin proved that any non- negative polynomial can be represented as a sum of squares of rational functions, which can be further formulated as a polynomial certificate of the nonnegativity of the polynomial. This is a Sum of Square proof of the inequality. Take the degree of the polynomial certificate as the degree of Sum of Square proof. The degree of an Sum of Square proof determines the complexity of generating such proof by Sum of Square algorithm which is a powerful tool for optimization and computer aided proof. In this paper, we give a Sum of Square proof for some special settings of Brascamp- Lieb inequality following and and discuss some applications of Brascamp-Lieb inequality on Abelian group and Euclidean Sphere. If the original description of the inequality has constant degree and d is constant, the degree of the proof is also constant. Therefore, low degree sum of square algorithm can fully capture the power of low degree finite Brascamp-Lieb inequality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2019

Entropy and Compression: A simple proof of an inequality of Khinchin-Ornstein-Shields

We prove that Entropy is a lower bound for the average compression ratio...
research
04/26/2023

On the Order of Power Series and the Sum of Square Roots Problem

This paper focuses on the study of the order of power series that are li...
research
03/04/2016

Finding best possible constant for a polynomial inequality

Given a multi-variant polynomial inequality with a parameter, how to fin...
research
05/21/2020

Chang's lemma via Pinsker's inequality

Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An en...
research
01/16/2017

On Bezout Inequalities for non-homogeneous Polynomial Ideals

We introduce a "workable" notion of degree for non-homogeneous polynomia...
research
09/29/2015

On a Conjecture of Cusick Concerning the Sum of Digits of n and n + t

For a nonnegative integer t, let c_t be the asymptotic density of natura...
research
02/25/2021

Semidefinite Relaxations of Products of Nonnegative Forms on the Sphere

We study the problem of maximizing the geometric mean of d low-degree no...

Please sign up or login with your details

Forgot password? Click here to reset