Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 11 results · all verified · 10 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Measurements, POVMs, and Instruments

1 · Prerequisites

2 · Summary

This page defines finite projective measurements and POVMs as algebraic families of operators, then proves positivity and normalization of their outcome laws. It defines finite POVM probability kernels with an explicit matrix-coordinate Borel structure and proves measurability and affinity. It defines complete positivity through all finite ancilla block amplifications, supplies the finite block-map construction, and proves a finite Naimark isometric compression. Finally, it defines instruments and conditional states and proves outcome normalization, the Lüders construction, positive-probability state validity, zero-probability branch behavior, and the density and mixture formulas for nonselective outputs. No physical postulate is used as a mathematical premise.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite projective measurements

Definition

Let H be a nonzero finite-dimensional complex inner-product space and let Ω be a finite nonempty outcome set (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis, Real and complex inner-product spaces and their induced length). Its endomorphisms are its complex-linear maps H→H (The space L(V,W) of linear maps with pointwise addition and scalar multiplication); for an endomorphism P, P∗ denotes its adjoint, which exists uniquely in finite dimension (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V, Every linear map between finite-dimensional inner product spaces has a unique adjoint). A finite projective measurement on H with outcomes Ω is a family (Pa)a∈Ω of endomorphisms such that

Pa∗=Pa,Pa2=Pa,PaPb=0 (a≠b),∑a∈ΩPa=IH.

The products above are compositions, the sum is pointwise addition of endomorphisms, and IH is the identity map; these operations preserve linear maps (L(V,W) is a vector space over the common scalar field, Identity maps and composites of linear maps are linear). The projections Pa=0 are permitted. For a density operator ρ on H (nonnegative and trace one, Density operator), the associated outcome weights are pρ(a)=tr⁡(ρPa); their nonnegativity and normalization are proved in Projective measurement outcome weights are probabilities ↗.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite POVMs and their outcome law

Definition

Let H be a nonzero finite-dimensional complex inner-product space; the pairing is linear in its first argument (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis, Real and complex inner-product spaces and their induced length). Write L(H) for its complex-linear endomorphisms (The space L(V,W) of linear maps with pointwise addition and scalar multiplication) and let Ω be a finite nonempty outcome set. A finite POVM on H with outcomes Ω is a family E=(Ea)a∈Ω with each Ea nonnegative and ∑a∈ΩEa=IH; after any enumeration of Ω, these operators form the finite complete positive family of Finite positive effect family. Reordering does not alter the finite sum. The complete-family lemma A complete positive family consists of effects shows that every Ea also has nonnegative complement IH−Ea, so each is an effect.

For a density operator ρ on H (a nonnegative operator of trace one, Density operator), its POVM outcome weights are

pρ(a):=tr⁡(ρEa),a∈Ω.

Here tr⁡ is the finite-dimensional endomorphism trace (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

The positivity and normalization of these weights are proved in POVM outcome weights are probabilities ↗. A POVM specifies this outcome law; it does not by itself prescribe a conditional output state.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Projective measurement outcome weights are probabilities

Statement

Let ρ be a density operator on a nonzero finite-dimensional complex inner-product space H, and let (Pa)a∈Ω be a finite projective measurement on H. Then pρ(a)=tr⁡(ρPa) lies in [0,1] for every a, and ∑a∈Ωpρ(a)=1.

Facts & Assumptions

Given: The density operator ρ and the finite projective measurement (Pa)a∈Ω stated above.

[F1]

Finite projective measurements: Pa∗=Pa=Pa2, PaPb=0 for a≠b, and ∑aPa=IH; zero projections are allowed.

[F6]

Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.

[F7]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

[F2]

A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: a nonnegative operator has an orthonormal basis in which its matrix is diagonal with nonnegative real diagonal entries.

[F3]

For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA): tr⁡(AB)=tr⁡(BA) for compatible rectangular matrices.

[F4]

Trace is a linear functional on Mn(F): trace preserves finite sums and scalar multiples.

[F5]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: endomorphism trace is the matrix trace in any basis and is basis-independent.

Proof

1.1givenF1F2F3F5F6F7

Fix a. Set τa=PaρPa. Self-adjointness of Pa and ρ gives ⟨τax,y⟩=⟨ρPax,Pay⟩=⟨x,τay⟩ for all x,y, so τa is self-adjoint. It is nonnegative, since ⟨τax,x⟩=⟨ρPax,Pax⟩≥0 for every x by [F6]–[F7]. By [F2], τa has nonnegative diagonal entries in an orthonormal basis, so [F5] gives tr⁡(τa)≥0. By [F3] and Pa2=Pa, pρ(a)=tr⁡(ρPa)=tr⁡(PaρPa)=tr⁡(τa)≥0.

1.2givenF1F4F5F6

By [F4], the resolution of the identity in [F1], and [F6], ∑apρ(a)=tr⁡(ρ∑aPa)=tr⁡(ρIH)=tr⁡(ρ)=1.

2.1step 1.1algebra∎

For each a, 1−pρ(a)=∑b≠apρ(b)≥0 by step 1.1, with the empty sum interpreted as 0 when Ω={a}. Therefore every weight is at most one and, by step 1.1, belongs to [0,1].

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite POVM outcome kernel

Definition

Let H be a nonzero finite-dimensional complex-inner-product space and fix an ordered basis B of H (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis, Real and complex inner-product spaces and their induced length). Represent each endomorphism by its matrix in B (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases), and identify its real and imaginary entries with a point of R2(dim⁡H)2. Give the density set D(H) (nonnegative operators of trace one, Density operator) the topology whose open sets are intersections of D(H) with open subsets of that Euclidean coordinate space. Its Borel σ-algebra is the smallest σ-algebra containing those open sets; a σ-algebra is a family of subsets closed under complements and countable unions.

Let Ω be the finite outcome set of a POVM E on H. A finite probability kernel from D(H) to Ω assigns to each ρ∈D(H) a finite probability space on Ω, and requires that ρ↦K(ρ,S) be Borel measurable for every event S⊆Ω (Finite probability spaces, outcome weights, events, and event probabilities). The Borel σ-algebra on R is generated by its open sets; a real-valued function is Borel measurable when the preimage of every such Borel set belongs to the domain's Borel σ-algebra.

For the POVM outcome weights from Finite POVMs and their outcome law, define the candidate kernel by

KE(ρ,S):=∑a∈Str⁡(ρEa),S⊆Ω.

Here tr⁡ is the finite-dimensional endomorphism trace (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

That this assignment is a probability kernel and is affine in ρ is proved in The finite POVM law is a probability kernel ↗. The matrix-coordinate σ-algebra is fixed in the definition; no unmentioned topology on the state set is used.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite ancilla amplification is a well-defined block map

Statement

Let H,K be finite-dimensional complex-inner-product spaces, let r≥1, and let R=Cr have its standard ordered orthonormal basis (e0,…,er−1). For every X∈L(H⊗R) there is a unique family Xij∈L(H) such that

X(x⊗ej)=∑i<rXijx⊗ei(x∈H, j<r).

For every complex-linear Φ:L(H)→L(K), there is a unique operator Φ(r)(X)∈L(K⊗R) satisfying

Φ(r)(X)(y⊗ej)=∑i<rΦ(Xij)y⊗ei(y∈K, j<r).

Thus the block rule [Xij]↦[Φ(Xij)] defines a well-defined linear map on the full operator space. At r=1, it is Φ under the canonical unitary identifications x↦x⊗e0 and y↦y⊗e0.

Facts & Assumptions

Given: Finite-dimensional complex-inner-product spaces H,K, an integer r≥1, the standard basis of R=Cr, and a complex-linear map Φ:L(H)→L(K).

[F1]

Finite registers and their ordered computational bases: the r-level register is Cr with ordered standard basis e0,…,er−1.

[F2]

Ordered tensor registers, their inner product, and wire permutations: after specifying ordered orthonormal bases for the factors, their tensor register has the product inner product, linear in the first argument.

[F3]

The product basis is orthonormal and tensor dimensions multiply: product vectors from specified orthonormal bases of the factors form an orthonormal basis of the tensor space.

[F4]

The space L(V,W) of linear maps with pointwise addition and scalar multiplication: L(H) and L(K) are the spaces of complex-linear endomorphisms, with pointwise operations.

[F5]

L(V,W) is a vector space over the common scalar field: pointwise operations make each finite-dimensional linear-map space a complex vector space.

[F6]

Linear map between vector spaces over the same field: a complex-linear map preserves finite linear combinations.

[F7]

Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis: finite-dimensional means having a finite basis; the stated finite-dimensional spaces therefore admit finite bases.

[F8]

Finite iterated tensor products represent multilinear maps independently of parenthesization: tensor products represent finite multilinear maps, and the scalar space is the tensor unit with its canonical unit identifications.

[F9]

Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans: Gram–Schmidt turns any finite linearly independent list, in particular a basis, into an orthonormal list with the same successive spans.

Proof

1.1givenF1F2F3F7F9

Choose finite bases of H and K, which exist by [F7] and are linearly independent by the basis definition; apply [F9] to obtain orthonormal bases (uα) and (vβ) with the same spans. By [F1]–[F3], (uα⊗ej)α,j and (vβ⊗ej)β,j are orthonormal bases of H⊗R and K⊗R. For each j,α, uniquely expand X(uα⊗ej)=∑i<r, βcβi;αjuβ⊗ei. Define Xijuα=∑βcβi;αjuβ and extend linearly from the basis of H. Linearity of X gives the required block formula on every x∈H. Any other family satisfying it has the same coefficients on every product-basis vector, hence each block agrees on the basis uα and is equal.

2.1givenF1F2F3F4F6step 1.1

On each product-basis vector vβ⊗ej, prescribe the image ∑iΦ(Xij)vβ⊗ei. Since these product vectors are a basis, there exists a unique linear operator Y on K⊗R with those values. By linearity this gives the displayed rule for all y∈K. Define Φ(r)(X)=Y. Uniqueness of the blocks from step 1.1 and uniqueness of an operator from its values on a basis show that this definition is unambiguous.

3.1givenF1F2F3F4F5F6F8step 1.1step 2.1∎

For X,X′∈L(H⊗R), their block families are respectively [Xij] and [Xij′]. The defining action on the product basis shows that the blocks of sX+tX′ are sXij+tXij′ for any scalars s,t∈C. Applying the linearity of Φ from [F6] gives blocks sΦ(Xij)+tΦ(Xij′), which are exactly the blocks of sΦ(r)(X)+tΦ(r)(X′). Equality on a basis yields Φ(r)(sX+tX′)=sΦ(r)(X)+tΦ(r)(X′). When r=1, identify R=C1 with the tensor unit C by 1↦e0, and define uH:H→H⊗R and uK:K→K⊗R by uHx=x⊗e0 and uKy=y⊗e0. These are the corresponding canonical unit identifications of [F8]. By [F3], they send the orthonormal bases chosen in step 1.1 to the corresponding product bases, and [F1]–[F2] show they preserve inner products; hence they are unitary. The sole block equations are XuH=uHX00 and Φ(1)(X)uK=uKΦ(X00), so X00=uH−1XuH and uK−1Φ(1)(X)uK=Φ(X00)=Φ(uH−1XuH). This is the original map under these identifications.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Finite Naimark isometric compression

Statement

Let H be a nonzero finite-dimensional complex inner-product space, let Ω be a finite nonempty set, and let (Ea)a∈Ω be a finite POVM on H. Put r=∣Ω∣, fix any bijection j:Ω→{0,…,r−1}, and let R=Cr with standard orthonormal basis e0,…,er−1; write ∣a⟩=ej(a). Define

Vx:=∑a∈ΩEa1/2x⊗∣a⟩,Qa:=IH⊗∣a⟩⟨a∣.

Then V∗V=IH, the family (Qa)a∈Ω is a finite projective measurement on H⊗R, and V∗QaV=Ea for every a. For every density operator ρ on H, VρV∗ is a density operator on H⊗R and

tr⁡H⊗R(VρV∗Qa)=tr⁡H(ρEa).

The result holds for every finite enumeration j and asserts an algebraic compression, not a physical realization.

Facts & Assumptions

Given: A nonzero finite-dimensional complex-inner-product space H, a finite nonempty outcome set Ω, a finite POVM (Ea) on H, any enumeration j of Ω, and a density operator ρ on H.

[F1]

Finite POVMs and their outcome law: each Ea is nonnegative and ∑aEa=IH.

[F2]

Finite projective measurements: a projective measurement is a finite family of pairwise orthogonal self-adjoint projections summing to the identity.

[F3]

Density operator: on nonzero finite-dimensional H, a density operator is nonnegative and has trace one.

[F4]

Finite registers and their ordered computational bases: for r≥1, the register Cr has its standard ordered orthonormal basis.

[F5]

Ordered tensor registers, their inner product, and wire permutations: after specifying ordered orthonormal bases for the factors, their tensor register has the product inner product, with its factors in the declared order.

[F6]

The product basis is orthonormal and tensor dimensions multiply: product vectors from specified orthonormal bases of the factors form an orthonormal basis and tensor dimensions multiply.

[F7]

Dirac Notation Conversion: the root pairing is linear in its first argument and ∣u⟩⟨v∣ sends z to ⟨z,v⟩u.

[F8]

Non-negative and positive operators: nonnegative means self-adjoint with ⟨Tx,x⟩≥0 for every vector x.

[F9]

A non-negative operator has a unique non-negative square root: each nonnegative Ea has a unique nonnegative square root Ma satisfying Ma2=Ea.

[F10]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: T∗ satisfies ⟨Tx,y⟩=⟨x,T∗y⟩ under the root convention.

[F11]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique adjoint.

[F12]

For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA): traces of compatible rectangular products satisfy tr⁡(AB)=tr⁡(BA).

[F13]

Real and complex inner-product spaces and their induced length: complex inner products are positive definite and linear in the first argument.

[F14]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: endomorphism trace is the matrix trace in any ordered basis and is basis-independent.

[F15]

Tensor products of finitely many linear maps: tensor maps are the unique linear maps satisfying their elementary-tensor formula.

[F16]

Projective measurement outcome weights are probabilities: for a density operator and a finite projective measurement, the outcome weight at a is tr⁡(ρPa).

[F17]

Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans: Gram–Schmidt turns a finite linearly independent list, in particular a basis, into an orthonormal list with the same span.

[F18]

Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis: finite-dimensional means having a finite basis; since H is nonzero, its basis is nonempty.

Proof

1.1givenF2F4F5F6F7F10F11F13F15F17F18

Choose a finite basis of H, which exists by [F18] and is linearly independent by the basis definition, and apply [F17] to obtain an orthonormal basis of H. With the standard orthonormal basis of R from [F4], [F6] gives an orthonormal product basis of H⊗R. For elementary tensors, [F7] and the tensor-map formula [F15] give Qa(x⊗ec)=δj(a),cx⊗ej(a). Therefore Qa2=Qa, QaQb=0 when a≠b, and ∑aQa=I on every product-basis vector; equality on that basis gives these operator identities. For elementary tensors x⊗ec,y⊗ed, orthonormality and the product inner product give ⟨Qa(x⊗ec),y⊗ed⟩=δj(a),cδj(a),d⟨x,y⟩=⟨x⊗ec,Qa(y⊗ed)⟩. Sesquilinearity and spanning by [F6] extend this identity to all vectors, so uniqueness of adjoints [F11] gives Qa∗=Qa. By [F2], (Qa) is a projective measurement.

1.2givenF1F4F5F8F9F10F11F13F15

Put Ma=Ea1/2 using [F9]. Each summand x↦Max⊗ej(a) is linear by [F15], so V is linear. For x,y∈H, orthogonality of the register labels and the product inner product give ⟨Vx,Vy⟩=∑a⟨Max,May⟩=⟨x,(∑aMa∗Ma)y⟩=⟨x,y⟩, because Ma is self-adjoint by [F8]–[F9], so Ma∗Ma=Ea, and [F1] gives ∑aEa=IH. The adjoint identities [F10]–[F11] also give ⟨Vx,Vy⟩=⟨x,V∗Vy⟩. For fixed y, set x=(V∗V−IH)y; then ∥x∥2=0, so positive definiteness [F13] implies (V∗V−IH)y=0. Since y was arbitrary, V∗V=IH.

2.1givenF5F8F9F10F13step 1.1

Fix b∈Ω. Step 1.1's action formula and the definition of V give QbVx=Mbx⊗ej(b). For all x,y∈H, the adjoint identity [F10], conjugate symmetry [F13], and product inner product [F5] yield ⟨V∗QbVx,y⟩=⟨QbVx,Vy⟩=⟨Mbx,Mby⟩=⟨x,Eby⟩, where the last equality uses self-adjointness from [F8]–[F9], which gives Mb∗Mb=Eb. If T=V∗QbV−Eb, then ⟨Tx,y⟩=0 for every x,y. Taking y=Tx gives ∥Tx∥2=0, so [F13] implies Tx=0 for every x; hence V∗QbV=Eb.

2.2givenF3F4F6F8F10F12F13F14F18step 1.1step 1.2

For all z,w∈H⊗R, the adjoint identities [F10] and self-adjointness of ρ from [F3], [F8] give ⟨VρV∗z,w⟩=⟨ρV∗z,V∗w⟩=⟨V∗z,ρV∗w⟩=⟨z,VρV∗w⟩, where the last equality follows from [F10] and conjugate symmetry [F13]. Thus VρV∗ is self-adjoint. Also, for every z, ⟨VρV∗z,z⟩=⟨ρV∗z,V∗z⟩≥0 by [F3], [F8] and [F10], so it is nonnegative by [F8]. Also dim⁡(H⊗R)=rdim⁡H>0 by [F4] and [F6], since H is nonzero by [F18] and r≥1. In bases, rectangular trace cyclicity [F12] and [F14] give tr⁡(VρV∗)=tr⁡(V∗Vρ)=tr⁡(ρ)=1 by step 1.2 and [F3]. Therefore VρV∗ is a density operator on the nonzero space H⊗R.

3.1givenF1F12F14F16step 1.1step 2.1step 2.2∎

Step 1.1 proves (Qa) is a projective measurement and step 2.2 proves VρV∗ is a density operator. Thus [F16] identifies its b-outcome weight as tr⁡(VρV∗Qb). Rectangular trace cyclicity [F12] and [F14] rewrite this as tr⁡(V∗QbVρ); step 2.1 makes that tr⁡(Ebρ)=tr⁡(ρEb), using [F12] once more on H. The final expression is the original POVM weight by [F1], proving the claimed equality.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

POVM outcome weights are probabilities

Statement

Let ρ be a density operator on a nonzero finite-dimensional complex inner-product space H, and let E=(Ea)a∈Ω be a finite POVM on H. Then

pρ(a)=tr⁡(ρEa)∈[0,1]for each a∈Ω,∑a∈Ωpρ(a)=1.

Facts & Assumptions

Given: H, the density operator ρ, the finite outcome set Ω, and the POVM E stated above.

[F1]

Finite POVMs and their outcome law: Ea is nonnegative, ∑aEa=IH, and pρ(a)=tr⁡(ρEa).

[F7]

Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.

[F8]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

[F2]

A non-negative operator has a unique non-negative square root: every nonnegative operator on a finite-dimensional real or complex inner-product space has a unique nonnegative square root R with R2=T.

[F3]

A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: a nonnegative operator has an orthonormal basis in which its matrix is diagonal with nonnegative real diagonal entries.

[F4]

For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA): for compatible rectangular matrices A,B, tr⁡(AB)=tr⁡(BA), including zero-sized cases.

[F5]

Trace is a linear functional on Mn(F): trace preserves finite sums and scalar multiples.

[F6]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: endomorphism trace is the matrix trace in any basis and is basis-independent.

Proof

1.1givenF1F2F3F4F6F7F8

Fix a∈Ω. Let Ma=Ea1/2 be the nonnegative square root supplied by [F2]. Since Ma and ρ are self-adjoint by [F2] and [F7]–[F8], for every x,y∈H one has ⟨MaρMax,y⟩=⟨ρMax,May⟩=⟨Max,ρMay⟩=⟨x,MaρMay⟩, so MaρMa is self-adjoint. For every x∈H, ⟨MaρMax,x⟩=⟨ρMax,Max⟩≥0 by [F7]–[F8], so MaρMa is nonnegative. By [F3] it is diagonal with nonnegative entries in an orthonormal basis, hence its trace is nonnegative by [F6]. By [F4] and Ma2=Ea, pρ(a)=tr⁡(ρEa)=tr⁡(MaρMa)≥0.

1.2givenF1F5F6F7

Linearity of trace [F5] and the completeness relation in [F1] give ∑a∈Ωpρ(a)=tr⁡(ρ∑aEa)=tr⁡(ρIH)=tr⁡(ρ)=1 by [F7] and [F6].

2.1step 1.1algebra∎

For fixed a, 1−pρ(a)=∑b∈Ω, b≠apρ(b)≥0 by step 1.1; if Ω={a} this is the empty sum 0. Thus pρ(a)≤1, and together with step 1.1 each weight lies in [0,1].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Conditional state for a projective measurement

Statement

Let ρ be a density operator and (Pa)a∈Ω a finite projective measurement on a nonzero finite-dimensional complex inner-product space H. Put pa=tr⁡(ρPa). If pa>0, then

ρa:=PaρPapa

is a density operator whose image im⁡(ρa):={ρax:x∈H} is contained in im⁡(Pa) (Kernel and image of a linear map). This statement assigns a conditional state only on positive-probability branches.

Facts & Assumptions

Given: The density operator ρ, the projective measurement (Pa)a∈Ω, and an outcome a with pa>0.

[F1]

Finite projective measurements: Pa∗=Pa=Pa2 and distinct outcome projections are orthogonal.

[F2]

Projective measurement outcome weights are probabilities: pa=tr⁡(ρPa) is the probability of outcome a.

[F5]

Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.

[F3]

For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA): tr⁡(AB)=tr⁡(BA) for compatible rectangular matrices.

[F4]

Trace is a linear functional on Mn(F): trace preserves scalar multiples.

[F6]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

[F7]

Kernel and image of a linear map: the image of a linear map T is im⁡T={T(x):x is in the domain}.

Proof

1.1givenF1F5F6

Set τa=PaρPa. Self-adjointness of Pa and ρ gives ⟨τax,y⟩=⟨ρPax,Pay⟩=⟨x,τay⟩ for all x,y, so τa is self-adjoint. For every x∈H, ⟨τax,x⟩=⟨ρPax,Pax⟩≥0 by [F5] and [F6], so τa is nonnegative. Since pa>0 is real, scaling the same pairing identity by 1/pa makes ρa=τa/pa self-adjoint; its quadratic form is nonnegative as well, so ρa is nonnegative.

1.2givenF1F2F3F4F5

By [F3] and Pa2=Pa, tr⁡(τa)=tr⁡(PaρPa)=tr⁡(ρPa2)=pa by [F2]. Hence [F4] gives tr⁡(ρa)=pa/pa=1, so ρa is a density operator by [F5].

2.1givenF1F7step 1.1step 1.2∎

For every x∈H, ρax=Pa(ρPax)/pa is of the form Pay with y=ρPax/pa. By [F7], every such vector lies in im⁡(Pa), so im⁡(ρa)⊆im⁡(Pa).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Completely positive maps

Definition

Let H and K be finite-dimensional complex inner-product spaces and write L(H) and L(K) for their vector spaces of complex-linear endomorphisms with pointwise operations (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis, Real and complex inner-product spaces and their induced length, The space L(V,W) of linear maps with pointwise addition and scalar multiplication, L(V,W) is a vector space over the common scalar field). Let Φ:L(H)→L(K) be complex-linear. For each integer r≥1, put R=Cr with its standard ordered register basis (Finite registers and their ordered computational bases). Write an operator X∈L(H⊗R) in its unique r×r block form X=[Xij] with Xij∈L(H), and define Φ(r)(X) to have blocks [Φ(Xij)] on K⊗R. Lemma Finite ancilla amplification is a well-defined block map proves that this block rule defines a linear map on the full operator space for every finite r. For r=1, the extension is Φ under the canonical unitary identifications x↦x⊗e0 and y↦y⊗e0 proved in that lemma.

The map Φ is completely positive if, for every finite r≥1, Φ(r) sends every nonnegative operator on H⊗R to a nonnegative operator on K⊗R (Non-negative and positive operators). The quantifier includes r=1; complete positivity therefore implies positivity. No Kraus, Choi, or Stinespring characterization is part of this definition.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The finite POVM law is a probability kernel

Statement

For a finite POVM E=(Ea)a∈Ω on a nonzero finite-dimensional complex inner-product space H, the assignment

KE(ρ,S)=∑a∈Str⁡(ρEa)

is a probability kernel from the matrix-coordinate Borel density set D(H) to the finite outcome set Ω. For every event S⊆Ω, the function ρ↦KE(ρ,S) is affine on D(H), meaning it preserves every convex combination λρ+(1−λ)σ with 0≤λ≤1.

Facts & Assumptions

Given: A nonzero finite-dimensional complex-inner-product space H, a finite nonempty outcome set Ω, and a finite POVM E=(Ea)a∈Ω.

[F1]

Finite POVM outcome kernel: D(H) carries the matrix-coordinate subspace Borel σ-algebra; Ω carries all subsets; KE(ρ,S)=∑a∈Str⁡(ρEa).

[F2]

POVM outcome weights are probabilities: for each density ρ, the weights pρ(a)=tr⁡(ρEa) are nonnegative and sum to one.

[F3]

Finite probability spaces, outcome weights, events, and event probabilities: a finite probability space is a finite outcome set with nonnegative weights summing to one, and an event's mass is the sum of its outcome weights.

[F4]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: endomorphism trace is matrix trace in any basis; in the chosen coordinates it is the sum of diagonal entries.

[F5]

Trace is a linear functional on Mn(F): tr⁡(A+B)=tr⁡(A)+tr⁡(B) and tr⁡(λA)=λtr⁡(A).

[F6]

Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.

[F7]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

[F8]

Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes: matrix products are row-by-column finite sums, so tr⁡(AB)=∑i,jAijBji in finite coordinates.

Proof

1.1givenF1F2F3

Fix ρ∈D(H). By [F2], the weights pρ(a) are nonnegative and sum to one, so [F3] gives a finite probability space on Ω. Its probability for an event S is ∑a∈Spρ(a), which equals KE(ρ,S) by [F1]. Thus the kernel value at each input is a probability measure on the finite outcome set.

1.2givenF1F4F8

Fix S⊆Ω and use the ordered basis defining the matrix coordinates. In those coordinates, each summand is tr⁡(ρEa)=∑i,jρij(Ea)ji by [F4] and the row-by-column product formula [F8]; it is a finite linear combination of coordinate projections ρ↦ρij. The projections are continuous in the matrix-coordinate topology, so each summand and the finite sum gS(ρ)=KE(ρ,S) are continuous.

2.1step 1.2

For every open U⊆R, continuity in step 1.2 makes gS−1(U) open and hence Borel. The collection of subsets B⊆R for which gS−1(B) is Borel is a σ-algebra, because inverse images preserve complements and countable unions; it contains every open set by the same continuity. It therefore contains the Borel σ-algebra, proving that gS is Borel measurable.

3.1givenF1F5F6F7algebra∎

Let λ∈[0,1] and ρ,σ∈D(H). Put T=λρ+(1−λ)σ. Since λ and 1−λ are real and ρ,σ are self-adjoint by [F6]–[F7], for every x,y∈H one has ⟨Tx,y⟩=λ⟨ρx,y⟩+(1−λ)⟨σx,y⟩=⟨x,Ty⟩. Thus T is self-adjoint; also ⟨Tx,x⟩=λ⟨ρx,x⟩+(1−λ)⟨σx,x⟩≥0, so T is nonnegative by [F7]. It has trace one by [F6] and [F5], so it lies in D(H). Applying [F5] to the finite sum in [F1] gives KE(λρ+(1−λ)σ,S)=λKE(ρ,S)+(1−λ)KE(σ,S). This proves affinity.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite instruments and conditional states

Definition

Let H be a nonzero finite-dimensional complex-inner-product space, let K be a finite-dimensional complex-inner-product space, and let Ω be a finite nonempty outcome set. A finite instrument from H to K is a family of complex-linear maps Ia:L(H)→L(K), one for each a∈Ω, such that each Ia is completely positive (Completely positive maps) and

∑a∈Ωtr⁡K(Ia(X))=tr⁡H(X)for every X∈L(H).

For a density operator ρ on H (nonnegative with trace one, Density operator), define the outcome weight pa(ρ):=tr⁡K(Ia(ρ)). The conditional state for outcome a is

ρa:={Ia(ρ)/pa(ρ),pa(ρ)>0,⊥,pa(ρ)=0.

Here ⊥ is a symbol meaning that no conditional density operator is assigned; it is not a state. Positivity and normalization of the outcome weights, and density of every positive-probability conditional state, are proved in Instrument outcome weights normalize ↗ and Positive-probability instrument branches are density operators ↗.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Instrument outcome weights normalize

Statement

For a finite instrument (Ia)a∈Ω and a density operator ρ on its input space, the branch weights pa=tr⁡(Ia(ρ)) form a probability distribution on Ω.

Facts & Assumptions

Given: A finite instrument (Ia)a∈Ω and an input density operator ρ.

[F1]

Finite instruments and conditional states: each outcome map is completely positive and ∑atr⁡(Ia(X))=tr⁡(X) for every input operator X; pa=tr⁡(Ia(ρ)).

[F2]

Completely positive maps: complete positivity includes the r=1 extension, which is the original map and therefore preserves nonnegativity.

[F5]

Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.

[F3]

A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: a nonnegative operator has an orthonormal basis in which its matrix is diagonal with nonnegative real diagonal entries.

[F4]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the basis-independent matrix trace of a finite-dimensional endomorphism.

[F6]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

Proof

1.1givenF1F2F3F4F5F6

For each a, complete positivity [F1]–[F2] at r=1 sends the nonnegative input ρ from [F5] to a nonnegative τa:=Ia(ρ) in the sense of [F6]. By [F3], τa has nonnegative diagonal entries in an orthonormal basis, and [F4] therefore gives pa=tr⁡(τa)≥0.

1.2givenF1F5

Apply the trace-preservation identity in [F1] to X=ρ. It gives ∑a∈Ωpa=tr⁡(ρ)=1 by [F5]. Thus the nonnegative branch weights sum to one.

2.1step 1.1step 1.2algebra∎

For any a, 1−pa=∑b≠apb≥0 by step 1.1, including the empty sum when Ω={a}. Hence pa∈[0,1] for every outcome, and the weights form a finite probability distribution.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The square-root Lüders maps form an instrument

Statement

Let (Ea)a∈Ω be a finite POVM on H, and let Ma=Ea1/2 be the nonnegative square root of each effect. The maps

Ia(X):=MaXMa,X∈L(H),

form an instrument from H to itself.

Facts & Assumptions

Given: A nonzero finite-dimensional complex-inner-product space H, a finite POVM (Ea)a∈Ω, and Ma=Ea1/2.

[F1]

Finite POVMs and their outcome law: each effect Ea is nonnegative and ∑aEa=IH.

[F2]

Finite instruments and conditional states: a family of completely positive outcome maps whose output traces sum to the input trace on every operator is an instrument.

[F3]

Completely positive maps: a branch map is completely positive when all its finite-ancilla extensions preserve nonnegative operators.

[F4]

Finite ancilla amplification is a well-defined block map: for an extension input with blocks Xij, the amplification of X↦MaXMa has blocks MaXijMa.

[F5]

A non-negative operator has a unique non-negative square root: Ma is nonnegative and Ma2=Ea.

[F6]

The space L(V,W) of linear maps with pointwise addition and scalar multiplication: L(H) has pointwise addition and scalar multiplication.

[F7]

L(V,W) is a vector space over the common scalar field: those pointwise operations make L(H) a vector space.

[F8]

Identity maps and composites of linear maps are linear: a composition of linear maps is linear.

[F10]

Trace is a linear functional on Mn(F): trace is linear on finite-dimensional matrix spaces.

[F11]

Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes: compatible block matrices multiply by row-by-column finite sums.

[F12]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

[F13]

Ordered tensor registers, their inner product, and wire permutations: after specifying ordered orthonormal bases for the factors, their tensor register carries the product inner product, linear in the first argument.

[F14]

Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis: finite-dimensional H has a finite basis; since H is nonzero, this basis is nonempty.

[F15]

Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans: Gram–Schmidt turns a finite linearly independent list, in particular a basis, into an orthonormal list with the same span.

[F16]

The product basis is orthonormal and tensor dimensions multiply: product vectors from specified orthonormal bases of the factors form an orthonormal basis of the tensor register.

Proof

1.1givenF6F7F8

For each a, X↦MaXMa takes L(H) to L(H) by composition of linear maps [F8]. For X,Y∈L(H), scalars s,t∈C, and v∈H, evaluate at v to obtain Ma((sX+tY)(Mav))=sMaXMav+tMaYMav. By the pointwise operations [F6]–[F7], this is sIa(X)v+tIa(Y)v, so Ia is complex-linear.

1.2givenF3F4F5F11F12F13F14F15F16

Fix any finite r and a nonnegative X on H⊗Cr in the sense of [F12]. By [F14] choose a finite basis of H, which is linearly independent by the basis definition, and apply [F15] to obtain an orthonormal basis; together with the standard basis of Cr, [F16] gives the product basis of H⊗Cr. By [F4], the extended branch map sends the blocks of X to MaXijMa. Let Sa be the block-diagonal operator with Ma on every diagonal block and zero off the diagonal. By the block product formula [F11], (SaXSa)ij=∑k,ℓ(Sa)ikXkℓ(Sa)ℓj=MaXijMa, so the extension is SaXSa. Write z=∑jzj⊗ej and w=∑jwj⊗ej using that product basis. The product inner product [F13] gives ⟨Saz,w⟩=∑j⟨Mazj,wj⟩=∑j⟨zj,Mawj⟩=⟨z,Saw⟩, since Ma is self-adjoint by [F5]; hence Sa is self-adjoint. For all z,w, self-adjointness of Sa and X gives ⟨SaXSaz,w⟩=⟨XSaz,Saw⟩=⟨Saz,XSaw⟩=⟨z,SaXSaw⟩, so SaXSa is self-adjoint. Therefore ⟨SaXSaz,z⟩=⟨XSaz,Saz⟩≥0 by [F12]. Thus the extension is nonnegative for every r, so [F3] gives complete positivity of each Ia.

2.1givenF1F2F5F9F10∎

For any X∈L(H), rectangular trace cyclicity [F9] and Ma2=Ea give tr⁡(Ia(X))=tr⁡(MaXMa)=tr⁡(XMa2)=tr⁡(XEa). By [F10] and completeness in [F1], ∑atr⁡(Ia(X))=tr⁡(X∑aEa)=tr⁡(X). Thus the family satisfies the instrument trace condition [F2].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A zero-probability instrument branch has no conditioned state

Statement

Let (Ia)a∈Ω be a finite instrument and let ρ be an input density operator. If pa=tr⁡(Ia(ρ))=0, then Ia(ρ)=0 and the conditional value for outcome a is ⊥, not a density operator.

Facts & Assumptions

Given: A finite instrument, an input density operator ρ, and an outcome a whose branch weight pa is zero.

[F1]

Finite instruments and conditional states: pa=tr⁡(Ia(ρ)), and the conditional value is ⊥ when pa=0.

[F2]

Completely positive maps: each finite-ancilla extension of a completely positive branch map preserves nonnegative operators.

[F5]

Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.

[F3]
[F4]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the basis-independent sum of the diagonal entries in any chosen basis.

[F6]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

Proof

1.1givenF1F2F3F4F5F6

Since Ia is completely positive, its r=1 extension sends the nonnegative ρ from [F5] to the nonnegative operator τ:=Ia(ρ) by [F2], with nonnegativity as defined in [F6]. By [F3], τ is diagonal with entries λj≥0 in an orthonormal basis. Its trace is ∑jλj=0 by the hypothesis and [F1], [F4]; a finite sum of nonnegative numbers is zero only when every λj=0. Hence τ=0.

2.1givenF1step 1.1∎

The instrument definition [F1] assigns ⊥ when pa=0. The algebraic quotient Ia(ρ)/pa would have zero denominator, so it is not a normalized conditional density state.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Positive-probability instrument branches are density operators

Statement

Let ρ be an input density operator for a finite instrument (Ia)a∈Ω, and let pa=tr⁡(Ia(ρ)). If pa>0, then the conditional operator ρa=Ia(ρ)/pa is a density operator on the instrument's output space.

Facts & Assumptions

Given: A finite instrument, an input density operator ρ, and an outcome a with pa>0.

[F1]

Finite instruments and conditional states: each branch map is completely positive, pa=tr⁡(Ia(ρ)), and the conditional operator is Ia(ρ)/pa when pa>0.

[F2]

Completely positive maps: at ancilla dimension r=1, a completely positive map preserves nonnegative operators.

[F5]

Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.

[F3]

Instrument outcome weights normalize: the branch weights satisfy pa≥0 and sum to one.

[F4]

Trace is a linear functional on Mn(F): trace commutes with scalar multiplication.

[F6]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

Proof

1.1givenF3

The outcome-law theorem [F3] shows that pa is the probability of branch a; the hypothesis pa>0 selects a positive-probability branch.

2.1givenF1F2F5F6step 1.1

Put τa=Ia(ρ). By [F1]–[F2] and [F5]–[F6], τa is nonnegative. Since pa>0 is real and τa is self-adjoint, for all u,v one has ⟨(τa/pa)u,v⟩=pa−1⟨τau,v⟩=pa−1⟨u,τav⟩=⟨u,(τa/pa)v⟩, so τa/pa is self-adjoint. Division by pa>0 also preserves nonnegativity of every quadratic form. Thus ρa=τa/pa is nonnegative by [F6].

3.1givenF1F4F5step 2.1∎

By the definition in [F1], tr⁡(τa)=pa. Linearity [F4] gives tr⁡(ρa)=pa−1tr⁡(τa)=1. Thus ρa is a density operator by [F5]. The hypothesis pa>0 also forces the output space to be nonzero, since its zero space has only trace-zero endomorphisms.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The nonselective output of an instrument is a density operator

Statement

For an input density operator ρ and a finite instrument (Ia)a∈Ω, define its nonselective output by ρˉ:=∑a∈ΩIa(ρ). Then ρˉ is a density operator on the output space. Moreover,

ρˉ=∑a:pa>0paρa,

where pa=tr⁡(Ia(ρ)) and ρa is the positive-probability conditional state.

Facts & Assumptions

Given: An input density operator ρ and a finite instrument with outcome set Ω.

[F1]

Finite instruments and conditional states: each branch is completely positive, pa=tr⁡(Ia(ρ)), and ρa=Ia(ρ)/pa for pa>0.

[F6]

Density operator: on a nonzero finite-dimensional complex inner-product space, a density operator is nonnegative and has trace one.

[F2]

Instrument outcome weights normalize: pa≥0 and ∑apa=1.

[F3]

A zero-probability instrument branch has no conditioned state: if pa=0, then Ia(ρ)=0.

[F4]

Completely positive maps: a completely positive branch map sends nonnegative inputs to nonnegative outputs at ancilla dimension one.

[F5]

Trace is a linear functional on Mn(F): trace preserves finite sums.

[F7]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

Proof

1.1givenF1F2F4F5F6F7

For each a, τa=Ia(ρ) is nonnegative by [F1], [F4], and [F6]–[F7]. For all x,y, self-adjointness of each τa gives ⟨ρˉx,y⟩=∑a⟨τax,y⟩=∑a⟨x,τay⟩=⟨x,ρˉy⟩, so the finite sum ρˉ is self-adjoint. For every x, its quadratic form is ⟨ρˉx,x⟩=∑a⟨τax,x⟩≥0. Hence ρˉ is nonnegative by [F7]. By [F5] and [F2], tr⁡(ρˉ)=∑atr⁡(τa)=∑apa=1. Hence ρˉ is a density operator; its trace one also shows the output space is nonzero.

2.1givenF1F3step 1.1∎

If pa>0, the instrument definition [F1] gives paρa=τa. If pa=0, [F3] gives τa=0. Summing these equalities over the finite outcome set yields ρˉ=∑a:pa>0paρa.

5 · Examples, counterexamples and false statements

None yet.

Sources