Theorem 16, sufficient infinity-norm tensor-power clause
OpenQAlgorithms.Papers.Independent.Gap48.P36.coset_tensor_powersAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Use , , , and labels . Write and , with density inputs, Schatten norm, and von Neumann entropy. For , arrange the probability weights of a Pauli channel bijectively into a nonincreasing row-major array . Assume the rows are the cosets of a single -element subgroup of the additive label group. For every integer with ,
The identity row need not be the largest-weight row. The case gives (74), and attainment is not added as a hypothesis.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a natural number with , let have nonnegative entries summing to , and let be a bijection satisfying . Suppose there is an additive subgroup such that each row equals a coset for some . Define , where exactly when modulo , and , and define . Let be a natural number and assume
Then , where . Here the tensor-power map acts on matrices indexed by -tuples and is defined entrywise by
with the matrix unit. No primality assumption on is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.