Documentation

LeanPool.AaronsonAmbainis.Chain

The chain #

This file chains the links of the proof of the paper: every theorem below is one implication, applied to theorems that precede it.

Boolean functions (directories DetLow, DetBij, TwoSided):

Real functions with a row of cost at most K at every point (directories Level, Average):

Bounded functions of degree at most d (directories Row, Pack, Dual):

The theorems for bounded functions of degree at most d (MainTheorem.lean):

All theorems of this file except the last one have no hypothesis. The hypothesis of the last one, mainTheoremImproved_of_rowBound : RowBound → MainTheoremImproved, is RowBound, the row bound of Agarwal and Ben-David (Theorem 1.7 of arXiv:2410.19062), which is not proved in this project. The two-sided inequality is a result of the paper in its own right; the main theorem does not use it.

Boolean functions #

The antipodal inequality (the inequality of Theorem 4.3 of the paper), with no hypothesis.

The all-pairs inequality (the inequality of Proposition 5.2 of the paper), with no hypothesis.

The two-sided inequality (the inequality of Theorem 5.4 of the paper), with no hypothesis.

Real functions with a row at every point #

The integrated all-pairs inequality (the inequality of Proposition 7.4 of the paper), with no hypothesis.

The third-moment inequality (Theorem 7.6 of the paper), with no hypothesis.

The bound for the mean absolute increments (Theorem 7.10 of the paper), with no hypothesis.

The bound for the influences (Theorem 8.3 of the paper), with no hypothesis.

Bounded functions of degree at most d #

The sensitivity bound at every point (Corollary 6.10 of the paper), with no hypothesis.

The packing bound (Lemma 6.5 of the paper), with no hypothesis.

The row bound (Theorem 6.8 of the paper: rows of cost at most π² d²), with no hypothesis.

The theorems for bounded functions of degree at most d #

The main theorem (Theorem 1.1 of the paper), with no hypothesis.

The bound for the mean absolute increments of a bounded function of degree at most d (Corollary 7.11 of the paper), with no hypothesis.

The row bound of Agarwal and Ben-David, which is a hypothesis here, implies the main theorem with the constant 3125 π^8 (Remark 8.4 of the paper).