Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by Finite POVM outcome kernel.

Dependency tree · two levels

27 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources