Generating full sequence with complex numbers.

smithnya
Messages
41
Reaction score
0
Hello everyone,

I need some help with the following: I understand that by using xn = axn-1+b we can generate a full sequence of numbers. For example, if x1=ax0+b, then x2 = ax1+b = a2x0+ab+b, and so on and so forth to xn. I need help applying this same concept to complex numbers (a+bi). Is it even possible? I think it is, but I can't figure it out. Can some one lend a hand?
 
Physics news on Phys.org
hello smithnya! :smile:

this is a recurrence relation

its solutions should be of the same form, whether the constants are real or complex

were you having a problem with any particular relation?​
 
Well, my professor began to explain the relation among real numbers, and he explained for x0, x1, x2, etc. He mentioned that the same could be done with complex numbers, but never went into detail, maybe he will explain later. It piqued my curiosity, but I can't figure out how to generate a full sequence using the same method above only with something of the form a+bi.
 
As tiny tim said, it is exactly the same thing: x_{n+1}= ax_n+ b will give complex numbers if anyone or more of a, b, and x_0 is complex.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top