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.

The finite-dimensional erasure map is a quantum channel

Statement

For every integer d≥1 and ϵ∈[0,1], the map Ed,ϵ defined in Finite-dimensional quantum erasure channel is a finite-dimensional quantum channel.

Facts & Assumptions

Given: A d-dimensional complex inner-product space A, d≥1, and ϵ∈[0,1].

[F1]

Finite-dimensional quantum erasure channel: B=A⊕Ce with e⊥A, and Ed,ϵ(X)=(1−ϵ)JXJ∗+ϵtr⁡(X)∣e⟩⟨e∣.

[F2]

An isometry followed by partial trace is a channel: if V:A→B⊗E is a finite-dimensional linear isometry, then X↦Tr⁡E(VXV∗) is a quantum channel.

[F3]

Partial trace over a finite tensor factor and Ordered tensor registers, their inner product, and wire permutations: partial trace sums matching diagonal environment coordinates in the ordered product basis.

Proof

1.1givenF1constructalgebra

Let E=A⊕CeE with eE a unit vector orthogonal to the data summand, and write JB,JE for the data inclusions. Define Vϵx:=1−ϵ JBx⊗eE+ϵ e⊗JEx. The summands lie in orthogonal subspaces of B⊗E, so for all x,y∈A, ⟨Vϵx,Vϵy⟩=(1−ϵ)⟨x,y⟩+ϵ⟨x,y⟩=⟨x,y⟩. Thus Vϵ is a linear isometry, including at ϵ=0 and ϵ=1.

2.1F1F3step 1.1algebra

Expanding VϵXVϵ∗ gives two diagonal terms and two cross terms. The first diagonal term is (1−ϵ)JBXJB∗⊗∣eE⟩⟨eE∣, whose partial trace over E is (1−ϵ)JBXJB∗. The second is ϵ∣e⟩⟨e∣⊗JEXJE∗, whose partial trace is ϵtr⁡(X)∣e⟩⟨e∣. Each cross term has a partial-trace coefficient equal to the inner product of the orthogonal erasure flag with the data subspace, hence vanishes. Therefore Tr⁡E(VϵXVϵ∗)=Ed,ϵ(X) for every X.

3.1F2step 1.1step 2.1∎

By step 1.1, Vϵ is an isometry; [F2] says its partial-trace map is completely positive and trace-preserving on the full operator space. Step 2.1 identifies that map with Ed,ϵ, proving the Statement.

Depends on

Used by

Cited to discharge well-definedness by Finite-dimensional quantum erasure channel.

Dependency tree · two levels

36 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