Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Lev: On Isoperimetric Stability


Library card.

Vsevolod F. Lev, "On Isoperimetric Stability," arXiv:1709.05539 (2017).

Overview

The paper studies an edge-isoperimetric stability question in an abelian group GG. For finite A,S⊆GA,S\subseteq G, it defines

∂S(A)=∣{(a,s)∈A×S:a+s∉A}∣\partial_S(A)=|\{(a,s)\in A\times S:a+s\notin A\}|

and asks how large AA must be when ∂S(A)≤(1−γ)∣S∣∣A∣\partial_S(A)\le (1-\gamma)|S||A|. Its central hypothesis is that SS is independent, meaning that ∑s∈Sk(s)s=0\sum_{s\in S}k(s)s=0 with integer coefficients forces every summand to vanish, equivalently ⨁s∈S⟨s⟩\bigoplus_{s\in S}\langle s\rangle is direct.

The principal result, Theorem 2 in Section 1, states that if SS is finite, nonempty, and independent, n=∣S∣n=|S|, and d=min⁡s∈Sord⁡(s)d=\min_{s\in S}\operatorname{ord}(s), then

∂S(A)≤(1−γ)n∣A∣⟹∣A∣≥4(1−1/d)γn.\partial_S(A)\le(1-\gamma)n|A|\quad\Longrightarrow\quad |A|\ge 4^{(1-1/d)\gamma n}.

When all elements of SS have infinite order, the asserted interpretation is ∣A∣≥4γn|A|\ge4^{\gamma n}. Example 3 shows that the base 44 cannot in general be increased: boxes [0,t−1]n⊆Cmn[0,t-1]^n\subseteq C_m^n, with t=2t=2, attain that scale. Example 2 shows optimality of the factor 1−1/d1-1/d when d=2d=2, and that for d=3d=3 it cannot be replaced by a number larger than log⁡3/log⁡4≈0.792\log3/\log4\approx0.792.

For homocyclic groups of exponent 22, 33, or 44, Theorem 1 gives the stronger conclusion ∣A∣≥∣G∣γ|A|\ge |G|^\gamma when SS generates GG and ∂S(A)≤(1−γ)(rk⁡G)∣A∣\partial_S(A)\le(1-\gamma)(\operatorname{rk}G)|A|. This is deduced in Section 3 from the cited result [L15, Corollary 1.10], not proved independently from first principles in this paper. Corollary 1 extends the conclusion to arbitrary SS in groups of exponent 22 or 33, with GG replaced by H=⟨S⟩H=\langle S\rangle. Examples 1–3 delimit these statements: replacing rank by ∣S∣|S| can fail, and the ∣G∣γ|G|^\gamma conclusion does not extend uniformly to larger exponents.

The auxiliary combinatorial result is Theorem 3 (equivalently Theorem 3′3'): every finite nonempty downset A⊆Z≥0nA\subseteq\mathbb Z_{\ge0}^n satisfies

1∣A∣∑a∈Aw(a)≤12log⁡2∣A∣,\frac1{|A|}\sum_{a\in A}w(a)\le\frac12\log_2|A|,

where w(a)w(a) is the number of nonzero coordinates. Equality occurs for boxes whose side lengths are 00 or 11. Section 2 proves this by double induction on nn and ∣A∣|A|. After splitting the top coordinate layer from the remainder, inequalities (2) and (3) invoke the induction hypotheses, while inequality (4) reduces the required recombination to

1+12τlog⁡2τ≤12(τ+1)log⁡2(τ+1),τ≥1.1+\tfrac12\tau\log_2\tau\le\tfrac12(\tau+1)\log_2(\tau+1),\qquad \tau\ge1.

Section 3 develops coordinate compressions along the independent generators. Claim 1 shows that compression in one direction preserves compression already achieved in another; Claim 2 shows that compression does not increase any directed boundary contribution and hence does not increase ∂S(A)\partial_S(A). Corollary 2 transports Theorem 3 to compressed subsets of a direct sum of cyclic groups. In the proof of Theorem 2, equations (6) and (7) express the boundary through occupied and full cyclic cosets, equation (8) compares these quantities using the least order dd, and equation (9), together with Corollary 2, sandwiches the average support size between (1−1/d)γn(1-1/d)\gamma n and 12log⁡2∣A∣\frac12\log_2|A|.

The main application concerns popular differences. For finite A⊆GA\subseteq G,

Pγ(A)={g:rA(g)≥γ∣A∣},rA(g)=∣{(a,a′)∈A2:g=a−a′}∣.P_\gamma(A)=\{g:r_A(g)\ge\gamma|A|\},\qquad r_A(g)=|\{(a,a')\in A^2:g=a-a'\}|.

Theorem 4 bounds the maximum size dim⁡I(Pγ(A))\dim_I(P_\gamma(A)) of an independent subset by

dim⁡I(Pγ(A))≤γ−1log⁡2∣A∣2(1−1/p),\dim_I(P_\gamma(A))\le \frac{\gamma^{-1}\log_2|A|}{2(1-1/p)},

where pp is the least order of a nonzero group element; for exponent 33 it gives the sharper dim⁡I(Pγ(A))≤γ−1log⁡3∣A∣\dim_I(P_\gamma(A))\le\gamma^{-1}\log_3|A|. Section 4 proves this by observing that an independent S⊆Pγ(A)S\subseteq P_\gamma(A) supplies at least γ∣A∣∣S∣\gamma|A||S| internal Cayley edges, then applying Theorem 2 or Corollary 1. Example 4 shows sharpness for homocyclic groups of exponents 22 and 33, up to the displayed lower-order term.

The paper explicitly distinguishes independence from dissociativity. It cites Shkredov–Yekhanin [SY11, Theorem 3.1] for the qualitative estimate

dim⁡D(Pγ(A))≪γ−1log⁡∣A∣(1)\dim_D(P_\gamma(A))\ll\gamma^{-1}\log|A| \tag{1}

in finite abelian groups. Since independent sets are dissociated, dim⁡I≤dim⁡D\dim_I\le\dim_D, with equality in exponent 22 or 33; thus Theorem 4 supplies sharp constants only in those exponents and does not control dissociated dimension in general groups. Section 5 records, as an unnumbered observation credited to Thomas Bloom (personal communication) rather than a principal theorem, that dissociated SS and the same small-boundary hypothesis imply ∣A∣>exp⁡(cγ2∣S∣)|A|>\exp(c\gamma^2|S|) for some unspecified absolute c>0c>0; the paper indicates only that this follows from Hölder's inequality and basic Fourier analysis, and gives no proof. Finally, equation (10) extends the projection inequality obtained in the proof of Theorem 3 to arbitrary finite nonempty subsets of Zn\mathbb Z^n. The structural classification of small-boundary sets and improvements for exponent at least 55 are left open in Section 5.

Relation to E963

For E963, write

dD(X):=max⁡{∣D∣:D⊆X is dissociated},f(N)=min⁡∣X∣=NdD(X).d_D(X):=\max\{|D|:D\subseteq X\text{ is dissociated}\},\qquad f(N)=\min_{|X|=N}d_D(X).

The paper’s definition of dissociated is exactly the one needed here: all subset sums of DD are distinct, equivalently there is no nonzero relation ∑d∈Dεdd=0\sum_{d\in D}\varepsilon_dd=0 with εd∈{−1,0,1}\varepsilon_d\in\{-1,0,1\}. Its principal notion of independence is substantially stronger over R\mathbb R: an independent set has no nontrivial integer relation at all, hence is linearly independent over Q\mathbb Q. Thus

dI(X)≤dD(X),d_I(X)\le d_D(X),

and equality need not hold; for example, {1,2}\{1,2\} is dissociated but satisfies the integer relation 2⋅1−2=02\cdot1-2=0. Consequently, Theorem 4’s upper bound on independent dimension cannot be converted into an upper bound on the dissociation number relevant to E963.

There is nevertheless a precise popular-difference consequence. If B⊂RB\subset\mathbb R is finite, 0<γ<10<\gamma<1, and an independent set SS lies in Pγ(B)P_\gamma(B), then the counting argument of Section 4 gives

∂S(B)≤(1−γ)∣S∣∣B∣.\partial_S(B)\le(1-\gamma)|S||B|.

Because every nonzero real has infinite order, the infinite-order case of Theorem 2 yields

∣B∣≥4γ∣S∣,∣S∣≤12γlog⁡2∣B∣.|B|\ge4^{\gamma|S|},\qquad |S|\le\frac{1}{2\gamma}\log_2|B|.

This can control the rationally independent part of a set of frequently occurring differences, but not its largest dissociated subset. For dissociated SS, the unnumbered observation at the beginning of Section 5 instead gives only

∣B∣>exp⁡(cγ2∣S∣),|B|>\exp(c\gamma^2|S|),

or ∣S∣<c−1γ−2log⁡∣B∣|S|<c^{-1}\gamma^{-2}\log|B|, with an unspecified absolute constant. This is the paper’s result most directly aligned with E963’s notion.

Accordingly, the connection is limited. All principal inequalities run from many internal translations to an upper bound on independent or dissociated dimension; E963 asks for a universal lower bound on dissociated dimension of an arbitrary real set. In particular, the paper neither proves f(N)≥⌊log⁡2N⌋f(N)\ge\lfloor\log_2N\rfloor nor constructs a set violating it.