While this submission is a draft, it cannot be used by other submissions.

Second moment and tail bound for the high-degree CNA term

Lax253009.HighDegreeSoundness · concepts/Lax253009/HighDegreeSoundness.lean · lax-253009

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Normalize the first Fourier term by averaging over balanced predicates. If its supports have size at least ℓ\ell and its coefficients have total squared mass at most one, its second moment is at most qℓ+2(N+1)e−Nq2/2q^\ell+2(N+1)e^{-Nq^2/2} for every q≥0q\geq0, where NN is the number of inputs to a predicate. Its upper tail at a>0a>0 is bounded by this quantity divided by a2a^2.

    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 q=N−1/4q=N^{-1/4} yields the required high-degree decay.

    Concept map
    6 concepts; 4 descendants hidden
    100%
    Proven claimThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax253009.BalancedPredicates
    2import Lax253009.ProductMoments
    3
    4/-!
    5---
    6title: Second moment and tail bound for the high-degree CNA term
    7type: theorem
    8---
    9Normalize the first Fourier term by averaging over balanced predicates.
    10If its supports have size at least ℓ\ell and its coefficients have total
    11squared mass at most one, its second moment is at most
    12qℓ+2(N+1)e−Nq2/2q^\ell+2(N+1)e^{-Nq^2/2} for every q≥0q\geq0, where NN is the number of
    13inputs to a predicate. Its upper tail at a>0a>0 is bounded by this quantity
    14divided by a2a^2.
    15
    16This is the normalized version of the estimates in Lemma 4.5 and Corollary
    174.6, with the concentration bound obtained by conditioning on balance.
    18The choice q=N−1/4q=N^{-1/4} yields the required high-degree decay.
    19-/
    20
    21namespace Lax253009.HighDegreeSoundness
    22
    23open BooleanFourier BalancedPredicates FiniteProbability
    24open scoped BigOperators
    25
    26noncomputable 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
    30axiom 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
    39axiom 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
    49end Lax253009.HighDegreeSoundness
    50
    Show ProofShow Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…