Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Gentle measurement bound in finite dimensions

Statement

Let ρ be a density operator on a nonzero finite-dimensional complex inner-product space H, let 0⪯Λ⪯IH, and suppose tr⁡(Λρ)≥1−u for some u∈[0,1]. Then

∥ρ−ΛρΛ∥1≤2u.

Here Λ is the unique nonnegative square root, and ∥⋅∥1 is the finite-dimensional trace norm. No normalization is applied after the operation ρ↦ΛρΛ.

Facts & Assumptions

Given: A finite-dimensional density operator ρ, an operator 0⪯Λ⪯IH, and u∈[0,1] with tr⁡(Λρ)≥1−u.

[F1]

Density operator: ρ is nonnegative with trace one.

[F2]

Purifications exist and are unitarily equivalent after padding: every finite-dimensional density operator has a unit-vector purification whose partial trace is the state.

[F3]
[F4]

A non-negative operator has a unique non-negative square root: a nonnegative endomorphism has a unique nonnegative square root.

[F5]

Trace Norm: the trace norm is the sum of singular values.

[F6]

Partial trace contracts the trace norm on Hermitian operators: partial trace does not increase trace norm on Hermitian operators.

Proof

1.1givenF1F2F3F4algebrachoose

Choose a purification ∣ψ⟩∈H⊗R of ρ using [F2]. Let v=(Λ⊗IR)∣ψ⟩, q=⟨v,v⟩=tr⁡(Λρ), and s=⟨ψ,v⟩=tr⁡(ρΛ). By [F3]–[F4], the eigenvalues λ of Λ lie in [0,1] and λ≥λ, so Λ−Λ is nonnegative. Diagonalizing ρ by [F3], s−q=tr⁡(ρ(Λ−Λ)) is a sum of nonnegative eigenvalues of ρ times nonnegative quadratic forms; hence s≥q. Also 0≤q≤1 because Λ⪯I and tr⁡ρ=1.

2.1F3F5F7step 1.1algebracases

The Hermitian operator ∣ψ⟩⟨ψ∣−∣v⟩⟨v∣ is zero off the span of ψ,v. If v is not a scalar multiple of ψ, write v=sˉ ψ+w with w⊥ψ; in the orthonormal basis ψ,w/∥w∥, its 2×2 matrix has trace 1−q and determinant −(q−∣s∣2). By [F7], q−∣s∣2≥0, so the eigenvalues have opposite signs or one is zero. Its trace norm is the square root of the characteristic discriminant, (1+q)2−4∣s∣2. If v is a scalar multiple of ψ, the same formula reduces to the one-dimensional trace norm ∣1−q∣.

3.1F2F6step 1.1step 2.1algebra∎

Since s≥q and 0≤q≤1, step 2.1 gives ∥∣ψ⟩⟨ψ∣−∣v⟩⟨v∣∥12≤(1+q)2−4q2=(1−q)(1+3q)≤4(1−q)≤4u. Taking the partial trace over R gives the claimed bound by [F6], because the partial trace of the first rank-one state is ρ and that of the second is ΛρΛ.

Depends on

Used by

Dependency tree · two levels

51 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