Sums of entire surjective functions
$begingroup$
Suppose $(f_n)_n$ is a countable family of entire, surjective functions, each $f_n:mathbb{C}tomathbb{C}$. Can one always find complex scalars $(a_n)_n$, not all zero, such that $sum_{n=1}^{infty} a_n f_n$ is entire but not-surjective? In fact, I am interested in this question under the additional assumption that $(f_n)_n$ are not polynomials.
ca.classical-analysis-and-odes cv.complex-variables
New contributor
$endgroup$
add a comment |
$begingroup$
Suppose $(f_n)_n$ is a countable family of entire, surjective functions, each $f_n:mathbb{C}tomathbb{C}$. Can one always find complex scalars $(a_n)_n$, not all zero, such that $sum_{n=1}^{infty} a_n f_n$ is entire but not-surjective? In fact, I am interested in this question under the additional assumption that $(f_n)_n$ are not polynomials.
ca.classical-analysis-and-odes cv.complex-variables
New contributor
$endgroup$
$begingroup$
I'm not sure I understand the question. Are there some extra assumptions on the $f_n$ or on the $a_n$ ? For instance, assume that $f_1=-f_2$, then $a_1=a_2=1$, $a_n=0$, $ngeq 3$, will yield $sum a_nf_n=0$...
$endgroup$
– M. Dus
2 days ago
1
$begingroup$
@M.Dus: I suppose OP asks whether one can always find such scalaras. I also guess that the sum is supposed to be entire, not surjective and non-constant.
$endgroup$
– Mateusz Kwaśnicki
2 days ago
$begingroup$
@Mateusz Kwasnicki: this does not help. Suppose they are all polynomials. If the linear combination is not constant is must be surjective.
$endgroup$
– Alexandre Eremenko
2 days ago
1
$begingroup$
Maybe $(f_n)$ denotes an infinite sequence of functions?
$endgroup$
– Nik Weaver
2 days ago
$begingroup$
@AlexandreEremenko I made some edits, I hope it is more clear now. Indeed, the question is if this is true for any such family.
$endgroup$
– user137377
2 days ago
add a comment |
$begingroup$
Suppose $(f_n)_n$ is a countable family of entire, surjective functions, each $f_n:mathbb{C}tomathbb{C}$. Can one always find complex scalars $(a_n)_n$, not all zero, such that $sum_{n=1}^{infty} a_n f_n$ is entire but not-surjective? In fact, I am interested in this question under the additional assumption that $(f_n)_n$ are not polynomials.
ca.classical-analysis-and-odes cv.complex-variables
New contributor
$endgroup$
Suppose $(f_n)_n$ is a countable family of entire, surjective functions, each $f_n:mathbb{C}tomathbb{C}$. Can one always find complex scalars $(a_n)_n$, not all zero, such that $sum_{n=1}^{infty} a_n f_n$ is entire but not-surjective? In fact, I am interested in this question under the additional assumption that $(f_n)_n$ are not polynomials.
ca.classical-analysis-and-odes cv.complex-variables
ca.classical-analysis-and-odes cv.complex-variables
New contributor
New contributor
edited 2 days ago
user137377
New contributor
asked 2 days ago
user137377user137377
263
263
New contributor
New contributor
$begingroup$
I'm not sure I understand the question. Are there some extra assumptions on the $f_n$ or on the $a_n$ ? For instance, assume that $f_1=-f_2$, then $a_1=a_2=1$, $a_n=0$, $ngeq 3$, will yield $sum a_nf_n=0$...
$endgroup$
– M. Dus
2 days ago
1
$begingroup$
@M.Dus: I suppose OP asks whether one can always find such scalaras. I also guess that the sum is supposed to be entire, not surjective and non-constant.
$endgroup$
– Mateusz Kwaśnicki
2 days ago
$begingroup$
@Mateusz Kwasnicki: this does not help. Suppose they are all polynomials. If the linear combination is not constant is must be surjective.
$endgroup$
– Alexandre Eremenko
2 days ago
1
$begingroup$
Maybe $(f_n)$ denotes an infinite sequence of functions?
$endgroup$
– Nik Weaver
2 days ago
$begingroup$
@AlexandreEremenko I made some edits, I hope it is more clear now. Indeed, the question is if this is true for any such family.
$endgroup$
– user137377
2 days ago
add a comment |
$begingroup$
I'm not sure I understand the question. Are there some extra assumptions on the $f_n$ or on the $a_n$ ? For instance, assume that $f_1=-f_2$, then $a_1=a_2=1$, $a_n=0$, $ngeq 3$, will yield $sum a_nf_n=0$...
$endgroup$
– M. Dus
2 days ago
1
$begingroup$
@M.Dus: I suppose OP asks whether one can always find such scalaras. I also guess that the sum is supposed to be entire, not surjective and non-constant.
$endgroup$
– Mateusz Kwaśnicki
2 days ago
$begingroup$
@Mateusz Kwasnicki: this does not help. Suppose they are all polynomials. If the linear combination is not constant is must be surjective.
$endgroup$
– Alexandre Eremenko
2 days ago
1
$begingroup$
Maybe $(f_n)$ denotes an infinite sequence of functions?
$endgroup$
– Nik Weaver
2 days ago
$begingroup$
@AlexandreEremenko I made some edits, I hope it is more clear now. Indeed, the question is if this is true for any such family.
$endgroup$
– user137377
2 days ago
$begingroup$
I'm not sure I understand the question. Are there some extra assumptions on the $f_n$ or on the $a_n$ ? For instance, assume that $f_1=-f_2$, then $a_1=a_2=1$, $a_n=0$, $ngeq 3$, will yield $sum a_nf_n=0$...
$endgroup$
– M. Dus
2 days ago
$begingroup$
I'm not sure I understand the question. Are there some extra assumptions on the $f_n$ or on the $a_n$ ? For instance, assume that $f_1=-f_2$, then $a_1=a_2=1$, $a_n=0$, $ngeq 3$, will yield $sum a_nf_n=0$...
$endgroup$
– M. Dus
2 days ago
1
1
$begingroup$
@M.Dus: I suppose OP asks whether one can always find such scalaras. I also guess that the sum is supposed to be entire, not surjective and non-constant.
$endgroup$
– Mateusz Kwaśnicki
2 days ago
$begingroup$
@M.Dus: I suppose OP asks whether one can always find such scalaras. I also guess that the sum is supposed to be entire, not surjective and non-constant.
$endgroup$
– Mateusz Kwaśnicki
2 days ago
$begingroup$
@Mateusz Kwasnicki: this does not help. Suppose they are all polynomials. If the linear combination is not constant is must be surjective.
$endgroup$
– Alexandre Eremenko
2 days ago
$begingroup$
@Mateusz Kwasnicki: this does not help. Suppose they are all polynomials. If the linear combination is not constant is must be surjective.
$endgroup$
– Alexandre Eremenko
2 days ago
1
1
$begingroup$
Maybe $(f_n)$ denotes an infinite sequence of functions?
$endgroup$
– Nik Weaver
2 days ago
$begingroup$
Maybe $(f_n)$ denotes an infinite sequence of functions?
$endgroup$
– Nik Weaver
2 days ago
$begingroup$
@AlexandreEremenko I made some edits, I hope it is more clear now. Indeed, the question is if this is true for any such family.
$endgroup$
– user137377
2 days ago
$begingroup$
@AlexandreEremenko I made some edits, I hope it is more clear now. Indeed, the question is if this is true for any such family.
$endgroup$
– user137377
2 days ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
One expects there to be no such $a_n$ in general, because the
"typical" entire functions is surjective (those that aren't are of the
special form $z mapsto c + exp g(z)$). An explicit example is
$f_n(z) = cos z/n$: any convergent linear combination $f = sum_n a_n f_n$
is of order $1$, so if $f$ is not surjective then $g$ is a polynomial
of degree at most $1$; but $f$ is even, so must be constant,
from which it soon follows that $a_n=0$ for every $n$.
$endgroup$
add a comment |
$begingroup$
The answer is no. If something does not hold for polynomials, don't expect that it will hold for entire functions:-)
For example, all non-constant functions of order less than $1/2$ are surjective.
This follows from an old theorem of Wiman that for such function $f$ there exists
a sequence $r_ktoinfty$ such that $min_{|z|=r_k}|f(z)|toinfty$ as $kto infty.$
And of course linear combinations of functions of order less than $1/2$ are of order less
than $1/2$.
Edit. To construct a counterexample with infinite sums, one can use lacunary series. Let $Lambda$ be a sequence of integers $n_k$ which grows sufficiently fast,
for example, such that $n_k/ktoinfty$,
and consider the class of entire functions of the form
$$f(z)=sum_{ninLambda}c_nz^n.$$
It is known that all such functions are surjective. And of course any linear combination of such functions, finite or infinite, belongs to the class.
Reference: L. Sons, An analogue of a theorem of W.H.J. Fuchs on gap series,
Proc. LMS, 1970, 21 525-539.
$endgroup$
1
$begingroup$
Didn't the OP ask about infinite sums? The exponential function is the sum of its power series, and it is not surjective, so if $f_n(z) = z^n$, the answer is yes.
$endgroup$
– Mateusz Kwaśnicki
yesterday
1
$begingroup$
Do we really need a theorem of Wiman (or anyone else) to verify your claim that non-constant functions $f$ of order $<1$ are surjective? Doesn't this just follow from the Hadamard factorization, which implies that if $f-c$ doesn't have a zero, then $f-cequiv d$.
$endgroup$
– Christian Remling
yesterday
$begingroup$
@Christian Remling: Hadamard factorization is fine of course. On my opinion, Wiman's theorem is somewhat simpler, but this is a question of opinion.
$endgroup$
– Alexandre Eremenko
yesterday
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "504"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
user137377 is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326094%2fsums-of-entire-surjective-functions%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
One expects there to be no such $a_n$ in general, because the
"typical" entire functions is surjective (those that aren't are of the
special form $z mapsto c + exp g(z)$). An explicit example is
$f_n(z) = cos z/n$: any convergent linear combination $f = sum_n a_n f_n$
is of order $1$, so if $f$ is not surjective then $g$ is a polynomial
of degree at most $1$; but $f$ is even, so must be constant,
from which it soon follows that $a_n=0$ for every $n$.
$endgroup$
add a comment |
$begingroup$
One expects there to be no such $a_n$ in general, because the
"typical" entire functions is surjective (those that aren't are of the
special form $z mapsto c + exp g(z)$). An explicit example is
$f_n(z) = cos z/n$: any convergent linear combination $f = sum_n a_n f_n$
is of order $1$, so if $f$ is not surjective then $g$ is a polynomial
of degree at most $1$; but $f$ is even, so must be constant,
from which it soon follows that $a_n=0$ for every $n$.
$endgroup$
add a comment |
$begingroup$
One expects there to be no such $a_n$ in general, because the
"typical" entire functions is surjective (those that aren't are of the
special form $z mapsto c + exp g(z)$). An explicit example is
$f_n(z) = cos z/n$: any convergent linear combination $f = sum_n a_n f_n$
is of order $1$, so if $f$ is not surjective then $g$ is a polynomial
of degree at most $1$; but $f$ is even, so must be constant,
from which it soon follows that $a_n=0$ for every $n$.
$endgroup$
One expects there to be no such $a_n$ in general, because the
"typical" entire functions is surjective (those that aren't are of the
special form $z mapsto c + exp g(z)$). An explicit example is
$f_n(z) = cos z/n$: any convergent linear combination $f = sum_n a_n f_n$
is of order $1$, so if $f$ is not surjective then $g$ is a polynomial
of degree at most $1$; but $f$ is even, so must be constant,
from which it soon follows that $a_n=0$ for every $n$.
answered 2 days ago
Noam D. ElkiesNoam D. Elkies
56.4k11199282
56.4k11199282
add a comment |
add a comment |
$begingroup$
The answer is no. If something does not hold for polynomials, don't expect that it will hold for entire functions:-)
For example, all non-constant functions of order less than $1/2$ are surjective.
This follows from an old theorem of Wiman that for such function $f$ there exists
a sequence $r_ktoinfty$ such that $min_{|z|=r_k}|f(z)|toinfty$ as $kto infty.$
And of course linear combinations of functions of order less than $1/2$ are of order less
than $1/2$.
Edit. To construct a counterexample with infinite sums, one can use lacunary series. Let $Lambda$ be a sequence of integers $n_k$ which grows sufficiently fast,
for example, such that $n_k/ktoinfty$,
and consider the class of entire functions of the form
$$f(z)=sum_{ninLambda}c_nz^n.$$
It is known that all such functions are surjective. And of course any linear combination of such functions, finite or infinite, belongs to the class.
Reference: L. Sons, An analogue of a theorem of W.H.J. Fuchs on gap series,
Proc. LMS, 1970, 21 525-539.
$endgroup$
1
$begingroup$
Didn't the OP ask about infinite sums? The exponential function is the sum of its power series, and it is not surjective, so if $f_n(z) = z^n$, the answer is yes.
$endgroup$
– Mateusz Kwaśnicki
yesterday
1
$begingroup$
Do we really need a theorem of Wiman (or anyone else) to verify your claim that non-constant functions $f$ of order $<1$ are surjective? Doesn't this just follow from the Hadamard factorization, which implies that if $f-c$ doesn't have a zero, then $f-cequiv d$.
$endgroup$
– Christian Remling
yesterday
$begingroup$
@Christian Remling: Hadamard factorization is fine of course. On my opinion, Wiman's theorem is somewhat simpler, but this is a question of opinion.
$endgroup$
– Alexandre Eremenko
yesterday
add a comment |
$begingroup$
The answer is no. If something does not hold for polynomials, don't expect that it will hold for entire functions:-)
For example, all non-constant functions of order less than $1/2$ are surjective.
This follows from an old theorem of Wiman that for such function $f$ there exists
a sequence $r_ktoinfty$ such that $min_{|z|=r_k}|f(z)|toinfty$ as $kto infty.$
And of course linear combinations of functions of order less than $1/2$ are of order less
than $1/2$.
Edit. To construct a counterexample with infinite sums, one can use lacunary series. Let $Lambda$ be a sequence of integers $n_k$ which grows sufficiently fast,
for example, such that $n_k/ktoinfty$,
and consider the class of entire functions of the form
$$f(z)=sum_{ninLambda}c_nz^n.$$
It is known that all such functions are surjective. And of course any linear combination of such functions, finite or infinite, belongs to the class.
Reference: L. Sons, An analogue of a theorem of W.H.J. Fuchs on gap series,
Proc. LMS, 1970, 21 525-539.
$endgroup$
1
$begingroup$
Didn't the OP ask about infinite sums? The exponential function is the sum of its power series, and it is not surjective, so if $f_n(z) = z^n$, the answer is yes.
$endgroup$
– Mateusz Kwaśnicki
yesterday
1
$begingroup$
Do we really need a theorem of Wiman (or anyone else) to verify your claim that non-constant functions $f$ of order $<1$ are surjective? Doesn't this just follow from the Hadamard factorization, which implies that if $f-c$ doesn't have a zero, then $f-cequiv d$.
$endgroup$
– Christian Remling
yesterday
$begingroup$
@Christian Remling: Hadamard factorization is fine of course. On my opinion, Wiman's theorem is somewhat simpler, but this is a question of opinion.
$endgroup$
– Alexandre Eremenko
yesterday
add a comment |
$begingroup$
The answer is no. If something does not hold for polynomials, don't expect that it will hold for entire functions:-)
For example, all non-constant functions of order less than $1/2$ are surjective.
This follows from an old theorem of Wiman that for such function $f$ there exists
a sequence $r_ktoinfty$ such that $min_{|z|=r_k}|f(z)|toinfty$ as $kto infty.$
And of course linear combinations of functions of order less than $1/2$ are of order less
than $1/2$.
Edit. To construct a counterexample with infinite sums, one can use lacunary series. Let $Lambda$ be a sequence of integers $n_k$ which grows sufficiently fast,
for example, such that $n_k/ktoinfty$,
and consider the class of entire functions of the form
$$f(z)=sum_{ninLambda}c_nz^n.$$
It is known that all such functions are surjective. And of course any linear combination of such functions, finite or infinite, belongs to the class.
Reference: L. Sons, An analogue of a theorem of W.H.J. Fuchs on gap series,
Proc. LMS, 1970, 21 525-539.
$endgroup$
The answer is no. If something does not hold for polynomials, don't expect that it will hold for entire functions:-)
For example, all non-constant functions of order less than $1/2$ are surjective.
This follows from an old theorem of Wiman that for such function $f$ there exists
a sequence $r_ktoinfty$ such that $min_{|z|=r_k}|f(z)|toinfty$ as $kto infty.$
And of course linear combinations of functions of order less than $1/2$ are of order less
than $1/2$.
Edit. To construct a counterexample with infinite sums, one can use lacunary series. Let $Lambda$ be a sequence of integers $n_k$ which grows sufficiently fast,
for example, such that $n_k/ktoinfty$,
and consider the class of entire functions of the form
$$f(z)=sum_{ninLambda}c_nz^n.$$
It is known that all such functions are surjective. And of course any linear combination of such functions, finite or infinite, belongs to the class.
Reference: L. Sons, An analogue of a theorem of W.H.J. Fuchs on gap series,
Proc. LMS, 1970, 21 525-539.
edited yesterday
answered yesterday
Alexandre EremenkoAlexandre Eremenko
50.7k6140258
50.7k6140258
1
$begingroup$
Didn't the OP ask about infinite sums? The exponential function is the sum of its power series, and it is not surjective, so if $f_n(z) = z^n$, the answer is yes.
$endgroup$
– Mateusz Kwaśnicki
yesterday
1
$begingroup$
Do we really need a theorem of Wiman (or anyone else) to verify your claim that non-constant functions $f$ of order $<1$ are surjective? Doesn't this just follow from the Hadamard factorization, which implies that if $f-c$ doesn't have a zero, then $f-cequiv d$.
$endgroup$
– Christian Remling
yesterday
$begingroup$
@Christian Remling: Hadamard factorization is fine of course. On my opinion, Wiman's theorem is somewhat simpler, but this is a question of opinion.
$endgroup$
– Alexandre Eremenko
yesterday
add a comment |
1
$begingroup$
Didn't the OP ask about infinite sums? The exponential function is the sum of its power series, and it is not surjective, so if $f_n(z) = z^n$, the answer is yes.
$endgroup$
– Mateusz Kwaśnicki
yesterday
1
$begingroup$
Do we really need a theorem of Wiman (or anyone else) to verify your claim that non-constant functions $f$ of order $<1$ are surjective? Doesn't this just follow from the Hadamard factorization, which implies that if $f-c$ doesn't have a zero, then $f-cequiv d$.
$endgroup$
– Christian Remling
yesterday
$begingroup$
@Christian Remling: Hadamard factorization is fine of course. On my opinion, Wiman's theorem is somewhat simpler, but this is a question of opinion.
$endgroup$
– Alexandre Eremenko
yesterday
1
1
$begingroup$
Didn't the OP ask about infinite sums? The exponential function is the sum of its power series, and it is not surjective, so if $f_n(z) = z^n$, the answer is yes.
$endgroup$
– Mateusz Kwaśnicki
yesterday
$begingroup$
Didn't the OP ask about infinite sums? The exponential function is the sum of its power series, and it is not surjective, so if $f_n(z) = z^n$, the answer is yes.
$endgroup$
– Mateusz Kwaśnicki
yesterday
1
1
$begingroup$
Do we really need a theorem of Wiman (or anyone else) to verify your claim that non-constant functions $f$ of order $<1$ are surjective? Doesn't this just follow from the Hadamard factorization, which implies that if $f-c$ doesn't have a zero, then $f-cequiv d$.
$endgroup$
– Christian Remling
yesterday
$begingroup$
Do we really need a theorem of Wiman (or anyone else) to verify your claim that non-constant functions $f$ of order $<1$ are surjective? Doesn't this just follow from the Hadamard factorization, which implies that if $f-c$ doesn't have a zero, then $f-cequiv d$.
$endgroup$
– Christian Remling
yesterday
$begingroup$
@Christian Remling: Hadamard factorization is fine of course. On my opinion, Wiman's theorem is somewhat simpler, but this is a question of opinion.
$endgroup$
– Alexandre Eremenko
yesterday
$begingroup$
@Christian Remling: Hadamard factorization is fine of course. On my opinion, Wiman's theorem is somewhat simpler, but this is a question of opinion.
$endgroup$
– Alexandre Eremenko
yesterday
add a comment |
user137377 is a new contributor. Be nice, and check out our Code of Conduct.
user137377 is a new contributor. Be nice, and check out our Code of Conduct.
user137377 is a new contributor. Be nice, and check out our Code of Conduct.
user137377 is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to MathOverflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326094%2fsums-of-entire-surjective-functions%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
I'm not sure I understand the question. Are there some extra assumptions on the $f_n$ or on the $a_n$ ? For instance, assume that $f_1=-f_2$, then $a_1=a_2=1$, $a_n=0$, $ngeq 3$, will yield $sum a_nf_n=0$...
$endgroup$
– M. Dus
2 days ago
1
$begingroup$
@M.Dus: I suppose OP asks whether one can always find such scalaras. I also guess that the sum is supposed to be entire, not surjective and non-constant.
$endgroup$
– Mateusz Kwaśnicki
2 days ago
$begingroup$
@Mateusz Kwasnicki: this does not help. Suppose they are all polynomials. If the linear combination is not constant is must be surjective.
$endgroup$
– Alexandre Eremenko
2 days ago
1
$begingroup$
Maybe $(f_n)$ denotes an infinite sequence of functions?
$endgroup$
– Nik Weaver
2 days ago
$begingroup$
@AlexandreEremenko I made some edits, I hope it is more clear now. Indeed, the question is if this is true for any such family.
$endgroup$
– user137377
2 days ago