Cauchy's functional equation: Difference between revisions
No information was added, removed or changed. Only copy editing. |
m let's drop the repeated "Cauchy's" from these red links |
||
(20 intermediate revisions by 14 users not shown) | |||
Line 1: | Line 1: | ||
{{Short description|Functional equation}} |
|||
'''Cauchy's functional equation''' is the [[functional equation]]: |
'''Cauchy's functional equation''' is the [[functional equation]]: |
||
<math display=block>f(x+y) = f(x) + f(y).\ </math> |
<math display=block>f(x+y) = f(x) + f(y).\ </math> |
||
A function <math>f</math> that solves this equation is called an [[additive map|additive function]]. Over the [[rational number]]s, it can be shown using [[elementary algebra]] that there is a single family of solutions, namely <math>f |
A function <math>f</math> that solves this equation is called an [[additive map|additive function]]. Over the [[rational number]]s, it can be shown using [[elementary algebra]] that there is a single family of solutions, namely <math>f \colon x\mapsto cx</math> for any rational constant <math>c.</math> Over the [[real number]]s, the family of [[linear map]]s <math>f : x \mapsto cx,</math> now with <math>c</math> an arbitrary real constant, is likewise a family of solutions; however there can exist other solutions not of this form that are extremely complicated. However, any of a number of regularity conditions, some of them quite weak, will preclude the existence of these [[pathological (mathematics)|pathological]] solutions. For example, an additive function <math>f \colon \R\to\R</math> is [[linear map|linear]] if: |
||
* <math>f</math> is [[continuous function|continuous]] ( |
* <math>f</math> is [[continuous function|continuous]] ([[Cauchy]], 1821). In fact, it suffices for <math>f</math> to be continuous at one point ([[Jean Gaston Darboux|Darboux]], 1875). |
||
* <math>f(x)\ge0</math> or <math>f(x)\le0</math> for all <math>x\ge0</math>. |
|||
* <math>f</math> is [[monotonic function|monotonic]] on any [[interval (mathematics)|interval]]. |
* <math>f</math> is [[monotonic function|monotonic]] on any [[interval (mathematics)|interval]]. |
||
* <math>f</math> is [[bounded function|bounded]] on any interval. |
* <math>f</math> is [[bounded function|bounded]] on any interval. |
||
* <math>f</math> is [[Lebesgue measurable]]. |
* <math>f</math> is [[Lebesgue measurable]]. |
||
* <math>f\left(x^{n+1}\right)=x^nf(x)</math> for all real <math>x</math> and some positive integer <math>n</math>. |
|||
On the other hand, if no further conditions are imposed on <math>f,</math> then (assuming the [[axiom of choice]]) there are infinitely many other functions that satisfy the equation. This was proved in 1905 by [[Georg Hamel]] using [[Hamel bases]]. Such functions are sometimes called ''Hamel functions''.<ref>Kuczma (2009), p.130</ref> |
On the other hand, if no further conditions are imposed on <math>f,</math> then (assuming the [[axiom of choice]]) there are infinitely many other functions that satisfy the equation. This was proved in 1905 by [[Georg Hamel]] using [[Hamel bases]]. Such functions are sometimes called ''Hamel functions''.<ref>Kuczma (2009), p.130</ref> |
||
The [[Hilbert's fifth problem|fifth problem]] on [[Hilbert's problems|Hilbert's list]] is a generalisation of this equation. Functions where there exists a real number <math>c</math> such that <math>f(cx) \ne cf(x)</math> are known as Cauchy-Hamel functions and are used in Dehn-Hadwiger invariants which are used in the extension of [[Hilbert's third problem]] from 3D to higher dimensions.<ref>V.G. Boltianskii (1978) "Hilbert's third problem", Halsted Press, Washington</ref> |
The [[Hilbert's fifth problem|fifth problem]] on [[Hilbert's problems|Hilbert's list]] is a generalisation of this equation. Functions where there exists a real number <math>c</math> such that <math>f(cx) \ne cf(x)</math> are known as Cauchy-Hamel functions and are used in Dehn-Hadwiger invariants which are used in the extension of [[Hilbert's third problem]] from 3D to higher dimensions.<ref>V.G. Boltianskii (1978) "Hilbert's third problem", Halsted Press, Washington</ref> |
||
This equation is sometimes referred to as '''Cauchy's additive functional equation''' to distinguish it from the other functional equations introduced by Cauchy in 1821, the [[exponential functional equation]] <math>f(x + y) = f(x) f(y),</math> the [[logarithmic functional equation]] <math>f(xy) = f(x) + f(y),</math> and the [[multiplicative functional equation]] <math>f(x y) = f(x) f(y).</math> |
|||
==Solutions over the rational numbers == |
==Solutions over the rational numbers == |
||
A simple argument, involving only elementary algebra, demonstrates that the set of additive maps |
A simple argument, involving only elementary algebra, demonstrates that the set of additive maps <math>f \colon V \to W</math>, where <math>V, W</math> are vector spaces over an extension field of <math>\Q</math>, is identical to the set of <math>\Q</math>-linear maps from <math>V</math> to <math>W</math>. |
||
'''Theorem:''' ''Let <math>f |
'''Theorem:''' ''Let <math>f \colon V \to W</math> be an additive function. Then <math>f</math> is <math>\Q</math>-linear.'' |
||
'''Proof:''' We want to prove that any solution <math>f |
'''Proof:''' We want to prove that any solution <math>f \colon V \to W</math> to Cauchy’s functional equation, <math>f(x+y) = f(x) + f(y)</math>, satisfies <math>f(q v) = q f(v)</math> for any <math>q \in \Q</math> and <math>v \in V</math>. Let <math>v \in V</math>. |
||
First note <math>f(0) = f(0 + 0) = f(0) + f(0)</math>, hence <math>f(0) = 0</math>, and therewith <math>0 = f(0) = f(v + (-v)) = f(v) + f(-v)</math> from which follows <math>f(-v) = -f(v)</math>. |
|||
⚫ | |||
Via induction, <math>f(m v) = m f(v)</math> is proved for any <math>m \in \N \cup \{0\}</math>. |
|||
By setting <math>y=0</math> we conclude that |
|||
⚫ | |||
⚫ | |||
For any negative integer <math>m \in \Z</math> we know <math>-m \in \N</math>, therefore <math>f(m v) = f((-m) (-v)) = (-m) f(-v) = (-m) (-f(v)) = m f(v)</math>. Thus far we have proved |
|||
<u>Case II:</u> (<math>q>0</math>) |
|||
:<math>f(m v) = m f(v)</math> for any <math>m \in \Z</math>. |
|||
Let <math>n \in \N</math>, then <math>f(v) = f(n n^{-1} v) = n f(n^{-1} v)</math> and hence <math>f(n^{-1} v) = n^{-1} f(v)</math>. |
|||
<math display=block>n f(x) = f(n x), \quad n \in \N,\ x \in \Q.\qquad (*)</math> |
|||
Finally, any <math>q \in \Q</math> has a representation <math>q = \frac{m}{n}</math> with <math>m \in \Z</math> and <math>n \in \N</math>, so, putting things together, |
|||
<math |
:<math>f(q v) = f\left( \frac{m}{n} \, v \right) = f\left( \frac{1}{n} \, (m v) \right) = \frac{1}{n} \, f(m v) = \frac{1}{n} \, m \, f(v) = q f(v)</math>, q.e.d. |
||
⚫ | |||
Application of <math>(*)</math> to the left-hand side of <math>(**)</math> then affords |
|||
<math display=block>f\!\left(\frac{m}{n}x\right) = \frac{m}{n} f(x),\quad m,n \in \N,\ x \in \Q</math> |
|||
<math display=block>\implies f(qx) = q f(x), \quad q,x \in \Q,\ q>0 </math> |
|||
<math display=block>\implies f(q) = q f(1) = cq, \quad q \in \Q^+ ,</math> |
|||
⚫ | |||
where <math>c=f(1) \in \Q</math> is an arbitrary rational constant. |
|||
⚫ | |||
⚫ | |||
{{Math theorem |
|||
<u>Case III:</u> (<math>q<0</math>) |
|||
| name = Lemma |
|||
| note = |
|||
| math_statement = Let <math>t > 0</math>. If <math>f</math> satisfies the Cauchy functional equation on the interval <math>[0, t]</math> , but is not linear, then its graph is dense on the strip <math>[0, t] \times \R</math>. |
|||
}} |
|||
{{Math proof|proof= WLOG, scale <math>f</math> on the x-axis and y-axis, so that <math>f</math> satisfies the Cauchy functional equation on <math>[0, 1]</math>, and <math>f(1) = 1</math>. |
|||
It suffices to show that the graph of <math>f</math> is dense in <math>(0, 1) \times \R</math>, which is dense in <math>[0, 1]\times \R</math>. |
|||
<math display=block>f(-x) = -f(x),\,\ \ x \in \Q.</math> |
|||
Since <math>f</math> is not linear, we have <math>f(a) \neq a</math> for some <math>a\in (0, 1)</math>. |
|||
Combining this with the conclusion drawn for the positive rational numbers (Case II) gives |
|||
<math display=block>f(q) = -f(-q) = -\big(c(-q)\big) = cq,\,\ \ q \in \Q^{-}.</math> |
|||
Claim: The lattice defined by <math>L:= \{(r_1 + r_2 a, r_1 + r_2 f(a)): r_1, r_2 \in \mathbb Q\}</math> is dense in <math>\R^2</math>. |
|||
Considered together, the three cases above allow us to conclude that the complete solutions of Cauchy's functional equation over the rational numbers are given by: |
|||
<math display=block>f:\Q \to \Q,\ q \mapsto cq,\quad c=f(1)\in\Q. \quad\blacksquare</math> |
|||
Consider the linear transformation <math>A: \R^2 \to \R^2</math> defined by |
|||
⚫ | |||
⚫ | |||
⚫ | |||
\begin{bmatrix} |
|||
⚫ | |||
1 & a\\ |
|||
⚫ | |||
1 & f(a) |
|||
\end{bmatrix} |
|||
\begin{bmatrix} x\\ y \end{bmatrix} |
|||
</math> |
|||
With this transformation, we have <math>L = A(\mathbb Q^2)</math>. |
|||
Since <math>\det A = f(a) - a \neq 0</math>, the transformation is invertible, thus it is bicontinuous. Since <math>\mathbb Q^2</math> is dense in <math>\R^2</math>, so is <math>L</math>. <math>\square</math> |
|||
Claim: if <math>r_1, r_2 \in \mathbb Q</math>, and <math>r_1 + r_2 a \in (0, 1)</math>, then <math>f(r_1 + r_2 a) = r_1 + r_2 f(a)</math>. |
|||
Put |
|||
<math display=block>f(\alpha) = \alpha + \delta,\ \delta \neq 0.</math> |
|||
If <math>r_1, r_2 \geq 0</math>, then it is true by additivity. If <math>r_1, r_2 < 0</math>, then <math>r_1 + r_2 a < 0</math>, contradiction. |
|||
If <math>r_1 \geq 0, r_2 < 0</math>, then since <math>r_1 + r_2 a > 0</math>, we have <math>r_1 > 0</math>. Let <math>k</math> be a positive integer large enough such that <math>\frac{r_1}k, \frac{-r_2 a}{k} \in (0, 1)</math>. Then we have by additivity: |
|||
<math display=block>|\beta - b| < \frac{r}{2 |\delta|} \ .</math> |
|||
⚫ | |||
Then choose a rational number <math>a \in \Q</math> close to <math>\alpha</math> with |
|||
f\left(\frac{r_1}k + \frac{r_2 a}k\right) + f\left(\frac{-r_2 a}k\right) = f\left(\frac{r_1}k\right) |
|||
<math display=block>|\alpha - a| < \frac{r}{2 |b|} \ .</math> |
|||
</math> |
|||
That is, |
|||
Now put: |
|||
<math display=block>X = x + b (\alpha - a)</math> |
|||
⚫ | |||
⚫ | |||
Then using the functional equation, we get: |
|||
\frac{1}{k} f\left(r_1 + r_2 a\right) + \frac{-r_2}k f\left(a\right) =\frac{r_1}k |
|||
<math display=block>\begin{alignat}{9} |
|||
⚫ | |||
Y |
|||
&= f(x + b (\alpha - a)) ~&& \\ |
|||
&= f(x + b\alpha - ba) ~&& \\ |
|||
&= x + b f(\alpha) - b f(a) ~&& \\ |
|||
&= y - \delta \beta + b f(\alpha) - b a ~&& \text{ since } f(a) = a \text{ and } x = y - \beta \delta \\ |
|||
&= y - \delta \beta + b (\alpha + \delta) - b a ~&& \text{ since } f(\alpha) = \alpha + \delta \\ |
|||
&= y + b (\alpha - a) - \delta (\beta - b) ~&& \\ |
|||
\end{alignat}</math> |
|||
Thus, the graph of <math>f</math> contains <math>L \cap ((0, 1) \times \R)</math>, which is dense in <math>(0, 1) \times \R</math>. }} |
|||
==Existence of nonlinear solutions over the real numbers== |
==Existence of nonlinear solutions over the real numbers== |
||
The linearity proof given above also applies to <math>f |
The linearity proof given above also applies to <math>f \colon \alpha \Q\to\R,</math> where <math>\alpha\Q</math> is a scaled copy of the rationals. This shows that only linear solutions are permitted when the [[domain of a function|domain]] of <math>f</math> is restricted to such sets. Thus, in general, we have <math>f(\alpha q)=f(\alpha)q</math> for all <math>\alpha \in \R</math> and <math>q \in \Q.</math> However, as we will demonstrate below, highly pathological solutions can be found for functions <math>f \colon \R \to \R</math> based on these linear solutions, by viewing the reals as a [[vector space]] over the [[field (mathematics)|field]] of rational numbers. Note, however, that this method is nonconstructive, relying as it does on the existence of a [[Basis (linear algebra)|(Hamel) basis]] for any vector space, a statement proved using [[Zorn's lemma]]. (In fact, the existence of a basis for every vector space is logically equivalent to the [[axiom of choice]].) There exist models<ref>{{Cite journal |last=Solovay |first=Robert M. |date=1970 |title=A Model of Set-Theory in Which Every Set of Reals is Lebesgue Measurable |url=https://www.jstor.org/stable/1970696 |journal=Annals of Mathematics |volume=92 |issue=1 |pages=1–56 |doi=10.2307/1970696 |issn=0003-486X}}</ref> where all sets of reals are measurable which are consistent with ZF + [[Axiom of dependent choice|DC]], and therein all solutions are linear.<ref>{{Cite web |last=E. Caicedo |first=Andrés |date=2011-03-06 |title=Are there any non-linear solutions of Cauchy's equation $f(x+y)=f(x)+f(y)$ without assuming the Axiom of Choice? |url=https://mathoverflow.net/a/57532 |access-date=2024-02-21 |website=MathOverflow |language=en}}</ref> |
||
To show that solutions other than the ones defined by <math>f(x)=f(1)x</math> exist, we first note that because every vector space has a basis, there is a basis for <math>\R</math> over the field <math>\Q,</math> i.e. a set <math>\mathcal{B} \sub \R</math> with the property that any <math> x\in\R</math> can be expressed uniquely as <math display="inline"> x= \sum_{i \in I}{ \lambda_i x_i },</math> where <math>\{ x_i \}_{i \in I}</math> is a finite [[subset]] of <math>\mathcal{B},</math> and each <math>\lambda_i</math> is in <math>\Q.</math> We note that because no explicit basis for <math>\R</math> over <math>\Q</math> can be written down, the pathological solutions defined below likewise cannot be expressed explicitly. |
To show that solutions other than the ones defined by <math>f(x)=f(1)x</math> exist, we first note that because every vector space has a basis, there is a basis for <math>\R</math> over the field <math>\Q,</math> i.e. a set <math>\mathcal{B} \sub \R</math> with the property that any <math> x\in\R</math> can be expressed uniquely as <math display="inline"> x= \sum_{i \in I}{ \lambda_i x_i },</math> where <math>\{ x_i \}_{i \in I}</math> is a finite [[subset]] of <math>\mathcal{B},</math> and each <math>\lambda_i</math> is in <math>\Q.</math> We note that because no explicit basis for <math>\R</math> over <math>\Q</math> can be written down, the pathological solutions defined below likewise cannot be expressed explicitly. |
||
As argued above, the restriction of <math>f</math> to <math>x_i \Q</math> must be a linear map for each <math>x_i \in \mathcal{B}.</math> Moreover, because <math>x_iq\mapsto f(x_i)q</math> for <math>q \in \Q,</math> it is clear that <math>f(x_i) \over x_i</math> is the constant of proportionality. In other words, <math>f |
As argued above, the restriction of <math>f</math> to <math>x_i \Q</math> must be a linear map for each <math>x_i \in \mathcal{B}.</math> Moreover, because <math>x_iq\mapsto f(x_i)q</math> for <math>q \in \Q,</math> it is clear that <math>f(x_i) \over x_i</math> is the constant of proportionality. In other words, <math>f \colon x_i\Q \to \R</math> is the map <math>\xi \mapsto [f(x_i)/x_i]\xi.</math> Since any <math>x \in \R</math> can be expressed as a unique (finite) linear combination of the <math>x_i</math>s, and <math>f \colon \R \to \R</math> is additive, <math>f(x)</math> is well-defined for all <math>x \in \R</math> and is given by: |
||
<math display=block>f(x) = f\Big(\sum_{i \in I} \lambda_i x_i\Big) = \sum_{i \in I} f(x_i\lambda_i) = \sum_{i \in I} f(x_i) \lambda_i.</math> |
<math display=block>f(x) = f\Big(\sum_{i \in I} \lambda_i x_i\Big) = \sum_{i \in I} f(x_i\lambda_i) = \sum_{i \in I} f(x_i) \lambda_i.</math> |
||
It is easy to check that <math>f</math> is a solution to Cauchy's functional equation given a definition of <math>f</math> on the basis elements, <math>f |
It is easy to check that <math>f</math> is a solution to Cauchy's functional equation given a definition of <math>f</math> on the basis elements, <math>f \colon \mathcal{B} \to \R.</math> Moreover, it is clear that every solution is of this form. In particular, the solutions of the functional equation are linear [[if and only if]] <math>f(x_i) \over x_i</math> is constant over all <math>x_i \in \mathcal{B}.</math> Thus, in a sense, despite the inability to exhibit a nonlinear solution, "most" (in the sense of cardinality<ref>It can easily be shown that <math>\mathrm{card}(\mathcal{B})=\mathfrak{c}</math>; thus there are <math>\mathfrak{c}^\mathfrak{c}=2^\mathfrak{c}</math> functions <math>f \colon \mathcal{B}\to\R,</math> each of which could be extended to a unique solution of the functional equation. On the other hand, there are only <math>\mathfrak{c}</math> solutions that are linear.</ref>) solutions to the Cauchy functional equation are actually nonlinear and pathological. |
||
==See also== |
==See also== |
||
Line 109: | Line 110: | ||
* {{cite book|last=Kuczma|first=Marek|authorlink=Marek Kuczma|title=An introduction to the theory of functional equations and inequalities. Cauchy's equation and Jensen's inequality|publisher=Birkhäuser|location=Basel|year=2009|isbn=9783764387495}} |
* {{cite book|last=Kuczma|first=Marek|authorlink=Marek Kuczma|title=An introduction to the theory of functional equations and inequalities. Cauchy's equation and Jensen's inequality|publisher=Birkhäuser|location=Basel|year=2009|isbn=9783764387495}} |
||
* {{cite journal|last=Hamel|first=Georg|title=Eine Basis aller Zahlen und die unstetigen Lösungen der Funktionalgleichung: f(x+y) = f(x) + f(y).|journal=Mathematische Annalen|year=1905}} |
|||
==External links== |
==External links== |
||
* Solution to the Cauchy Equation [http://www.math.rutgers.edu/~useminar/cauchy.pdf Rutgers University] |
* Solution to the Cauchy Equation [http://www.math.rutgers.edu/~useminar/cauchy.pdf Rutgers University] |
||
* [http://cofault.com/2010/01/hunt-for-addictive-monster.html The Hunt for Addi(c)tive Monster] |
* [http://www.cofault.com/2010/01/hunt-for-addictive-monster.html The Hunt for Addi(c)tive Monster] |
||
* {{cite web|url=https://math.stackexchange.com/q/423492|title=Overview of basic facts about Cauchy functional equation|website=StackExchange|date=2013|accessdate=20 December 2015|author=Martin Sleziak|display-authors=etal}} |
* {{cite web|url=https://math.stackexchange.com/q/423492|title=Overview of basic facts about Cauchy functional equation|website=StackExchange|date=2013|accessdate=20 December 2015|author=Martin Sleziak|display-authors=etal}} |
||
Latest revision as of 15:44, 25 November 2024
Cauchy's functional equation is the functional equation:
A function that solves this equation is called an additive function. Over the rational numbers, it can be shown using elementary algebra that there is a single family of solutions, namely for any rational constant Over the real numbers, the family of linear maps now with an arbitrary real constant, is likewise a family of solutions; however there can exist other solutions not of this form that are extremely complicated. However, any of a number of regularity conditions, some of them quite weak, will preclude the existence of these pathological solutions. For example, an additive function is linear if:
- is continuous (Cauchy, 1821). In fact, it suffices for to be continuous at one point (Darboux, 1875).
- or for all .
- is monotonic on any interval.
- is bounded on any interval.
- is Lebesgue measurable.
- for all real and some positive integer .
On the other hand, if no further conditions are imposed on then (assuming the axiom of choice) there are infinitely many other functions that satisfy the equation. This was proved in 1905 by Georg Hamel using Hamel bases. Such functions are sometimes called Hamel functions.[1]
The fifth problem on Hilbert's list is a generalisation of this equation. Functions where there exists a real number such that are known as Cauchy-Hamel functions and are used in Dehn-Hadwiger invariants which are used in the extension of Hilbert's third problem from 3D to higher dimensions.[2]
This equation is sometimes referred to as Cauchy's additive functional equation to distinguish it from the other functional equations introduced by Cauchy in 1821, the exponential functional equation the logarithmic functional equation and the multiplicative functional equation
Solutions over the rational numbers
[edit]A simple argument, involving only elementary algebra, demonstrates that the set of additive maps , where are vector spaces over an extension field of , is identical to the set of -linear maps from to .
Theorem: Let be an additive function. Then is -linear.
Proof: We want to prove that any solution to Cauchy’s functional equation, , satisfies for any and . Let .
First note , hence , and therewith from which follows .
Via induction, is proved for any .
For any negative integer we know , therefore . Thus far we have proved
- for any .
Let , then and hence .
Finally, any has a representation with and , so, putting things together,
- , q.e.d.
Properties of nonlinear solutions over the real numbers
[edit]We prove below that any other solutions must be highly pathological functions. In particular, it is shown that any other solution must have the property that its graph is dense in that is, that any disk in the plane (however small) contains a point from the graph. From this it is easy to prove the various conditions given in the introductory paragraph.
Lemma — Let . If satisfies the Cauchy functional equation on the interval , but is not linear, then its graph is dense on the strip .
WLOG, scale on the x-axis and y-axis, so that satisfies the Cauchy functional equation on , and . It suffices to show that the graph of is dense in , which is dense in .
Since is not linear, we have for some .
Claim: The lattice defined by is dense in .
Consider the linear transformation defined by
With this transformation, we have .
Since , the transformation is invertible, thus it is bicontinuous. Since is dense in , so is .
Claim: if , and , then .
If , then it is true by additivity. If , then , contradiction.
If , then since , we have . Let be a positive integer large enough such that . Then we have by additivity:
That is,
Thus, the graph of contains , which is dense in .
Existence of nonlinear solutions over the real numbers
[edit]The linearity proof given above also applies to where is a scaled copy of the rationals. This shows that only linear solutions are permitted when the domain of is restricted to such sets. Thus, in general, we have for all and However, as we will demonstrate below, highly pathological solutions can be found for functions based on these linear solutions, by viewing the reals as a vector space over the field of rational numbers. Note, however, that this method is nonconstructive, relying as it does on the existence of a (Hamel) basis for any vector space, a statement proved using Zorn's lemma. (In fact, the existence of a basis for every vector space is logically equivalent to the axiom of choice.) There exist models[3] where all sets of reals are measurable which are consistent with ZF + DC, and therein all solutions are linear.[4]
To show that solutions other than the ones defined by exist, we first note that because every vector space has a basis, there is a basis for over the field i.e. a set with the property that any can be expressed uniquely as where is a finite subset of and each is in We note that because no explicit basis for over can be written down, the pathological solutions defined below likewise cannot be expressed explicitly.
As argued above, the restriction of to must be a linear map for each Moreover, because for it is clear that is the constant of proportionality. In other words, is the map Since any can be expressed as a unique (finite) linear combination of the s, and is additive, is well-defined for all and is given by:
It is easy to check that is a solution to Cauchy's functional equation given a definition of on the basis elements, Moreover, it is clear that every solution is of this form. In particular, the solutions of the functional equation are linear if and only if is constant over all Thus, in a sense, despite the inability to exhibit a nonlinear solution, "most" (in the sense of cardinality[5]) solutions to the Cauchy functional equation are actually nonlinear and pathological.
See also
[edit]- Antilinear map – Conjugate homogeneous additive map
- Homogeneous function – Function with a multiplicative scaling behaviour
- Minkowski functional – Function made from a set
- Semilinear map – homomorphism between modules, paired with the associated homomorphism between the respective base rings
References
[edit]- ^ Kuczma (2009), p.130
- ^ V.G. Boltianskii (1978) "Hilbert's third problem", Halsted Press, Washington
- ^ Solovay, Robert M. (1970). "A Model of Set-Theory in Which Every Set of Reals is Lebesgue Measurable". Annals of Mathematics. 92 (1): 1–56. doi:10.2307/1970696. ISSN 0003-486X.
- ^ E. Caicedo, Andrés (2011-03-06). "Are there any non-linear solutions of Cauchy's equation $f(x+y)=f(x)+f(y)$ without assuming the Axiom of Choice?". MathOverflow. Retrieved 2024-02-21.
- ^ It can easily be shown that ; thus there are functions each of which could be extended to a unique solution of the functional equation. On the other hand, there are only solutions that are linear.
- Kuczma, Marek (2009). An introduction to the theory of functional equations and inequalities. Cauchy's equation and Jensen's inequality. Basel: Birkhäuser. ISBN 9783764387495.
- Hamel, Georg (1905). "Eine Basis aller Zahlen und die unstetigen Lösungen der Funktionalgleichung: f(x+y) = f(x) + f(y)". Mathematische Annalen.
External links
[edit]- Solution to the Cauchy Equation Rutgers University
- The Hunt for Addi(c)tive Monster
- Martin Sleziak; et al. (2013). "Overview of basic facts about Cauchy functional equation". StackExchange. Retrieved 20 December 2015.