Documentation

LeanPool.AaronsonAmbainis.Main

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.

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.