Homogeneous function

In mathematics, a homogeneous function is one with multiplicative scaling behaviour: if all its arguments are multiplied by a factor, then its value is multiplied by some power of this factor.

For example, a homogeneous real-valued function of two variables x and y is a real-valued function that satisfies the condition for some constant k and all real numbers α. The constant k is called the degree of homogeneity.

More generally, if ƒ : VW is a function between two vector spaces over a field F, and k is an integer, then ƒ is said to be homogeneous of degree k if

 

 

 

 

(1)

for all nonzero α ∈ F and vV. When the vector spaces involved are over the real numbers, a slightly less general form of homogeneity is often used, requiring only that (1) hold for all α > 0.

Homogeneous functions can also be defined for vector spaces with the origin deleted, a fact that is used in the definition of sheaves on projective space in algebraic geometry. More generally, if S ⊂ V is any subset that is invariant under scalar multiplication by elements of the field (a "cone"), then a homogeneous function from S to W can still be defined by (1).

ExamplesEdit

 
A homogeneous function is not necessarily continuous, as shown by this example. This is the function f defined by   if   and   if  . This function is homogeneous of degree 1, i.e.   for any real numbers  . It is discontinuous at  .

Example 1Edit

The function   is homogeneous of degree 2:
 
For example, suppose x = 2, y = 4 and t = 5. Then

  •  , and
  •  .

Linear functionsEdit

Any linear map ƒ : VW is homogeneous of degree 1 since by the definition of linearity

 

for all α ∈ F and vV. Similarly, any multilinear function ƒ : V1 × V2 × ... VnW is homogeneous of degree n since by the definition of multilinearity

 

for all α ∈ F and v1V1, v2V2, ..., vnVn. It follows that the n-th differential of a function ƒ : XY between two Banach spaces X and Y is homogeneous of degree n.

Homogeneous polynomialsEdit

Monomials in n variables define homogeneous functions ƒ : FnF. For example,

 

is homogeneous of degree 10 since

 

The degree is the sum of the exponents on the variables; in this example, 10 = 5+2+3.

A homogeneous polynomial is a polynomial made up of a sum of monomials of the same degree. For example,

 

is a homogeneous polynomial of degree 5. Homogeneous polynomials also define homogeneous functions.

Given a homogeneous polynomial of degree k, it is possible to get a homogeneous function of degree 1 by raising to the power 1/k. So for example, for every k the following function is homogeneous of degree 1:

 

Min/maxEdit

For every set of weights  , the following functions are homogeneous of degree 1:

  •   (Leontief utilities)
  •  

PolarizationEdit

A multilinear function g : V × V × ... VF from the n-th Cartesian product of V with itself to the underlying field F gives rise to a homogeneous function ƒ : VF by evaluating on the diagonal:

 

The resulting function ƒ is a polynomial on the vector space V.

Conversely, if F has characteristic zero, then given a homogeneous polynomial ƒ of degree n on V, the polarization of ƒ is a multilinear function g : V × V × ... VF on the n-th Cartesian product of V. The polarization is defined by:   These two constructions, one of a homogeneous polynomial from a multilinear form and the other of a multilinear form from a homogeneous polynomial, are mutually inverse to one another. In finite dimensions, they establish an isomorphism of graded vector spaces from the symmetric algebra of V to the algebra of homogeneous polynomials on V.

Rational functionsEdit

Rational functions formed as the ratio of two homogeneous polynomials are homogeneous functions off of the affine cone cut out by the zero locus of the denominator. Thus, if f is homogeneous of degree m and g is homogeneous of degree n, then f/g is homogeneous of degree m − n away from the zeros of g.

Non-examplesEdit

LogarithmsEdit

The natural logarithm   scales additively and so is not homogeneous.

This can be demonstrated with the following examples:  ,  , and  . This is because there is no k such that  .

Affine functionsEdit

Affine functions (the function   is an example) do not scale multiplicatively.

Positive homogeneityEdit

In the special case of vector spaces over the real numbers, the notion of positive homogeneity often plays a more important role than homogeneity in the above sense.

Definition: Let X be a vector space over a field 𝔽, where 𝔽 is either the real numbers or complex numbers , and let f : X → ℂ be a function (note that every -valued function is also -valued). We define the following terminology:

  1. Strict positive homogeneity: f (rx) = r f (x) for all xX and all positive real r > 0.
  2. Nonnegative homogeneity: f (rx) = r f (x) for all xX and all non-negative real r ≥ 0.
  3. Positive homogeneity: This is usually defined to mean "nonnegative homogeneity" but it is also frequently defined to instead mean "strict positive homogeneity". We now explain why this distinction is irrelevant for real or complex valued maps:
    • Assume that f is strictly positively homogeneous. Then f (0) = f (2 ⋅ 0) = 2 f (0) implies that f (0) = 0. But if we let t = 0 then for all xX we have f (t x) = f (0) = 0 = 0 f (x) = t f (x). Thus f is nonnegative homogeneous.
      • Thus nonnegative homogeneity is the same as strict positive homogeneity. These notions are identical.
  4. Real homogeneity: f (rx) = r f (x) for all xX and all real r.
  5. Homogeneity: f (rx) = r f (x) for all xX and all r ∈ 𝔽 (note that this definition depends on X 's underlying field 𝔽).

All of the above definitions can be generalized by replacing the equality f (rx) = r f (x) with f (rx) = |r| f (x) in which case we prefix that definition with the word "absolute" or "absolutely. For example,

  1. Absolute real homogeneity: f (rx) = |r| f (x) for all xX and all real r.
  2. Absolute homogeneity: f (rx) = |r| f (x) for all xX and all r ∈ 𝔽.
    • This property is used in the definition of a seminorm and a norm.

If k is a fixed real number then the above definitions can be further generalized by replacing the equality f (rx) = r f (x) with f (rx) = rk f (x) (or with f (rx) = |r|k f (x) for conditions using the absolute value), in which case we say that the homogeneity is "of degree k" (note in particular that all of the above definitions are "of degree 1"). For instance,

  1. Nonnegative homogeneity of degree k: f (rx) = rk f (x) for all xX and all real r ≥ 0.
  2. Real homogeneity of degree k: f (rx) = rk f (x) for all xX and all real r.
  3. Absolute real homogeneity of degree k: f (rx) = |r|k f (x) for all xX and all real r.
  4. Absolute homogeneity of degree k: f (rx) = |r|k f (x) for all xX and all r ∈ 𝔽.

Note that sometimes f 's codomain is the set of extended real numbers (which allow for ±∞), in which case the multiplication 0 ⋅ f (x) will be undefined whenever f (x) = ±∞. This is one possible reason why the condition "r > 0" may be used instead of "r ≥ 0."

A (nonzero) continuous function that is homogeneous of degree k on n \ {0} extends continuously to n if and only if k > 0.

GeneralizationsEdit

The definitions given above are all specializes of the following more general notion of homogeneity in which X can be any set (rather than a vector space) and the real numbers can be replaced by the more general notion of a monoid.

Monoids and monoid actions
Definition: A monoid is a pair (M, ⋅ ) consisting of a set M and an associative operator M × MM where there is some element in S called an identity element, which we will denote by 1 ∈ M, such that 1 ⋅ m = m = m ⋅ 1 for all mM.
Notation: If (M, ⋅ ) is a monoid with identity element 1 ∈ M and if mM, then we will let m0 := 1, m1 := m, m2 := mm, and more generally for any positive integers k, we will let mk will be the product of k m's (i.e. mk := m ⋅ (mk - 1)).
Notation: It is common practice (e.g. such as in algebra or calculus) to denote the multiplication operation of a monoid (M, ⋅ ) by juxtaposition, meaning that we may write m n rather than mn. This allows us to not even have to assign a symbol to a monoid's multiplication operation. Moreover, when we use this juxtaposition notation then we will automatically assume that the monoid's identity element is denoted by 1.
Definition: Let M be a monoid with identity element 1 ∈ M whose operation is denoted by juxtaposition and let X be a set. A monoid action of M on X is a map M × XX, which we will also denote by juxtaposition, such that 1 x = x = x 1 and (m n) x = m (n x) for all xX and all m, nM.
Homogeneity
Definition: Let M be a monoid with identity element 1 ∈ M, let X and Y be sets, and suppose that on both X and Y there are defined monoid actions of M. Let k be a non-negative integer and let f : XY be a map. Then we say that f is homogeneous of degree k over M if for every xX and mM,
f (m x) = mk f (x).
If in addition there is a function MM, denoted by m ↦ |m|, called an absolute value then we say that f is absolutely homogeneous of degree k over M if for every xX and mM,
f (m x) = |m|k f (x).
Definition: If we say that a function is homogeneous over M (resp. absolutely homogeneous over M) then we mean that it is homogeneous of degree 1 over M (resp. absolutely homogeneous of degree 1 over M).

More generally, note that it is possible for the symbols mk to be defined for mM with k being something other than an integer (e.g. if M is the real numbers and k is a non-zero real number then mk is defined even though k is not an integer). In this case, we say that f is homogeneous of degree k over M if the same equality holds:

f (m x) = mk f (x)        for every xX and mM.

The notion of being absolutely homogeneous of degree k over M is generalized similarly.

Euler's homogeneous function theoremEdit

Continuously differentiable positively homogeneous functions are characterized the following theorem:

Euler's homogeneous function theorem. — Suppose that the function f : ℝn \ {0} → ℝ is continuously differentiable. Then f is positively homogeneous of degree k if and only if

 
Proof —

This result follows at once by differentiating both sides of the equation fy) = αkf (y) with respect to α, applying the chain rule, and choosing α to be 1.

The converse is proved by integrating. Specifically, let  . Since  ,

 

Thus,  . This implies  . Therefore,  : f is positively homogeneous of degree k.

As a consequence, suppose that f : ℝn → ℝ is differentiable and homogeneous of degree k. Then its first-order partial derivatives   are homogeneous of degree k − 1. The result follows from Euler's theorem by commuting the operator   with the partial derivative.

One can specialize the theorem to the case of a function of a single real variable (n = 1), in which case the function satisfies the ordinary differential equation

 

This equation may be solved using an integrating factor approach, with solution  , where c = f (1).

Homogeneous distributionsEdit

A continuous function ƒ on Rn is homogeneous of degree k if and only if

 

for all compactly supported test functions  ; and nonzero real t. Equivalently, making a change of variable y = tx, ƒ is homogeneous of degree k if and only if

 

for all t and all test functions  . The last display makes it possible to define homogeneity of distributions. A distribution S is homogeneous of degree k if

 

for all nonzero real t and all test functions  . Here the angle brackets denote the pairing between distributions and test functions, and μt : RnRn is the mapping of scalar division by the real number t.

Application to differential equationsEdit

The substitution v = y/x converts the ordinary differential equation

 

where I and J are homogeneous functions of the same degree, into the separable differential equation

 

See alsoEdit

ReferencesEdit

  • Blatter, Christian (1979). "20. Mehrdimensionale Differentialrechnung, Aufgaben, 1.". Analysis II (2nd ed.) (in German). Springer Verlag. p. 188. ISBN 3-540-09484-9.

External linksEdit