Dimension-independent bounds for weighted double covers
Lax253009.DoubleCoverBounds · concepts/Lax253009/DoubleCoverBounds.lean · lax-253009
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Let nonnegative coefficients be supported on sets of size at most , with . For every , the sum of over double-cover tuples is bounded by a constant depending only on , not on the underlying coordinate set. We give the explicit, nonoptimal bound .
This is the normalized form of Lemma 4.15 needed for the small-coefficient analysis. The proof uses a centered variable equal to 3 with probability 1/4 and -1 otherwise. Its moments vanish at order one and are at least one at every order at least two. Representing it on two Boolean coordinates allows the low-degree moment bound to control all double-cover terms.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax253009.HigherMoments |
| 2 | import Lax253009.Hypercontractivity |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Dimension-independent bounds for weighted double covers |
| 7 | type: theorem |
| 8 | --- |
| 9 | Let nonnegative coefficients be supported on sets of size at most |
| 10 | , with . For every , the sum of |
| 11 | over double-cover tuples is bounded by a constant |
| 12 | depending only on , not on the underlying coordinate set. |
| 13 | We give the explicit, nonoptimal bound . |
| 14 | |
| 15 | This is the normalized form of Lemma 4.15 needed for the small-coefficient |
| 16 | analysis. The proof uses a centered variable equal to 3 with probability |
| 17 | 1/4 and -1 otherwise. Its moments vanish at order one and are at least one |
| 18 | at every order at least two. Representing it on two Boolean coordinates |
| 19 | allows the low-degree moment bound to control all double-cover terms. |
| 20 | -/ |
| 21 | |
| 22 | namespace Lax253009.DoubleCoverBounds |
| 23 | |
| 24 | open HigherMoments |
| 25 | open scoped BigOperators |
| 26 | |
| 27 | noncomputable def weight {ι : Type} [Fintype ι] [DecidableEq ι] |
| 28 | (c : Finset ι → ℝ) (m : ℕ) : ℝ := by |
| 29 | classical |
| 30 | exact ∑ S : Fin m → Finset ι, if DoubleCover S then ∏ j, c (S j) else 0 |
| 31 | |
| 32 | axiom bound {ι : Type} [Fintype ι] [DecidableEq ι] |
| 33 | (c : Finset ι → ℝ) (l m : ℕ) (hc : ∀ S, 0 ≤ c S) |
| 34 | (hdegree : ∀ S, l < S.card → c S = 0) (henergy : ∑ S, c S ^ 2 ≤ 1) : |
| 35 | weight c m ≤ 1 + (3 : ℝ) ^ (l * (2 * m + 1) * 2 ^ m) |
| 36 | |
| 37 | end Lax253009.DoubleCoverBounds |
| 38 |
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments