Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pending
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.

Finite unitary averaging and a decoupling second-moment bound

Statement

Let D≥2, 1≤K≤D, and ωAE⪰0 with dim⁡A=D, tr⁡ω≤1, and r=rank⁡ωE. For every δ>0 there is an explicitly specified finite probability ensemble of isometries W:CK→CD such that, for ωREW=DK(WT⊗IE)ωAE(W‾⊗IE), one has E∥ωREW−IRK⊗ωE∥1≤2Krtr⁡(ωAE2)+δ. At the same time the ensemble can be required to satisfy, for every Hermitian ZAE, E∥DK(WT⊗I)Z(W‾⊗I)∥1≤(1+δ)∥Z∥1. No Haar existence or Gaussian-law supplier, and no choice axiom, is used.

Facts & Assumptions

Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.

[F1]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely.

[F2]

Trace Norm Duality And Norm Properties: Trace Norm Duality And Norm Properties.

[F3]

Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors: Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors.

[F4]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: 'The basis-independent trace of an endomorphism of a finite-dimensional vector space'.

[F5]

Ordered tensor registers, their inner product, and wire permutations: Ordered tensor registers, their inner product, and wire permutations.

[F7]

Trace Norm Unitary Invariance And Positive Formula: the trace norm of a positive operator is its trace.

[F8]

Hermitian Trace Norm Positive Negative Parts: a Hermitian operator is the difference of positive and negative parts and its trace norm is the sum of their traces.

Proof

1.1F1F2F3F4F5F9givenalgebraconstruct

Set ζ=exp⁡(2πi/5). The three finite complex-exponential premises in [F9] show ∣ζ∣=1 and ζm=1 exactly when 5 divides m. Let G be the finite group of monomial unitaries whose nonzero entries belong to {1,ζ,ζ2,ζ3,ζ4}. Let R be the real rotation by π/4 in coordinates 1 and 2, acting identically elsewhere. Use the symmetric finite list S=G∪{R,R∗}, retaining multiplicities if any. At each walk step choose the identity with probability 1/2 and an element of this list uniformly with the remaining probability. For j=1,2, the moment operator on matrices is Tj(X)=12X+12∣S∣∑U∈SU⊗jX(U∗)⊗j. These are self-adjoint contractions for the Hilbert–Schmidt inner product, because the list is inverse-symmetric; laziness makes every eigenvalue nonnegative. Moreover ⟨X,(I−Tj)X⟩=14∣S∣∑U∈S∥X−U⊗jX(U∗)⊗j∥22. Thus their fixed spaces are exactly the simultaneous commutants of the displayed finite unitaries.

2.1F1F2F3F4F5step 1.1givenalgebraconstruct

For j=1, the independent diagonal fifth-root phases force a commuting matrix to be diagonal; permutations force all its diagonal entries equal. For j=2, a matrix coefficient from ∣i,j⟩ to ∣k,l⟩ can survive the diagonal phases only when the unordered multisets {i,j} and {k,l} agree. By the primitive-order identity established in step 1.1, each index occurs with multiplicity 0, 1 or 2; equality modulo 5 of every exponent forces equality of these integer multiplicities. Commutation with all permutations then leaves three constants: c on ∣i,i⟩, a on ∣i,j⟩⟨i,j∣ for i≠j, and b on ∣i,j⟩⟨j,i∣. Commutation with R⊗R applied to ∣1,1⟩, whose rotated vector has nonzero coefficients on both ∣1,2⟩ and ∣2,1⟩, forces c=a+b. Conversely I and the swap F commute with every tensor-square unitary. The fixed space is therefore precisely span⁡{I,F}, also when D=2.

3.1F1F2F3F4F5step 2.1givenalgebraconstruct

Finite-dimensional spectral decomposition now gives orthogonal projections P1,P2 onto these fixed spaces and a number 0≤λ<1 such that ∥TjL−Pj∥2→2≤λL,j=1,2. If the orthogonal complement is zero, take its spectral radius as zero. Every TjL is the moment of an finite distribution of length-L unitary words; the limit is only a finite-matrix spectral calculation, not an assumed Haar integral. The first projection is P1(X)=tr⁡(X)I/D. For any rank-K projection P0, invariance of trace and swap trace gives P2(P0⊗P0)=a0I+b0F,a0=K(KD−1)D(D2−1),b0=K(D−K)D(D2−1). The coefficients solve a0D2+b0D=K2 and a0D+b0D2=K.

4.1F1F2F3F4F5step 3.1givenalgebraconstruct

Choose a coordinate isometry W0 and let W=UW0, where U is a finite walk word. Complex conjugation preserves the same limiting first and second moment projections and their norm bounds, so they apply to P=W‾WT as well. The swap identity on matrix units gives the following limiting second moment, with Ω=IR/K⊗ωE: lim⁡L→∞E∥ωW−Ω∥22=D(KD−1)K(D2−1)tr⁡(ω2)+1−DKK(D2−1)tr⁡(ωE2)≤2tr⁡(ω2). In detail, the squared-state term is (D2/K2){a0tr⁡(ω2)+b0tr⁡(ωE2)}, and the limiting mean is Ω, so subtract tr⁡(ωE2)/K.

5.1F1F2F3F4F5F6step 4.1givenalgebraconstruct

The finite moment error has a quantitative bound. Put dE=dim⁡E and ε=λL. The first-moment error in each matrix unit of the compressed reference is at most ε in Hilbert–Schmidt norm; contracting it with ω shows ∥EωW−Ω∥2≤Dε∥ω∥2≤Dε. For the squared-state term, the second-moment error on P0⊗P0 has Hilbert–Schmidt norm at most Kε. In its trace pairing with FE(ω⊗ω), the partial trace over the two environment copies has Hilbert–Schmidt norm at most dE∥ω∥22≤dE (Cauchy–Schwarz for each diagonal block). Consequently that squared-state error is at most D2dEε/K. The cross term with Ω, whose Hilbert–Schmidt norm is at most 1/K, has error at most 2Dε/K. Hence, with CD=D2dE+2D, E∥ωW−Ω∥22≤2tr⁡(ω2)+CDε. Positivity implies supp⁡ω⊆A⊗supp⁡ωE: if v∈ker⁡ωE, the marginal quadratic form is a sum of nonnegative diagonal quadratic forms of ω; each is zero, and [F6] makes the corresponding product vectors kernel vectors of ω. Self-adjointness then makes the corresponding rows and columns zero. Compression acts only on A, so both ωW and Ω are supported in CK⊗supp⁡ωE; each difference therefore has rank at most Kr. Cauchy–Schwarz on singular values and Jensen give the trace-norm bound at most 2Krtr⁡(ω2)+KrCDε.

6.1F1F2F3F4F5F7F8step 5.1givenalgebraconstruct∎

Finally write a Hermitian Z as Z+−Z− using [F8]. Each compression of Z+ or Z− is positive, so its trace norm is its trace by [F7]; positivity and linearity therefore bound the trace norm of the difference by the sum of the two compressed traces. The first-moment bound ∥EP−(K/D)I∥∞≤Kε gives E∥CW(Z)∥1≤(1+Dε/K)∥Z∥1. Choose a finite L with both KrCDλL≤δ2 and DλL/K≤δ. Such an integer exists by λ<1; the least such integer is a specified choice. If r=0, the positive operator is zero and its decoupling bound is automatic. This proves both assertions with an finite ensemble and exact dimension-dependent moment control.

Depends on

Used by

Dependency tree · two levels

65 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