Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Mueller–Jones maps form a semigroup

Proved
QAlgorithms.Papers.Independent.Intake100.P24.mueller_jones_semigroup

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

prove2quantum

A Mueller–Jones map is a pair (Φ,V)(\Phi,V)(Φ,V) in which Φ\PhiΦ is complex-linear, completely positive and doubly contracting, VV†≤IVV^\dagger\le IVV†≤I, and Φ−(X↦VXV†)\Phi-(X\mapsto VXV^\dagger)Φ−(X↦VXV†) is positive. The composition is

(Φ,V)∘(Ψ,W)=(Φ∘Ψ,VW).(\Phi,V)\circ(\Psi,W)=(\Phi\circ\Psi,VW).(Φ,V)∘(Ψ,W)=(Φ∘Ψ,VW).

The composition of two such maps is again a Mueller–Jones map, and this operation is associative. Thus these abstract maps form the semigroup stated in (55), with the right-hand map acting first.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P24
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ENNReal ComplexOrder Matrix.Norms.L2Operator

open MeasureTheory

open QAlgorithms.Papers.Independent.Dependency50.P49 (traceDual)

open QAlgorithms.Papers.Independent.Information100.P30 (IsPositiveMap)

namespace QAlgorithms.Papers.Independent.Intake100.P24

local instance : MeasurableSpace PolarizationMatrix := borel PolarizationMatrix

local instance : BorelSpace PolarizationMatrix := ⟨rfl⟩

/-- arXiv:1904.06170v1 PDF p.9, (55): admissible Mueller–Jones maps are
closed under the displayed composition, and that composition is associative.
It asserts no physical realization or surjectivity onto optical devices. -/
theorem mueller_jones_semigroup (P Q R : MuellerJonesPair)
    (hP : IsMuellerJones P) (hQ : IsMuellerJones Q) (hR : IsMuellerJones R) :
    IsMuellerJones (muellerJonesCompose P Q) ∧
      muellerJonesCompose (muellerJonesCompose P Q) R =
        muellerJonesCompose P (muellerJonesCompose Q R) := by sorry

end QAlgorithms.Papers.Independent.Intake100.P24

end
Source
Quantum features of macroscopic fields. Entropy and dynamics, arXiv:1904.06170v1, PDF p. 9, §VI.B, (55): Mueller–Jones semigroup
Read-back

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

Let P=(Φ,V)P=(\Phi,V)P=(Φ,V), Q=(Ψ,W)Q=(\Psi,W)Q=(Ψ,W), and R=(Ξ,Z)R=(\Xi,Z)R=(Ξ,Z), where Φ,Ψ,Ξ\Phi,\Psi,\XiΦ,Ψ,Ξ are complex-linear maps on complex 2×22\times22×2 matrices and V,W,ZV,W,ZV,W,Z are complex 2×22\times22×2 matrices. Assume that each pair (F,B)(F,B)(F,B) among these three satisfies all of the following: FFF is completely positive, meaning that for every natural number rrr, including r=0r=0r=0, its amplification idr⊗F\mathrm{id}_r\otimes Fidr​⊗F sends every positive semidefinite matrix to a positive semidefinite matrix; the matrices I−F(I)I-F(I)I−F(I), I−F∨(I)I-F^\vee(I)I−F∨(I), and I−BB†I-BB^\daggerI−BB† are positive semidefinite; and F(X)−BXB†F(X)-BXB^\daggerF(X)−BXB† is positive semidefinite for every positive semidefinite XXX. Here B†B^\daggerB† denotes conjugate transpose, and the map F∨F^\veeF∨ is defined using matrix units EijE_{ij}Eij​ by (F∨(X))ij=∑x,y=01F(Eji)yxXxy(F^\vee(X))_{ij}=\sum_{x,y=0}^{1}F(E_{ji})_{yx}X_{xy}(F∨(X))ij​=∑x,y=01​F(Eji​)yx​Xxy​. Define pair composition by (F,B)⊛(G,C)=(F∘G,BC)(F,B)\circledast(G,C)=(F\circ G,BC)(F,B)⊛(G,C)=(F∘G,BC). Then P⊛Q=(Φ∘Ψ,VW)P\circledast Q=(\Phi\circ\Psi,VW)P⊛Q=(Φ∘Ψ,VW) satisfies those same conditions, and (P⊛Q)⊛R=P⊛(Q⊛R)(P\circledast Q)\circledast R=P\circledast(Q\circledast R)(P⊛Q)⊛R=P⊛(Q⊛R). The hypotheses permit singular matrices and zero maps, including the pair consisting of the zero map and the zero matrix.

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