Second moment and tail bound for the high-degree CNA term
Lax253009.HighDegreeSoundness · concepts/Lax253009/HighDegreeSoundness.lean · lax-253009
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Normalize the first Fourier term by averaging over balanced predicates. If its supports have size at least and its coefficients have total squared mass at most one, its second moment is at most for every , where is the number of inputs to a predicate. Its upper tail at is bounded by this quantity divided by .
This is the normalized version of the estimates in Lemma 4.5 and Corollary 4.6, with the concentration bound obtained by conditioning on balance. The choice yields the required high-degree decay.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax253009.BalancedPredicates |
| 2 | import Lax253009.ProductMoments |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Second moment and tail bound for the high-degree CNA term |
| 7 | type: theorem |
| 8 | --- |
| 9 | Normalize the first Fourier term by averaging over balanced predicates. |
| 10 | If its supports have size at least and its coefficients have total |
| 11 | squared mass at most one, its second moment is at most |
| 12 | for every , where is the number of |
| 13 | inputs to a predicate. Its upper tail at is bounded by this quantity |
| 14 | divided by . |
| 15 | |
| 16 | This is the normalized version of the estimates in Lemma 4.5 and Corollary |
| 17 | 4.6, with the concentration bound obtained by conditioning on balance. |
| 18 | The choice yields the required high-degree decay. |
| 19 | -/ |
| 20 | |
| 21 | namespace Lax253009.HighDegreeSoundness |
| 22 | |
| 23 | open BooleanFourier BalancedPredicates FiniteProbability |
| 24 | open scoped BigOperators |
| 25 | |
| 26 | noncomputable def normalizedSum {ι κ : Type} [Fintype κ] [DecidableEq κ] |
| 27 | (supports : Finset (Finset ι)) (c : Finset ι → ℝ) (n : ℕ) (f : ι → κ) : ℝ := |
| 28 | ∑ S ∈ supports, c S * (𝔼 B : predicates κ n, ∏ i ∈ S, sign (B.val (f i))) |
| 29 | |
| 30 | axiom second_moment_bound {ι κ : Type} [Fintype ι] [DecidableEq ι] |
| 31 | [Fintype κ] [DecidableEq κ] [Nonempty κ] |
| 32 | (n : ℕ) (hn : 0 < n) (hN : Fintype.card κ = 2 * n) |
| 33 | (supports : Finset (Finset ι)) (c : Finset ι → ℝ) (l : ℕ) |
| 34 | (hdegree : ∀ S ∈ supports, l ≤ S.card) (henergy : ∑ S ∈ supports, c S ^ 2 ≤ 1) |
| 35 | (q : ℝ) (hq : 0 ≤ q) : |
| 36 | (𝔼 f : ι → κ, normalizedSum supports c n f ^ 2) ≤ |
| 37 | q ^ l + 2 * (Fintype.card κ + 1 : ℝ) * Real.exp (-(Fintype.card κ : ℝ) * q ^ 2 / 2) |
| 38 | |
| 39 | axiom tail_bound {ι κ : Type} [Fintype ι] [DecidableEq ι] |
| 40 | [Fintype κ] [DecidableEq κ] [Nonempty κ] |
| 41 | (n : ℕ) (hn : 0 < n) (hN : Fintype.card κ = 2 * n) |
| 42 | (supports : Finset (Finset ι)) (c : Finset ι → ℝ) (l : ℕ) |
| 43 | (hdegree : ∀ S ∈ supports, l ≤ S.card) (henergy : ∑ S ∈ supports, c S ^ 2 ≤ 1) |
| 44 | (q : ℝ) (hq : 0 ≤ q) (a : ℝ) (ha : 0 < a) : |
| 45 | probability (fun f : ι → κ ↦ a ≤ normalizedSum supports c n f) ≤ |
| 46 | (q ^ l + 2 * (Fintype.card κ + 1 : ℝ) * |
| 47 | Real.exp (-(Fintype.card κ : ℝ) * q ^ 2 / 2)) / a ^ 2 |
| 48 | |
| 49 | end Lax253009.HighDegreeSoundness |
| 50 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments