The Aaronson–Ambainis conjecture: the final theorems #
The statements proved here are the propositions of LeanPool/AaronsonAmbainis/Conjecture.lean.
That file imports only Mathlib and uses no definition of this project, so it is enough to read
it in order to know what has been proved.
aaronson_ambainis— the conjecture of Aaronson and Ambainis (Conjecture 6 of arXiv:0911.0996v3; Conjecture 1.7 of the journal version) with the exponent7in place ofO(1): a polynomialpof degree at mostdwith0 ≤ p ≤ 1on{0,1}^Nand variance at leastε > 0has a variable of influence at least(ε/d)^7.aaronson_ambainis_explicit— the same with the lower bound(8 √15 / (125 π^4)) ε^{5/2} / d^6.aaronson_ambainis_pm— Theorem 1.1 of the upstream paper on the cube{-1,1}^n(the bittrueis1, the bitfalseis-1), for polynomials with values in[-1,1], with the lower bound(√15 / (500 π^4)) ε^{5/2} / d^6.aaronson_ambainis_of_fbsDegreeBound— the lower bound(32 √15 / (125 π^4)) ε^{5/2} / d^6, under the hypothesisFbsDegreeBound, which is Theorem 1.7 of Agarwal and Ben-David (arXiv:2410.19062) as printed.
The first three theorems have no hypothesis. The proofs are assembled in Chain.lean (the chain
of the links, from the determinant inequality to the main theorem on the cube) and in
Bridge/Capstone.lean (the passage from the definitions of the project to the statements of
Conjecture.lean).
The Aaronson–Ambainis conjecture, as printed, with the exponent 7 for O(1).
The Aaronson–Ambainis conjecture with the explicit lower bound
(8 √15 / (125 π^4)) ε^{5/2} / d^6.
Theorem 1.1 of the upstream paper on the cube
{-1,1}^n, with the explicit lower bound (√15 / (500 π^4)) ε^{5/2} / d^6.
The explicit lower bound (32 √15 / (125 π^4)) ε^{5/2} / d^6, from Theorem 1.7 of
arXiv:2410.19062, which is a hypothesis here.