Theorem 13
OpenQAlgorithms.Papers.Independent.Gap20.P19.weylMultiplierObstructionAll Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.
For an integer , let with labels in , forward cyclic shift and positive-phase clock . Let , , and . These are probabilities.
Assume . Define . If some nonidentity supported label has , then
The computed normalized coefficient supplies a concrete obstruction, without a prime-dimension restriction.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P19
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker
open Filter Topology
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
maximumCoherentInformation dilationPower)
open QAlgorithms.Papers.Independent.Claimed50.P48
(MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)
open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)
open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)
open QAlgorithms.Papers.Independent.Information100.P69 (choi)
open QAlgorithms.Papers.Independent.Information100.P50 (matrixRange)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E F R K A2 B2 E2 : Type}
variable [Fintype A] [DecidableEq A] [Nonempty A]
variable [Fintype B] [DecidableEq B] [Nonempty B]
variable [Fintype C] [DecidableEq C] [Nonempty C]
variable [Fintype E] [DecidableEq E] [Nonempty E]
variable [Fintype F] [DecidableEq F] [Nonempty F]
variable [Fintype R] [DecidableEq R] [Nonempty R]
variable [Fintype K] [DecidableEq K]
variable [Fintype A2] [DecidableEq A2] [Nonempty A2]
variable [Fintype B2] [DecidableEq B2] [Nonempty B2]
variable [Fintype E2] [DecidableEq E2] [Nonempty E2]
/-- Theorem 13, PDF p.21: arbitrary positive d, with identity in the support.
The multiplier is computed with the missing 1/d normalization restored. -/
theorem weylMultiplierObstruction (d : ℕ) [NeZero d]
(a : WeylLabel d → ℝ) (ha : WeylProbabilities a) (hidentity : a (0,0) ≠ 0)
(m : WeylLabel d) (hm : m ≠ (0,0)) (ham : a m ≠ 0)
(hlo : 0 < ‖weylMultiplier d a m‖) (hhi : ‖weylMultiplier d a m‖ < 1) :
¬ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (weylChannel d a) ∧ IsDegradable witness) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonzero natural number, let satisfy for every label and , and assume . On the standard basis indexed by , let , let , and define , using representatives in ; these matrices are identified with matrices indexed by . Define
For every label with and , there do not exist a natural number , an isometry , and a finite Kraus channel from the receiver to the environment such that and for every matrix . Here , partial traces sum matching discarded indices, and with . The hypotheses exclude multiplier magnitudes and ; when , no nonzero label exists.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.