Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coordinate identifications for tensor branches

Definition
Nonadditivity_FreeBridge

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

holevo-additivity-gap-v100matrix-analysisquantum-informationtensor-products

For a type α\alphaα and an integer n≥0n\ge0n≥0, identify the recursively nested tensor index In(α)I_n(\alpha)In​(α) with ordered tuples {0,…,n−1}→α\{0,\ldots,n-1\}\to\alpha{0,…,n−1}→α. For K>0K>0K>0, this induces the branch/output equivalence

In({0,…,K−1})≅{0,…,K−1}n≅Z/(KnZ).I_n(\{0,\ldots,K-1\})\cong\{0,\ldots,K-1\}^{n}\cong\mathbb Z/(K^n\mathbb Z).In​({0,…,K−1})≅{0,…,K−1}n≅Z/(KnZ).

The ordering agrees with the concrete block channel: appending a tensor factor appends the last tuple coordinate. If e:I≅Je:I\cong Je:I≅J is a bijection and AAA is a complex matrix indexed by the finite set JJJ, then reindexing both matrix coordinates preserves trace and Hilbert–Schmidt length:

Tr⁡(A[e,e])=Tr⁡A,∥A[e,e]∥HS=∥A∥HS.\operatorname{Tr}(A[e,e])=\operatorname{Tr}A,\qquad\|A[e,e]\|_{\rm HS}=\|A\|_{\rm HS}.Tr(A[e,e])=TrA,∥A[e,e]∥HS​=∥A∥HS​.

These identifications connect free-group branch polynomials with the output basis used by the finite Kraus construction.

Definition code
import Definitions.Def_Nonadditivity_AdjointPurity
import Definitions.Def_Nonadditivity_BellOutput
import Definitions.Def_Nonadditivity_BlockBell
import Definitions.Def_Nonadditivity_BlockConstruction
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_FreeModel
import Definitions.Def_Nonadditivity_Net
import Definitions.Def_Nonadditivity_PureChannelEntropy
import Definitions.Def_Nonadditivity_QuantumHolevo
import Definitions.Def_Nonadditivity_StateEnsembles
import Definitions.Def_Nonadditivity_SwitchChannel
import Definitions.Def_Nonadditivity_TensorPowers
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.InnerProductSpace.l2Space
import Mathlib.Analysis.Matrix.Order
import Mathlib.Analysis.Matrix.PosDef
import Mathlib.Analysis.Normed.Module.FiniteDimension
import Mathlib.Analysis.SpecialFunctions.Complex.CircleAddChar
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Log.NegMulLog
import Mathlib.Data.Fin.Tuple.Basic
import Mathlib.Data.Fintype.EquivFin
import Mathlib.Data.Matrix.Basic
import Mathlib.Data.Real.Sqrt
import Mathlib.GroupTheory.FreeGroup.Basic
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.MeasureTheory.Measure.Typeclasses.Probability
import Mathlib.Order.ConditionallyCompleteLattice.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring

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






/-!
# Exact observable-basis transport for the product free model

The nested block labels are canonically converted into ordered branch tuples.
Trace, Hermitian symmetry, and Hilbert--Schmidt length are preserved by the
actual matrix reindexing. Thus the Collins--Youn hypothesis supplies the
finite-net comparison bound after output coordinates have been specified.
-/

noncomputable section

namespace Nonadditivity.FreeBridge

open Nonadditivity.Entropy Nonadditivity.AdjointPurity
open scoped BigOperators Matrix

universe u

/-- The canonical ordered tuple associated with a recursively nested tensor label.
The last local tensor coordinate is the last coordinate of the finite tuple. -/
def chainTupleEquiv (α : Type u) : (n : ℕ) → TensorChainIndex α n ≃ (Fin n → α)
  | 0 =>
    { toFun := fun _ i => Fin.elim0 i
      invFun := fun _ => PUnit.unit
      left_inv := fun x => by cases x; rfl
      right_inv := fun x => by funext i; exact Fin.elim0 i }
  | n + 1 =>
    { toFun := fun x => Fin.snoc (chainTupleEquiv α n x.1) x.2
      invFun := fun x => ((chainTupleEquiv α n).symm (Fin.init x), x (Fin.last n))
      left_inv := fun x => by rcases x with ⟨a,b⟩; simp
      right_inv := fun x => by simp [Fin.snoc_init_self] }

@[simp] theorem chainTupleEquiv_succ (α : Type u) (n : ℕ)
    (a : TensorChainIndex α n) (b : α) :
    chainTupleEquiv α (n + 1) (a,b) = Fin.snoc (chainTupleEquiv α n a) b := rfl

@[simp] theorem chainTupleEquiv_succ_symm (α : Type u) (n : ℕ) (a : Fin (n + 1) → α) :
    (chainTupleEquiv α (n + 1)).symm a =
      ((chainTupleEquiv α n).symm (Fin.init a), a (Fin.last n)) := rfl

def chainBranchEquiv (K n : ℕ) :
    TensorChainIndex (Fin K) n ≃ FreeModel.Branch K n := chainTupleEquiv (Fin K) n

section Reindex

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

omit [DecidableEq ι] [DecidableEq ο] in
/-- Trace is preserved by a bijective change of matrix basis labels. -/
theorem trace_submatrix_equiv (e : ι ≃ ο) (A : Matrix ο ο ℂ) :
    (A.submatrix e e).trace = A.trace := by
  exact e.sum_comp (fun i => A i i)

omit [DecidableEq ι] [DecidableEq ο] in
/-- The matrix trace definition of Hilbert--Schmidt length is invariant under reindexing. -/
theorem hsLength_submatrix_equiv (e : ι ≃ ο) (A : Matrix ο ο ℂ) :
    hsLength (A.submatrix e e) = hsLength A := by
  unfold hsLength
  rw [Matrix.conjTranspose_submatrix, Matrix.submatrix_mul_equiv,
    trace_submatrix_equiv]



end Reindex

section Comparison

variable {K n : ℕ} {ο : Type*} [Fintype ο] [DecidableEq ο]







end Comparison

section Block

variable {K n : ℕ} [NeZero K]

/-- Ordered free-generator branches in the very output coordinates used by
`BlockConstruction.blockChannel`. The tuple conversion fixes the order of
the local tensor legs before applying the block's output basis equivalence. -/
def branchToOutput (K n : ℕ) [NeZero K] :
    FreeModel.Branch K n ≃ ZMod (K ^ n) :=
  (chainBranchEquiv K n).symm.trans (BlockConstruction.blockOutputEquiv K n)

@[simp] theorem branchToOutput_chain (a : TensorChainIndex (Fin K) n) :
    branchToOutput K n (chainBranchEquiv K n a) =
      BlockConstruction.blockOutputEquiv K n a := by
  simp [branchToOutput]















end Block

end Nonadditivity.FreeBridge
Source
https://github.com/JWang226/Holevo-Additivity-Gap/blob/635aa93eb3a2310b79fd5371e2ce311914ec5887/Nonadditivity/FreeBridge.lean#L29-L118
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