Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rectangular tensor matrices acting on the Bell vector

Definition
Nonadditivity_GeneralBell

by JWang226 · Oct 7, 2026 · Mathlib c5ea003 (Lean v4.30.0)

holevo-additivity-gap-v100quantum-information

For finite input and output index sets I,OI,OI,O, write d=∣I∣d=|I|d=∣I∣ and v(i,j)=1/d 1i=jv(i,j)=\sqrt{1/d}\,\mathbf1_{i=j}v(i,j)=1/d​1i=j​. For arbitrary complex matrices A,BA,BA,B with rows indexed by OOO and columns by III, the proved identity is ((A⊗B‾)v)(a,b)=1/d∑iAaiBbi‾((A\otimes\overline B)v)(a,b)=\sqrt{1/d}\sum_i A_{ai}\overline{B_{bi}}((A⊗B)v)(a,b)=1/d​∑i​Aai​Bbi​​. At d=0d=0d=0 the source uses zero for the normalization factor. This algebraic identity supplies the entry calculation for paired Bell outputs.

Definition code
import Definitions.Def_Nonadditivity_AdjointPurity
import Definitions.Def_Nonadditivity_BellOutput
import Definitions.Def_Nonadditivity_ChannelEntropy
import Definitions.Def_Nonadditivity_ChannelExtensions
import Definitions.Def_Nonadditivity_ChannelReindex
import Definitions.Def_Nonadditivity_ChannelTensorControl
import Definitions.Def_Nonadditivity_Channels
import Definitions.Def_Nonadditivity_ConditionalStates
import Definitions.Def_Nonadditivity_ConjugateChannel
import Definitions.Def_Nonadditivity_Conversion
import Definitions.Def_Nonadditivity_Entropy
import Definitions.Def_Nonadditivity_EntropyMixtures
import Definitions.Def_Nonadditivity_EntropyProducts
import Definitions.Def_Nonadditivity_PureChannelEntropy
import Definitions.Def_Nonadditivity_QuantumHolevo
import Definitions.Def_Nonadditivity_StateEnsembles
import Definitions.Def_Nonadditivity_SwitchChannel
import Definitions.Def_Nonadditivity_Weyl
import Definitions.Def_Nonadditivity_WeylTensor
import Mathlib.Analysis.CStarAlgebra.ContinuousFunctionalCalculus.Order
import Mathlib.Analysis.CStarAlgebra.Matrix
import Mathlib.Analysis.Convex.Jensen
import Mathlib.Analysis.Matrix.Order
import Mathlib.Analysis.Matrix.PosDef
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Log.NegMulLog
import Mathlib.Data.Matrix.Basic
import Mathlib.Data.Real.Sqrt
import Mathlib.LinearAlgebra.Matrix.Kronecker
import Mathlib.LinearAlgebra.Matrix.Permutation
import Mathlib.LinearAlgebra.Matrix.Reindex
import Mathlib.LinearAlgebra.Matrix.Trace
import Mathlib.LinearAlgebra.UnitaryGroup
import Mathlib.Order.ConditionallyCompleteLattice.Basic
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring

/-
Copyright (c) 2026 the Nonadditivity project contributors.
All rights reserved. See COPYRIGHT.md for licensing and attribution.
-/




/-! # Bell witnesses for arbitrary Kraus channels

This extends the Bell entropy argument beyond random-unitary complements.
All norms use the Euclidean operator norm, and all states are actual matrices.
-/

noncomputable section
set_option maxHeartbeats 800000
set_option backward.isDefEq.respectTransparency false

namespace Nonadditivity.GeneralBell

open Entropy Channels BellOutput
open scoped BigOperators ComplexOrder Matrix Kronecker Matrix.Norms.L2Operator









section BellOverlap

variable {ι ο κ : Type*} [Fintype ι] [DecidableEq ι] [Nonempty ι]
  [Fintype ο] [DecidableEq ο] [Nonempty ο] [Fintype κ]



omit [Fintype κ] [Nonempty ι] [Fintype ο] [DecidableEq ο] [Nonempty ο] in
lemma tensor_mul_bell (A B : Matrix ο ι ℂ) (a b : ο) :
    ((A ⊗ₖ B.map star) *ᵥ normalizedBellVector) (a,b) =
      (Real.sqrt (1 / (Fintype.card ι : ℝ)) : ℂ) *
        ∑ i, A a i * star (B b i) := by
  simp [Matrix.mulVec, dotProduct, Fintype.sum_prod_type,
    Matrix.map_apply, normalizedBellVector, bellVector, Finset.mul_sum,
    mul_comm, mul_left_comm]

















end BellOverlap



end Nonadditivity.GeneralBell
Source
https://github.com/JWang226/Holevo-Additivity-Gap/blob/635aa93eb3a2310b79fd5371e2ce311914ec5887/Nonadditivity/GeneralBell.lean#L122-L129
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by JWang226 · Oct 9, 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