Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered normalization and product preservation

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.mappingProducts

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For the spectral-pair map pij=λi∣⟨xi,yj⟩∣2p_{ij}=\lambda_i|\langle x_i,y_j\rangle|^2pij​=λi​∣⟨xi​,yj​⟩∣2, qij=μj∣⟨xi,yj⟩∣2q_{ij}=\mu_j|\langle x_i,y_j\rangle|^2qij​=μj​∣⟨xi​,yj​⟩∣2, both ppp and qqq are normalized probability laws. Their tensor products are orthonormal eigenbases of the tensor-copy states, and preserve the map:

pi,j(n)=∏k=1npikjk,qi,j(n)=∏k=1nqikjk.p^{(n)}_{\mathbf i,\mathbf j}=\prod_{k=1}^n p_{i_kj_k},\qquad q^{(n)}_{\mathbf i,\mathbf j}=\prod_{k=1}^n q_{i_kj_k}.pi,j(n)​=k=1∏n​pik​jk​​,qi,j(n)​=k=1∏n​qik​jk​​.

Here p(n),q(n)p^{(n)},q^{(n)}p(n),q(n) are obtained from the product eigenvalues and the overlaps of the product eigenvectors. The empty tensor power is included and gives the singleton law.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P45

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology

open QAlgorithms.Papers.Independent.Information100.P07
  (support positivePart positiveProjection IsProjection)

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- arXiv:0708.4282v1, PDF p.10: Unnumbered normalization and product preservation. -/
theorem mappingProducts (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (D : SpectralPair rho sigma) :
    IsLaw (spectralP D) ∧ IsLaw (spectralQ D) ∧
    (∀ n : ℕ,
      (copies n (D.leftBasis : Mat I))ᴴ * copies n (D.leftBasis : Mat I) = 1 ∧
      copies n (D.leftBasis : Mat I) * (copies n (D.leftBasis : Mat I))ᴴ = 1 ∧
      (copies n (D.rightBasis : Mat I))ᴴ * copies n (D.rightBasis : Mat I) = 1 ∧
      copies n (D.rightBasis : Mat I) * (copies n (D.rightBasis : Mat I))ᴴ = 1 ∧
      copies n rho = copies n (D.leftBasis : Mat I) *
        Matrix.diagonal (fun x => ((∏ k, D.leftValues (x k) : ℝ) : ℂ)) *
          (copies n (D.leftBasis : Mat I))ᴴ ∧
      copies n sigma = copies n (D.rightBasis : Mat I) *
        Matrix.diagonal (fun x => ((∏ k, D.rightValues (x k) : ℝ) : ℂ)) *
          (copies n (D.rightBasis : Mat I))ᴴ) ∧
    (∀ n : ℕ, ∀ x y : Fin n → I,
      (∏ k, D.leftValues (x k)) *
        Complex.normSq (∑ z : Fin n → I,
          star (∏ k, (D.leftBasis : Mat I) (z k) (x k)) *
            (∏ k, (D.rightBasis : Mat I) (z k) (y k))) =
          ∏ k, spectralP D (x k,y k)) ∧
    (∀ n : ℕ, ∀ x y : Fin n → I,
      (∏ k, D.rightValues (y k)) *
        Complex.normSq (∑ z : Fin n → I,
          star (∏ k, (D.leftBasis : Mat I) (z k) (x k)) *
            (∏ k, (D.rightBasis : Mat I) (z k) (y k))) =
          ∏ k, spectralQ D (x k,y k)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 10, Unnumbered normalization and product preservation
Read-back

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

For every finite index type III with decidable equality, every positive semidefinite complex matrices ρ,σ\rho,\sigmaρ,σ indexed by III with trace one, and every unitary matrices U,VU,VU,V and nonnegative real families λ,μ:I→R\lambda,\mu:I\to\mathbb Rλ,μ:I→R satisfying ρ=Udiag⁡(λ)U†\rho=U\operatorname{diag}(\lambda)U^\daggerρ=Udiag(λ)U† and σ=Vdiag⁡(μ)V†\sigma=V\operatorname{diag}(\mu)V^\daggerσ=Vdiag(μ)V†, define

pij=λi∣(U†V)ij∣2,qij=μj∣(U†V)ij∣2.p_{ij}=\lambda_i|(U^\dagger V)_{ij}|^2, \qquad q_{ij}=\mu_j|(U^\dagger V)_{ij}|^2.pij​=λi​∣(U†V)ij​∣2,qij​=μj​∣(U†V)ij​∣2.

Both ppp and qqq are nonnegative and sum to one over I×II\times II×I. For every natural number nnn, define Cn(M)C_n(M)Cn​(M), indexed by functions x,y:{0,…,n−1}→Ix,y:\{0,\ldots,n-1\}\to Ix,y:{0,…,n−1}→I, by Cn(M)xy=∏k=0n−1MxkykC_n(M)_{xy}=\prod_{k=0}^{n-1}M_{x_k y_k}Cn​(M)xy​=∏k=0n−1​Mxk​yk​​. Then

Cn(U)†Cn(U)=Cn(U)Cn(U)†=1,Cn(V)†Cn(V)=Cn(V)Cn(V)†=1,C_n(U)^\dagger C_n(U)=C_n(U)C_n(U)^\dagger=1, \qquad C_n(V)^\dagger C_n(V)=C_n(V)C_n(V)^\dagger=1,Cn​(U)†Cn​(U)=Cn​(U)Cn​(U)†=1,Cn​(V)†Cn​(V)=Cn​(V)Cn​(V)†=1,

and

Cn(ρ)=Cn(U)diag⁡ ⁣(x↦∏kλxk)Cn(U)†,Cn(σ)=Cn(V)diag⁡ ⁣(x↦∏kμxk)Cn(V)†.C_n(\rho)=C_n(U)\operatorname{diag}\!\left(x\mapsto\prod_k\lambda_{x_k}\right)C_n(U)^\dagger, \qquad C_n(\sigma)=C_n(V)\operatorname{diag}\!\left(x\mapsto\prod_k\mu_{x_k}\right)C_n(V)^\dagger.Cn​(ρ)=Cn​(U)diag(x↦k∏​λxk​​)Cn​(U)†,Cn​(σ)=Cn​(V)diag(x↦k∏​μxk​​)Cn​(V)†.

Furthermore, for every such n,x,yn,x,yn,x,y,

(∏kλxk)∣∑z:{0,…,n−1}→I∏kUzkxk‾∏kVzkyk∣2=∏kpxkyk,\left(\prod_k\lambda_{x_k}\right) \left|\sum_{z:\{0,\ldots,n-1\}\to I} \overline{\prod_k U_{z_k x_k}}\prod_k V_{z_k y_k}\right|^2 =\prod_k p_{x_k y_k},(k∏​λxk​​)​z:{0,…,n−1}→I∑​k∏​Uzk​xk​​​k∏​Vzk​yk​​​2=k∏​pxk​yk​​,

and

(∏kμyk)∣∑z:{0,…,n−1}→I∏kUzkxk‾∏kVzkyk∣2=∏kqxkyk.\left(\prod_k\mu_{y_k}\right) \left|\sum_{z:\{0,\ldots,n-1\}\to I} \overline{\prod_k U_{z_k x_k}}\prod_k V_{z_k y_k}\right|^2 =\prod_k q_{x_k y_k}.(k∏​μyk​​)​z:{0,…,n−1}→I∑​k∏​Uzk​xk​​​k∏​Vzk​yk​​​2=k∏​qxk​yk​​.

These statements include n=0n=0n=0: all empty products are one, and each matrix C0(M)C_0(M)C0​(M) is the one-by-one matrix with entry one. The density hypotheses exclude an empty III.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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