Homogeneous function: Difference between revisions

Content deleted Content added
m sfn whitelist CITEREFKubrusly2011
 
(9 intermediate revisions by 8 users not shown)
Line 2:
{{More footnotes|date=July 2018}}
{{for|homogeneous linear maps|Graded vector space#Homomorphisms}}
In [[mathematics]], a '''homogeneous function''' is a [[function of several variables]] such that, ifthe allfollowing itsholds: If each of the function's arguments areis multiplied by athe same [[scalar (mathematics)|scalar]], then itsthe function's value is multiplied by some power of this scalar,; the power is called the '''degree of homogeneity''', or simply the ''degree'';. thatThat is, if {{mvar|k}} is an integer, a function {{mvar|f}} of {{mvar|n}} variables is homogeneous of degree {{mvar|k}} if
:<math>f(sx_1,\ldots, sx_n)=s^k f(x_1,\ldots, x_n)</math>
for every <math>x_1, \ldots, x_n,</math> and <math>s\ne 0.</math> This is also referred to a ''{{mvar|k}}th-degree'' or ''{{mvar|k}}th-order'' homogeneous function.
 
For example, a [[homogeneous polynomial]] of degree {{mvar|k}} defines a homogeneous function of degree {{mvar|k}}.
Line 10:
The above definition extends to functions whose [[___domain of a function|___domain]] and [[codomain]] are [[vector space]]s over a [[Field (mathematics)|field]] {{mvar|F}}: a function <math>f : V \to W</math> between two {{mvar|F}}-vector spaces is ''homogeneous'' of degree <math>k</math> if
{{NumBlk|:|<math>f(s \mathbf{v}) = s^k f(\mathbf{v})</math>|{{EquationRef|1}}}}
for all nonzero <math>s \in F</math> and <math>v \in V.</math> This definition is often further generalized to functions whose ___domain is not {{mvar|V}}, but a [[cone (linear algebra)|cone]] in {{mvar|V}}, that is, a subset {{mvar|C}} of {{mvar|V}} such that <math>\mathbf{v}\in C</math> implies <math>s \mathbf{v}\in C</math> for every nonzero scalar {{mvar|s}}.
 
In the case of [[functions of several real variables]] and [[real vector space]]s, a slightly more general form of homogeneity called '''positive homogeneity''' is often considered, by requiring only that the above identities hold for <math>s > 0,</math> and allowing any real number {{mvar|k}} as a degree of homogeneity. Every homogeneous real function is ''positively homogeneous''. The converse is not true, but is locally true in the sense that (for integer degrees) the two kinds of homogeneity cannot be distinguished by considering the behavior of a function near a given point.
Line 22:
There are two commonly used definitions. The general one works for vector spaces over arbitrary [[field (mathematics)|fields]], and is restricted to degrees of homogeneity that are [[integer]]s.
 
The second one supposes to work over the field of [[real number]]s, or, more generally, over an [[ordered field]]. This definition restricts to positive values the scaling factor that occurs in the definition, and is therefore called ''positive homogeneity'', the qualificative ''positive'' being often omitted when there is no risk of confusion. Positive homogeneity leads to considerconsidering more functions as homogeneous. For example, the [[absolute value]] and all [[norm (mathematics)|norms]] are positively homogeneous functions that are not homogeneous.
 
The restriction of the scaling factor to real positive values allows also considering homogeneous functions whose degree of homogeneity is any real number.
Line 62:
More generally, every [[norm (mathematics)|norm]] and [[seminorm]] is a positively homogeneous function of degree {{math|1}} which is not a homogeneous function. As for the absolute value, if the norm or semi-norm is defined on a vector space over the complex numbers, this vector space has to be considered as vector space over the real number for applying the definition of a positively homogeneous function.
 
===Linear functionsMaps===
Any [[linear map]] <math>f : V \to W</math> between [[vector space]]s over a [[field (mathematics)|field]] {{mvar|F}} is homogeneous of degree 1, by the definition of linearity:
<math display="block">f(\alpha \mathbf{v}) = \alpha f(\mathbf{v})</math>
Line 113:
 
The converse is proved by integrating a simple [[differential equation]].
Let <math>\mathbf{x}</math> be in the interior of the ___domain of {{mvar|f}}. For {{mvar|s}} sufficiently close ofto {{math|1}}, the function
<math display="inline"> g(s) = f(s \mathbf{x})</math> is well defined. The partial differential equation implies that
<math display=block>
Line 224:
==Sources==
{{sfn whitelist|CITEREFKubrusly2011}}
* {{cite book|last=Blatter|first=Christian|title=Analysis II (|edition=2nd ed.)|publisher=Springer Verlag|year=1979|language=German|isbn=3-540-09484-9|pages=188|chapter=20. Mehrdimensionale Differentialrechnung, Aufgaben, 1.}}
* {{Kubrusly The Elements of Operator Theory 2nd Edition 2011}} <!--{{sfn|Kubrusly|2011|p=}}-->
* {{Schaefer Wolff Topological Vector Spaces|edition=2}} <!--{{sfn|Schaefer|Wolff|1999|p=}}-->