Finite probability theory is enriched by introducing the mathematical notion of a superposition event $\Sigma S$, in addition to the usual discrete event $S$. The superposition event $\Sigma S$ is defined on the properties that are common to the elements of $S$, but is indefinite where the elements of $S$ differ. This concept of superposition can be seen as extracting from a set an entity that is definite on the commonalities of the elements and indefinite where they differ. To mathematically distinguish between discrete events and superposition events, density matrices are used. For a discrete event $S$, the density matrix $\rho(S)$ is diagonal, while for a superposition event $\Sigma S$, the density matrix $\rho(\Sigma S)$ is obtained as an outer product of a normalized vector $\left| s \right\rangle \in \mathbb{R}^n$. Probabilities are defined using density matrices as $\Pr(T|\rho) = \operatorname*{tr}[P_T\rho]$, where $T$ is a subset of the outcome space $U=\left(u_1,...,u_n\right)$ and $P_T$ is the diagonal projection matrix with diagonal entries $\chi_T(u_i)$. The Born Rule, which gives the probability of an outcome conditioned by a superposition event, arises naturally from this mathematical framework. Specifically, for a singleton subset $\left\{u_i\right\} \subseteq U$, the probability of obtaining outcome $u_i$ conditioned by the superposition event $\Sigma S$ is given by $\Pr(\left\{u_i\right\}|\Sigma S) = \left\langle u_i|s \right\rangle^2$. It should be noted that when using complex numbers instead of real numbers in this mathematical framework ($\mathbb{C}^n$ instead of $\mathbb{R}^n$), this square becomes an absolute square:
$\left| \left< u_i | s \right > \right | ^2$. In summary, introducing superposition events to finite probability theory enriches its mathematical framework and gives rise to the Born Rule, which provides probabilities for outcomes conditioned by such events. This concept allows us to extract commonalities from sets while allowing for variation among their elements.
Key points1. Superposition events are a concept in probability theory that helps us understand similarities and differences among things.
- Density matrices are used to tell the difference between regular events and superposition events.
- The density matrix for a regular event is diagonal, while for a superposition event it is made by multiplying two vectors together.
- Probabilities can be calculated using density matrices.
- Superposition events help us learn more about sets of things.
Definitions
- Finite probability theory: A way of studying how likely different things are to happen.
- Superposition event: When we look at a group of things and see what they have in common and how they are different from each other.
- Density matrix: A way of showing the differences between regular events and superposition events using numbers.
- Discrete event: An event that only has one outcome.
- Outer product: Multiplying two vectors together to make a new matrix.
- Probability: How likely something is to happen.
Exploring Superposition Events in Finite Probability Theory
Finite probability theory is a mathematical framework used to describe the likelihood of certain outcomes. It has been enriched with the introduction of superposition events, which are defined on the properties that are common to elements within a set, but indefinite where they differ. In this article, we will explore how superposition events can be mathematically distinguished from discrete events and how they give rise to the Born Rule.
Mathematical Distinction Between Discrete Events and Superposition Events
Discrete events $S$ and superposition events $\Sigma S$ can be mathematically distinguished using density matrices. For a discrete event $S$, its density matrix $\rho(S)$ is diagonal, while for a superposition event $\Sigma S$, its density matrix $\rho(\Sigma S)$ is obtained as an outer product of a normalized vector $\left| s \right\rangle \in \mathbb{R}^n$.
Probabilities Defined Using Density Matrices
Probabilities are defined using density matrices as follows: given an outcome space $U=\left(u_1,...,u_n\right)$, let $T$ be any subset of this outcome space and let $P_T$ be the diagonal projection matrix with diagonal entries $\chi_T(u_i)$. Then, the probability of obtaining outcome $T$ conditioned by some event (discrete or superposition) is given by $$\Pr(T|\rho) = \operatorname*{tr}[P_T\rho].$$
The Born Rule
The Born Rule gives us probabilities for outcomes conditioned by superposition events. Specifically, for a singleton subset $\left\{u_i\right\} \subseteq U$, it states that $$\Pr(\left\{u_i\right
Finite probability theory is enriched by introducing the mathematical notion (no physics involved) of a superposition event $\Sigma S$--in addition to the usual discrete event $S$ (subset of the outcome space $U=\left( u_{1},...,u_{n}\right) $). Mathematically, the two types of events are distinguished using $n\times n$ density matrices. The density matrix $\rho\left( S\right) $ for a discrete event is diagonal and the density matrix $\rho\left( \Sigma S\right) $ is obtained as an outer product $\left\vert s\right\rangle \left\langle s\right\vert $ of a normalized vector $\left\vert s\right\rangle \in \mathbb{R}^{n}$. Probabilities are defined using density matrices as $\Pr\left( T|\rho\right) =\operatorname*{tr}\left[ P_{T}\rho\right] $ where $T\subseteq U$ and $P_{T}$ is the diagonal projection matrix with diagonal entries $\chi_{T}\left( u_{i}\right) $. Then for the singleton $\left\{ u_{i}\right\} \subseteq U$, the probability of the outcome $u_{i}$ conditioned by the \textit{superposition} event $\Sigma S$ is $\Pr\left( \left\{ u_{i}\right\} |\Sigma S\right) =\left\langle u_{i}|s\right\rangle ^{2}$, the Born Rule. Thus the Born Rule arises naturally from the mathematics of superposition when superposition events are added to ordinary finite probability theory. No further explanation is required when the mathematics uses $ \mathbb{C}^{n}$ instead of $\mathbb{R}^{n}$ except that the square $\left\langle u_{i}|s\right\rangle ^{2}$ is the absolute square $\left\vert \left\langle u_{i}|s\right\rangle \right\vert ^{2}$.
