Skip to content

Born Rule for Discrete Spectra

The discrete Born rule assigns probabilities to finite or countably many mutually exclusive outcomes of a projective measurement. If outcome aa is represented by the projector PaP_a, then

p(a)=Tr⁡(ρPa)p(a) = \operatorname{Tr}(\rho P_a)

for a density operator ρ\rho. For a normalized pure state,

p(a)=⟨ψ∣Pa∣ψ⟩=∥Pa∣ψ⟩∥2.p(a) = \langle\psi\rvert P_a\lvert\psi\rangle = \lVert P_a\lvert\psi\rangle\rVert^2.

When the outcome is nondegenerate and Pa=∣a⟩⟨a∣P_a=\lvert a\rangle\langle a\rvert, this reduces to

p(a)=∣⟨a∣ψ⟩∣2.p(a) = \lvert\langle a\rvert\psi\rangle\rvert^2.

The representation-independent postulate and its assumptions are developed in the canonical Born Rule. This page is the calculation-facing treatment for sharp measurements with discrete outcomes.

Required background. The Born Rule supplies the state–measurement pairing; Probability Amplitudes supplies discrete-basis overlaps; Projectors supplies degenerate and coarse-grained events.

Here discrete means that the outcome set can be listed as a finite or countable collection. It does not require the Hilbert space to be finite-dimensional. Examples include:

  • spin components and other finite-level observables;
  • bound-state energy levels;
  • angular-momentum quantum numbers;
  • occupation-number measurements with outcomes n=0,1,2,…n=0,1,2,\ldots;
  • coarse-grained bins represented by mutually orthogonal projectors.

The page assumes a projective measurement, or PVM. General effects and noisy measurements belong to POVMs: First Encounter. Continuous outcome measures belong to Born Rule for Continuous Spectra.

SituationProbability of outcome aa
pure state, nondegenerate outcome∣⟨a∣ψ⟩∣2\lvert\langle a\rvert\psi\rangle\rvert^2
pure state, degenerate outcome∥Pa∣ψ⟩∥2\lVert P_a\lvert\psi\rangle\rVert^2
mixed stateTr⁡(ρPa)\operatorname{Tr}(\rho P_a)
eigenspace basis {∣a,α⟩}\{\lvert a,\alpha\rangle\}∑α∣⟨a,α∣ψ⟩∣2\sum_\alpha\lvert\langle a,\alpha\rvert\psi\rangle\rvert^2
matrix representationc†Pacc^\dagger P_a c
coarse outcome SS∑a∈Sp(a)\sum_{a\in S}p(a)

The projector and trace formulas are the safest defaults. The squared-coefficient formula should be used only after the measurement basis and any degeneracy have been identified.

A discrete projective measurement is a family of projectors {Pa}\{P_a\} satisfying

Pa†=Pa,Pa2=Pa,PaPb=0(a≠b),∑aPa=I.\begin{aligned} P_a^\dagger&=P_a,\\ P_a^2&=P_a,\\ P_aP_b&=0 \quad(a\neq b),\\ \sum_aP_a&=I. \end{aligned}

The first two conditions say that each PaP_a projects onto a closed outcome subspace. Orthogonality makes distinct outcomes mutually exclusive. Completeness makes them exhaustive. For a countably infinite outcome set, the sum ∑aPa=I\sum_aP_a=I is understood in the strong-operator sense.

A discrete self-adjoint observable can be written

A=∑aaPa,A = \sum_a aP_a,

where distinct labels aa denote distinct eigenvalues. The probability depends on the spectral projectors, not on the numerical size of the eigenvalues. Replacing aa by another one-to-one relabeling changes reported values but not the underlying outcome probabilities.

Suppose AA has a nondegenerate orthonormal eigenbasis:

A∣an⟩=an∣an⟩.A\lvert a_n\rangle = a_n\lvert a_n\rangle.

Expand the normalized state,

∣ψ⟩=∑ncn∣an⟩,cn=⟨an∣ψ⟩.\lvert\psi\rangle = \sum_n c_n\lvert a_n\rangle, \qquad c_n = \langle a_n\rvert\psi\rangle.

Each spectral projector is rank one,

Pn=∣an⟩⟨an∣,P_n = \lvert a_n\rangle\langle a_n\rvert,

so

p(an)=∣cn∣2.p(a_n) = \lvert c_n\rvert^2.

Completeness gives the immediate check

∑np(an)=∑n∣cn∣2=1.\sum_n p(a_n) = \sum_n \lvert c_n\rvert^2 = 1.

The coefficient phases do not affect this particular measurement distribution. They can affect a measurement in another basis, where different linear combinations of the same coefficients interfere.

If several orthogonal eigenvectors share the same eigenvalue aa, the outcome projector has rank greater than one. Let

{∣a,1⟩,…,∣a,da⟩}\{ \lvert a,1\rangle, \ldots, \lvert a,d_a\rangle \}

be an orthonormal basis of the eigenspace. Then

Pa=∑α=1da∣a,α⟩⟨a,α∣.P_a = \sum_{\alpha=1}^{d_a} \lvert a,\alpha\rangle \langle a,\alpha\rvert.

For a pure state,

p(a)=⟨ψ∣Pa∣ψ⟩=∑α=1da∣⟨a,α∣ψ⟩∣2.\begin{aligned} p(a) &= \langle\psi\rvert P_a\lvert\psi\rangle\\ &= \sum_{\alpha=1}^{d_a} \lvert \langle a,\alpha\rvert\psi\rangle \rvert^2. \end{aligned}

The outcome probability is the total state weight in the full eigenspace. It is not the weight of one arbitrarily chosen eigenvector.

Choose another orthonormal basis of the same eigenspace,

∣a,μ⟩′=∑αUμα∣a,α⟩,\lvert a,\mu\rangle' = \sum_{\alpha} U_{\mu\alpha} \lvert a,\alpha\rangle,

where UU is unitary. The component columns obey

dμ=∑αUμα∗cα.d_\mu = \sum_\alpha U_{\mu\alpha}^*c_\alpha.

Unitarity preserves their squared norm:

∑μ∣dμ∣2=∑α∣cα∣2.\sum_\mu \lvert d_\mu\rvert^2 = \sum_\alpha \lvert c_\alpha\rvert^2.

Thus the individual amplitudes depend on the internal basis, while their sum is the basis-independent probability of the degenerate outcome.

Several orthogonal basis components are grouped by spectral projectors into discrete measurement outcomes.

Distinct eigenvectors with the same eigenvalue belong to one outcome projector. Their squared component magnitudes add to the probability p(a)p(a); nondegenerate outcomes require only one component.

A measurement may report a set SS of fine outcomes as one coarse result. The coarse projector is

PS=∑a∈SPa.P_S = \sum_{a\in S} P_a.

Because the fine projectors are orthogonal,

PS2=PS,P_S^2 = P_S,

and

p(S)=Tr⁡(ρPS)=∑a∈STr⁡(ρPa)=∑a∈Sp(a).\begin{aligned} p(S) &= \operatorname{Tr}(\rho P_S)\\ &= \sum_{a\in S} \operatorname{Tr}(\rho P_a)\\ &= \sum_{a\in S}p(a). \end{aligned}

The probabilities add because the fine outcomes are mutually exclusive records of the declared projective measurement. This is different from coherent alternatives that lead to the same unresolved amplitude before a measurement.

In an orthonormal computational basis, represent a pure state by a column cc and an outcome projector by a matrix PaP_a. Then

p(a)=c†Pac.p(a) = c^\dagger P_a c.

The projected branch is the column PacP_ac, and

c†Pac=(Pac)†(Pac)c^\dagger P_ac = (P_ac)^\dagger(P_ac)

because Pa†Pa=PaP_a^\dagger P_a=P_a.

For a nondegenerate measurement performed in the computational basis,

Pn=diag⁡(0,…,0,1,0,…),P_n = \operatorname{diag} \left( 0,\ldots,0,1,0,\ldots \right),

so the matrix formula selects

p(n)=∣cn∣2.p(n) = \lvert c_n\rvert^2.

The same calculation works in any basis provided the state and projectors are represented consistently.

For a density operator,

p(a)=Tr⁡(ρPa).p(a) = \operatorname{Tr}(\rho P_a).

In a measurement basis adapted to a degenerate eigenspace,

p(a)=∑α=1daρaα,aα.p(a) = \sum_{\alpha=1}^{d_a} \rho_{a\alpha,a\alpha}.

Only the diagonal entries in this measurement basis contribute directly to the displayed distribution. Off-diagonal entries are not thereby unphysical: they can affect probabilities for another measurement basis.

For an ensemble

ρ=∑kwk∣ψk⟩⟨ψk∣,\rho = \sum_k w_k \lvert\psi_k\rangle \langle\psi_k\rvert,

linearity of the trace gives

p(a)=∑kwk⟨ψk∣Pa∣ψk⟩.p(a) = \sum_k w_k \langle\psi_k\rvert P_a\lvert\psi_k\rangle.

The result depends only on ρ\rho, not on a particular ensemble decomposition. The state theory is developed in Density Operators.

Suppose the state is given in an orthonormal basis {∣en⟩}\{\lvert e_n\rangle\}:

∣ψ⟩=∑ncn∣en⟩.\lvert\psi\rangle = \sum_n c_n\lvert e_n\rangle.

For a nondegenerate measurement basis {∣a⟩}\{\lvert a\rangle\}, define the overlap matrix

San=⟨a∣en⟩.S_{an} = \langle a\rvert e_n\rangle.

The measurement-basis amplitudes are

da=⟨a∣ψ⟩=∑nSancn,d_a = \langle a\rvert\psi\rangle = \sum_n S_{an}c_n,

and

p(a)=∣da∣2.p(a) = \lvert d_a\rvert^2.

For a degenerate outcome, compute all amplitudes daαd_{a\alpha} inside the eigenspace and sum their squared moduli:

p(a)=∑α∣daα∣2.p(a) = \sum_\alpha \lvert d_{a\alpha}\rvert^2.

Probability in Different Bases owns the detailed translation workflow and its qubit examples.

Outcome Values Do Not Weight Probabilities

Section titled “Outcome Values Do Not Weight Probabilities”

For

A=∑aaPa,A = \sum_a aP_a,

the eigenvalue aa labels the reported outcome. It does not multiply the Born probability:

p(a)≠a Tr⁡(ρPa).p(a) \neq a\, \operatorname{Tr}(\rho P_a).

Eigenvalues enter expectation values,

⟨A⟩=∑aa p(a),\langle A\rangle = \sum_a a\,p(a),

only after the outcome probabilities have been found. Confusing these two steps is a common source of negative or non-normalized “probabilities.”

Write a normalized spin-1/21/2 state in the SzS_z basis:

∣ψ⟩=cos⁡θ2∣+z⟩+eiϕsin⁡θ2∣−z⟩.\lvert\psi\rangle = \cos\frac{\theta}{2} \lvert+z\rangle + e^{i\phi} \sin\frac{\theta}{2} \lvert-z\rangle.

The spectral projectors are

P±=∣±z⟩⟨±z∣.P_\pm = \lvert\pm z\rangle \langle\pm z\rvert.

Therefore

p(+ℏ2)=cos⁡2θ2,p(−ℏ2)=sin⁡2θ2.\begin{aligned} p\left(+\frac{\hbar}{2}\right) &= \cos^2\frac{\theta}{2},\\ p\left(-\frac{\hbar}{2}\right) &= \sin^2\frac{\theta}{2}. \end{aligned}

The phase ϕ\phi does not affect the SzS_z distribution, but it can affect spin measurements along another axis.

For a Hamiltonian with discrete spectral decomposition

H=∑EEPE,H = \sum_E E P_E,

an ideal energy measurement has probabilities

p(E)=Tr⁡(ρPE).p(E) = \operatorname{Tr}(\rho P_E).

For a nondegenerate pure-state expansion

∣ψ⟩=∑ncn∣En⟩,\lvert\psi\rangle = \sum_n c_n\lvert E_n\rangle,

this becomes

p(En)=∣cn∣2.p(E_n) = \lvert c_n\rvert^2.

If several states share one energy EE, their weights must be grouped through PEP_E. Degeneracy is common in systems with rotational or other symmetries; an energy readout need not resolve the additional quantum numbers.

Worked Example: A Degenerate Three-Level Observable

Section titled “Worked Example: A Degenerate Three-Level Observable”

In the orthonormal basis {∣0⟩,∣1⟩,∣2⟩}\{\lvert0\rangle,\lvert1\rangle,\lvert2\rangle\}, define

A=0(∣0⟩⟨0∣+∣1⟩⟨1∣)+2∣2⟩⟨2∣.A = 0 \left( \lvert0\rangle\langle0\rvert + \lvert1\rangle\langle1\rvert \right) + 2\lvert2\rangle\langle2\rvert.

The two outcome projectors are

P0=∣0⟩⟨0∣+∣1⟩⟨1∣,P2=∣2⟩⟨2∣.\begin{aligned} P_0 &= \lvert0\rangle\langle0\rvert + \lvert1\rangle\langle1\rvert,\\ P_2 &= \lvert2\rangle\langle2\rvert. \end{aligned}

For

∣ψ⟩=∣0⟩+i∣1⟩+2∣2⟩6,\lvert\psi\rangle = \frac{ \lvert0\rangle +i\lvert1\rangle +2\lvert2\rangle }{\sqrt6},

the probabilities are

p(0)=⟨ψ∣P0∣ψ⟩=13,p(2)=⟨ψ∣P2∣ψ⟩=23.\begin{aligned} p(0) &= \langle\psi\rvert P_0\lvert\psi\rangle = \frac13,\\ p(2) &= \langle\psi\rvert P_2\lvert\psi\rangle = \frac23. \end{aligned}

The outcome 00 does not distinguish which vector within its two-dimensional eigenspace contributed.

Let {∣n⟩}n=0∞\{\lvert n\rangle\}_{n=0}^\infty be an orthonormal basis and choose 0≤q<10\leq q<1. The state

∣ψq⟩=1−q∑n=0∞qn/2∣n⟩\lvert\psi_q\rangle = \sqrt{1-q} \sum_{n=0}^{\infty} q^{n/2}\lvert n\rangle

is normalized because

(1−q)∑n=0∞qn=1.(1-q) \sum_{n=0}^{\infty} q^n = 1.

A measurement in this basis gives the geometric distribution

p(n)=(1−q)qn.p(n) = (1-q)q^n.

The probability of a tail event is

Pr⁡(n≥N)=∑n=N∞(1−q)qn=qN.\begin{aligned} \Pr(n\geq N) &= \sum_{n=N}^{\infty} (1-q)q^n\\ &= q^N. \end{aligned}

For countably infinite spectra, normalization is a convergence statement. The amplitude sequence must lie in ℓ2\ell^2, and probabilities must be summed with the appropriate limiting procedure.

For a pure state,

Pa∣ψ⟩=∣ψ⟩⟹p(a)=1,P_a\lvert\psi\rangle = \lvert\psi\rangle \quad \Longrightarrow \quad p(a)=1,

while

Pa∣ψ⟩=0⟹p(a)=0.P_a\lvert\psi\rangle = 0 \quad \Longrightarrow \quad p(a)=0.

More generally, 0<p(a)<10<p(a)<1 when the state has nonzero components both inside and outside the outcome subspace.

For a density operator, certainty means that the support of ρ\rho lies within ran⁡Pa\operatorname{ran}P_a; impossibility means that the support is orthogonal to that subspace.

Numerical calculations often retain only ∣0⟩,…,∣N⟩\lvert0\rangle,\ldots,\lvert N\rangle. The retained projector is

P≤N=∑n=0N∣n⟩⟨n∣.P_{\leq N} = \sum_{n=0}^{N} \lvert n\rangle\langle n\rvert.

For the geometric example,

⟨ψq∣P≤N∣ψq⟩=1−qN+1.\langle\psi_q\rvert P_{\leq N} \lvert\psi_q\rangle = 1-q^{N+1}.

If the truncated state is not renormalized, its listed probabilities sum to the retained weight rather than one. Renormalizing changes the question to a conditional distribution given n≤Nn\leq N:

pN(n)=(1−q)qn1−qN+1,0≤n≤N.p_N(n) = \frac{ (1-q)q^n }{ 1-q^{N+1} }, \qquad 0\leq n\leq N.

The missing tail probability qN+1q^{N+1} should be monitored as a truncation error, not silently discarded.

Before trusting a discrete calculation, verify the measurement data:

Pa†=Pa,Pa2=Pa,PaPb=0(a≠b),∑aPa=I.\begin{aligned} P_a^\dagger&=P_a, & P_a^2&=P_a,\\ P_aP_b&=0 \quad(a\neq b), & \sum_aP_a&=I. \end{aligned}

Then verify the output:

p(a)∈[0,1],∑ap(a)=1.p(a)\in[0,1], \qquad \sum_ap(a)=1.

In numerical work, small deviations can arise from floating-point error. Large imaginary parts, negative probabilities, or substantial failure of normalization usually indicate inconsistent bases, nonprojective candidate matrices, or an incompletely represented state space.

Probability and State Update Are Different

Section titled “Probability and State Update Are Different”

The Born rule answers

How likely is outcome a?\text{How likely is outcome }a?

It does not by itself answer

What state follows after outcome a?\text{What state follows after outcome }a?

For an ideal projective measurement, a common conditional update is

ρ⟼PaρPaTr⁡(ρPa),\rho \longmapsto \frac{ P_a\rho P_a }{ \operatorname{Tr}(\rho P_a) },

when p(a)>0p(a)>0. The probability formula is the same for other instruments that can produce different conditional states. The update theory belongs to Projective Measurement and State Update Rule.

  1. List distinct outcomes. Group repeated eigenvalues into one outcome.
  2. Construct the projectors. Use the full eigenspace for every degenerate outcome.
  3. Check the PVM. Verify orthogonality and completeness.
  4. Normalize the state. For countable expansions, check convergence as well as the formal sum.
  5. Align representations. Express the state and projectors in the same basis.
  6. Apply the rule. Use ∣⟨a∣ψ⟩∣2\lvert\langle a\rvert\psi\rangle\rvert^2 only for rank-one pure-state outcomes; otherwise use a projected norm or trace.
  7. Coarse-grain after fine probabilities are defined. Sum mutually exclusive outcome probabilities or their projectors.
  8. Audit the result. Check reality, nonnegativity, and unit total probability.
  9. Treat update separately. Do not infer a conditional state from p(a)p(a) alone.
  • Squaring an amplitude rather than taking its squared modulus.
  • Reading coefficients in the preparation basis as probabilities for a different measurement basis.
  • Treating a repeated eigenvalue as several distinct outcomes when the apparatus reports only the eigenvalue.
  • Using one eigenvector instead of the full projector for a degenerate outcome.
  • Multiplying the probability by the numerical eigenvalue.
  • Assuming coefficient phases never matter because they disappear in one particular basis measurement.
  • Forgetting to verify that candidate projectors are orthogonal and complete.
  • Applying pure-state formulas directly to a mixed state without choosing a valid ensemble-independent expression.
  • Assuming a finite truncation remains normalized without checking the omitted tail.
  • Confusing the outcome probability with the post-measurement state.
  • M. Born, “Zur Quantenmechanik der Stoßvorgänge”, Zeitschrift für Physik 37, 863–867 (1926).
  • P. A. M. Dirac, The Principles of Quantum Mechanics, 4th ed., Oxford University Press, 1958. Develops transformation amplitudes and projection measurements.
  • B. C. Hall, Quantum Theory for Mathematicians, Springer, 2013. Gives a mathematically careful account of Hilbert-space states, spectral theory, and projective probability measures.
  • A. Peres, Quantum Theory: Concepts and Methods, Kluwer, 1995. Emphasizes operational distinctions among preparations, projectors, and outcomes.
  • J. J. Sakurai and J. Napolitano, Modern Quantum Mechanics, 3rd ed., Cambridge University Press, 2020. Treats spin, compatible observables, degeneracy, and measurement postulates.
  • R. Shankar, Principles of Quantum Mechanics, 2nd ed., Springer, 1994. Gives detailed finite-dimensional and basis-based calculations.

Let

∣ψ⟩=2∣0⟩−i∣1⟩5.\lvert\psi\rangle = \frac{ 2\lvert0\rangle-i\lvert1\rangle }{\sqrt5}.

Find the probabilities for a measurement in the {∣0⟩,∣1⟩}\{\lvert0\rangle,\lvert1\rangle\} basis.

Solution

The basis amplitudes are 2/52/\sqrt5 and −i/5-i/\sqrt5. Therefore

p(0)=45,p(1)=15.p(0) = \frac45, \qquad p(1) = \frac15.

The probabilities are nonnegative and sum to one.

For the state in Exercise 1, compute the probabilities for the basis

∣±⟩=∣0⟩±∣1⟩2.\lvert\pm\rangle = \frac{ \lvert0\rangle\pm\lvert1\rangle }{\sqrt2}.
Solution

The amplitudes are

⟨+∣ψ⟩=2−i10,⟨−∣ψ⟩=2+i10.\begin{aligned} \langle+\rvert\psi\rangle &= \frac{2-i}{\sqrt{10}},\\ \langle-\rvert\psi\rangle &= \frac{2+i}{\sqrt{10}}. \end{aligned}

Hence

p(+)=p(−)=4+110=12.p(+) = p(-) = \frac{4+1}{10} = \frac12.

The original coefficients could not be squared directly because this is a different measurement basis.

Let

Pa=∣0⟩⟨0∣+∣1⟩⟨1∣,Pb=∣2⟩⟨2∣,P_a = \lvert0\rangle\langle0\rvert + \lvert1\rangle\langle1\rvert, \qquad P_b = \lvert2\rangle\langle2\rvert,

and

∣χ⟩=∣0⟩−∣1⟩2.\lvert\chi\rangle = \frac{ \lvert0\rangle-\lvert1\rangle }{\sqrt2}.

Find p(a)p(a) and p(b)p(b).

Solution

The state lies entirely in ran⁡Pa\operatorname{ran}P_a:

Pa∣χ⟩=∣χ⟩,Pb∣χ⟩=0.P_a\lvert\chi\rangle = \lvert\chi\rangle, \qquad P_b\lvert\chi\rangle = 0.

Therefore

p(a)=1,p(b)=0.p(a)=1, \qquad p(b)=0.

The relative minus sign does not remove the state from the two-dimensional outcome subspace.

In a three-dimensional basis, take

PA=(100000001),PB=(000010000).\begin{aligned} P_A &= \begin{pmatrix} 1&0&0\\ 0&0&0\\ 0&0&1 \end{pmatrix},\\[2mm] P_B &= \begin{pmatrix} 0&0&0\\ 0&1&0\\ 0&0&0 \end{pmatrix}. \end{aligned}

and

c=16(1i2).c = \frac1{\sqrt6} \begin{pmatrix} 1\\ i\\ 2 \end{pmatrix}.

Verify that the matrices form a PVM and compute the probabilities.

Solution

Both matrices are Hermitian and idempotent. They are orthogonal and complete:

PAPB=0,PA+PB=I.P_AP_B=0, \qquad P_A+P_B=I.

The probabilities are

p(A)=c†PAc=1+46=56,p(B)=c†PBc=16.\begin{aligned} p(A) &= c^\dagger P_Ac = \frac{1+4}{6} = \frac56,\\ p(B) &= c^\dagger P_Bc = \frac16. \end{aligned}

Consider

ρ=(12γγ∗12),∣γ∣≤12.\rho = \begin{pmatrix} \frac12&\gamma\\ \gamma^*&\frac12 \end{pmatrix}, \qquad \lvert\gamma\rvert\leq\frac12.

Find the outcome probabilities in the zz basis and in the {∣+⟩,∣−⟩}\{\lvert+\rangle,\lvert-\rangle\} basis.

Solution

The zz-basis probabilities are the diagonal entries:

p(0)=p(1)=12.p(0)=p(1)=\frac12.

For the complementary basis,

p(+)=⟨+∣ρ∣+⟩=12+Re⁡γ,p(−)=⟨−∣ρ∣−⟩=12−Re⁡γ.\begin{aligned} p(+) &= \langle+\rvert\rho\lvert+\rangle = \frac12+\operatorname{Re}\gamma,\\ p(-) &= \langle-\rvert\rho\lvert-\rangle = \frac12-\operatorname{Re}\gamma. \end{aligned}

The off-diagonal coherence is invisible to the zz measurement but affects the complementary measurement.

Exercise 6: Countably infinite distribution

Section titled “Exercise 6: Countably infinite distribution”

For 0≤q<10\leq q<1, let

p(n)=(1−q)qn,n=0,1,2,….\begin{aligned} p(n)&=(1-q)q^n,\\ n&=0,1,2,\ldots. \end{aligned}

verify normalization and find Pr⁡(n≥N)\Pr(n\geq N).

Solution

The geometric series gives

∑n=0∞p(n)=(1−q)11−q=1.\sum_{n=0}^{\infty} p(n) = (1-q) \frac1{1-q} = 1.

The tail is

Pr⁡(n≥N)=(1−q)∑n=N∞qn=(1−q)qN1−q=qN.\begin{aligned} \Pr(n\geq N) &= (1-q) \sum_{n=N}^{\infty} q^n\\ &= (1-q) \frac{q^N}{1-q} = q^N. \end{aligned}

A four-outcome PVM gives

p0=110,p1=210,p2=310,p3=410.\begin{aligned} p_0&=\frac1{10}, & p_1&=\frac2{10},\\ p_2&=\frac3{10}, & p_3&=\frac4{10}. \end{aligned}

Outcomes 22 and 33 are reported together as SS. Find PSP_S and p(S)p(S).

Solution

The coarse projector and probability are

PS=P2+P3P_S = P_2+P_3

and

p(S)=p2+p3=710.p(S) = p_2+p_3 = \frac7{10}.

Orthogonality of P2P_2 and P3P_3 ensures that PSP_S is again a projector.

For the geometric distribution in Exercise 6, retain only n=0,…,Nn=0,\ldots,N. Find the retained probability and the normalized conditional distribution within the truncation.

Solution

The retained probability is

p(n≤N)=(1−q)∑n=0Nqn=1−qN+1.\begin{aligned} p(n\leq N) &= (1-q) \sum_{n=0}^{N} q^n\\ &= 1-q^{N+1}. \end{aligned}

Conditioning on the retained subspace gives

pN(n)=(1−q)qn1−qN+1,0≤n≤N.p_N(n) = \frac{ (1-q)q^n }{ 1-q^{N+1} }, \qquad 0\leq n\leq N.

The omitted tail has probability qN+1q^{N+1}.