Multiplicatively separable function: Difference between revisions
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
===For a function of two variables=== | ===For a function of two variables=== | ||
Suppose <math> | Suppose <math>G</math> is a function of two variables <matH>x</math> and <math>y</math>. We say that <math>G</matH> is '''multiplicatively separable''' if there exist functions <math>f,g</math> of one variable such that: | ||
<math> | <math>G(x,y) = f(x)g(y)</math> | ||
on the entire domain of <math> | on the entire domain of <math>G</math>. | ||
Note that the concept of multiplicatively separable is sensitive to the coordinate system, i.e., if we change the coordinate system, a function that was originally multiplicatively separable need not remain multiplicatively separable. | Note that the concept of multiplicatively separable is sensitive to the coordinate system, i.e., if we change the coordinate system, a function that was originally multiplicatively separable need not remain multiplicatively separable. | ||
| Line 13: | Line 13: | ||
===For a function of many variables=== | ===For a function of many variables=== | ||
Suppose <math> | Suppose <math>G</math> is a function of <math>n</math> variables <math>x_1,x_2,\dots,x_n</math>. We say that <math>G</math> is '''completely multiplicatively separable''' if there exist functions <math>g_1,g_2,\dots,g_n</math>, each a function of one variable, such that: | ||
<math> | <math>G(x_1,x_2,\dots,x_n) = g_1(x_1)g_2(x_2) \dots g_n(x_n)</math> | ||
(note that the subscripts here are ''not'' to be confused with subscripts used for partial derivatives). | (note that the subscripts here are ''not'' to be confused with subscripts used for partial derivatives). | ||
There is a weaker notion of ''partially multiplicatively separable'': if we express the set <math>\{ 1,2,\dots,n\}</math> as a union of two disjoint subsets <math>A,B</math>, <math> | There is a weaker notion of ''partially multiplicatively separable'': if we express the set <math>\{ 1,2,\dots,n\}</math> as a union of two disjoint subsets <math>A,B</math>, <math>G</matH> is multiplicatively separable with respect to the partition if there exist functions <math>g_A,g_B</math> such that: | ||
<math> | <math>G(x_1,x_2,\dots,x_n) = g_A(\mbox{only the variables } x_i, i \in A)g_B(\mbox{only the variables } x_i, i \in B)</math> | ||
<center>{{#widget:YouTube|id=9pXmMkHG248}}</center> | |||
Revision as of 23:35, 10 April 2012
Definition
For a function of two variables
Suppose is a function of two variables and . We say that is multiplicatively separable if there exist functions of one variable such that:
on the entire domain of .
Note that the concept of multiplicatively separable is sensitive to the coordinate system, i.e., if we change the coordinate system, a function that was originally multiplicatively separable need not remain multiplicatively separable.
For a function of many variables
Suppose is a function of variables . We say that is completely multiplicatively separable if there exist functions , each a function of one variable, such that:
(note that the subscripts here are not to be confused with subscripts used for partial derivatives).
There is a weaker notion of partially multiplicatively separable: if we express the set as a union of two disjoint subsets , is multiplicatively separable with respect to the partition if there exist functions such that: