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.

Preserving the logical marginal forces a gauge-only channel

Statement

Let HG,HL be nonzero finite-dimensional complex inner-product spaces in the fixed order HG⊗HL. Let Φ:B(HG⊗HL)→B(HG⊗HL) be a channel with a finite Kraus family K1,…,Km. If Tr⁡G(Φ(ρ))=Tr⁡G(ρ) for every positive semidefinite trace-one operator ρ on HG⊗HL, then there are operators Aj:HG→HG such that Kj=Aj⊗IHL for every j and ∑jAj∗Aj=IHG. Consequently Φ=TG⊗id⁡B(HL) for the channel TG(X)=∑jAjXAj∗, and the same marginal identity holds after tensoring with the identity on any finite reference space. Conversely, any finite family Aj with ∑jAj∗Aj=IHG defines a channel with this marginal-preserving property.

Also let J:HG⊗HL→HP be an isometric encoding and let D:B(HO)→B(HG⊗HL) be a channel. For every unit g0∈HG, the gauge-reset map X⟼J(Pg0⊗Tr⁡G(D(X)))J∗, where Pg0x=⟨x,g0⟩g0, is a channel into the encoded subspace im⁡J.

Facts & Assumptions

Given: The finite-dimensional spaces and channel in the first part of the Statement; and, for its final assertion, the isometry J and decoded channel D there specified.

[F1]

Partial trace over the first tensor factor: in the order HG⊗HQ, the matrix entries are (Tr⁡GX)αβ=∑sX(s,α),(s,β), and the same formula applies with HQ=HL⊗HR.

[F3]

Every finite-dimensional real or complex inner product space has an orthonormal basis: finite-dimensional inner-product spaces have orthonormal bases. For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥: a vector can be extended to an orthonormal basis by adjoining an orthonormal basis of its orthogonal complement.

[F4]

Finite Kraus representation and Finite-dimensional quantum channel: a finite Kraus family represents its channel on the full operator space, and a channel is completely positive and trace-preserving.

[F5]

Trace preservation is Kraus normalization: a finite Kraus family is trace-preserving exactly when its adjoint-square sum is the identity.

[F6]

An isometric quantum encoding gives an orthogonal code projector: J∗J=I for an isometric encoding.

[F7]

Tensor products of finitely many linear maps and Tensor maps preserve composition, identities, and adjoints: tensor maps act on elementary tensors and (A⊗B)∗=A∗⊗B∗.

[F8]

The product basis is orthonormal and tensor dimensions multiply: elementary product tensors form a basis and span the finite tensor product.

[F9]

A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.

[F10]

Kraus and Choi characterizations of complete positivity: every finite-dimensional completely positive map has a finite Kraus representation.

[F11]

Product operator matrix units form a basis: for finite-dimensional factors with ordered bases, tensor products of operator matrix units form a basis of the endomorphisms of their product space. Finite iterated tensor products represent multilinear maps independently of parenthesization supplies the canonical reassociation for the ordered three-factor register.

Proof

1.1givenF1F2F3F4choosealgebra

Fix unit vectors g∈HG and ℓ∈HL, and write Pℓx=⟨x,ℓ⟩ℓ. Extend ℓ to an orthonormal basis (e0,e1,…,eq−1) of HL with e0=ℓ, using [F3]. For each j, expand Kj(g⊗ℓ)=∑k<qyjk⊗ek. Apply the marginal hypothesis to the rank-one density operator Pg⊗ℓ. By [F4] the output is ∑jPKj(g⊗ℓ). In each diagonal entry k,k, the partial-trace formula [F1] sums the squared coordinates of yjk over an orthonormal basis of HG, so that entry is ∑j∥yjk∥2. The required marginal is Pℓ, whose kth diagonal entry is zero for every k>0. Since each squared norm is nonnegative, yjk=0 for all j and k>0. Hence Kj(g⊗ℓ)=ηj,g,ℓ⊗ℓ for some ηj,g,ℓ∈HG.

2.1step 1.1algebra

Fix a unit g. If unit vectors ℓ1,ℓ2 are linearly independent, then ℓ1+ℓ2≠0; normalize their sum and apply step 1.1 to ℓ1,ℓ2 and (ℓ1+ℓ2)/∥ℓ1+ℓ2∥. Linearity of Kj gives ηj,g,ℓ1⊗ℓ1+ηj,g,ℓ2⊗ℓ2=ηj,g,ℓ+⊗(ℓ1+ℓ2). Extend ℓ1,ℓ2 to a basis and apply its two corresponding coordinate functionals to the second tensor factor; this gives ηj,g,ℓ1=ηj,g,ℓ+=ηj,g,ℓ2. If ℓ2=cℓ1 for a unit scalar c, linearity and c≠0 give the same equality directly. Thus ηj,g,ℓ is independent of the unit vector ℓ.

3.1step 1.1step 2.1F8constructchoose

Fix a unit ℓ0∈HL. For unit g, step 1.1 shows Kj(g⊗ℓ0) lies in HG⊗span⁡{ℓ0}. Scaling gives the same for every g. Define Ajg by Kj(g⊗ℓ0)=Ajg⊗ℓ0; it is unique because u↦u⊗ℓ0 is injective. The linearity of Kj makes Aj linear. By step 2.1, Kj(g⊗ℓ)=Ajg⊗ℓ for all simple tensors. Since simple tensors span by [F8], Kj=Aj⊗IHL.

4.1F5F7step 3.1algebrachoose

Trace preservation [F5] and step 3.1 give (∑jAj∗Aj)⊗IHL=IHG⊗IHL, using the tensor-adjoint rule [F7]. Apply both sides to g⊗ℓ0 for arbitrary g and a fixed unit ℓ0. Injectivity of u↦u⊗ℓ0 yields ∑jAj∗Aj=IHG.

5.1step 3.1step 4.1F5F9F11algebra

Define TG(X)=∑jAjXAj∗. Its finite Kraus form makes it completely positive by [F9], and the normalization from step 4.1 makes it trace-preserving by [F5]. Thus it is a channel. On a simple operator tensor XG⊗XL, step 3.1 gives Φ(XG⊗XL)=∑j(AjXGAj∗)⊗XL=TG(XG)⊗XL. By [F11], tensor products of operator matrix units form a basis of the full operator space, so linearity gives Φ=TG⊗id⁡B(HL).

5.2F1F3F8F11step 4.1algebrachoose

For a finite reference space HR, choose orthonormal bases of HG,HL,HR by [F3]; [F8] gives the product basis of HL⊗HR. Use the canonical reassociation in [F11] and the operator matrix-unit basis there to write any operator ρ on (HG⊗HL)⊗HR as ρ=∑s,t∣gs⟩⟨gt∣⊗ρst, with ρst∈B(HL⊗HR). Write Ajgs=∑rars(j)gr. By the first-factor partial-trace formula [F1], the coefficient of ρst after applying Φ⊗id⁡B(HR) and tracing out G is ∑j,rars(j)art(j)‾=∑j(Aj∗Aj)ts=δts. Therefore the output marginal is ∑sρss=(Tr⁡G⊗id⁡B(HR))(ρ). The calculation applies to every operator, hence to every density operator and every finite reference.

6.1givenF1F2F5F6F7F8F9F10constructchoose∎

For the gauge-reset assertion, choose an orthonormal basis (gs) of HG and define Cs:HG⊗HL→HL by Cs(g⊗ℓ)=⟨g,gs⟩ℓ. Its adjoint is Cs∗ℓ=gs⊗ℓ, so ∑sCs∗Cs(g⊗ℓ)=∑s⟨g,gs⟩gs⊗ℓ=g⊗ℓ; simple tensors span, hence ∑sCs∗Cs=IHG⊗HL. On the product basis, the matrix entries of ∑sCsYCs∗ are exactly the first-factor contraction entries in [F1], hence Tr⁡G(Y)=∑sCsYCs∗. Let Jg0:HL→HP be Jg0ℓ=J(g0⊗ℓ). It is an isometry by [F6]. Choose finite Kraus operators Dr for D using [F10]. Since Jg0YJg0∗=J(Pg0⊗Y)J∗, the gauge-reset map equals X↦∑s,rJg0CsDrXDr∗Cs∗Jg0∗, so it has Kraus operators Jg0CsDr, and ∑s,r(Jg0CsDr)∗(Jg0CsDr)=∑rDr∗(∑sCs∗Jg0∗Jg0Cs)Dr=∑rDr∗Dr=IHO. Thus the map is completely positive by [F9] and trace-preserving by [F5], so it is a channel. Its range is contained in im⁡J by construction.

Depends on

Used by

Dependency tree · two levels

66 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