@LeakyNun ok, that is again not the purpose of that text :) sure, you can do things different ways, but if you exercise, you limit yourself on some technique, as if there were not any other technique.
I don' understand. The text says, "we can interprete $\frac{1}{1-\gamma_ix}$ as the geometric series $\sum_{n=0}^{\infty}(\gamma_ix)^n$". But we can do that only if $\gamma_ix < 1$, and for $\gamma_i$ being $\frac{1+ \sqrt{5}}{2}$ that is not the case. On the other hand, we are looking at the formal power series . That means, we are not interested in the convergence, but at the same time we took the limit of this series for our calculations. Is that not cheating, at all?
not rigorous in what sense? I would say it is all wrong what is written there. But, if the text says that is ok, so maybe I should understand why the expression in the form of the geometric series is possible.
I know only the limit $\frac{1}{1-q}$, if $q<1, \sum q^n$
if you want to decompose $\frac{x}{1-x-x^2}$ in $\frac{b_1}{1-c_1x}$ and $\frac{b_2}{1-c_2x}$ that it's ok. But if you want to decompose $\frac{x}{x^5-x^4-x^3-x^2-x+1}$, those fractions are wrong.
I have a problem in proving a problem, which is easy to do in basic multivariable calculus but I couldn't do it in tensor notation. Please help
$$\nabla.(r^n \vec{r})=(n+3)r^n$$
Here $r=\sqrt{x^2+y^2+z^2}$ is the magnitude of the position vector $\vec{r}=xi+yj+zk$.
I tried representing(i don't ...
@LeakyNun that was just an illustration for that, that I understand the partial fraction thing for a degree $\le 2$. Do not ask me to decompose it for other degress.
@LeakyNun not a complaint! I just underline that my knowledge of partial decompositions is limited, e.g. there is a constant $C$, such that knowledge $\le C$ for the whole knowledge. And, $C=2$ here.
Consider the sequence A126022 at OEIS
http://oeis.org/A126022
$$ 1,2,4,7,10,13,17,21,25,30, ... $$
We start with $a_1 = a(1) = 1$.
$a_n = a(n)$ and $^{-1}$ means functional inverse.
( check the link If you are confused , Leroy explains it more clearly )
If this self-reference reminds you of...
I have a problem in proving a problem, which is easy to do in basic multivariable calculus but I couldn't do it in tensor notation. Please help
$$\nabla.(r^n \vec{r})=(n+3)r^n$$
Here $r=\sqrt{x^2+y^2+z^2}$ is the magnitude of the position vector $\vec{r}=xi+yj+zk$.
I tried representing(i don't ...
@jyotishrajthoudam None of that notation looks familiar to me. I keep forgetting that "tensor" is often used in a way that is practically unrecognizable from the term as I know it (i.e. in tensor products).
ok, so the latter (btw, I am uncertain of whether the word "farther" is really correct, since I recall Tolkien going on about the fact that he used it whatever people said)
Consider the sequence A126022 at OEIS
http://oeis.org/A126022
$$ 1,2,4,7,10,13,17,21,25,30, ... $$
We start with $a_1 = a(1) = 1$.
$a_n = a(n)$ and $^{-1}$ means functional inverse.
By $\lfloor a^{-1}(n+1) \rfloor$ we mean $\max K $ such that $a_K = a(K) $ and $a_K = n+1 $ or $a_K < n+1$.
(...
@TobiasKildetoft I mean: 1 in $\mathbb{Z}$ is 1, 1 in $\mathbb{Z}^{2 \times 2}$ is $\begin{pmatrix} 1&0\\0&1\end{pmatrix}$. That's formally not the same.
@MikeMiller I was hoping you could tell me that part. I would like to try to understand what the "original" Hodge theory is, since some people have developed something they call an algebraic analogue and used that for some pretty amazingthings.
@Kirill In that case, $k[[x]]$ does not consist of anything written as sums, but of sequences of elements of $k$
@MikeMiller Unfortunately I don't have time right now anyway. But the people are Elias and Williamson, in the paper The Hodge theory of Soergel bimodules which they published in Annals 3 years ago
@LeakyNun that is one very cool way to find generating functions. The approach I have encountered so far involve solving for coefficients after multiplying a series by some power series.
Now that I am made away I can simply bubble out powers of x like these and try to left behind the original sum, it might help in figuring out for me on how infinite series works and its sensitivity to details
Sorry for interruption. Right now, I am reading Michael A. Nielsen & Isaac L. Chuang for Quantum Computation and Quantum Information. And in chapter 2, 3 equal signs are used. Can someone explain why is that?
@Huv, text from book: An important linear operator on any vector space V is the identity operator, IV , defined by the equation IV |v> ≡ |v> for all vectors |v>.
@Huy the diagonalisation - for sure! We are just not expected to use matrices for that point. I should shorly think about how to rewrite the sequence as matrix.
but since polynomial is sequence I think I can do that
that look slike trolling @LeakyNun . I do not see any reason for the decimal formalism. It is all about how you define the elements of your rings. If you define your elements as numbers that you cannot write on the paper, you would be right.
@LeakyNun and the point is definitions. If the definition says that elements of $R[[x]]$ have the form $\sum_{n=0}^{\infty}x^n$ then I just bring them in the form, although it is not necessary.
it is the same reason why I write $ax^2 +bx^1 + cx^0$ for the second degree polynomial, as it is just intuitevly clear for me.
I wonder how will one handle the following sum: $$\sum_{k=0}^n k^k (x+1)^k$$? The $0^0 = 1$ convention will allow the binomial expansion to be carried out, however, here there's an explicit $k^k$ term which cannot be $1$ (Or perhaps I have constructed a wrong example)
@LeakyNun It's an attempt to ask how to pick conventions for the value of $0^0$ if an expression contains both a binomial expansion and also requiring $x\mapsto x^x$ to be continuous, i.e. if an expression contains $0^0$ that is supposed to be used in conflicting ways when alone, how to pick the correct convention to evaluate such expression?