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.

Singular Pair No Broadcasting

Statement

For any two density operators ρ0,ρ1 on a nonzero finite-dimensional H, one channel broadcasts both if and only if [ρ0,ρ1]=0.

Facts & Assumptions

Given: States ρ0,ρ1 on H and, for necessity, a common channel B broadcasting both.

[L1]

A broadcaster is one channel whose two partial-trace marginals equal each input; density operators are nonnegative and trace one (Broadcasting Family, Finite-dimensional quantum channel, Density operator, Partial trace over a finite tensor factor).

[L2]

A faithful state σ on a finite-dimensional support dominates each positive X on that support up to a finite scalar (Faithful State Dominates Positive Operator).

[L3]

If both marginals of a positive joint operator are supported on S, then the joint operator is supported on S⊗S (Positive Marginals Imply Joint Support).

[L4]

Complete positivity means every finite amplification preserves nonnegativity; composing those amplifications with isometric inclusions and orthogonal compressions preserves nonnegativity. Positive square roots exist (Completely positive maps, A non-negative operator has a unique non-negative square root, 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).

[L5]

The full-rank pair theorem gives commutation for broadcastable faithful states on any nonzero finite-dimensional support (Full Rank Pair No Broadcasting).

[F2]

A finite Kraus sum is completely positive and trace-preserving exactly when ∑jKj∗Kj=I; the rank-one operator ∣x⟩⟨y∣ acts as z↦⟨z,y⟩x (A finite Kraus sum is completely positive, Trace preservation is Kraus normalization, Dirac Notation Conversion).

[F3]

Every self-adjoint finite-dimensional operator is a difference of its nonnegative positive and negative spectral parts; every operator is the sum of a self-adjoint operator and i times a self-adjoint operator (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).

Proof

1.1givenL1L4algebra

Let S=supp⁡(ρ0)+supp⁡(ρ1), the linear span of the two supports. It is nonzero. Set σ=(ρ0+ρ1)/2. For x∈S, ⟨(ρ0+ρ1)x,x⟩=0 implies both nonnegative terms vanish, hence x lies in both kernels and is orthogonal to S, so x=0. Therefore σ is positive definite on S; it has trace one and support S. By linearity, B(σ) has both marginals equal to σ.

2.1givenL2L3L4step 1.1algebra

For any nonnegative X on S, faithfulness in step 1.1 and [L2] give 0≤X≤cσ for some finite c. Positivity of B yields 0≤B(X)≤cB(σ). By [L3], B(σ) is supported on S⊗S. If 0≤A≤C and x∈ker⁡C, then 0≤⟨Ax,x⟩≤⟨Cx,x⟩=0. Thus ∥A1/2x∥2=0, so Ax=0 and ker⁡C⊆ker⁡A; taking orthogonal complements gives supp⁡A⊆supp⁡C. Applying this to A=B(X) shows B(X) is supported on S⊗S.

3.1givenL1L4L5F3step 1.1step 2.1algebra

Nonnegative operators span L(S) over C by [F3]. Therefore step 2.1 shows B(X) is supported on S⊗S for every X∈L(S). Define B~:L(S)→L(S⊗S) by restricting the input and identifying each supported output with its compression to S⊗S. For each finite amplification, the input inclusion and output compression preserve nonnegativity, so B~ is completely positive by [L4]. In an orthonormal basis of H extending one of S, the embedded input has X as its S-block and zero elsewhere, so its trace is tr⁡X; output compression leaves the supported B(X) unchanged. Thus B~ is trace-preserving and a channel by [L1]. It broadcasts the restrictions of ρ0,ρ1 on S. For fixed 0<ε<1, the states τi=(1−ε)ρi+εσ are faithful on S and are broadcast by B~. By [L5], [τ0,τ1]=0. Direct expansion using σ=(ρ0+ρ1)/2 gives [τ0,τ1]=(1−ε)[ρ0,ρ1]; since 1−ε≠0, the original states commute.

4.1givenL1F1F2step 3.1algebrachoose∎

Suppose [ρ0,ρ1]=0. Choose an orthonormal eigenbasis of ρ0 by [F1] and group it into its finitely many eigenspaces Sλ. For x∈Sλ, ρ0(ρ1x)=ρ1(ρ0x)=λρ1x, so Sλ is invariant under ρ1. The restriction of ρ1 to Sλ is self-adjoint, since ⟨ρ1x,y⟩=⟨x,ρ1y⟩ for x,y∈Sλ. Apply [F1] on each Sλ and combine these orthonormal eigenbases to obtain a common orthonormal basis (ej). Write ρi=∑jλi,j∣ej⟩⟨ej∣. The Kraus operators Kj=∣ej⊗ej⟩⟨ej∣ obey ∑jKj∗Kj=I. Their map B(X)=∑jKjXKj∗ is a channel by [F2]. It sends ρi to ∑jλi,j∣ej⊗ej⟩⟨ej⊗ej∣, whose two marginals are ρi. Thus the pair is broadcastable.

Depends on

Used by

Dependency tree · two levels

64 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