Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3: two commutant conditions

Proved
QAlgorithms.Papers.Independent.Advance50.P50.proposition3

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

prove2quantum

An nnn-qubit input ρ\rhoρ is a positive semidefinite, trace-one matrix on the fixed computational basis, of dimension d=2nd=2^nd=2n. A kkk-copy model has a fixed input-independent unitary UUU, a Hermitian observable OOO, effective observable O~=U†OU\widetilde O=U^\dagger O UO=U†OU, and exact response h(ρ)=Tr⁡[Uρ⊗kU†O]h(\rho)=\operatorname{Tr}[U\rho^{\otimes k}U^\dagger O]h(ρ)=Tr[Uρ⊗kU†O]. Here k≥1k\ge1k≥1. The declared domain RRR consists of density matrices, and its symmetry groups preserve RRR and its binary labels. Invariance means equality of exact expectations on every ρ∈R\rho\in Rρ∈R under the specified conjugation action. Let G0,G1G_0,G_1G0​,G1​ act on their respective stable domains R0,R1R_0,R_1R0​,R1​. Then

O~∈C(k)(G0)∩C(k)(G1) ⟹ h is invariant under both actions.\widetilde O\in C^{(k)}(G_0)\cap C^{(k)}(G_1)\ \Longrightarrow\ h\text{ is invariant under both actions}.O∈C(k)(G0​)∩C(k)(G1​) ⟹ h is invariant under both actions.

For either i∈{0,1}i\in\{0,1\}i∈{0,1}, membership in C(k)(Gi)C^{(k)}(G_i)C(k)(Gi​) together with nonmembership in C(k)(G1−i)C^{(k)}(G_{1-i})C(k)(G1−i​) still guarantees GiG_iGi​-invariance on RiR_iRi​. It does not establish non-invariance under the other group. This distinguishes a sufficient criterion from a converse.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Advance50.P50

open MeasureTheory ProbabilityTheory

open scoped ComplexConjugate ENNReal

-- Exact accepted primitives; no paper-local redeclarations.

open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)

open QAlgorithms.Papers.Independent.Gap48.P38 (subsystemReduction)

open QAlgorithms.Papers.Independent.Information100.P32 (purity)

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

-- Matrices carry the associative commutator bracket X*Y-Y*X.

attribute [local instance 100] LieRing.ofAssociativeRing

/-- PDF p.6, Proposition 3, Appendix C p.24. Nonmembership in the other
tensorCommutant does not imply failure of invariance. Both index orders are included. -/
theorem proposition3 {n k : ℕ} (hk : 0 < k) (M : ExpectationModel (Qubits n) k)
    (G : Bool → Subgroup (Matrix.unitaryGroup (Qubits n) ℂ))
    (R : Bool → Set (Mat (Qubits n))) (label : Mat (Qubits n) → Bool)
    (hdata : ∀ i, DatasetSymmetry (groupMatrices (G i)) (R i) label) :
    ((∀ i, M.effective ∈ tensorCommutant k (groupMatrices (G i))) →
      ∀ i, DomainInvariant (groupMatrices (G i)) (R i) M.response) ∧
    (∀ i, M.effective ∈ tensorCommutant k (groupMatrices (G i)) →
      M.effective ∉ tensorCommutant k (groupMatrices (G (!i))) →
      DomainInvariant (groupMatrices (G i)) (R i) M.response) := by sorry

end QAlgorithms.Papers.Independent.Advance50.P50

end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 6, Proposition 3: two commutant conditions
Read-back

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

Let n,kn,kn,k be natural numbers with k>0k>0k>0, let H\mathcal HH be the complex Euclidean space indexed by nnn-bit strings, and let an expectation model supply a unitary UUU and a Hermitian matrix OOO on H⊗k\mathcal H^{\otimes k}H⊗k. Write Heff=U†OUH_{\mathrm{eff}}=U^\dagger O UHeff​=U†OU and h(ρ)=Re⁡Tr⁡(Uρ⊗kU†O)h(\rho)=\operatorname{Re}\operatorname{Tr}(U\rho^{\otimes k}U^\dagger O)h(ρ)=ReTr(Uρ⊗kU†O), with (ρ⊗k)x,y=∏cρxc,yc(\rho^{\otimes k})_{x,y}=\prod_c\rho_{x_c,y_c}(ρ⊗k)x,y​=∏c​ρxc​,yc​​. For each Boolean index iii, let GiG_iGi​ be a subgroup of the unitary group of H\mathcal HH and RiR_iRi​ a set of matrices, and let ℓ\ellℓ be a Boolean-valued function on all matrices on H\mathcal HH. Assume, for each iii, that every ρ∈Ri\rho\in R_iρ∈Ri​ is positive semidefinite with trace 111, and that every V∈GiV\in G_iV∈Gi​ sends ρ∈Ri\rho\in R_iρ∈Ri​ to VρV†∈RiV\rho V^\dagger\in R_iVρV†∈Ri​ with ℓ(VρV†)=ℓ(ρ)\ell(V\rho V^\dagger)=\ell(\rho)ℓ(VρV†)=ℓ(ρ). Let Ci\mathcal C_iCi​ be the set of matrices commuting with V⊗kV^{\otimes k}V⊗k for every V∈GiV\in G_iV∈Gi​. Then both implications hold:

Heff∈Ci for both Boolean indices i ⟹ h(VρV†)=h(ρ) for every i, V∈Gi, ρ∈Ri;for each i,Heff∈Ci,Heff∉C¬i ⟹ h(VρV†)=h(ρ) for every V∈Gi, ρ∈Ri.\begin{aligned} &H_{\mathrm{eff}}\in\mathcal C_i\text{ for both Boolean indices }i \ \Longrightarrow\ h(V\rho V^\dagger)=h(\rho) \text{ for every }i,\ V\in G_i,\ \rho\in R_i;\\ &\text{for each }i,\quad H_{\mathrm{eff}}\in\mathcal C_i,\quad H_{\mathrm{eff}}\notin\mathcal C_{\neg i} \ \Longrightarrow\ h(V\rho V^\dagger)=h(\rho) \text{ for every }V\in G_i,\ \rho\in R_i. \end{aligned}​Heff​∈Ci​ for both Boolean indices i ⟹ h(VρV†)=h(ρ) for every i, V∈Gi​, ρ∈Ri​;for each i,Heff​∈Ci​,Heff​∈/C¬i​ ⟹ h(VρV†)=h(ρ) for every V∈Gi​, ρ∈Ri​.​

Here ¬i\neg i¬i is the other Boolean index. The statement allows n=0n=0n=0 and empty datasets; invariance on an empty RiR_iRi​ is vacuous.

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

    Confirmed by the moderator at approval.

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