Wiki
Wiki

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

Updated

Arithmetic characterizations of Sidon sets

Library card.


Gilles Pisier, “Arithmetic characterizations of Sidon sets,” Bulletin of the American Mathematical Society (New Series) 8 (1983), no. 1, 87–89.

Scope and notation

Let GG be a compact abelian group and let G^\widehat G be its discrete dual. For Λ⊂G^\Lambda\subset\widehat G, Pisier writes RΛR_\Lambda for the finitely supported relations

∑λ∈Λϵλλ=0,ϵλ∈{−1,0,1}.\sum_{\lambda\in\Lambda}\epsilon_\lambda\lambda=0, \qquad \epsilon_\lambda\in\{-1,0,1\}.

The larger set IΛI_\Lambda consists of all finitely supported {−1,0,1}\{-1,0,1\}-families, whether or not they give a zero relation. For γ∈G^\gamma\in\widehat G, R(γ,Λ)R(\gamma,\Lambda) counts the representations γ=∑ϵλλ\gamma=\sum\epsilon_\lambda\lambda coming from IΛI_\Lambda, and Rs(γ,Λ)R_s(\gamma,\Lambda) counts those with ∑∣ϵλ∣=s\sum|\epsilon_\lambda|=s.

A set Λ\Lambda is quasi-independent when R(0,Λ)=1R(0,\Lambda)=1: its only {−1,0,1}\{-1,0,1\} relation is the zero relation. It is a Rider set when, for some δ>0\delta>0, ∑s≥0δsRs(0,Λ)<∞\sum_{s\geq 0}\delta^sR_s(0,\Lambda)<\infty. A Sidon set is a set Λ\Lambda for which there is KK such that every trigonometric polynomial ff with Fourier support in Λ\Lambda satisfies

∑γ∣f^(γ)∣≤K∥f∥C(G).\sum_\gamma |\widehat f(\gamma)|\leq K\|f\|_{C(G)}.

The least such KK is denoted S(Λ)S(\Lambda). These definitions are on pp. 87–88 (the article's first two pages).

For Λ⊂N⊂Z=T^\Lambda\subset\mathbb N\subset\mathbb Z=\widehat{\mathbb T}, quasi-independence is exactly dissociation in the sense of E0774. Indeed, a nonzero signed relation partitions its support into two distinct finite subsets with equal sums. Conversely, equality of two distinct subset sums, after cancelling their intersection, gives a nonzero signed relation.

Main arithmetic characterizations

Theorem 1 (p. 88; the article's second page). Suppose 0∉Λ⊂G^0\notin\Lambda\subset\widehat G. The following are equivalent:

  • (i) Λ\Lambda is Sidon.
  • (ii) For some θ<1\theta<1, every finite A⊂ΛA\subset\Lambda satisfies
∑s≥02−sRs(0,A)≤2θ∣A∣.\sum_{s\geq0}2^{-s}R_s(0,A)\leq 2^{\theta|A|}.
  • (iii) For some θ<1\theta<1, every finite A⊂ΛA\subset\Lambda satisfies
sup⁡γ∈G^R(γ,A)≤3θ∣A∣.\sup_{\gamma\in\widehat G}R(\gamma,A)\leq3^{\theta|A|}.
  • (iv) For some θ<1\theta<1, every finite A⊂ΛA\subset\Lambda satisfies
(∑γ∈G^R(γ,A)2)1/2≤3θ∣A∣.\left(\sum_{\gamma\in\widehat G}R(\gamma,A)^2\right)^{1/2} \leq3^{\theta|A|}.

The accompanying proposition (p. 88; the article's second page) says these conditions are also equivalent to two analytic/metric formulations. First, there are α>0\alpha>0 and ρ<1\rho<1 such that, for every finite A⊂ΛA\subset\Lambda,

m{t∈G:inf⁡λ∈ARe⁡λ(t)>ρ}≤2−α∣A∣.m\{t\in G:\inf_{\lambda\in A}\operatorname{Re}\lambda(t)>\rho\} \leq2^{-\alpha|A|}.

Second, there is α>0\alpha>0 such that for every such AA there are N≥2α∣A∣N\geq2^{\alpha|A|} points t1,…,tN∈Gt_1,\dots,t_N\in G with

sup⁡λ∈A∣λ(ti)−λ(tj)∣≥α(i≠j).\sup_{\lambda\in A}|\lambda(t_i)-\lambda(t_j)|\geq\alpha \quad(i\ne j).

The paper says the equivalence of these last two formulations is formal. It also notes that the equivalence of the two representation-count bounds follows easily from ∑γR(γ,A)=3∣A∣\sum_\gamma R(\gamma,A)=3^{|A|}.

Theorem 2 (p. 89; the article's third page). “A subset Λ\Lambda of G^\widehat G is a Sidon set iff (vii) there is an integer kk such that any finite subset AA of Λ\Lambda contains a quasi-independent subset B⊂AB\subset A with ∣B∣≥∣A∣/k|B|\geq|A|/k.”

Thus, for A⊂NA\subset\mathbb N, “proportionately dissociated” is equivalent to “Sidon.” Pisier says that Theorem 2, in some sense, reduces the outstanding finite-union problem to “a purely combinatorial question: Is every set satisfying (vii) a finite union of quasi-independent sets?” (p. 89). Under the integer translation above, that is precisely E0774.

Proof ideas useful for E0774

  • A union of kk quasi-independent sets has the proportional extraction property immediately: one color class contains at least ∣A∣/k|A|/k elements of every finite AA. E0774 asks for the converse.
  • The identity displayed as (1) on p. 88 expands ∏λ∈A[1+δ(λ+λˉ)]\prod_{\lambda\in A}[1+\delta(\lambda+\bar\lambda)] in terms of the weighted counts Rs(γ,A)R_s(\gamma,A). Pisier says the Sidon-to-relation-count implication uses this identity at δ=1/2\delta=1/2 together with integrability properties of ∑λ∈ARe⁡λ\sum_{\lambda\in A}\operatorname{Re}\lambda.

Exact limits of this source

  • This three-page article is an announcement. It sends the details of Theorem 1, the proposition, and the difficult direction of Theorem 2 to Pisier’s reference [5], then listed as forthcoming. It does not contain those proofs.
  • The converse direction in Theorem 2 is attributed to Theorem 2.3 of Pisier’s 1981 paper, using the fact that every quasi-independent set has Sidon constant bounded by an absolute constant.
  • The paper states that every Rider set is a finite union of quasi-independent sets, again referring to [5] rather than proving it here.
  • No explicit dependence of kk, θ\theta, α\alpha, or ρ\rho on the Sidon constant is given. The equivalences are qualitative and uniform over finite subsets.
  • Pisier does not answer the finite-union question and provides no integer counterexample, block construction, or encoding scheme. The positive results it mentions, for G=Z(p)NG=\mathbb Z(p)^{\mathbb N} with pp prime (its reference [3]) or a product of distinct primes (Bourgain, private communication), do not cover T^=Z\widehat{\mathbb T}=\mathbb Z.