Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Diamond Norm Ancilla Dimension Bound

Statement

Let H,K be nonzero finite-dimensional complex Hilbert spaces, d=dim⁡H, and let Φ:L(H)→L(K) be linear. Then ∥Φ∥⋄=∥Φ⊗id⁡Cd∥1→1, and the latter induced norm is attained on some rank-one operator Rx,y:z↦⟨z,y⟩rootx with unit vectors x,y∈H⊗Cd.

Facts & Assumptions

Given: Nonzero finite-dimensional H,K and a linear map Φ:L(H)→L(K).

[L1]

The trace norm is the sum of singular values; SVD writes X=∑jsjRuj,vj, where Ru,v(z)=⟨z,v⟩rootu, sj≥0, and ∑jsj=∥X∥1 (Trace Norm, Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition). The QC01 trace-norm definition is present as a draft and agrees with the root first-argument-linear convention.

[L2]

Tensor maps act on elementary tensors factorwise, factor permutations reorder product bases, and tensor-map adjoints are factorwise (Tensor products of finitely many linear maps, Ordered tensor registers, their inner product, and wire permutations, Tensor maps preserve composition, identities, and adjoints). Products of operator matrix units form a basis of the full tensor-product operator space, so checking the amplification identity on those elementary operators proves it for every input (Tensor products of operator matrix units form a basis). The QC02 carriers are present as drafts; step 1.2 proves the singular-value invariance of the two separate isometric embeddings.

[L3]

Every vector x∈H⊗Z has a Schmidt decomposition with at most dim⁡H terms and orthonormal families in both factors (Schmidt decomposition). The QC03 theorem body is present as a draft; this proof uses only its finite-rank decomposition.

[L4]

The finite trace norm is a norm and satisfies the triangle inequality (Trace Norm Duality And Norm Properties). For a matrix A of fixed shape q×p, let m=min⁡(p,q). Its SVD gives ∥A∥1=∑j=1msj(A) and ∑jsj(A)2=tr⁡(A∗A)=∑i,j∣Aij∣2. Since each singular value is at most (∑jsj(A)2)1/2, ∥A∥1≤m(∑i,j∣Aij∣2)1/2. The norm triangle inequality therefore gives, for matrices A,B of the same shape, ∣∥A∥1−∥B∥1∣≤m(∑i,j∣Aij−Bij∣2)1/2. This finite-coordinate bound proves the continuity used below; the singular-value and trace-norm formulas are Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition and Trace Norm.

Proof

1.1givenL1L4F1algebra

For fixed r, let Mr be the maximum of ∥(Φ⊗id⁡r)(Ru,v)∥1 over unit vectors u,v∈H⊗Cr. Their unit spheres are compact by [F1]. In orthonormal coordinates each entry of Ru,v is a finite product of coordinates of u and conjugates of coordinates of v; applying the finite linear map Φ⊗id⁡r remains continuous, and [L4] makes the output trace norm continuous. Hence the maximum exists. By [L1], every X with ∥X∥1≤1 has an SVD X=∑jsjRuj,vj with unit uj,vj, sj≥0, and ∑jsj≤1. Linearity and the trace-norm triangle inequality give ∥(Φ⊗id⁡r)(X)∥1≤∑jsjMr≤Mr. For unit u,v, the adjoint calculation gives Ru,v∗Ru,v=Rv,v, a rank-one orthogonal projection, so its singular values are one 1 and the remaining zeros; hence ∥Ru,v∥1=1. Thus the induced norm equals Mr and is attained.

1.2givenL2L3algebra

Now take any finite ancilla Z and unit vectors x,y∈H⊗Z. By [L3], their Schmidt ranks a,b are at most min⁡(d,dim⁡Z). Let m=max⁡(a,b) and pad each Schmidt list to an orthonormal m-tuple, obtaining x′,y′∈H⊗Cm by replacing the respective ancilla Schmidt vectors by the standard basis vectors and retaining the Schmidt coefficients and H-vectors. Define Vx,Vy:Cm→Z to send that basis to the respective padded orthonormal ancilla families; thus x=(IH⊗Vx)x′ and y=(IH⊗Vy)y′. The tensor-map definition and product pairing show each map I⊗Vx and I⊗Vy is an isometry. Factor permutations are unitary because they carry an orthonormal product basis bijectively to another such basis. Thus (Φ⊗id⁡Z)(Rx,y)=(IK⊗Vx)(Φ⊗id⁡m)(Rx′,y′)(IK⊗Vy)∗. To verify the equality, expand operators in elementary tensors A⊗B: Φ⊗id⁡ sends this to Φ(A)⊗B, and the two isometries send each ancilla matrix unit Rei,ej to Rzi,wj. For isometries U,V, (UA0V∗)∗(UA0V∗)=VA0∗A0V∗. The positive eigenvalues of this operator are those of A0∗A0: an eigenvector z with positive eigenvalue maps to Vz, and any eigenvector with positive eigenvalue must lie in the range of V because the operator vanishes on its orthogonal complement. Hence left/right isometric embeddings preserve the nonzero singular values and trace norm. Embedding Cm isometrically into Cd on both sides is the same case, so the original output has trace norm at most ∥Φ⊗id⁡d∥1→1.

2.1step 1.1step 1.2given∎

By step 1.1, the induced norm for each Z is attained by a rank-one unit input, so step 1.2 gives ∥Φ⊗id⁡Z∥1→1≤∥Φ⊗id⁡d∥1→1. Taking the supremum over all finite Z gives ∥Φ∥⋄≤∥Φ⊗id⁡d∥1→1. The reverse inequality holds because r=d is one of the ancilla dimensions in the supremum. Step 1.1 at r=d supplies an attaining rank-one operator.

Depends on

Used by

Cited to discharge well-definedness by Diamond Norm.

Dependency tree · two levels

72 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