Sublinear function

From Wikipedia, the free encyclopedia

In linear algebra, a sublinear function (or functional as is more often used in functional analysis), also called a quasi-seminorm or a Banach functional, on a vector space is a real-valued function with only some of the properties of a seminorm. Unlike seminorms, a sublinear function does not have to be nonnegative-valued and also does not have to be absolutely homogeneous. Seminorms are themselves abstractions of the more well known notion of norms, where a seminorm has all the defining properties of a norm except that it is not required to map non-zero vectors to non-zero values.

In functional analysis the name Banach functional is sometimes used, reflecting that they are most commonly used when applying a general formulation of the Hahn–Banach theorem. The notion of a sublinear function was introduced by Stefan Banach when he proved his version of the Hahn-Banach theorem.[1]

There is also a different notion in computer science, described below, that also goes by the name "sublinear function."

Definitions[]

Let be a vector space over a field where is either the real numbers or complex numbers A real-valued function on is called a sublinear function (or a sublinear functional if ), and also sometimes called a quasi-seminorm or a Banach functional, if it has these two properties:[1]

  1. Positive homogeneity/Nonnegative homogeneity: for any real and any ; and
  2. Subadditivity/Triangle inequality: for all
    • This subadditivity condition requires to be real-valued.

A sublinear function is called positive[2] or nonnegative if for all

The set of all sublinear functions on denoted by can be partially ordered by declaring if and only if for all A sublinear function is called minimal if it is a minimal element of under this order. A sublinear function is minimal if and only if it is a real linear functional.[1]

Examples and sufficient conditions[]

Every seminorm and norm is a sublinear function and every real linear functional is a sublinear function. The converses are not true in general.

If and are sublinear functions on a real vector space then so is the map More generally, if is any non-empty collection of sublinear functionals on a real vector space and if for all then is a sublinear functional on [3]

The linear functional on is a sublinear functional that is not positive and is not a seminorm.[3]

Properties[]

Every sublinear function is a convex functional.

If is a real-valued sublinear function on then:

  • [2][proof 1]
  • for every [proof 2]
  • for all [2]
    • The map defined by is a seminorm on [2]
    • This implies, in particular, that at least one of and is non-negative.
  • for all [1][proof 3]

Associated seminorm[]

If is a real-valued sublinear function on then the map defines a seminorm on called the seminorm associated with [2]

Relation to linear functions[]

If is a sublinear function on a real vector space then the following are equivalent:[1]

  1. is a linear functional;
  2. for every ;
  3. for every ;
  4. is a minimal sublinear function.

If is a sublinear function on a real vector space then there exists a linear functional on such that [1]

If is a real vector space, is a linear functional on and is a positive sublinear function on then on if and only if [1]

Continuity[]

Theorem[4] — Suppose is a subadditive function (that is, for all ). Then is continuous at the origin if and only if is uniformly continuous on If satisfies then is continuous if and only if its absolute value is continuous. If is non-negative then is continuous if and only if is open in

Suppose is a topological vector space (TVS) over the real or complex numbers and is a sublinear function on Then the following are equivalent:[4]

  1. is continuous;
  2. is continuous at 0;
  3. is uniformly continuous on ;

and if is positive then we may add to this list:

  1. is open in

If is a real TVS, is a linear functional on and is a continuous sublinear function on then on implies that is continuous.[4]

Relation to Minkowski functions and open convex sets[]

Theorem[4] — If is a convex open neighborhood of the origin in a TVS then the Minkowski functional of is a continuous non-negative sublinear function on such that ; if in addition is balanced then is a seminorm on

Relation to open convex sets

Theorem[4] — Suppose that is a TVS (not necessarily locally convex or Hausdorff) over the real or complex numbers. Then the open convex subsets of are exactly those that are of the form for some and some positive continuous sublinear function on

Proof

Let be an open convex subset of If then let and otherwise let be arbitrary. Let be the Minkowski functional of where is a continuous sublinear function on since is convex, absorbing, and open ( however is not necessarily a seminorm since was not assumed to be balanced). From the properties of Minkowski functionals, it is known that from which follows. But

as desired.

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.

Computer science definition[]

In computer science, a function is called sublinear if or in asymptotic notation (notice the small ). Formally, if and only if, for any given there exists an such that for [5] That is, grows slower than any linear function. The two meanings should not be confused: while a Banach functional is convex, almost the opposite is true for functions of sublinear growth: every function can be upper-bounded by a concave function of sublinear growth.[6]

See also[]

Notes[]

  1. ^ Using and any non-negative homogeneity implies that
  2. ^ which is only possible if
  3. ^ which happens if and only if

References[]

  1. ^ Jump up to: a b c d e f g Narici & Beckenstein 2011, pp. 177–220.
  2. ^ Jump up to: a b c d e Narici & Beckenstein 2011, pp. 120–121.
  3. ^ Jump up to: a b Narici & Beckenstein 2011, pp. 177–221.
  4. ^ Jump up to: a b c d e Narici & Beckenstein 2011, pp. 192–193.
  5. ^ 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)
  6. ^ Ceccherini-Silberstein, Tullio; Salvatori, Maura; Sava-Huss, Ecaterina (2017-06-29). Groups, graphs, and random walks. Cambridge. Lemma 5.17. ISBN 9781316604403. OCLC 948670194.

Bibliography[]

  • ; (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. ISBN 978-1584888666. OCLC 144216834.
  • Schaefer, Helmut H.; (1999). Topological Vector Spaces. GTM. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. ISBN 978-1-4612-7155-0. OCLC 840278135.
  • Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322.
Retrieved from ""