A Deriving Probability Amplitude from Markov Density Function

redtree
Messages
335
Reaction score
15
1. Given a Markov state density function:
## P((\textbf{r}_{n}| \textbf{r}_{n-1})) ##

##P## describes the probability of transitioning from a state at ## \textbf{r}_{n-1}## to a state at ##\textbf{r}_{n} ##. If ## \textbf{r}_{n-1} = \textbf{r}_{n}##, then ##P## describes the probability of the state at ##\textbf{r}_{n}## transitioning to itself.

2. A probability density function can be decomposed into probability amplitudes, where the probability density function ##P## is the product of a probability amplitude ##\psi_{\textbf{r}_{n-1}} ## and the complex modulus of second probability amplitude ##\psi^*_{\textbf{r}_{n}} ## where:
## P((\textbf{r}_{n}| \textbf{r}_{n-1})) = \psi^*_{\textbf{r}_{n}} \cdot \psi_{\textbf{r}_{n-1}} ##

Again, if ## \textbf{r}_{n-1} = \textbf{r}_{n}##, then:
## P((\textbf{r}_{n}| \textbf{r}_{n-1})) = \psi^*_{\textbf{r}_{n}} \cdot \psi_{\textbf{r}_{n}} = |\psi_{\textbf{r}_{n}}|^2##

-----------------

Unfortunately, I have not been able to find a derivation for #2. Does anyone know where I can find such a derivation?
 
Physics news on Phys.org
redtree said:
1. Given a Markov state density function:
## P((\textbf{r}_{n}| \textbf{r}_{n-1})) ##

##P## describes the probability of transitioning from a state at ## \textbf{r}_{n-1}## to a state at ##\textbf{r}_{n} ##. If ## \textbf{r}_{n-1} = \textbf{r}_{n}##, then ##P## describes the probability of the state at ##\textbf{r}_{n}## transitioning to itself.

According to that notation, to speak ##P((\textbf{r}_{n}| \textbf{r}_{n-1}))## as a specific number, we must specify a value for each of ##\textbf{r}_{n}## and ##\textbf{r}_{n-1}##. So the notation ##P( \textbf{r}_{n} = b | \textbf{r}_{n-1} = a)## represents a specific numerical value.

2. A probability density function can be decomposed into probability amplitudes, where the probability density function ##P## is the product of a probability amplitude ##\psi_{\textbf{r}_{n-1}} ## and the complex modulus of second probability amplitude ##\psi^*_{\textbf{r}_{n}} ## where:
## P((\textbf{r}_{n}| \textbf{r}_{n-1})) = \psi^*_{\textbf{r}_{n}} \cdot \psi_{\textbf{r}_{n-1}} ##

It isn't clear what is being claimed. In a Markov process, the values of ##P( \textbf{r}_{n} = b | \textbf{r}_{n-1} = a)## and ##P( \textbf{r}_{n} = a | \textbf{r}_{n-1} = b) ## may be different. What non-commutative arithmetic does the claim use to allow such a situation to happen?
 
1.
Stephen Tashi said:
According to that notation, to speak ##P((\textbf{r}_{n}| \textbf{r}_{n-1}))## as a specific number, we must specify a value for each of ##\textbf{r}_{n}## and ##\textbf{r}_{n-1}##. So the notation ##P( \textbf{r}_{n} = b | \textbf{r}_{n-1} = a) ## represents a specific numerical value.

You are correct if ##\textbf{r}_{n}## and ##\textbf{r}_{n-1}## represent scalars (##a## and ##b##), such that ##P( \textbf{r}_{n} = b | \textbf{r}_{n-1} = a) = c##, where ##c## is also a scalar. However, if ##\textbf{r}_{n}## and ##\textbf{r}_{n-1}## are vectors, then ##P((\textbf{r}_{n}| \textbf{r}_{n-1}))## represents a transition probability tensor (transformation matrix). In my understanding, in both cases, ##P## represents a probability density for the transformation.

2.
Stephen Tashi said:
It isn't clear what is being claimed. In a Markov process, the values of ##P( \textbf{r}_{n} = b | \textbf{r}_{n-1} = a)## and ##P( \textbf{r}_{n} = a | \textbf{r}_{n-1} = b)## may be different. What non-commutative arithmetic does the claim use to allow such a situation to happen?

You are correct. I made a notational error. I should have written the following:
##P((\textbf{r}_{n}| \textbf{r}_{n-1})) = \psi^*_{\textbf{r}_{n}} \otimes \psi_{\textbf{r}_{n-1}}##

In this form, assuming ## \psi^*_{\textbf{r}_{n}}## and ## \psi_{\textbf{r}_{n-1}}## are vectors, the expression does not commute.

Such that, if ##\textbf{r}_{n-1} = \textbf{r}_{n}##, then:
##P((\textbf{r}_{n}| \textbf{r}_{n})) = \psi^*_{\textbf{r}_{n}} \otimes \psi_{\textbf{r}_{n}} = |\psi_{\textbf{r}_{n}}|^2##

-----------------------------

And my question remains: Does anyone know where I can find such a derivation for the following:
##P((\textbf{r}_{n}| \textbf{r}_{n-1})) = \psi^*_{\textbf{r}_{n}} \otimes \psi_{\textbf{r}_{n-1}}##

Or, am I overthinking the problem, and the answer is simply in the definition of ## \psi##?
 
Last edited:
Upon further reflection, it seems that the equation should read as follows:
## \psi_{\textbf{r}_{n}} \doteq \sqrt{P((\textbf{r}_{n}| \textbf{r}_{n-1})) }##
 
Does the claim comes from derivation that involves physics or is it suppose to be purely a mathematical result?

Assume we have the transition matrix ##M## of a Markov process with a 10 states. What does ##\psi_3## denote? Is it a vector with 10 components, each of which is a complex number?

Is ##\psi^*_3## a vector whose components are the complex conjugates of the components of ##\psi_3## ?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top