Samiksha Jaiswal (Editor)

Sublinear function

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

A sublinear function (or functional, as is more often used in functional analysis), in linear algebra and related areas of mathematics, is a function f : V → F on a vector space V over F, an ordered field (e.g. the real numbers R ), which satisfies

Contents

f ( γ x ) = γ f ( x )   for any positive γ ∈ F and any x ∈ V (positive homogeneity), and

f ( x + y ) ≤ f ( x ) + f ( y )   for any x, y ∈ V (subadditivity).

In functional analysis the name Banach functional is used for sublinear function, especially when formulating Hahn–Banach theorem.

In computer science, a function f : Z + → R is called sublinear if f ( n ) ∈ o ( n ) in asymptotic notation (Notice the small o ). Formally, f ( n ) ∈ o ( n ) if and only if, for any given c > 0 , there exists an n 0 such that

n ≥ n 0 ⇒ 0 ≤ f ( n ) < c ⋅ n

This means that for any linear function g , for sufficiently large input f grows slower than g .

Examples

  • Every (semi-)norm is a sublinear function. The opposite is not true, because (semi-)norms can have their domain vector space over any field (not necessarily ordered) and must have R as their codomain.

    • Properties

  • Every sublinear function is a convex functional.

    • Operators

    The concept can be extended to operators that are homogeneous and subadditive. This requires only that the codomain be, say, an ordered vector space to make sense of the conditions.

    References

    Sublinear function Wikipedia
    (Text) CC BY-SA