nth roots and logarithm$f$ is holomorphic then there exists $F$ such that $f=exp(F)$How to prove this?Existence of holomorphic n-th root and non-vanishingQuestion about entire functionThe Schwarz reflection principle and harmonic function (Big Rudin chapter 11)Cauchy's Theorem and maximum modulus principleFind all entire functionsBranches of the complex logarithmUniformly bounded sequence of analytic functions in the unit diskConvergence of holomorphic function when the real part convergesShow a normal family $f_n $ converges uniformly on compacts
What would the Romans have called "sorcery"?
Why is the design of haulage companies so “special”?
What is the command to reset a PC without deleting any files
The use of multiple foreign keys on same column in SQL Server
I probably found a bug with the sudo apt install function
Email Account under attack (really) - anything I can do?
How to get the available space of $HOME as a variable in shell scripting?
Why has Russell's definition of numbers using equivalence classes been finally abandoned? ( If it has actually been abandoned).
What would happen to a modern skyscraper if it rains micro blackholes?
How can I hide my bitcoin transactions to protect anonymity from others?
What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?
Simple device (fancy) pointer implementation
How long does it take to type this?
How is the claim "I am in New York only if I am in America" the same as "If I am in New York, then I am in America?
Why don't electron-positron collisions release infinite energy?
How old can references or sources in a thesis be?
A function which translates a sentence to title-case
How do I create uniquely male characters?
Is it possible to make sharp wind that can cut stuff from afar?
Do Phineas and Ferb ever actually get busted in real time?
Pronouncing Dictionary.com's W.O.D "vade mecum" in English
What defenses are there against being summoned by the Gate spell?
How did the USSR manage to innovate in an environment characterized by government censorship and high bureaucracy?
Why is an old chain unsafe?
nth roots and logarithm
$f$ is holomorphic then there exists $F$ such that $f=exp(F)$How to prove this?Existence of holomorphic n-th root and non-vanishingQuestion about entire functionThe Schwarz reflection principle and harmonic function (Big Rudin chapter 11)Cauchy's Theorem and maximum modulus principleFind all entire functionsBranches of the complex logarithmUniformly bounded sequence of analytic functions in the unit diskConvergence of holomorphic function when the real part convergesShow a normal family $f_n $ converges uniformly on compacts
$begingroup$
Suppose $Omega$ is a region,$fin H(Omega)$, and $fnotequiv 0$.If for every positive integer n,there is $f_n in H(Omega)$,$(f_n)^n=f$,prove that there is $gin H(Omega),f=e^g$.
My conjecture :
$$g=lim (nf_n - n)$$
But I don't know how to deal with it.
I will appreciate your help.
complex-analysis
$endgroup$
add a comment |
$begingroup$
Suppose $Omega$ is a region,$fin H(Omega)$, and $fnotequiv 0$.If for every positive integer n,there is $f_n in H(Omega)$,$(f_n)^n=f$,prove that there is $gin H(Omega),f=e^g$.
My conjecture :
$$g=lim (nf_n - n)$$
But I don't know how to deal with it.
I will appreciate your help.
complex-analysis
$endgroup$
$begingroup$
If you can prove convergence, then that should be ok. But here it is sufficient to show that $g=ln(f)$ is well-defined, i.e., that $f$ does not take values on the negative half axis.
$endgroup$
– LutzL
Mar 20 '14 at 14:53
add a comment |
$begingroup$
Suppose $Omega$ is a region,$fin H(Omega)$, and $fnotequiv 0$.If for every positive integer n,there is $f_n in H(Omega)$,$(f_n)^n=f$,prove that there is $gin H(Omega),f=e^g$.
My conjecture :
$$g=lim (nf_n - n)$$
But I don't know how to deal with it.
I will appreciate your help.
complex-analysis
$endgroup$
Suppose $Omega$ is a region,$fin H(Omega)$, and $fnotequiv 0$.If for every positive integer n,there is $f_n in H(Omega)$,$(f_n)^n=f$,prove that there is $gin H(Omega),f=e^g$.
My conjecture :
$$g=lim (nf_n - n)$$
But I don't know how to deal with it.
I will appreciate your help.
complex-analysis
complex-analysis
asked Mar 20 '14 at 3:05
gilliattgilliatt
1478
1478
$begingroup$
If you can prove convergence, then that should be ok. But here it is sufficient to show that $g=ln(f)$ is well-defined, i.e., that $f$ does not take values on the negative half axis.
$endgroup$
– LutzL
Mar 20 '14 at 14:53
add a comment |
$begingroup$
If you can prove convergence, then that should be ok. But here it is sufficient to show that $g=ln(f)$ is well-defined, i.e., that $f$ does not take values on the negative half axis.
$endgroup$
– LutzL
Mar 20 '14 at 14:53
$begingroup$
If you can prove convergence, then that should be ok. But here it is sufficient to show that $g=ln(f)$ is well-defined, i.e., that $f$ does not take values on the negative half axis.
$endgroup$
– LutzL
Mar 20 '14 at 14:53
$begingroup$
If you can prove convergence, then that should be ok. But here it is sufficient to show that $g=ln(f)$ is well-defined, i.e., that $f$ does not take values on the negative half axis.
$endgroup$
– LutzL
Mar 20 '14 at 14:53
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If $f$ has a holomorphic logarithm $g$, then $f$ has no zeros, and $f' = g'cdot e^g$, or
$$g' = fracf'f,$$
so the function $f'/f$ has a primitive on $Omega$. Conversely, if $f$ has no zeros, and $f'/f$ has a primitive $h$ on $Omega$, then $fcdot e^-h$ is constant, and by adding a suitable constant to $h$, we obtain a $g$ with $f = e^g$.
So first, we deduce that $f$ has no zeros in $Omega$: If $f$ had a zero in $a in Omega$, say of order $k$, then the $n$-th root $f_n$ would also have have a zero in $a$. Let its order be $k_n$, so $f_n(z) = (z-a)^k_ncdot h_n(z)$ with $h_n in H(Omega)$ such that $h_n(a) neq 0$. But then $f(z) = (z-a)^ncdot k_nh_n(z)^n$, so $k = ncdot k_n$, and $n mid k$. But a positive integer has only finitely many divisors, so $f$ can't have a zero.
Thus $q = f'/f in H(Omega)$, and $q$ has a primitive if and only if
$$I(gamma) := int_gamma fracf'(z)f(z),dz = 0$$
for all closed paths $gamma$ in $Omega$. But $n(gamma) = frac12pi iI(gamma)$ is the winding number of the closed path $fcirc gamma$ around $0$, hence an integer, and
$$beginalign
n(gamma) &= frac12pi iint_gamma fracf'(z)f(z),dz\
&= frac12pi i int_gamma frac(f_n(z)^n)'f_n(z)^n,dz\
&= frac12pi iint_gamma fracn f_n(z)^n-1f_n'(z)f_n(z)^n,dz\
&= fracn2pi iint_gamma fracf_n'(z)f_n(z),dz
endalign$$
is $n$ times the winding number of the closed path $f_ncircgamma$ around $0$, hence a multiple of $n$. The only integer that is a multiply of all $n in mathbbZ^+$ is $0$, hence $n(gamma) = 0$, and indeed $f'/f$ has a primitive on $Omega$.
$endgroup$
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: "69"
;
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
);
);
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%2fmath.stackexchange.com%2fquestions%2f719283%2fnth-roots-and-logarithm%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If $f$ has a holomorphic logarithm $g$, then $f$ has no zeros, and $f' = g'cdot e^g$, or
$$g' = fracf'f,$$
so the function $f'/f$ has a primitive on $Omega$. Conversely, if $f$ has no zeros, and $f'/f$ has a primitive $h$ on $Omega$, then $fcdot e^-h$ is constant, and by adding a suitable constant to $h$, we obtain a $g$ with $f = e^g$.
So first, we deduce that $f$ has no zeros in $Omega$: If $f$ had a zero in $a in Omega$, say of order $k$, then the $n$-th root $f_n$ would also have have a zero in $a$. Let its order be $k_n$, so $f_n(z) = (z-a)^k_ncdot h_n(z)$ with $h_n in H(Omega)$ such that $h_n(a) neq 0$. But then $f(z) = (z-a)^ncdot k_nh_n(z)^n$, so $k = ncdot k_n$, and $n mid k$. But a positive integer has only finitely many divisors, so $f$ can't have a zero.
Thus $q = f'/f in H(Omega)$, and $q$ has a primitive if and only if
$$I(gamma) := int_gamma fracf'(z)f(z),dz = 0$$
for all closed paths $gamma$ in $Omega$. But $n(gamma) = frac12pi iI(gamma)$ is the winding number of the closed path $fcirc gamma$ around $0$, hence an integer, and
$$beginalign
n(gamma) &= frac12pi iint_gamma fracf'(z)f(z),dz\
&= frac12pi i int_gamma frac(f_n(z)^n)'f_n(z)^n,dz\
&= frac12pi iint_gamma fracn f_n(z)^n-1f_n'(z)f_n(z)^n,dz\
&= fracn2pi iint_gamma fracf_n'(z)f_n(z),dz
endalign$$
is $n$ times the winding number of the closed path $f_ncircgamma$ around $0$, hence a multiple of $n$. The only integer that is a multiply of all $n in mathbbZ^+$ is $0$, hence $n(gamma) = 0$, and indeed $f'/f$ has a primitive on $Omega$.
$endgroup$
add a comment |
$begingroup$
If $f$ has a holomorphic logarithm $g$, then $f$ has no zeros, and $f' = g'cdot e^g$, or
$$g' = fracf'f,$$
so the function $f'/f$ has a primitive on $Omega$. Conversely, if $f$ has no zeros, and $f'/f$ has a primitive $h$ on $Omega$, then $fcdot e^-h$ is constant, and by adding a suitable constant to $h$, we obtain a $g$ with $f = e^g$.
So first, we deduce that $f$ has no zeros in $Omega$: If $f$ had a zero in $a in Omega$, say of order $k$, then the $n$-th root $f_n$ would also have have a zero in $a$. Let its order be $k_n$, so $f_n(z) = (z-a)^k_ncdot h_n(z)$ with $h_n in H(Omega)$ such that $h_n(a) neq 0$. But then $f(z) = (z-a)^ncdot k_nh_n(z)^n$, so $k = ncdot k_n$, and $n mid k$. But a positive integer has only finitely many divisors, so $f$ can't have a zero.
Thus $q = f'/f in H(Omega)$, and $q$ has a primitive if and only if
$$I(gamma) := int_gamma fracf'(z)f(z),dz = 0$$
for all closed paths $gamma$ in $Omega$. But $n(gamma) = frac12pi iI(gamma)$ is the winding number of the closed path $fcirc gamma$ around $0$, hence an integer, and
$$beginalign
n(gamma) &= frac12pi iint_gamma fracf'(z)f(z),dz\
&= frac12pi i int_gamma frac(f_n(z)^n)'f_n(z)^n,dz\
&= frac12pi iint_gamma fracn f_n(z)^n-1f_n'(z)f_n(z)^n,dz\
&= fracn2pi iint_gamma fracf_n'(z)f_n(z),dz
endalign$$
is $n$ times the winding number of the closed path $f_ncircgamma$ around $0$, hence a multiple of $n$. The only integer that is a multiply of all $n in mathbbZ^+$ is $0$, hence $n(gamma) = 0$, and indeed $f'/f$ has a primitive on $Omega$.
$endgroup$
add a comment |
$begingroup$
If $f$ has a holomorphic logarithm $g$, then $f$ has no zeros, and $f' = g'cdot e^g$, or
$$g' = fracf'f,$$
so the function $f'/f$ has a primitive on $Omega$. Conversely, if $f$ has no zeros, and $f'/f$ has a primitive $h$ on $Omega$, then $fcdot e^-h$ is constant, and by adding a suitable constant to $h$, we obtain a $g$ with $f = e^g$.
So first, we deduce that $f$ has no zeros in $Omega$: If $f$ had a zero in $a in Omega$, say of order $k$, then the $n$-th root $f_n$ would also have have a zero in $a$. Let its order be $k_n$, so $f_n(z) = (z-a)^k_ncdot h_n(z)$ with $h_n in H(Omega)$ such that $h_n(a) neq 0$. But then $f(z) = (z-a)^ncdot k_nh_n(z)^n$, so $k = ncdot k_n$, and $n mid k$. But a positive integer has only finitely many divisors, so $f$ can't have a zero.
Thus $q = f'/f in H(Omega)$, and $q$ has a primitive if and only if
$$I(gamma) := int_gamma fracf'(z)f(z),dz = 0$$
for all closed paths $gamma$ in $Omega$. But $n(gamma) = frac12pi iI(gamma)$ is the winding number of the closed path $fcirc gamma$ around $0$, hence an integer, and
$$beginalign
n(gamma) &= frac12pi iint_gamma fracf'(z)f(z),dz\
&= frac12pi i int_gamma frac(f_n(z)^n)'f_n(z)^n,dz\
&= frac12pi iint_gamma fracn f_n(z)^n-1f_n'(z)f_n(z)^n,dz\
&= fracn2pi iint_gamma fracf_n'(z)f_n(z),dz
endalign$$
is $n$ times the winding number of the closed path $f_ncircgamma$ around $0$, hence a multiple of $n$. The only integer that is a multiply of all $n in mathbbZ^+$ is $0$, hence $n(gamma) = 0$, and indeed $f'/f$ has a primitive on $Omega$.
$endgroup$
If $f$ has a holomorphic logarithm $g$, then $f$ has no zeros, and $f' = g'cdot e^g$, or
$$g' = fracf'f,$$
so the function $f'/f$ has a primitive on $Omega$. Conversely, if $f$ has no zeros, and $f'/f$ has a primitive $h$ on $Omega$, then $fcdot e^-h$ is constant, and by adding a suitable constant to $h$, we obtain a $g$ with $f = e^g$.
So first, we deduce that $f$ has no zeros in $Omega$: If $f$ had a zero in $a in Omega$, say of order $k$, then the $n$-th root $f_n$ would also have have a zero in $a$. Let its order be $k_n$, so $f_n(z) = (z-a)^k_ncdot h_n(z)$ with $h_n in H(Omega)$ such that $h_n(a) neq 0$. But then $f(z) = (z-a)^ncdot k_nh_n(z)^n$, so $k = ncdot k_n$, and $n mid k$. But a positive integer has only finitely many divisors, so $f$ can't have a zero.
Thus $q = f'/f in H(Omega)$, and $q$ has a primitive if and only if
$$I(gamma) := int_gamma fracf'(z)f(z),dz = 0$$
for all closed paths $gamma$ in $Omega$. But $n(gamma) = frac12pi iI(gamma)$ is the winding number of the closed path $fcirc gamma$ around $0$, hence an integer, and
$$beginalign
n(gamma) &= frac12pi iint_gamma fracf'(z)f(z),dz\
&= frac12pi i int_gamma frac(f_n(z)^n)'f_n(z)^n,dz\
&= frac12pi iint_gamma fracn f_n(z)^n-1f_n'(z)f_n(z)^n,dz\
&= fracn2pi iint_gamma fracf_n'(z)f_n(z),dz
endalign$$
is $n$ times the winding number of the closed path $f_ncircgamma$ around $0$, hence a multiple of $n$. The only integer that is a multiply of all $n in mathbbZ^+$ is $0$, hence $n(gamma) = 0$, and indeed $f'/f$ has a primitive on $Omega$.
answered Mar 21 '14 at 13:43
Daniel FischerDaniel Fischer
174k17171289
174k17171289
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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%2fmath.stackexchange.com%2fquestions%2f719283%2fnth-roots-and-logarithm%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$
If you can prove convergence, then that should be ok. But here it is sufficient to show that $g=ln(f)$ is well-defined, i.e., that $f$ does not take values on the negative half axis.
$endgroup$
– LutzL
Mar 20 '14 at 14:53