Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge 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.

Standalone Global Phase Leaves Pure-State POVM Probabilities Unchanged

Statement

Let H be a nonzero finite-dimensional complex inner-product space with the root pairing linear in the first argument. For nonzero x∈H, put u=x/∥x∥. If λ∈C has ∣λ∣=1, then u and λu determine the same rank-one density operator. Consequently, for every finite POVM (Ea)a∈Ω on H, each defined outcome probability satisfies

tr⁡(∣u⟩⟨u∣Ea)=tr⁡(∣λu⟩⟨λu∣Ea).

The unnormalized vector x itself gives tr⁡(∣x⟩⟨x∣)=∥x∥2 and is not a density operator when ∥x∥≠1.

Facts & Assumptions

Given: The finite-dimensional space and nonzero x in the Statement, a scalar λ with ∣λ∣=1, and a finite POVM (Ea)a∈Ω.

[F1]

Real and complex inner-product spaces and their induced length: the root pairing is linear in its first argument, conjugate-linear in its second, and positive definite.

[F3]

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

[L1]

Density operator: a density operator is a non-negative endomorphism of trace one on a nonzero finite-dimensional space.

[L2]

Finite POVMs and their outcome law defines a finite POVM and the outcome weight pa=tr⁡(ρEa) for a density operator. Its current draft definition body was read.

[L3]

Dirac Notation Conversion defines ∣v⟩⟨w∣z=⟨z,w⟩rootv. Its current draft definition body was read.

[L4]

A unit-vector outer product is a density operator proves directly that the outer product of every unit vector is a density operator, including its trace-one verification by Parseval.

[L5]

POVM outcome weights are probabilities states nonnegativity and normalization of finite POVM weights. Its current draft proof was read; its density-definition dependency is present in its current frontmatter.

Proof

1.1givenF1F2algebra

Positive definiteness gives ∥x∥>0, so u is defined. By [F1] and [F2], ∥u∥2=⟨x/∥x∥,x/∥x∥⟩=⟨x,x⟩/∥x∥2=1. Again using linearity in the first argument and conjugate-linearity in the second, ∥λu∥2=⟨λu,λu⟩=∣λ∣2⟨u,u⟩=1. Taking nonnegative square roots gives both norms equal to one.

1.2givenF1L3algebra

For every z∈H, the root-first conversion [L3] gives ∣λu⟩⟨λu∣z=⟨z,λu⟩rootλu=λ‾λ⟨z,u⟩rootu=∣u⟩⟨u∣z. Hence the two rank-one operators are equal.

2.1step 1.2L1L2L4L5algebra

By [L4], the common operator is a density operator, so the outcome law [L2] defines its weight for each effect Ea. Since the density operator is identical for u and λu, those weights agree; [L5] proves the finite family of weights is a probability distribution.

3.1givenF1F3L1L3L4algebra∎

Since x=∥x∥u with ∥x∥ a nonnegative real, [F1] and [L3] give ∣x⟩⟨x∣=∥x∥2∣u⟩⟨u∣. In any basis, its matrix is therefore ∥x∥2 times the matrix of ∣u⟩⟨u∣; summing the diagonal entries in that basis as in [F3] gives tr⁡(∣x⟩⟨x∣)=∥x∥2tr⁡(∣u⟩⟨u∣)=∥x∥2 by [L4]. If ∥x∥≠1, it is not trace one and hence is not a density operator by [L1].

Depends on

Used by

Dependency tree · two levels

32 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