Version history

Submission versions

  1. lax-323828current version

    Håstad’s inapproximability of Max Clique

  2. lax-253009viewing

    Håstad’s inapproximability of Max Clique

    GitHub sourceShown on this page

Proof of `Fourier analysis on a finite Boolean cube` (2nd statement)

groundedproofs/Lax253009Proofs/BooleanFourier.lean · lax-253009

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Parseval also bounds the energy of the real-valued averaged tables used for side conditions, since every pointwise square is at most one.