# Sublinear function

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

- for any positive and any (
*positive homogeneity*), and

- 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 is called sublinear if in asymptotic notation (notice the small ). Formally, if and only if, for any given , there exists an such that^{[1]}

This means that for any linear function for sufficiently large input grows slower than

## Contents

## ExamplesEdit

- 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 as their codomain.

## PropertiesEdit

- Every sublinear function is a convex functional.

## OperatorsEdit

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.

## ReferencesEdit

**^**Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein (2001) [1990]. "3.1".*Introduction to Algorithms*(2nd ed.). MIT Press and McGraw-Hill. pp. 47–48. ISBN 0-262-03293-7.CS1 maint: Multiple names: authors list (link)

This linear algebra-related article is a stub. You can help Wikipedia by expanding it. |