Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Local conjugation forces a tensor product of unitaries

Open
QAlgorithms.Papers.Independent.Intakenext100.P81.local_unitary_factorization

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

prove2quantum

Let n≥1n\ge1n≥1 and let Hi\mathcal H_iHi​ be nonzero finite-dimensional complex Hilbert spaces. Let UUU be unitary on ⨂i=1nHi\bigotimes_{i=1}^n\mathcal H_i⨂i=1n​Hi​. Suppose that U†OiUU^\dagger O_iUU†Oi​U is supported on factor iii whenever OiO_iOi​ is supported on that factor. Then there are factor unitaries UiU_iUi​ such that

U=⨂i=1nUi.U=\bigotimes_{i=1}^n U_i.U=i=1⨂n​Ui​.

For every subset RRR of the sites, there is a unitary URU_RUR​ whose conjugation agrees with that of UUU on every operator supported in RRR and fixes every operator supported in its complement. This gives the lattice splittability consequence. The factors have arbitrary positive dimensions, and equality includes the scalar phase.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P81
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P81

open scoped BigOperators ComplexConjugate Manifold ContDiff

/-- Theorem 2.1, PDF p.23, proof pp.146--148, lattice consequence p.24.
The finite family is nonempty and its factors are nonzero. Scalar phase is absorbed
in a factor; no qubit restriction and no equality merely up to phase is imposed. -/
theorem local_unitary_factorization {n : ℕ} (hn : 0 < n) (dim : Fin n → ℕ)
    (hdim : ∀ i, 0 < dim i) (U : Matrix.unitaryGroup (FactorBasisIndex dim) ℂ)
    (hlocal : ∀ i (O : Matrix (Fin (dim i)) (Fin (dim i)) ℂ),
      ∃ P : Matrix (Fin (dim i)) (Fin (dim i)) ℂ,
        (star (U : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ)) *
          embedSite dim i O * (U : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ) =
            embedSite dim i P) :
    (∃ V : (i : Fin n) → Matrix.unitaryGroup (Fin (dim i)) ℂ,
      (U : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ) =
        factorTensorMatrix dim (fun i => (V i : Matrix (Fin (dim i)) (Fin (dim i)) ℂ))) ∧
    (∀ s : Finset (Fin n), ∃ V : Matrix.unitaryGroup (FactorBasisIndex dim) ℂ,
      (∀ O : Matrix (RegionIndex dim s) (RegionIndex dim s) ℂ,
        star (V : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ) * embedRegion dim s O *
          (V : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ) =
        star (U : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ) * embedRegion dim s O *
          (U : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ)) ∧
      (∀ O : Matrix (RegionIndex dim sᶜ) (RegionIndex dim sᶜ) ℂ,
        star (V : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ) * embedRegion dim sᶜ O *
          (V : Matrix (FactorBasisIndex dim) (FactorBasisIndex dim) ℂ) = embedRegion dim sᶜ O)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P81

end
Source
Symmetries in quantum field theory and quantum gravity, arXiv:1810.05338v2, PDF p. 23, Theorem 2.1: local unitary factorization
Read-back

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

For every natural number n>0n>0n>0, every family of positive natural dimensions di>0d_i>0di​>0 for i<ni<ni<n, and every unitary complex matrix UUU indexed by the assignment set X={x:0≤xi<di for every i<n}X=\{x:0\le x_i<d_i\text{ for every }i<n\}X={x:0≤xi​<di​ for every i<n}, assume the following: for each i<ni<ni<n and each complex di×did_i\times d_idi​×di​ matrix OOO, there exists a complex di×did_i\times d_idi​×di​ matrix PPP such that U∗Li(O)U=Li(P)U^*L_i(O)U=L_i(P)U∗Li​(O)U=Li​(P), where Li(O)x,y=Oxi,yiL_i(O)_{x,y}=O_{x_i,y_i}Li​(O)x,y​=Oxi​,yi​​ when xj=yjx_j=y_jxj​=yj​ for every j≠ij\ne ij=i, and Li(O)x,y=0L_i(O)_{x,y}=0Li​(O)x,y​=0 otherwise; here ∗^*∗ denotes conjugate transpose. Then both of these conclusions hold: there exists a family of unitary complex di×did_i\times d_idi​×di​ matrices WiW_iWi​ such that

Ux,y=∏i=0n−1(Wi)xi,yi(x,y∈X);U_{x,y}=\prod_{i=0}^{n-1}(W_i)_{x_i,y_i}\qquad(x,y\in X);Ux,y​=i=0∏n−1​(Wi​)xi​,yi​​(x,y∈X);

and, for every subset s⊆{0,…,n−1}s\subseteq\{0,\ldots,n-1\}s⊆{0,…,n−1}, there exists a unitary complex matrix VVV indexed by XXX such that

V∗Es(O)V=U∗Es(O)Ufor every complex matrix O indexed by Xs,V∗Esc(O)V=Esc(O)for every complex matrix O indexed by Xsc.\begin{aligned} V^*E_s(O)V&=U^*E_s(O)U &&\text{for every complex matrix }O\text{ indexed by }X_s,\\ V^*E_{s^c}(O)V&=E_{s^c}(O) &&\text{for every complex matrix }O\text{ indexed by }X_{s^c}. \end{aligned}V∗Es​(O)VV∗Esc​(O)V​=U∗Es​(O)U=Esc​(O)​​for every complex matrix O indexed by Xs​,for every complex matrix O indexed by Xsc​.​

Here scs^csc is the complement within {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1}, XtX_tXt​ consists of assignments ai∈{0,…,di−1}a_i\in\{0,\ldots,d_i-1\}ai​∈{0,…,di​−1} for i∈ti\in ti∈t, and Et(O)x,yE_t(O)_{x,y}Et​(O)x,y​ equals Ox∣t,y∣tO_{x|_t,y|_t}Ox∣t​,y∣t​​ if xi=yix_i=y_ixi​=yi​ for every i∉ti\notin ti∈/t, and equals 000 otherwise. Dimensions equal to 111 are included, as are empty and full subsets sss; X∅X_\varnothingX∅​ is a singleton, and E∅(O)E_\varnothing(O)E∅​(O) is the sole entry of OOO times the identity.

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