Alphabeta Math
TheoremStatement: 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.

Full Rank Pair No Broadcasting

Statement

Let H be a nonzero finite-dimensional complex Hilbert space and let ρ0,ρ1 be positive-definite density operators on H. One channel B:L(H)→L(H⊗H) broadcasts both states if and only if ρ0ρ1=ρ1ρ0.

Facts & Assumptions

Given: Positive-definite density operators ρ0,ρ1 and a single channel B whose two output marginals are each the corresponding input.

[F1]

A density operator is nonnegative and has trace one (Density operator).

[L1]

Broadcasting means both partial traces of each output equal that input (Broadcasting Family, Partial trace over a finite tensor factor). The partial-trace trace-pairing identity gives the marginal calculations below, and partial trace is a channel (The partial trace is characterized by the trace pairing and is basis-independent, An isometry followed by partial trace is a channel). The coordinate definition also gives Tr⁡1(X(I⊗G))=(Tr⁡1X)G, Tr⁡2(X(G⊗I))=(Tr⁡2X)G, and Tr⁡i(X∗)=(Tr⁡iX)∗: each identity follows by expanding the repeated traced index in the defining finite sum.

[L2]

Fidelity is the minimum classical measurement overlap, attained by a PVM for faithful input states (Fidelity classical measurement minimum). Its full proof is drafted in this batch.

[L3]

Fidelity is monotone under channels (Fidelity Data Processing). The QC06 proof remains draft.

[L4]

Square endomorphism polar decomposition gives a unitary U with UA=(A∗A)1/2; the trace-norm spectral formula then gives ∣tr⁡(UA)∣=∥A∥1. Positive square roots are unique (Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible, Trace Norm Spectral Formula, Trace Norm Duality And Norm Properties, A non-negative operator has a unique non-negative square root).

[L5]

The Hilbert–Schmidt pairing on matrices is an inner product and satisfies Cauchy–Schwarz with equality exactly for linearly dependent pairs (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs); in coordinates this is the ordinary finite inner-product theorem.

[L6]

Self-adjoint finite-dimensional operators have orthonormal eigenbases (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely, Every finite-dimensional real or complex inner product space has an orthonormal basis). A finite Kraus family defines a completely positive map, and its normalization ∑jKj∗Kj=I makes it trace-preserving (A finite Kraus sum is completely positive, Trace preservation is Kraus normalization).

[L7]

Under the Dirac convention, ∣x⟩⟨y∣ maps z to ⟨z,y⟩x; its adjoint is ∣y⟩⟨x∣ by the defining adjoint identity (Dirac Notation Conversion, The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V).

Proof

1.1givenF1L2algebra

Since ρ0,ρ1 are faithful, the measurement-minimum theorem [L2] supplies a rank-one PVM (Eb) whose classical overlap is F(ρ0,ρ1). Every ps,b=tr⁡(ρsEb) is positive: if Eb=∣b⟩⟨b∣ and ρs is positive definite, then ps,b=⟨ρsb,b⟩>0.

2.1givenL1L2L3step 1.1algebra

Put ρ~s=B(ρs). Data processing under B gives F(ρ0,ρ1)≤F(ρ~0,ρ~1). Data processing under either partial trace, whose outputs are ρs by [L1], gives the reverse inequality. Hence equality holds. Measuring Eb⊗I on the first output factor, or I⊗Eb on the second, produces the same probabilities as measuring Eb on the input; each classical overlap is F(ρ~0,ρ~1) and so is optimal by [L2].

3.1givenL2L4L5step 1.1step 2.1algebra

For any two states R,S and a finite POVM (Qb) attaining the minimum overlap, choose a polar unitary U with URS=SRS. For each outcome let Ab=URQb1/2 and Cb=SQb1/2. The Hilbert–Schmidt norms satisfy ∥Ab∥22=tr⁡(RQb) and ∥Cb∥22=tr⁡(SQb), while their inner product is tr⁡(URQbS). Thus Cauchy–Schwarz and the triangle inequality give ∑btr⁡(RQb)tr⁡(SQb)≥∑b∣tr⁡(UR QbS)∣≥∣tr⁡(URS)∣=F(R,S). Equality of the endpoints forces equality term by term in Cauchy–Schwarz and common nonnegative phase in the triangle inequality. For each outcome with tr⁡(SQb)>0, this gives a scalar γb≥0 with UR Qb1/2=γbS Qb1/2. Applying this to the two optimal PVMs of step 2.1, there are unitaries U,V and nonnegative αb,βb such that Uρ~0(I⊗Eb)=αbρ~1(I⊗Eb),Vρ~0(Eb⊗I)=βbρ~1(Eb⊗I), and both U,V satisfy Uρ~0ρ~1=Vρ~0ρ~1=ρ~1ρ~0ρ~1. For these two PVMs every outcome probability is positive by step 1.1 and the broadcaster marginals, so neither Cauchy–Schwarz vector is zero; dependence therefore gives the displayed scalar equations.

4.1givenL1step 3.1algebra

Set G=∑bαbEb and J=∑bβbEb. Summing the equations in step 3.1 gives Uρ~0=ρ~1(I⊗G) and Vρ~0=ρ~1(J⊗I). Multiply the first by ρ~0U∗ on the left and trace out the first factor; multiply the second by ρ~0V∗ and trace out the second. The marginal identities yield ρ0=AG=CJ, where A=Tr⁡1(ρ~0U∗ρ~1) and C=Tr⁡2(ρ~0V∗ρ~1). Since ρ0 is invertible, both G and J are invertible.

5.1givenL1L4step 4.1algebra

Left-multiply the two summed equations of step 4.1 by ρ~1 and trace out the first factor in the first equation and the second in the second. The partial-trace adjoint identity and the local-factor multiplication rule in [L1] give A∗=ρ1G and C∗=ρ1J. Taking adjoints in ρ0=AG=CJ gives ρ0=Gρ1G=Jρ1J. For either positive operator G or J, conjugating this equation by ρ11/2 shows (ρ11/2Gρ11/2)2=ρ11/2ρ0ρ11/2, and likewise for J. Uniqueness of the positive square root [L4] therefore yields G=J.

5.2givenL4step 4.1algebra

The operators G=J=∑bαbEb are positive and invertible by step 4.1, so write G∣b⟩=gb∣b⟩ with each gb>0. Substituting G=J into step 4.1 and eliminating ρ~1 gives V∗Uρ~0=ρ~0(G−1⊗G). For w=ρ~0(∣b⟩⊗∣c⟩)≠0, this equation says the unitary V∗U has eigenvalue gc/gb>0 on w, whose modulus must be one. Hence gb=gc; when they differ, w=0.

6.1givenstep 5.1step 5.2algebra

For any b,b′ with gb≠gb′ and any c, either gc≠gb, in which case step 5.2 gives ρ~0∣b,c⟩=0, or gc=gb, in which case it gives ρ~0∣b′,c⟩=0. In the first case the column of ρ~0 vanishes; in the second its corresponding row vanishes because ρ~0 is self-adjoint. Therefore every summand in ⟨b′∣ρ0∣b⟩=∑c⟨b′,c∣ρ~0∣b,c⟩ is zero. Thus [G,ρ0]=0. Since ρ0=Gρ1G from step 5.1, ρ1=G−1ρ0G−1 also commutes with ρ0.

7.1givenL1L6L7algebra∎

Conversely, diagonalize ρ0 in an orthonormal basis by [L6]. Commutation makes each eigenspace invariant under ρ1; the restriction of the self-adjoint ρ1 to each eigenspace has an orthonormal eigenbasis by [L6]. Combining them gives a common orthonormal eigenbasis (∣j⟩). Define Kj=∣j,j⟩⟨j∣ and B(X)=∑jKjXKj∗. By [L7], Kj∗Kj=∣j⟩⟨j∣, so the basis identity gives ∑jKj∗Kj=I; [L6] therefore makes B completely positive and trace-preserving, hence a channel. For either diagonal state ρs=∑jλs,j∣j⟩⟨j∣, B(ρs)=∑jλs,j∣j,j⟩⟨j,j∣, whose two marginals are both ρs. This proves the reverse direction.

Depends on

Used by

Dependency tree · two levels

80 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