Proof that a finite series expansion of $f(X)$ at $alpha$ exists iff $Q(X)$ is a power of $(X-alpha)$, in...
$begingroup$
I'm working through Gouvea's P-adic numbers book, and early on they give the problem
Write $f(X)=frac{P(X)}{Q(X)}$ in lowest terms, so that $P(X)$ and $Q(X)$ have no common zeros. Show that the expansion of $f(X)$ in powers of $(X-alpha)$ is finite if and only if $Q(X)=(X-alpha)^m$ for some $mgeq 0$
The solution/hint given is
"if the expansion is finite, it will certainly become a polynomial after we multiply by $(X-alpha)^m$, where $m$ is the biggest exponnent appearing in a denominator.
From what I read so far, we should get a finite series in the event where we have a "pole", for example, the series expansion of $frac{X}{X-1}$ at the point $alpha=1$, gives us the series $(X-1)^{-1}+1$. But i'm not sure how to prove that we are assure a finite series expansion where the denomiator polynomial can be expressed as a power of $(X-alpha)$ and I'm also unsure of going in the other direction.
Thanks
complex-analysis elementary-number-theory proof-writing p-adic-number-theory
$endgroup$
add a comment |
$begingroup$
I'm working through Gouvea's P-adic numbers book, and early on they give the problem
Write $f(X)=frac{P(X)}{Q(X)}$ in lowest terms, so that $P(X)$ and $Q(X)$ have no common zeros. Show that the expansion of $f(X)$ in powers of $(X-alpha)$ is finite if and only if $Q(X)=(X-alpha)^m$ for some $mgeq 0$
The solution/hint given is
"if the expansion is finite, it will certainly become a polynomial after we multiply by $(X-alpha)^m$, where $m$ is the biggest exponnent appearing in a denominator.
From what I read so far, we should get a finite series in the event where we have a "pole", for example, the series expansion of $frac{X}{X-1}$ at the point $alpha=1$, gives us the series $(X-1)^{-1}+1$. But i'm not sure how to prove that we are assure a finite series expansion where the denomiator polynomial can be expressed as a power of $(X-alpha)$ and I'm also unsure of going in the other direction.
Thanks
complex-analysis elementary-number-theory proof-writing p-adic-number-theory
$endgroup$
add a comment |
$begingroup$
I'm working through Gouvea's P-adic numbers book, and early on they give the problem
Write $f(X)=frac{P(X)}{Q(X)}$ in lowest terms, so that $P(X)$ and $Q(X)$ have no common zeros. Show that the expansion of $f(X)$ in powers of $(X-alpha)$ is finite if and only if $Q(X)=(X-alpha)^m$ for some $mgeq 0$
The solution/hint given is
"if the expansion is finite, it will certainly become a polynomial after we multiply by $(X-alpha)^m$, where $m$ is the biggest exponnent appearing in a denominator.
From what I read so far, we should get a finite series in the event where we have a "pole", for example, the series expansion of $frac{X}{X-1}$ at the point $alpha=1$, gives us the series $(X-1)^{-1}+1$. But i'm not sure how to prove that we are assure a finite series expansion where the denomiator polynomial can be expressed as a power of $(X-alpha)$ and I'm also unsure of going in the other direction.
Thanks
complex-analysis elementary-number-theory proof-writing p-adic-number-theory
$endgroup$
I'm working through Gouvea's P-adic numbers book, and early on they give the problem
Write $f(X)=frac{P(X)}{Q(X)}$ in lowest terms, so that $P(X)$ and $Q(X)$ have no common zeros. Show that the expansion of $f(X)$ in powers of $(X-alpha)$ is finite if and only if $Q(X)=(X-alpha)^m$ for some $mgeq 0$
The solution/hint given is
"if the expansion is finite, it will certainly become a polynomial after we multiply by $(X-alpha)^m$, where $m$ is the biggest exponnent appearing in a denominator.
From what I read so far, we should get a finite series in the event where we have a "pole", for example, the series expansion of $frac{X}{X-1}$ at the point $alpha=1$, gives us the series $(X-1)^{-1}+1$. But i'm not sure how to prove that we are assure a finite series expansion where the denomiator polynomial can be expressed as a power of $(X-alpha)$ and I'm also unsure of going in the other direction.
Thanks
complex-analysis elementary-number-theory proof-writing p-adic-number-theory
complex-analysis elementary-number-theory proof-writing p-adic-number-theory
asked Dec 7 '18 at 2:10
john fowlesjohn fowles
1,198817
1,198817
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Assume that the expansion is finite, i.e,
$$f(x) = sum_{n=-k}^m a_i (x-alpha)^i$$
where we assume $k>0$, and we let $a_{-k}=0$ if needed (I assume it only for convenience. Also note that if the sequence actually start with $ngeq 0$, $f$ is a polynomial and there's nothing to prove). Note that after multiplying by $(x-alpha)^k$ we get:
$$(x-alpha)^kf(x)=sum_{n=-k}^m a_i (x-alpha)^{i+k}=sum_{n=0}^{m+k}a_i (x-alpha)^{i+k}$$
RHS is a sum of polynomials, hence a polynomial $g(x)$, so, we may write $(x-alpha)^k f(x)=g(x)$ which gives $f(x)=g(x)/(x-alpha)^k$. After canceling factors, this is still the form of the rational function $f$ (maybe $k$ will be changed).
The other way around, if $f(x)=g(x)/(x-alpha)^k$ for some $kgeq0$, where $g$ is a polynomial, note that $g$ can be written as $g(x)=g((x-alpha)+alpha)$. Now if we write $g$ explicitly as $g(x)=sum_{i=0}^m b_i x^i$, we get-
$$g((x-alpha)+alpha)=g(x)=sum_{i=0}^m b_i ((x-alpha)+alpha)^i$$
using the binomial theorem we get that $g(x)=sum_{i=0}^m b_i' (x-alpha)^i$ ($b_i'$ are the modified coefficients; we can calculate them explicitly, but this is not interesting). This gives
$$f(x)=frac{g(x)}{(x-alpha)^k}=sum_{i=0}^m b_i' (x-alpha)^{i-k}$$
And so the expansion is finite.
$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%2f3029378%2fproof-that-a-finite-series-expansion-of-fx-at-alpha-exists-iff-qx-is%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$
Assume that the expansion is finite, i.e,
$$f(x) = sum_{n=-k}^m a_i (x-alpha)^i$$
where we assume $k>0$, and we let $a_{-k}=0$ if needed (I assume it only for convenience. Also note that if the sequence actually start with $ngeq 0$, $f$ is a polynomial and there's nothing to prove). Note that after multiplying by $(x-alpha)^k$ we get:
$$(x-alpha)^kf(x)=sum_{n=-k}^m a_i (x-alpha)^{i+k}=sum_{n=0}^{m+k}a_i (x-alpha)^{i+k}$$
RHS is a sum of polynomials, hence a polynomial $g(x)$, so, we may write $(x-alpha)^k f(x)=g(x)$ which gives $f(x)=g(x)/(x-alpha)^k$. After canceling factors, this is still the form of the rational function $f$ (maybe $k$ will be changed).
The other way around, if $f(x)=g(x)/(x-alpha)^k$ for some $kgeq0$, where $g$ is a polynomial, note that $g$ can be written as $g(x)=g((x-alpha)+alpha)$. Now if we write $g$ explicitly as $g(x)=sum_{i=0}^m b_i x^i$, we get-
$$g((x-alpha)+alpha)=g(x)=sum_{i=0}^m b_i ((x-alpha)+alpha)^i$$
using the binomial theorem we get that $g(x)=sum_{i=0}^m b_i' (x-alpha)^i$ ($b_i'$ are the modified coefficients; we can calculate them explicitly, but this is not interesting). This gives
$$f(x)=frac{g(x)}{(x-alpha)^k}=sum_{i=0}^m b_i' (x-alpha)^{i-k}$$
And so the expansion is finite.
$endgroup$
add a comment |
$begingroup$
Assume that the expansion is finite, i.e,
$$f(x) = sum_{n=-k}^m a_i (x-alpha)^i$$
where we assume $k>0$, and we let $a_{-k}=0$ if needed (I assume it only for convenience. Also note that if the sequence actually start with $ngeq 0$, $f$ is a polynomial and there's nothing to prove). Note that after multiplying by $(x-alpha)^k$ we get:
$$(x-alpha)^kf(x)=sum_{n=-k}^m a_i (x-alpha)^{i+k}=sum_{n=0}^{m+k}a_i (x-alpha)^{i+k}$$
RHS is a sum of polynomials, hence a polynomial $g(x)$, so, we may write $(x-alpha)^k f(x)=g(x)$ which gives $f(x)=g(x)/(x-alpha)^k$. After canceling factors, this is still the form of the rational function $f$ (maybe $k$ will be changed).
The other way around, if $f(x)=g(x)/(x-alpha)^k$ for some $kgeq0$, where $g$ is a polynomial, note that $g$ can be written as $g(x)=g((x-alpha)+alpha)$. Now if we write $g$ explicitly as $g(x)=sum_{i=0}^m b_i x^i$, we get-
$$g((x-alpha)+alpha)=g(x)=sum_{i=0}^m b_i ((x-alpha)+alpha)^i$$
using the binomial theorem we get that $g(x)=sum_{i=0}^m b_i' (x-alpha)^i$ ($b_i'$ are the modified coefficients; we can calculate them explicitly, but this is not interesting). This gives
$$f(x)=frac{g(x)}{(x-alpha)^k}=sum_{i=0}^m b_i' (x-alpha)^{i-k}$$
And so the expansion is finite.
$endgroup$
add a comment |
$begingroup$
Assume that the expansion is finite, i.e,
$$f(x) = sum_{n=-k}^m a_i (x-alpha)^i$$
where we assume $k>0$, and we let $a_{-k}=0$ if needed (I assume it only for convenience. Also note that if the sequence actually start with $ngeq 0$, $f$ is a polynomial and there's nothing to prove). Note that after multiplying by $(x-alpha)^k$ we get:
$$(x-alpha)^kf(x)=sum_{n=-k}^m a_i (x-alpha)^{i+k}=sum_{n=0}^{m+k}a_i (x-alpha)^{i+k}$$
RHS is a sum of polynomials, hence a polynomial $g(x)$, so, we may write $(x-alpha)^k f(x)=g(x)$ which gives $f(x)=g(x)/(x-alpha)^k$. After canceling factors, this is still the form of the rational function $f$ (maybe $k$ will be changed).
The other way around, if $f(x)=g(x)/(x-alpha)^k$ for some $kgeq0$, where $g$ is a polynomial, note that $g$ can be written as $g(x)=g((x-alpha)+alpha)$. Now if we write $g$ explicitly as $g(x)=sum_{i=0}^m b_i x^i$, we get-
$$g((x-alpha)+alpha)=g(x)=sum_{i=0}^m b_i ((x-alpha)+alpha)^i$$
using the binomial theorem we get that $g(x)=sum_{i=0}^m b_i' (x-alpha)^i$ ($b_i'$ are the modified coefficients; we can calculate them explicitly, but this is not interesting). This gives
$$f(x)=frac{g(x)}{(x-alpha)^k}=sum_{i=0}^m b_i' (x-alpha)^{i-k}$$
And so the expansion is finite.
$endgroup$
Assume that the expansion is finite, i.e,
$$f(x) = sum_{n=-k}^m a_i (x-alpha)^i$$
where we assume $k>0$, and we let $a_{-k}=0$ if needed (I assume it only for convenience. Also note that if the sequence actually start with $ngeq 0$, $f$ is a polynomial and there's nothing to prove). Note that after multiplying by $(x-alpha)^k$ we get:
$$(x-alpha)^kf(x)=sum_{n=-k}^m a_i (x-alpha)^{i+k}=sum_{n=0}^{m+k}a_i (x-alpha)^{i+k}$$
RHS is a sum of polynomials, hence a polynomial $g(x)$, so, we may write $(x-alpha)^k f(x)=g(x)$ which gives $f(x)=g(x)/(x-alpha)^k$. After canceling factors, this is still the form of the rational function $f$ (maybe $k$ will be changed).
The other way around, if $f(x)=g(x)/(x-alpha)^k$ for some $kgeq0$, where $g$ is a polynomial, note that $g$ can be written as $g(x)=g((x-alpha)+alpha)$. Now if we write $g$ explicitly as $g(x)=sum_{i=0}^m b_i x^i$, we get-
$$g((x-alpha)+alpha)=g(x)=sum_{i=0}^m b_i ((x-alpha)+alpha)^i$$
using the binomial theorem we get that $g(x)=sum_{i=0}^m b_i' (x-alpha)^i$ ($b_i'$ are the modified coefficients; we can calculate them explicitly, but this is not interesting). This gives
$$f(x)=frac{g(x)}{(x-alpha)^k}=sum_{i=0}^m b_i' (x-alpha)^{i-k}$$
And so the expansion is finite.
answered Dec 7 '18 at 11:55
MadarbMadarb
346111
346111
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%2f3029378%2fproof-that-a-finite-series-expansion-of-fx-at-alpha-exists-iff-qx-is%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