Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 16, sufficient infinity-norm tensor-power clause

Open
QAlgorithms.Papers.Independent.Gap48.P36.coset_tensor_powers

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Use X∣k⟩=∣k+1 mod d⟩X|k\rangle=|k+1\bmod d\rangleX∣k⟩=∣k+1modd⟩, Z∣k⟩=e2πik/d∣k⟩Z|k\rangle=e^{2\pi ik/d}|k\rangleZ∣k⟩=e2πik/d∣k⟩, Wjk=XjZkW_{jk}=X^jZ^kWjk​=XjZk, and labels (j,k)∈(Z/dZ)2(j,k)\in(\mathbb Z/d\mathbb Z)^2(j,k)∈(Z/dZ)2. Write νp(Φ)=sup⁡ρ∥Φ(ρ)∥p\nu_p(\Phi)=\sup_\rho\|\Phi(\rho)\|_pνp​(Φ)=supρ​∥Φ(ρ)∥p​ and Smin⁡(Φ)=inf⁡ρS(Φ(ρ))S_{\min}(\Phi)=\inf_\rho S(\Phi(\rho))Smin​(Φ)=infρ​S(Φ(ρ)), with density inputs, Schatten norm, and von Neumann entropy. For d≥2d\ge2d≥2, arrange the probability weights of a Pauli channel bijectively into a nonincreasing row-major array bjkb_{jk}bjk​. Assume the rows are the cosets of a single ddd-element subgroup of the additive label group. For every integer r≥2r\ge2r≥2 with b0,d−1r>b00r−1b10b_{0,d-1}^r>b_{00}^{r-1}b_{10}b0,d−1r​>b00r−1​b10​,

ν∞(Φ⊗r)=ν∞(Φ)r.\nu_\infty(\Phi^{\otimes r})=\nu_\infty(\Phi)^r.ν∞​(Φ⊗r)=ν∞​(Φ)r.

The identity row need not be the largest-weight row. The case r=2r=2r=2 gives (74), and attainment is not added as a hypothesis.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P36

open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal

open QAlgorithms.Papers.Independent.Claimed50.P48

open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)

open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)

open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)

open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C D E K L A2 B2 C2 : Type*}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]

variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]

variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]

/-- Theorem 16 sufficient tensor-power clause, PDF pp.25–26.
The indexed coset premise precedes the extra strict inequality. No attainment
conclusion is assumed. The identity coset may be any row.
Correction to (73): equal weight values are replaced by indexed row images,
so tied weights retain the d-element partition specified by the rearrangement. -/
theorem coset_tensor_powers (d : ℕ) [NeZero d] (hd : 2 ≤ d)
    (a : WeylLabel d → ℝ) (ha : ProbabilityWeights a)
    (e : (Fin d × Fin d) ≃ WeylLabel d) (hs : SortedRows a e) (hc : CosetRows e)
    (r : ℕ) (hr : 2 ≤ r)
    (hstrict : a (e (0,Fin.rev (0 : Fin d))) ^ r >
      a (e (0,0)) ^ (r-1) * a (e (1,0))) :
    nu ⊤ (piSuperop (fun _ : Fin r => randomUnitary (finWeyl d) a)) =
      nu ⊤ (randomUnitary (finWeyl d) a) ^ r := by sorry

end QAlgorithms.Papers.Independent.Gap48.P36

end
Source
Properties of Conjugate Channels with Applications to Additivity and Multiplicativity, arXiv:quant-ph/0509126v3, PDF p. 25, Theorem 16, sufficient infinity-norm tensor-power clause
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let d≠0d\ne0d=0 be a natural number with d≥2d\ge2d≥2, let a:(Z/dZ)2→Ra:(\mathbb Z/d\mathbb Z)^2\to\mathbb Ra:(Z/dZ)2→R have nonnegative entries summing to 111, and let e:{0,…,d−1}2→(Z/dZ)2e:\{0,\ldots,d-1\}^2\to(\mathbb Z/d\mathbb Z)^2e:{0,…,d−1}2→(Z/dZ)2 be a bijection satisfying id+j≤i′d+j′⇒ae(i′,j′)≤ae(i,j)id+j\le i'd+j'\Rightarrow a_{e(i',j')}\le a_{e(i,j)}id+j≤i′d+j′⇒ae(i′,j′)​≤ae(i,j)​. Suppose there is an additive subgroup H≤(Z/dZ)2H\le(\mathbb Z/d\mathbb Z)^2H≤(Z/dZ)2 such that each row {e(i,j):0≤j<d}\{e(i,j):0\le j<d\}{e(i,j):0≤j<d} equals a coset {q:q−gi∈H}\{q:q-g_i\in H\}{q:q−gi​∈H} for some gig_igi​. Define W(n,m)=Sval⁡(n)Zval⁡(m)W_{(n,m)}=S^{\operatorname{val}(n)}Z^{\operatorname{val}(m)}W(n,m)​=Sval(n)Zval(m), where Suv=1S_{uv}=1Suv​=1 exactly when u=v+1u=v+1u=v+1 modulo ddd, and Zuu=exp⁡(2πi val⁡(u)/d)Z_{uu}=\exp(2\pi i\,\operatorname{val}(u)/d)Zuu​=exp(2πival(u)/d), and define N(X)=∑kakWkXWk†\mathcal N(X)=\sum_k a_kW_kXW_k^\daggerN(X)=∑k​ak​Wk​XWk†​. Let r≥2r\ge2r≥2 be a natural number and assume

ae(0,d−1)r>ae(0,0)r−1ae(1,0).a_{e(0,d-1)}^r>a_{e(0,0)}^{r-1}a_{e(1,0)}.ae(0,d−1)r​>ae(0,0)r−1​ae(1,0)​.

Then ν∞(N⊗r)=ν∞(N)r\nu_\infty(\mathcal N^{\otimes r})=\nu_\infty(\mathcal N)^rν∞​(N⊗r)=ν∞​(N)r, where ν∞(Φ)=sup⁡ρ≥0, tr⁡ρ=1∥Φ(ρ)∥op\nu_\infty(\Phi)=\sup_{\rho\ge0,\ \operatorname{tr}\rho=1}\|\Phi(\rho)\|_{\mathrm{op}}ν∞​(Φ)=supρ≥0, trρ=1​∥Φ(ρ)∥op​. Here the tensor-power map acts on matrices indexed by rrr-tuples and is defined entrywise by

(N⊗r(X))y,y′=∑x∑x′Xx,x′∏i=0r−1(N(Exi,xi′))yi,yi′,(\mathcal N^{\otimes r}(X))_{y,y'} =\sum_x\sum_{x'}X_{x,x'}\prod_{i=0}^{r-1} \bigl(\mathcal N(E_{x_i,x'_i})\bigr)_{y_i,y'_i},(N⊗r(X))y,y′​=x∑​x′∑​Xx,x′​i=0∏r−1​(N(Exi​,xi′​​))yi​,yi′​​,

with EabE_{ab}Eab​ the matrix unit. No primality assumption on ddd is imposed.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me