Altanis

2.2Bachmann-Landau Notation

Updated 22 Jun 2026Chapter (PDF)

[2.2.1]Definition(o(1),o(h),O(h)o(1), o(\norm{h}), \mathcal{O}(\norm{h}) Mappings)#

Suppose φ:B(0n,ε)Rm\phi: B(\vb{0}_n, \epsilon) \to \bR^m is a map from a ball about 0nRn\vb{0}_n \in \bR^n to Rm\bR^m.

  • φ\phi is said to be smaller than order 1 (“little-o of 1”, o(1)o(1)) if, for any c>0c > 0, there is some H>0H > 0 such that φ(h)c\norm{\phi(h)} \le c for every hRn:h<Hh \in \bR^n: \norm{h} < H.

  • φ\phi is said to be smaller than order hh (“little-o of hh”, o(h)o(\norm{h})) if, for every c>0c > 0, there is some H>0H > 0 such that φ(h)ch\norm{\phi(h)} \le c\norm{h} for every hRn:h<Hh \in \bR^n: \norm{h} < H.

  • φ\phi is said to be of order hh (“big-o of hh”, O(h)\mathcal{O}(\norm{h})) if, for a specific c>0c > 0, there is some H>0H > 0 such that φ(h)ch\norm{\phi(h)} \le c\norm{h} for every hRn:h<Hh \in \bR^n: \norm{h} < H.

Fix some domain ball B(0n,ε)B(\vb{0}_n, \epsilon) and some codomain Rm\bR^m. The set of all o(1)o(1) mappings with respect to this domain and range is denoted by o(1)o(1), and analogous statements follow for o(h)o(\norm{h}) and O(h)\mathcal{O}(\norm{h}).

[2.2.2]Remark(Intuition Behind Mappings)#

Saying something is an o(1)o(1), o(h)o(\norm{h}), O(h)\mathcal{O}(\norm{h}) mapping is a statement of the function being bounded above for small enough inputs (inputs near the origin).

  • An o(1)o(1) mapping is such that the norm of output vectors near 0n\vb{0}_n get arbitrarily small relative to any constant. That is, o(1)0o(1) \to 0 as h0nh \to \vb{0}_n.

  • An o(h)o(\norm{h}) mapping is such that the norm of output vectors near 0n\vb{0}_n get arbitrarily small relative to any linear function. That is, o(h)/h0o(\norm{h})/\norm{h} \to 0 as h0nh \to \vb{0}_n.

  • A O(h)\mathcal{O}(\norm{h}) mapping is such that the norm of output vectors near 0n\vb{0}_n get arbitrarily small relative to a specific linear function. That is, o(h)/ho(\norm{h})/\norm{h} is bounded above by some C>0C > 0 as h0nh \to \vb{0}_n.

Suppose φ:RR\phi: \bR \to \bR. If φ\phi is o(1)o(1), then φ(0)0\phi(0) \to 0. If φ\phi is o(h)o(\norm{h}), then for any constant C>0C > 0, there is some interval [h,h][-h, h] in which φ\phi is bounded in between the lines y=±Cxy = \pm Cx. If φ\phi is O(h)\mathcal{O}(\norm{h}), then there exists some constant C>0C > 0 for which there is some interval [h,h][-h, h] in which φ\phi is bounded in between the lines y=±Cxy = \pm Cx.

Note that since an o(h)o(\norm{h}) mapping is less than any chc\norm{h} as h0nh \to \vb{0}_n, it is less than some chc\norm{h} as h0nh \to \vb{0}_n, and so it is an O(h)\mathcal{O}(\norm{h}) mapping. Since there is some c>0c > 0 such that O(h)ch\mathcal{O}(\norm{h}) \le c\norm{h} as h0nh \to \vb{0}_n, it follows that O(h)0\mathcal{O}(\norm{h}) \to 0, and so a O(h)\mathcal{O}(\norm{h}) mapping is an o(1)o(1) mapping as well.

[2.2.3]Theorem(Classification of Mappings)#

o(h)O(h)o(1).o(\norm{h}) \subseteq \mathcal{O}(\norm{h}) \subseteq o(1).

[2.2.4]Theorem(Dominance Principle for Landau Spaces)#

Suppose φ=o(1)\phi = o(1), and suppose ψ(h)φ(h)\norm{\psi(h)} \le \norm{\phi(h)} for small enough hh (in terms of norm). Then ψ=o(1)\psi = o(1). Similar statements follow for o(h)o(\norm{h}) and O(h)\mathcal{O}(\norm{h}).

[2.2.5]Theorem(Landau Spaces are Vector Spaces)#

Fix and domain-ball B(0n,ε)B(\vb{0}_n, \epsilon) and any codomain Rm\bR^m. Then o(1)o(1) is a vector space, and O(h)\mathcal{O}(\norm{h}) and o(h)o(\norm{h}) are subspaces.

Proof.

Define +:o(1)×o(1)o(1)+: o(1) \times o(1) \to o(1) by traditional function addition. Let f,go(1)f, g \in o(1). Fix c>0c > 0. There exists some H>0H > 0 such that

f(h)c/2g(h)c/2\norm{f(h)} \le c/2 \quad \norm{g(h)} \le c/2

for every hRn:h<Hh \in \bR^n: \norm{h} < H. Then note

(f+g)(h)f(h)+g(h)=c,\norm{(f + g)(h)} \le \norm{f(h)} + \norm{g(h)} = c,

meaning f+go(1)f + g \in o(1). Commutativity, associativity, additive identity, and additive inverse axioms follow immediately.

Fix kRk \in \bR, and let fo(1)f \in o(1). With our aforementioned fixed c>0c > 0, there is some H>0H' > 0 such that

f(h)c/k\norm{f(h)} \le c/|k|

for every hRn:h<Hh \in \bR^n: \norm{h} < H. Then, of course,

kf(h)=kf(h)c,\norm{kf(h)} = |k|\norm{f(h)} \le c,

meaning kfo(1)kf \in o(1). Multiplicative identity and inverse axioms quickly follow. Subspace axioms are trivial to verify.

We provide an example of a class of functions that encompass o(1)o(1), o(h)o(\norm{h}), and O(h)\mathcal{O}(\norm{h}) functions.

[2.2.6]Example#

Define

φk:RnRφk(x)=xk\phi_k: \bR^n \to \bR \qquad \phi_k(x) = \norm{x}^k

for all kRk \in \bR. We show that φk\phi_k is o(1)o(1) for every k>0k > 0, φk\phi_k is O(h)\mathcal{O}(\norm{h}) for every k1k \ge 1, and φk\phi_k is o(h)o(\norm{h}) for every k>1k > 1.

First, we show φk\phi_k is o(1)o(1) for k>0k > 0. Fix c>0c > 0, then let H=c1/kH = c^{1/k}. Then

φk(h)=hk<(c1/k)k=c\norm{\phi_k(h)} = \norm{h}^k < (c^{1/k})^k = c

for every hRn:h<Hh \in \bR^n: \norm{h} < H, and so φk\phi_k is o(1)o(1).

Now let k>1k > 1. For any c>0c > 0, we may let H=c1/(k1)H = c^{1/(k-1)} and observe that

φk(h)=hk=hhk1ch\norm{\phi_k(h)} = \norm{h}^k = \norm{h} \norm{h}^{k - 1} \le c\norm{h}

for every hRn:H<Hh \in \bR^n: \norm{H} < H, and so φk\phi_k is o(h)o(\norm{h}).

If k=1k = 1, then HH is undefined, so we tackle it a different way. Note that if we let c>1c > 1, it is true that

φk(h)=xcx.\norm{\phi_k(h)} = \norm{x} \le c\norm{x}.

Thus, for k1k \ge 1, φkO(h)\phi_k \in \mathcal{O}(\norm{h}) (by stitching together our strategy for k>1k > 1 and k=1k = 1, we restrict c>1c > 1, meaning it is no longer o(h)o(\norm{h})).

[2.2.7]Theorem(Finite-Dimensional Linear Maps are Continuous)#

Suppose T:VWT: V \to W is a linear map between two finite-dimensional vector spaces. Then TT is continuous.

Proof.

Let (vk)V(v_k) \subseteq V be a sequence of vectors such that vkvVv_k \to v \in V. For TT to be continuous, we need that the image sequence T(vk)WT(v_k) \subseteq W is such that T(vk)T(v)WT(v_k) \to T(v) \in W.

Equip V,WV, W with norms   V,  W\norm{~\cdot~}_V, \norm{~\cdot~}_W. Choose a basis B={e1,,en}V\mathcal{B} = \{e_1, \dots, e_n\} \subseteq V. Express each vkv_k in the sequence as

vk=ak,1e1++ak,nen,v_k = a_{k, 1}e_1 + \dots + a_{k, n}e_n,

and express

v=a1e1++anen.v = a_1e_1 + \dots + a_ne_n.

Since (vk)(v_k) is a convergent sequence, we know vkvV0\norm{v_k - v}_V \to 0 as kk \to \infty. Because VV is finite-dimensional, convergence in norm implies coordinate-wise convergence. Thus, for each coordinate i{1,,n}i \in \{1, \dots, n\}, we have ak,iai0|a_{k, i} - a_i| \to 0.

Now consider the images

T(vk)=ak,1T(e1)++ak,nT(en),T(v_k) = a_{k, 1}T(e_1) + \dots + a_{k, n}T(e_n),
T(v)=a1T(e1)++anT(en).T(v) = a_1T(e_1) + \dots + a_nT(e_n).

Let A=max{T(e1)W,,T(en)W}A = \max\{\norm{T(e_1)}_W, \dots, \norm{T(e_n)}_W\}. Then, using the linearity of TT and the triangle inequality,

T(vk)T(v)W=T(vkv)W=i=1n(ak,iai)T(ei)Wi=1nak,iaiT(ei)WAi=1nak,iai.\norm{T(v_k) - T(v)}_W = \norm{T(v_k - v)}_W = \norm{\sum_{i = 1}^n (a_{k, i} - a_i) T(e_i)}_W \le \sum_{i = 1}^n |a_{k, i} - a_i| \norm{T(e_i)}_W \le A \sum_{i = 1}^n |a_{k, i} - a_i|.

As kk \to \infty, each ak,iai0|a_{k, i} - a_i| \to 0, which means the right-hand sum goes to 00. Therefore, T(vk)T(v)W0\norm{T(v_k) - T(v)}_W \to 0, establishing that T(vk)T(v)T(v_k) \to T(v).

[2.2.8]Theorem(Linear Maps in Landau Notation)#

Suppose T:RnRmT: \bR^n \to \bR^m is linear. Then TT is an O(h)\mathcal{O}(\norm{h}) mapping, and TT is an o(h)o(\norm{h}) mapping if and only if T0T \equiv 0.

Proof.

Define the unit ball B={vRn:v1}B = \{v \in \bR^n: \norm{v} \le 1\}. Then note BB is closed and bounded, thus compact. All linear maps are continuous, and so the image of the ball T(B)T(B) is compact as well, meaning T(B)T(B) is bounded. Thus there is some M>0M > 0 such that T(B)MT(B) \le M.

Let vVv \in V, which we can write as v=vv0v = \norm{v}v_0 for some v0Bv_0 \in B (with v0=1\norm{v_0} = 1). Note then that

Tv=T(vv0)=vTv0Mv.\norm{Tv} = \norm{T(\norm{v} v_0)} = \norm{v}\norm{Tv_0} \le M\norm{v}.

Thus TT is a O(h)\mathcal{O}(\norm{h}) mapping.

Note the zero linear map is trivially o(h)o(\norm{h}), so suppose T≢0T \not \equiv 0—we show To(h)T \ne o(\norm{h}). Thus there is some v0Vv_0 \in V such that T(v0)0T(v_0) \ne 0. Choose c=T(v0)/2c = \norm{T(v_0)}/2. Let v=λv0v = \lambda v_0 be any scalar multiple of v0v_0. Then note

Tv=λT(v0)=2cλ=2cv.\norm{Tv} = |\lambda|\norm{T(v_0)} = 2c|\lambda| = 2c\norm{v}.

Thus Tv>cv\norm{Tv} > c\norm{v}, meaning To(h)T \ne o(\norm{h}), completing the proof.

[2.2.9]Theorem(Product of Landau Functions)#

Suppose

f,g,fg:B(0n,ε)Rf, g, fg: B(\vb{0}_n, \epsilon) \to \bR

are mappings such that f=o(1)f = o(1) and g=O(h)g = \mathcal{O}(\norm{h}). Then fg=o(h)fg = o(\norm{h}).

Proof.

Fix c>0c > 0. Choose d>0d > 0 be such that there exists an H>0H > 0 such that

f(h)c/dg(h)dh\norm{f(h)} \le c/d \quad \norm{g(h)} \le d\norm{h}

whenever hRn:h<Hh \in \bR^n: \norm{h} < H. Then, of course,

fg(h)=f(h)g(h)ch\norm{fg(h)} = \norm{f(h)g(h)} \le c\norm{h}

for every hRn:h<Hh \in \bR^n: \norm{h} < H for arbitrary c>0c > 0. Thus fg=o(h)fg = o(\norm{h}).

Note this theorem applies if f=O(h)f = \mathcal{O}(\norm{h}), or f=o(h)f = o(\norm{h}), or g=o(h)g = o(\norm{h}).

[2.2.10]Theorem(Composition of Landau Functions)#
o(o(1))=o(1),O(O(h))=O(h),o(O(h))=o(h),O(o(h))=o(h).\begin{align*} o(o(1)) &= o(1), \\ \mathcal{O}(\mathcal{O}(\norm{h})) &= \mathcal{O}(\norm{h}), \\ o(\mathcal{O}(\norm{h})) &= o(\norm{h}), \\ \mathcal{O}(o(\norm{h})) &= o(\norm{h}). \end{align*}

For Landau functions that tend to 00, composition order is transitive.

Proof.

Trivialized by the definition of Landau functions.