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.

Fidelity Data Processing

Statement

For every finite-dimensional channel Φ:L(H)→L(K) and states ρ,σ∈D(H), F(ρ,σ)≤F(Φ(ρ),Φ(σ)). No general equality characterization is asserted.

Facts & Assumptions

Given: Nonzero finite-dimensional spaces H,K, a channel Φ, and density operators ρ,σ on H.

[L1]

An isometric Stinespring dilation writes Φ(X)=Tr⁡E(VXV∗) for an isometry V:H→K⊗E (Finite-dimensional quantum channel, Every finite-dimensional channel has a finite isometric dilation). The QC05 definition and theorem bodies are present as drafts.

[L2]

For every auxiliary space R with dim⁡R≥dim⁡H, the maximum overlap of purifications of the inputs on H⊗R is F(ρ,σ) and is attained (Fidelity Purification Characterization). The QC06 proof is a draft, not accepted.

[F1]
[F2]

Partial trace is characterized by its trace-pairing identity (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent). The successive-trace rule follows by pairing both sides with any endomorphism T on the retained factor: each pairing is tr⁡(Z(T⊗I⊗I)). For the specific local-isometry use below, write x=∑i,axiaei⊗ra and Vei=∑b,cVbc,ikb⊗fc. The (b,b′) entry after tracing E⊗R from (V⊗IR)∣x⟩⟨x∣(V∗⊗IR) is ∑c,a,i,i′Vbc,ixiaVb′c,i′‾xi′a‾; tracing R first and then E from V(Tr⁡R∣x⟩⟨x∣)V∗ gives the same finite sum. Thus the partial-trace identity in step 1.1 follows directly in the ordered product coordinates.

Proof

1.1givenL1L2F1F2algebra

Choose R with dim⁡R≥max⁡(dim⁡H,dim⁡K) and purifications x,y∈H⊗R attaining F(ρ,σ) by [L2]. The Stinespring environment E is nonzero because V:H→K⊗E is an isometry and H≠0, so dim⁡(E⊗R)≥dim⁡K. The tensor map V⊗IR and the factor permutation identify their images with vectors in K⊗(E⊗R) by [F1]. Their norms are one because V is an isometry. In product coordinates, the partial-trace characterization [F2] gives Tr⁡E⊗R((V⊗IR)∣x⟩⟨x∣(V∗⊗IR))=Tr⁡E(V(Tr⁡R∣x⟩⟨x∣)V∗)=Φ(ρ), and the same calculation gives output marginal Φ(σ) for y. Their inner product is ⟨x,y⟩ because V∗V=I. Thus they are purifications of the output states with the same overlap.

2.1step 1.1L2∎

The maximum-overlap formula [L2] for the output states is at least the overlap of the particular output purifications in step 1.1. That overlap has absolute value F(ρ,σ), so F(Φ(ρ),Φ(σ))≥F(ρ,σ), as required.

Depends on

Used by

Dependency tree · two levels

47 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