Scribd
Upload
39 views2 pages

The Subadditivity Lemma: Frank R. Kschischang November 3, 2009

The document discusses the Subadditivity Lemma. The lemma states that if a sequence of non-negative real numbers has the subadditive property of ai+j ≤ ai + aj for all i, j ≥ 1, then the limit of an/n as n approaches infinity exists and equals the infimum of an/n for n ≥ 1. The document provides a proof of the lemma and gives an example application to analyzing the size of sets of valid sequences over a finite alphabet.

Uploaded by

Cesar Angon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
39 views2 pages

The Subadditivity Lemma: Frank R. Kschischang November 3, 2009

The document discusses the Subadditivity Lemma. The lemma states that if a sequence of non-negative real numbers has the subadditive property of ai+j ≤ ai + aj for all i, j ≥ 1, then the limit of an/n as n approaches infinity exists and equals the infimum of an/n for n ≥ 1. The document provides a proof of the lemma and gives an example application to analyzing the size of sets of valid sequences over a finite alphabet.

Uploaded by

Cesar Angon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

The Subadditivity Lemma

Frank R. Kschischang

November 3, 2009

Let a1 , a2 , a3 , . . . be a sequence of non-negative real numbers with the “sub-


additive property”
ai+j ≤ ai + aj for all i, j ≥ 1.
Then
an
lim
n→∞ n
exists and equals inf n≥1 (an /n).
Proof : Let
an
.
L = inf
n≥1 n

For any  > 0, choose n so that an < n(L + ). (Such an n necessarily exists
by definition of infimum.) Let b = max1≤i<n ai . If m ≥ n, let m = qn + r
with 0 ≤ r < n. From the subadditivity property,

anq+r = an+n+···+n+r ≤ a
|n
+ an +
{z
· · · + an} +ar ≤ qan + b.
q times

Thus
am qan b
≤ +
m m m
qn(L + ) b
< +
m m
→ L +  as m → ∞

since qn/m → 1 as m → ∞.

1
For example, let An denote the set of sequences—called valid n-sequences—of
length n over some finite alphabet. Suppose that, in order for an (i + j)-
sequence to be valid, it is necessary (but not necessarily sufficient) that its
first i components be a valid i-sequence and its last j components be a valid
j-sequence. (This situation often arises in constrained coding, for example.)
Then Ai+j ⊆ Ai × Aj , and hence |Ai+j | ≤ |Ai × Aj | = |Ai | · |Aj |. Taking
logarithms, i.e., defining an = log2 |An |, we get

ai+j ≤ ai + aj .

The subadditivity lemma guarantees that an /n converges to a limit C as


n → ∞. Furthermore, log2 |An |/n ≥ C for all n, and, for any  > 0,
log2 |An |/n < C +  for sufficiently large n. Equivalently,

|An | ≥ 2nC for all n

and, for all  > 0,

|An | ≤ 2n(C+) for sufficiently large n.

Note: The subadditivity lemma is sometimes called Fekete’s Lemma after


Michael Fekete [1].

References
[1] M. Fekete, “Über die Verteilung der Wurzeln bei gewissen algebraischen
Gleichungen mit ganzzahligen Koeffizienten,” Mathematische Zeitschrift,
vol. 17, pp. 228–249, 1923.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy