Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Seed paper result: Proposition 1, commutant sufficient condition

Proved
QAlgorithms.Papers.Independent.Advance50.P50.proposition1

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. Write C(k)(G)={A:[A,V⊗k]=0 for every V∈G}C^{(k)}(G)=\{A:[A,V^{\otimes k}]=0\text{ for every }V\in G\}C(k)(G)={A:[A,V⊗k]=0 for every V∈G}. Then

O~∈C(k)(G)⟹h(VρV†)=h(ρ)(V∈G,ρ∈R).\widetilde O\in C^{(k)}(G)\quad\Longrightarrow\quad h(V\rho V^\dagger)=h(\rho)\quad(V\in G,\rho\in R).O∈C(k)(G)⟹h(VρV†)=h(ρ)(V∈G,ρ∈R).

This is a sufficient structural condition for invariance; no converse is asserted.

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.5, Proposition 1: tensorCommutant membership suffices for domain-relative invariance. -/
theorem proposition1 {n k : ℕ} (hk : 0 < k) (M : ExpectationModel (Qubits n) k)
    (G : Subgroup (Matrix.unitaryGroup (Qubits n) ℂ))
    (R : Set (Mat (Qubits n))) (label : Mat (Qubits n) → Bool)
    (hdata : DatasetSymmetry (groupMatrices G) R label)
    (hcomm : M.effective ∈ tensorCommutant k (groupMatrices G)) :
    DomainInvariant (groupMatrices G) R M.response := by sorry

end QAlgorithms.Papers.Independent.Advance50.P50

end
Source
Group-Invariant Quantum Machine Learning, arXiv:2205.02261v2, PDF p. 5, Seed paper result: Proposition 1, commutant sufficient condition
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 consist of a unitary UUU on H⊗k\mathcal H^{\otimes k}H⊗k and a Hermitian matrix OOO on that space. 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), where (ρ⊗k)x,y=∏c=0k−1ρxc,yc(\rho^{\otimes k})_{x,y}=\prod_{c=0}^{k-1}\rho_{x_c,y_c}(ρ⊗k)x,y​=∏c=0k−1​ρxc​,yc​​. Let GGG be any subgroup of the unitary group of H\mathcal HH, let RRR be any set of matrices on H\mathcal HH, and let ℓ\ellℓ be any Boolean-valued function on those matrices. Assume every ρ∈R\rho\in Rρ∈R is positive semidefinite with trace 111, and that for every V∈GV\in GV∈G and ρ∈R\rho\in Rρ∈R, both VρV†∈RV\rho V^\dagger\in RVρV†∈R and ℓ(VρV†)=ℓ(ρ)\ell(V\rho V^\dagger)=\ell(\rho)ℓ(VρV†)=ℓ(ρ). Assume also that HeffH_{\mathrm{eff}}Heff​ commutes with V⊗kV^{\otimes k}V⊗k for every V∈GV\in GV∈G. Then

h(VρV†)=h(ρ)(V∈G, ρ∈R).h(V\rho V^\dagger)=h(\rho) \qquad(V\in G,\ \rho\in R).h(VρV†)=h(ρ)(V∈G, ρ∈R).

The statement allows n=0n=0n=0 and does not require RRR to be nonempty; for empty RRR, the dataset assumptions and conclusion are 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